Public report of finol-digital/Card-Game-Simulator, published 17 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, 17 November 2026, 17:21 UTC · Survey ID cd_57523da70c044110b1f8f994ac3e9e58
finol-digital/Card-Game-Simulator
Measured 17 November 2026, 17:19 UTC, at code version 10c9bd2
First survey, so nothing to compare with yet
CAI scoreWeak
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 large codebase: 122,433 lines of product code in 14 projects, tests not counted · Estimated rebuild effort: about 1.5 person-years · Weakest lens: Code Health, 37.5
Findings by how serious they are
77 critical620 serious19 minor
9 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
17 November 2026, 17:19 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 ▸
72of 72 dimensions measured by tools.
700of 716 findings point to an exact file and line, so you can open each one in the code. The other 16 concern the repository as a whole, such as missing documentation.
72dimensions across 7 lenses, read from 122,433 lines of product code in 14 projects.
finol-digital/Card-Game-Simulator falls short of our standard for production, held back most by its Code Health lens, the quality of the code itself. It scores 45.6 out of 100 and is rated Weak, and 76 of its 77 critical findings are security problems.
Code Health, at 37.5, is the weakest lens and counts most in the score. The best first step is adding type checking, worth about 4.6 points. Keeping the encryption keys in a vault comes next, worth about 3.6 points. Raising Code Health to 70 would lift the score to about 52.5.
Sixty-eight pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Four passwords or keys are open to anyone who can read the repository, and two pipeline steps run downloads nobody checks. Pinning each tool to an exact version, replacing each exposed password or key and checking each download against a checksum would close these risks. Setting a waiting period for automatic updates would fix the automatic dependency update that takes a new release at once, and hashing passwords with a password-hashing function such as Argon2, bcrypt or PBKDF2 would deal with the place where passwords are scrambled with a fast general-purpose hash. Writing the unfinished function, or removing it would take care of the function that was never written.
The product code is 122,433 lines, about €210,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 Code Health rose from 37.5 to 70, the lowest score rated Strong, the score would rise from 45.6 to about 52.5.
Code composition: what the lines of code are
Business logic 33%Supporting code 57%Tests 10%
Rebuild cost: about €210,000 · Estimate
Cost to rebuild
€70,000 to €360,000, for 1,170 to 3,781 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.7 at a score of 46. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 122,433 lines of product code
Comment lines
The estimate prices 93,494 lines. Comment lines count towards the size of 122,433 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
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
Raises the score by about 4.6 points · Medium effort · Type Safety
2
Strengthen data-at-rest protection: vault your keys (Azure Key Vault / AWS KMS / IDataProtector key ring) and encrypt the most sensitive columns (EF HasConversion encryption or provider-native column encryption) — partial coverage still leaves gaps.
Raises the score by about 3.6 points · Medium effort · Data Protection
3
Store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`.
(A fast/plain hash, or a client-hashed value stored and compared verbatim, is not password storage.) Start in `Assets/Scripts/Cgs/Play/Multiplayer/LobbyPassword.cs:38`.
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 €210,000 to build again, about 1.5 person-years of work. Its weakest lens is Code Health, at 37.5 (Weak). Code Health is about how easy the code is to read and change safely, and code that is hard to read is slow and risky to change, so every future change costs more than it should. Because the weakest lens counts most in the score, work on Code Health also moves the score most.
Based on: the rebuild estimate · the Code Health grade · how much each lens counts
What to do: Start with the Code Health actions in Top priorities.
If you do one thing first · First action
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up. Of all the actions in this report, it raises the score most for the work it takes: about 4.6 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
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.5 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 614,502 lines over the last 90 days, which is about 2,492,147 lines a year. At that pace, the extra work comes to an estimated 124.6 to 830.7 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.
9 modules, with 1 dependency between them. Every module uses only modules listed above it, so there are no loops.
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.
tools.startup-benchmark uses tools.startup-benchmark.startup_stats, so a change to tools.startup-benchmark.startup_stats can break tools.startup-benchmark, while a change to tools.startup-benchmark can't break tools.startup-benchmark.startup_stats.
Position
Below the diagonal: tools.startup-benchmark uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 37.5 · Weak · gated by R1, X5 ·
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
78
High / Critical
A07:2025 — Authentication Failures
5
High / Critical
A03:2025 — Software Supply Chain Failures
5
Medium
Roadmap
Top priorities: Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up; Strengthen data-at-rest protection: vault your keys (Azure Key Vault / AWS KMS / IDataProtector key ring) and encrypt the most sensitive columns (EF HasConversion encryption or provider-native column encryption) — partial coverage still leaves gaps; Store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`. (A fast/plain hash, or a client-hashed value stored and compared verbatim, is not password storage.) Start in `Assets/Scripts/Cgs/Play/Multiplayer/LobbyPassword.cs:38`.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
Store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`. (A fast/plain hash, or a client-hashed value stored and compared verbatim, is not password storage.) Start in `Assets/Scripts/Cgs/Play/Multiplayer/LobbyPassword.cs:38`.
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 `?.`.
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
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 — 77
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 — 620
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 — 19
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 9
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 72 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 1.0, 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 — 72 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, 700 of 716 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.
D10 Test 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. The 233 test(s) behind this row are the ones the C# collector could read, and this repository also carries at least 11 test source file(s) (.py, .cjs, .mjs) that it cannot: it parses C# syntax and matches C# test attributes, so a vitest/jest/JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its gem dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Unity UPM manifest (Packages/manifest.json or a package's package.json), but the licence verdict published here was taken over its gem dependencies. Nothing was read about its Upm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (9 contributor(s) across 5503 commit(s) sampled, automation and bot accounts excluded). One of them holds 99% of the history; the other 8 hold 0.1% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
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. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API.
D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
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. `Assets/Plugins/PdfSharp/Didstopia/Drawing/XColorResourceManager.cs`, `Assets/Plugins/PdfSharp/Didstopia/Drawing/XFontFamily.cs`, `Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs`, `Assets/Plugins/PdfSharp/Didstopia/Drawing/XPoint.cs`, `Assets/Plugins/PdfSharp/Didstopia/Drawing/XVector.cs`, … (+6 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
AX2 Stateful singletons — 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. 39 further occurrence(s) are not listed individually; the score already reflects all 79.
AXB2 Runtime readiness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. The image build failed, and its output does not match a cause we recognise. (rule: unrecognised-build-failure). The renderer reported: docker build failed (exit 1) — [0m - InvalidDefaultArgInFrom: Default value for ARG ${BASE_IMAGE} results in empty or invalid base image name (line 2) Dockerfile:2 -------------------- 1 | ARG BASE_IMAGE 2 | >>> FROM ${BASE_IMAGE} 3 | COPY python/ C:/Python/ 4 | ENV CGS_PYTHON=C:/Python/python.exe -------------------- ERROR: failed to solve: base name (${BASE_IMAGE}) should not be blank; likely cause (not identified): the image build failed, and its output does not match a cause we recognise; runtime evidence skipped.
AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via Dockerfile (.github/actions/unity-windows-python/Dockerfile). docker build failed (exit 1) — [0m - InvalidDefaultArgInFrom: Default value for ARG ${BASE_IMAGE} results in empty or invalid base image name (line 2) Dockerfile:2 -------------------- 1 | ARG BASE_IMAGE 2 | >>> FROM ${BASE_IMAGE} 3 | COPY python/ C:/Python/ 4 | ENV CGS_PYTHON=C:/Python/python.exe -------------------- ERROR: failed to solve: base name (${BASE_IMAGE}) should not be blank; likely cause (not identified): the image build failed, and its output does not match a cause we recognise; runtime evidence skipped.
IC1 Incompleteness & stubs — 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. 543 further occurrence(s) are not listed individually; the score already reflects all 583.
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.
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.
X27 Collection changed while being enumerated — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This repository's C# was parsed (it ships no .sln or .csproj, so it was read as syntax-only projects), but this check proves its findings from resolved symbols and a reference-free parse resolves none. It abstained rather than report a clean bill it could not earn. That is a gap in this analyzer's reach into build-less repositories — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations: 2 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.
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.
D8 Code Coverage: Coverage is measured by building and running the test suite inside our isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
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 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
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.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
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.
85 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was PdfImage.ReadIndexedMemoryBitmap at 81. A further 10 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 PageSizeConverter.ToSize at 40 — they are counted neither in the figure above nor in this dimension's score. 7 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: Assets/Plugins/PdfSharp/Didstopia/root/PageSizeConverter.cs (PageSizeConverter.ToSize at 40), Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/AnsiEncoding.cs (AnsiEncoding.IsAnsi1252Char at 36), Assets/Plugins/PdfSharp/Didstopia/Internal/Calc.cs (Calc.PageSizeToSize at 18), Assets/Plugins/PdfSharp/Didstopia/Pdf/KeysMeta.cs (KeyDescriptor.GetValueType at 17), Assets/Scripts/Cgs/Menu/SharingMessages.cs (SharingMessages.FromFeedback at 17), and 2 more not listed here. 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.
+ 80 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 60 down to 60 or less in Cyclomatic Complexity — start with PdfImage.ReadIndexedMemoryBitmap (cyclomatic 81). — Refactoring it lifts Cyclomatic Complexity from 6.2 to about 6.5/10.
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.
+ 123 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 120 down to 120 or less in Cognitive Complexity — start with PdfImage.ReadIndexedMemoryBitmap (cognitive 158). — Refactoring it lifts Cognitive Complexity from 5.5 to about 5.8/10.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.7 / 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 22 TooManyMethods finding(s) in God Classes — start with XGraphics.cs, XMatrix.cs, CgsNetPlayer.cs. — One of this dimension's main actionable groups (22 warning-level).
Resolve the 12 FileTooLong finding(s) in God Classes — start with UnityCardGame.cs, XGraphicsPdfRenderer.cs, PlayController.cs. — One of this dimension's main actionable groups (12 warning-level).
Resolve the 9 MethodTooLong finding(s) in God Classes — start with UnityCardGame.cs (3), PdfImage.cs, XKnownColorTable.cs. — One of this dimension's main actionable groups (9 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.
84 duplicated block group(s) detected. 4.9 % of the production lines (5,928 of 121,822) are in a reported copy. A further 117 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 (8 corresponding lines) · ×12Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityDeck.cs:188
Edited copy of a member (9 corresponding lines) · ×11Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:516
+ 96 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 12 Edited copy of a member (8 corresponding lines) finding(s) in Code Duplication — start with UnityDeck.cs, XPoint.cs, PdfReferenceTable.cs. — One of this dimension's main actionable groups (12 warning-level).
Resolve the 11 Edited copy of a member (9 corresponding lines) finding(s) in Code Duplication — start with PdfRubberStampAnnotation.cs (2), CardSelector.cs (2), DeckLoadMenu.cs. — One of this dimension's main actionable groups (11 warning-level).
Resolve the 10 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with CardSearchMenu.cs (2), DeckLoadMenu.cs (2), PdfPage.cs (2). — One of this dimension's main actionable groups (10 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling8.3 / 10Strong✓ 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.
14 production modules (Unity), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 3 module(s) off the main sequence, with abstractness counted on 9 of the 14 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
Off the main sequence: Unity.UI.Shaders.Sample · ×3
What to do
Resolve the 3 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (3 warning-level).
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
What it measures: How much of the code is actually exercised by tests.
Method: Coverage from the analyzer's own run of the suite, computed per-file with structured exclusions for generated, trivial, and glue code. A coverage report found in the repository is never read. When the suite can't be built/run in-image, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.
Line coverage 97.9%. Measured from the JavaScript/TypeScript suite (node:test via `npm install --ignore-scripts` (no lockfile) in edge-worker/, the 3 run(s) test reliability made). Taken over 3 runs of the suite: a line counts as covered only when every run executed it.
✓ On the Gold path — maintain.
Detailed fixes: d8_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality9.9 / 10Stronggated by 2 serious findings✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
0 skipped, 2 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 233 tests. Measured on the C# suite only — at least 11 test source file(s) (.py, .cjs, .mjs) went unread, so its test quality is unmeasured and is not in these counts.
No assertions: BundledFonts_CoverCatalogsAndEveryNativeName · ×2Assets/Tests/EditMode/LocalizationCatalogTests.cs:315
What to do
Resolve the 2 No assertions finding(s) in Test Quality — start with LocalizationCatalogTests.cs (2). — One of this dimension's main actionable groups (2 warning-level).
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.
1 outdated direct gem(s), 0 pinning defect(s). 3 declaration(s) graded against rubygems.org, 3 of them against a version resolved in a committed REDACTED. Whether any of these gems is DEPRECATED or YANKED is not graded — rubygems.org publishes no deprecation marker, and a yank removes a version rather than flagging it. Whether any is UNMAINTAINED is not graded either: no registry publishes a maintenance status, and release age does not stand in for one. Whether any is UNUSED is a source question, not a registry one. Known CVEs in this dependency graph are D30's question, read from the manifest there.
Outdated: fastlane
✓ On the Gold path — maintain.
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 103 shipped gem(s) use a banned license. Licences were resolved from rubygems.org over the 103 gem(s) a consumer installs — this repository's runtime declarations closed transitively over its committed REDACTED. Development-group and `add_development_dependency` gems are excluded: they are not distributed with this repository. 1 of them publish no licence on rubygems.org; that is missing data, not a violation, and none of them is charged. ★ COVERAGE OF THIS VERDICT: it grades this repository's gem dependencies and nothing else. The repository also declares package.json and a Unity UPM manifest (Packages/manifest.json or a package's package.json), and the licences of those dependency graphs were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 10 Hotspot finding(s) in Churn × Complexity Hotspots — start with UnityCardGame.cs, CardViewer.cs, UnityFileMethods.cs. — One of this dimension's main actionable groups (10 warning-level).
Detailed fixes: d15_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.
0 deducted task-comment markers across 121822 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
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 1 documentation facets pass in full. 27 document(s) read across 2 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with ProjectVersion.txt. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
4 finding(s): 0 critical, 4 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
REDACTED
What to do
Resolve the 3 REDACTED finding(s) in Secrets (history) — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 1 High secret finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
78 finding(s): 0 critical, 71 high, 7 medium, 0 low. 66 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 16 file(s) — `Assets/Plugins/PdfSharp/Didstopia/Drawing/XColorResourceManager.cs` (line 53), `Assets/Plugins/PdfSharp/Didstopia/Drawing/XFontFamily.cs` (line 176), `Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs` (line 52), `Assets/Plugins/PdfSharp/Didstopia/Drawing/XPoint.cs` (line 58), `Assets/Plugins/PdfSharp/Didstopia/Drawing/XVector.cs` (line 47), … (+11 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 3 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
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 REDACTED finding(s) charged to Static Analysis (SAST) — the other 66 are reported here at file:line but scored by D36 (supply-chain provenance), which charges them once. — One of this dimension's main actionable groups (67 issue-level, 1 of them charged here).
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 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
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 REDACTED 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 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 387 of the 522 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.
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 0 platform declaration(s) and 4 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.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives1.0 / 10Critical✓ Tool-verified
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content. — firebase/public/index.html:13
What to do
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Do you agree with this assessment?
AC2 · Forms & labels10.0 / 10Exemplary○ Nothing flagged
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Do you agree with this assessment?
AC3 · Page structure4.9 / 10Weak✓ Tool-verified
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×2) — firebase/public/404.html:2, firebase/public/index.html:2
Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one. — firebase/public/404.html:29
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
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.
`ThreadLocalStorage` is not registered, but `PdfDocument` creates it and keeps it in the static `tls`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_importedDocuments; e.g. `_importedDocuments` at line 50). — Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/ThreadLocalStorage.cs:41
`LzwDecode` is not registered, but `Filtering` creates it and keeps it in the static `_lzwDecode`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_data, _bytePointer, _nextData, _nextBits, _stringTable, _tableIndex; e.g. `_data` at line 62). — Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/LzwDecode.cs:38
`StartupTimelineSession` is not registered, but `StartupTimeline` creates it and keeps it in the static `Session`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_marks, IsLaunchSummaryWritten, IsPlaySummaryWritten, PlayOutcome, FailedMilestone, FailureReason; e.g. `_marks` at line 86). — Assets/Scripts/Cgs/Performance/StartupTimelineSession.cs:16
`ImageQueueService` keeps one instance of itself in the static `Instance`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_pending, _active; e.g. `_pending` at line 45). — Assets/Scripts/FinolDigital.Cgs.Json.Unity/ImageQueueService.cs:15
`UnityCard` keeps one instance of itself in the static `Blank`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_imageFileType, _orientedImageSprite, _imageSprite, IsLoadingImage; e.g. `_imageFileType` at line 22). — Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCard.cs:13
`UnityCardGame` keeps one instance of itself in the static `UnityInvalid`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (ContentGeneration, _isDownloading, _downloadStatus, DownloadStage, DownloadItemCount, DownloadItemTotal; e.g. `ContentGeneration` at line 92). — Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:31
`PSSR` 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 (_resmngr; e.g. `_resmngr` at line 360). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/root/PSSR.cs:46
`XKnownColorTable` 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 (ColorTable; e.g. `ColorTable` at line 219). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Drawing/XKnownColorTable.cs:39
`FontFactory` 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 (FontResolverInfosByName, FontSourcesByName, FontSourcesByKey; e.g. `FontResolverInfosByName` at line 107). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Fonts/FontFactory.cs:59
`GlobalFontSettings` 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 (_fontResolver, _fontEncoding, _fontEncodingInitialized; e.g. `_fontResolver` at line 72). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Fonts/GlobalFontSettings.cs:39
`Diagnostics` 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 (_notImplementedBehaviour; e.g. `_notImplementedBehaviour` at line 57). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Internal/Diagnostics.cs:52
`Lock` 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 (_gdiPlusLockCount, _fontFactoryLockCount; e.g. `_gdiPlusLockCount` at line 48). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Internal/Lock.cs:40
`PdfDocument` 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 (_nameCount, tls; e.g. `_nameCount` at line 209). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDocument.cs:49
`Keys` 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 (_meta; e.g. `_meta` at line 194). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDocumentInformation.cs:128
`Keys` 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 (_meta; e.g. `_meta` at line 801). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfOutline.cs:673
`Keys` 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 (_meta; e.g. `_meta` at line 946). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:742
`Keys` 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 (_meta; e.g. `_meta` at line 734). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPages.cs:699
`PdfReferenceTable_old` 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 (_nestingLevel; e.g. `_nestingLevel` at line 430). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:45
`Keys` 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 (_meta; e.g. `_meta` at line 295). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfViewerPreferences.cs:155
`Keys` 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 (s_meta; e.g. `s_meta` at line 134). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfAcroForm.cs:72
`Keys` 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 (_meta; e.g. `_meta` at line 388). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfCheckBoxField.cs:374
`Keys` 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 (_meta; e.g. `_meta` at line 166). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfChoiceField.cs:129
`Keys` 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 (_meta; e.g. `_meta` at line 117). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfComboBoxField.cs:108
`Keys` 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 (_meta; e.g. `_meta` at line 56). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfGenericField.cs:52
`Keys` 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 (_meta; e.g. `_meta` at line 75). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfListBoxField.cs:69
`Keys` 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 (_meta; e.g. `_meta` at line 58). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfPushButtonField.cs:54
`Keys` 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 (_meta; e.g. `_meta` at line 119). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfRadioButtonField.cs:102
`Keys` 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 (_meta; e.g. `_meta` at line 121). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfSignatureField.cs:52
`Keys` 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 (_meta; e.g. `_meta` at line 302). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfTextField.cs:289
`Keys` 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 (_meta; e.g. `_meta` at line 216). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:126
`Keys` 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 (_meta; e.g. `_meta` at line 416). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCatalog.cs:217
`Keys` 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 (_meta; e.g. `_meta` at line 179). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfContent.cs:172
`Keys` 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 (_meta; e.g. `_meta` at line 144). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceStream.cs:70
`PdfCrossReferenceTable` 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 (_nestingLevel; e.g. `_nestingLevel` at line 431). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:42
`Keys` 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 (_meta; e.g. `_meta` at line 398). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfExtGState.cs:224
`Keys` 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 (_meta; e.g. `_meta` at line 336). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfFontDescriptor.cs:157
`Keys` 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 (_meta; e.g. `_meta` at line 487). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfFormXObject.cs:412
`Keys` 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 (_meta; e.g. `_meta` at line 77). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfGroupAttributes.cs:54
`Keys` 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 (_meta; e.g. `_meta` at line 439). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfResources.cs:380
`Keys` 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 (_meta; e.g. `_meta` at line 245). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfShading.cs:145
What to do
Keep singletons stateless or back their state with thread-safe types (Concurrent*/Immutable*); otherwise concurrent callers race.
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.
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 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.
`IInputField` declares 17 members: `contentType`, `lineType`, `fontSize`, `text`, `placeholder`, `characterLimit`, `caretPosition`, `isFocused`, `selectionFocusPosition`, `selectionAnchorPosition`, `ReadOnly`, `OnFocusSelectAll`, `EnableMobileSupport`, `GetScreenCoordinates`, `ActivateInputField`, `DeactivateInputField`, `Rebuild`. 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. — Assets/WebGLSupport/WebGLInput/Wrapper/IInputField.cs:24
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.
Do you agree with this assessment?
C1 · Data Protection3.5 / 10Weak✓ Tool-verified
Other · Security — Whether sensitive data is encrypted at rest and in transit and keys are vaulted.
Method: Roslyn plus filesystem scan: encryption presence (EF ColumnEncryption, key-vault references, HTTPS enforcement) and key-derivation KDF detection. Deterministic.
What to do
Strengthen data-at-rest protection: vault your keys (Azure Key Vault / AWS KMS / IDataProtector key ring) and encrypt the most sensitive columns (EF HasConversion encryption or provider-native column encryption) — partial coverage still leaves gaps.
Enforce HTTPS (UseHttpsRedirection / RequireHttpsMetadata) so data in transit is always encrypted.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface. (×7) — Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/IImageImporter.cs:220, Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:167, Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterJpeg.cs:203, …
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.
`PrepareImageData` is a shipped member whose body only throws — and it is REACHED: Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/IImageImporter.cs:215 references it. This is not dead surface that can be deleted — anything taking that path throws at runtime. Implement the member, or remove the code that reaches it. — Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/IImageImporter.cs:220
The branch `if (_formState == FormState.NotATemplate)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:206
The branch `if (value != XPageDirection.Downwards)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:1009
The branch `if (value != new XPoint())` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:1024
The first 2 statements of the `if` and of the `else` are identical, so they run on both paths regardless of the condition. Lift them above the `if` — leaving them duplicated inside makes the branches read as though they handled this differently. — Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:246
The first 4 statements of the `if` and of the `else` are identical, so they run on both paths regardless of the condition. Lift them above the `if` — leaving them duplicated inside makes the branches read as though they handled this differently. — Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:448
`PrepareImage` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. (×2) — Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:167, Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterJpeg.cs:203
The `default:` section (reached by `JPEG`, `JPEGGRAY`, `JPEGRGBW`, `JPEGCMYK`) throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:384
The branch `if (components == 1)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. (×2) — Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:456, Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:871
The branch `if (format.Alignment != XStringAlignment.Near || format.LineAlignment != XLineAlignment.Near)` throws `ArgumentException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Drawing_Layout/XTextFormatter.cs:141
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. — Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/PdfGraphicsState.cs:378
The branch `if (path == null)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:843
The branch `if (_clipLevel != _gfxState.Level)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. (×2) — Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:855, Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:885
The branch `if (collectionNumber != 0)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Fonts/FontResolverInfo.cs:110
The only thing establishing that `tag` is long enough before it is indexed is a `Debug.Assert`, which is `[Conditional("DEBUG")]` — the compiler deletes the call from Release, so the build your users install indexes `tag` with no length check at all and throws at the indexer instead of failing diagnosably. `tag` comes from outside this method, so its length is a contract, not something this code can see. Bound it with a check that ships (`if (tag.Count < n) throw …`, or `ArgumentOutOfRangeException.ThrowIfLessThan`), and keep the assert for the invariant you believe holds. — Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontWriter.cs:52
The section `case KeyType.NumberTree:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf/KeysMeta.cs:154
The section `case KeyType.NameOrArray:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf/KeysMeta.cs:157
The section `case KeyType.ArrayOrDictionary:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf/KeysMeta.cs:160
The section `case KeyType.StreamOrArray:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf/KeysMeta.cs:163
`CompressionMode` is a shipped property whose accessors only throw NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfCustomValues.cs:53
The branch `if (obj is PdfLiteral)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:703
`Remove` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1354
`Contains` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1379
`CopyTo` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1508
The only thing establishing that `_outlines` is long enough before it is indexed is a `Debug.Assert`, which is `[Conditional("DEBUG")]` — the compiler deletes the call from Release, so the build your users install indexes `_outlines` with no length check at all and throws at the indexer instead of failing diagnosably. `_outlines` comes from outside this method, so its length is a contract, not something this code can see. Bound it with a check that ships (`if (_outlines.Count < n) throw …`, or `ArgumentOutOfRangeException.ThrowIfLessThan`), and keep the assert for the invariant you believe holds. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfOutline.cs:513
Code inside a `#if false` block is permanently excluded from the build — disabled code that should be removed or restored. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfRectangle.cs:400
The branch `if (ReadWord(imageBits, 0) != 0x4d42 || // "BM" ReadDWord(imageBits, 2) != streamLength || ReadDWord(imageBits, 14) != 40 || // sizeof BITMAPINFOHEADER ReadDWord(imageBits, 18) != width || ReadDWord(imageBits, 22) != height)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:806
The branch `if (ReadWord(imageBits, 26) != 1 || (!hasAlpha && ReadWord(imageBits, 28) != components * bits || hasAlpha && ReadWord(imageBits, 28) != (components + 1) * bits) || ReadDWord(imageBits, 30) != 0)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:813
The branch `if (ReadWord(imageBits, 0) != 0x4d42 || // "BM" ReadDWord(imageBits, 2) != streamLength || ReadDWord(imageBits, 14) != 40 || // sizeof BITMAPINFOHEADER #if WPF // TODOWPF: bug with height and width??? With which files??? ReadDWord(imageBits, 18) != width || ReadDWord(imageBits, 22) != height) #else ReadDWord(imageBits, 18) != width || ReadDWord(imageBits, 22) != height)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:1001
The branch `if (ReadWord(imageBits, 26) != 1 || ReadWord(imageBits, 28) != bits || ReadDWord(imageBits, 30) != 0)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:1019
The branch `if ((bytesFileOffset - bytesColorPaletteOffset) / 4 != paletteColors)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:1027
The section `case CStringType.HexString:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Content_Objects/CObjects.cs:699
The section `case CStringType.UnicodeString:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Content_Objects/CObjects.cs:703
The section `case CStringType.UnicodeHexString:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Content_Objects/CObjects.cs:707
The branch `if (dict.Elements["/F"] != null)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:323
The section `case Symbol.BeginStream:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:524
The branch `if (!_document._irefTable.ObjectTable.TryGetValue(objectID, out iref))` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported. — Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:825
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.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the 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.
`REDACTED` schedules updates, but no `package-ecosystem` entry covers `npm`, `pip`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the `updates:` list. — REDACTED:6
What to do
Dependabot is configured but does not watch `npm`, `pip` — add those `package-ecosystem` entries to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
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.
Job `deployToFirebaseTest` rolls out to production on every branch push, with no environment, no manual approval and no test it waits for — every push is a production release, and nothing stops a bad one before users get it. — REDACTED:764
Job `deployToFirebaseProduction` rolls out to production on every branch push, with no environment, no manual approval and no test it waits for — every push is a production release, and nothing stops a bad one before users get it. — REDACTED:804
Job `deployToSteam` rolls out to production on every branch push, with no environment, no manual approval and no test it waits for — every push is a production release, and nothing stops a bad one before users get it. — REDACTED:954
What to do
Run the production rollout in a protected environment, behind a manual approval, or after the tests it must pass, so a bad push is stopped before users get it.
Do you agree with this assessment?
P6 · Release Hygiene8.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
The changelog this check read carries 0 versioned entries, against a bar of 3. Counted as either the distinct `x.y.z` versions it names (a link's target is not counted) or its version-shaped section headings (`## [1.2.0]`, `## V14.x.x`, `## Updates in 8.0.x`), whichever is the larger — so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read — release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository — are not counted here, and this row is about what is re-findable in the tree rather than about how often you release.
What to do
Keep the changelog current — add a versioned entry (Keep-a-Changelog ## [x.y.z]) for each release so the history isn't a stub.
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.
3 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) — these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
`.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one). (×2) — Assets/Scripts/Cgs/Editor/Localization/CatalogImporter.cs:242, Assets/Scripts/Cgs/Editor/Localization/CatalogImporter.cs:243
What to do
Make the call chain async end-to-end and await it — never block on a Task with .Wait()/.GetAwaiter().GetResult().
Do you agree with this assessment?
R1 · Type Safety0.0 / 10Critical✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
0 typed · 12 plain JS — the untyped files are edge-worker/public-resource-path.test.mjs, edge-worker/scripts/public-resource-path.mjs, edge-worker/scripts/redirect-chain.mjs, REDACTED, edge-worker/src/index.js, edge-worker/test/redirect-chain.test.mjs (+6 more).
What to do
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
React / JS · Code Health — The share of the scored frontend lines inside a near-exact copy-pasted block of substantial extent (the D4 clone algorithm over JS/TS tokens, D-386; each line once, 10 at none and 0 at a quarter of the lines, as D4): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Scored on the share of the scored frontend lines inside a reported copy, on the same curve as D4. Deterministic.
REDACTED:85 · REDACTED:167 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:85
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
handleRequest has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — edge-worker/src/index.js:125
acceptsMarkdown has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — edge-worker/src/index.js:39
Do you agree with this assessment?
R3 · Large Files10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
Do you agree with this assessment?
R4 · Test Coverage7.5 / 10Strong✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. — firebase/public/ServiceWorker.js:1
What to do
Add tests that import the unreached modules (directly or through their public entry).
Do you agree with this assessment?
R6 · Tooling6.7 / 10Adequate✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
test ✓ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
What to do
Add eslint as package.json scripts and run them in CI.
Do you agree with this assessment?
R7 · Dead Code10.0 / 10Exemplary✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Security — Cryptographic hygiene (weak hash/cipher, password key-derivation). This codebase has no web surface, so transport/header/cookie/CSRF controls are N/A and only crypto is scored.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
`sha256.ComputeHash(…)` puts the password `PasswordDomain` through a fast general-purpose digest, so a stolen hash is guessed at billions of candidates a second whether or not it is salted — no key-derivation function (PBKDF2/scrypt/Argon2/bcrypt) stands between the password and the stored value. — Assets/Scripts/Cgs/Play/Multiplayer/LobbyPassword.cs:38
MD5/SHA1 is constructed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ for content integrity, or a KDF (PBKDF2/Argon2/BCrypt) for password storage. If it only derives a non-security identifier (a cache key, a file or mutex name), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as `System.IO.Hashing.XxHash64`/`Crc32` says it in code — since the algorithm alone cannot distinguish the two uses. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Security/PdfStandardSecurityHandler.cs:622
What to do
Store passwords with a salted KDF — `Microsoft.AspNetCore.Identity.PasswordHasher<T>`, `Rfc2898DeriveBytes` (PBKDF2), or BCrypt/Argon2 — and compare with `CryptographicOperations.FixedTimeEquals`. (A fast/plain hash, or a client-hashed value stored and compared verbatim, is not password storage.) Start in `Assets/Scripts/Cgs/Play/Multiplayer/LobbyPassword.cs:38`.
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (`System.IO.Hashing.XxHash64`/`Crc32`) where it only derives an identifier such as a cache key or a mutex name.
Do you agree with this assessment?
X1 · Async correctness4.9 / 10Weak✓ Tool-verified
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process. (×2) — Assets/Scripts/Cgs/Editor/Localization/CatalogImporter.cs:242, Assets/Scripts/Cgs/Editor/Localization/CatalogImporter.cs:243
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · 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.
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.
Only 1/12 async methods accept a CancellationToken, so in-flight work can't be stopped early when the caller gives up — whatever ends it in your host (shutdown signal, timeout, abandoned request, user cancel). Thread a token through the call chain and honour it at each await and loop; where a method genuinely cannot be interrupted, omitting it is a deliberate choice — judge against your hosting model.
No CancellationToken parameter — this work can't be stopped early once started. (×11) — Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:146, Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:235, Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:271, …
What to do
Thread a CancellationToken through async methods so work stops promptly on cancellation.
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.
The guard on line 133 rejects `viewBox` and line 134 reports that rejection as `ArgumentNullException` — but the condition's own test `viewBox.Width < 1` is true of a value that is NOT null: it reads a member of `viewBox`, so it can only be evaluated on a non-null `viewBox` (a null one would throw `NullReferenceException` before the guard decided anything). So a caller whose `viewBox` is present but fails that test is told it was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows this case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` (or `ArgumentOutOfRangeException` for a bound) for what the condition actually tests, or split the guard and throw each on its own condition. — Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:134
The guard on line 101 rejects `fontFamilyName` and line 102 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(fontFamilyName)` is true of a value that is NOT null: it is satisfied by an EMPTY `fontFamilyName`, and on that path `fontFamilyName` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows this case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` (or `ArgumentOutOfRangeException` for a bound) for what the condition actually tests, or split the guard and throw each on its own condition. — Assets/Plugins/PdfSharp/Didstopia/Fonts/FontDescriptorCache.cs:102
The guard on line 107 rejects `faceName` and line 108 reports that rejection as `ArgumentNullException` — but the condition's own test `String.IsNullOrEmpty(faceName)` is true of a value that is NOT null: it is satisfied by an EMPTY `faceName`, and on that path `faceName` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows this case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` (or `ArgumentOutOfRangeException` for a bound) for what the condition actually tests, or split the guard and throw each on its own condition. — Assets/Plugins/PdfSharp/Didstopia/Fonts/FontResolverInfo.cs:108
The guard on line 1397 rejects `key` and line 1398 reports that rejection as `ArgumentNullException` — but the condition's own test `String.IsNullOrEmpty(key)` is true of a value that is NOT null: it is satisfied by an EMPTY `key`, and on that path `key` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows this case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` (or `ArgumentOutOfRangeException` for a bound) for what the condition actually tests, or split the guard and throw each on its own condition. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1398
The guard on line 245 rejects `value` only when `value == null`, and line 246 reports that rejection as `ArgumentOutOfRangeException` — but the condition is a NULL test: no value out of any range reaches the throw, only a missing `value`. So a caller who passes null is told the argument was out of range, and a caller catching `ArgumentNullException` to handle a missing argument never sees this one. Throw `ArgumentNullException` for it — `ArgumentNullException.ThrowIfNull(value)`. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfOutlineCollection.cs:246
What to do
Each finding names the throw and the test in its own condition that is true of a NON-null value. Confirm from the two, then throw the exception that describes what was actually wrong: `ArgumentException` for a value that arrived empty, or the .NET 8 helpers that spell the whole guard in one line and pick the type for you — `ArgumentException.ThrowIfNullOrEmpty(s)` / `ThrowIfNullOrWhiteSpace(s)` for strings, `ArgumentNullException.ThrowIfNull(x)` followed by `ArgumentOutOfRangeException.ThrowIfZero(x.Count)` for a collection. Splitting the two conditions is usually clearer than picking one exception for both: they are different failures and the caller may want to handle them differently.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back. Also whether a `finally` that gives the primitive back unconditionally can run in a state where the method does not hold it: after a timed wait whose result was discarded, after an acquire inside the `try` that can fail, after the body already released it, or never, because a `return` left between the acquire and the `try`. In Rust, where a guard or permit releases when it is dropped, whether a release written BY HAND — `add_permits` after a forgotten permit, `force_unlock` after a leaked guard, a raw lock's `unlock` — matches the state the function's own acquisitions put the primitive in: not after a try or timed acquire whose failure does not leave, not from a cleanup set up before an acquire that can fail, not skipped by a `?`, `return`, `break` or `continue`, and not on top of a guard that still releases itself.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
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.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×10) — Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:59, Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterJpeg.cs:77, Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:767, …
`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. — Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/GlyphDataTable.cs:76
`catch (ObjectDisposedException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch. — Assets/Scripts/Cgs/Play/Multiplayer/NetworkDiscovery.cs:116
`ContinueWith` with a continuation that does nothing discards the antecedent's failure — the task it returns completes successfully whether or not the work faulted, so the failure vanishes with no log and no rethrow. Await the task and handle the exception, or report the fault from the continuation (`t.Exception`). — Assets/Scripts/UnityExtensionMethods/UnityFileMethods.cs:656
What to do
Swallowed exception (empty catch)
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 log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or REDACTED, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
This method contradicts itself about `obj`: line 1115 assigns it with `as PdfObject`, which hands back null rather than throwing when the value is not a `PdfObject`, but line 1118 then dereferences it directly as `obj.Reference` with no null test between them and no guard around it. If the `as` is right, that dereference throws NullReferenceException on the input it was written for — and the NullReferenceException names neither the cast nor the type that failed. Settle it one way — test `obj` once before the first use and handle the null case, or cast with `(PdfObject)` so the failure is reported where it happens — rather than leaving the two readings side by side. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1118
This method contradicts itself about `xref3`: line 607 assigns it with `as PdfReference`, which hands back null rather than throwing when the value is not a `PdfReference`, but line 608 then dereferences it directly as `xref3.Value` with no null test between them and no guard around it. If the `as` is right, that dereference throws NullReferenceException on the input it was written for — and the NullReferenceException names neither the cast nor the type that failed. Settle it one way — test `xref3` once before the first use and handle the null case, or cast with `(PdfReference)` so the failure is reported where it happens — rather than leaving the two readings side by side. — Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPages.cs:608
This method contradicts itself about `selector`: line 216 assigns it with `as Selector`, which hands back null rather than throwing when the value is not a `Selector`, but line 219 then dereferences it directly as `selector._path` with no null test between them and no guard around it. If the `as` is right, that dereference throws NullReferenceException on the input it was written for — and the NullReferenceException names neither the cast nor the type that failed. Settle it one way — test `selector` once before the first use and handle the null case, or cast with `(Selector)` so the failure is reported where it happens — rather than leaving the two readings side by side. — Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfFormXObjectTable.cs:219
0/524 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets <Nullable>enable</Nullable> for it: a file is enabled only by its own `#nullable enable`, by a Unity `csc.rsp` with `-nullable:enable` for its assembly, or as a file-based app (`#:` directives) whose `#:property Nullable` does not turn it off. NRTs catch a whole class of null-deref bugs at compile time.
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 `?.`.
Put every file in a nullable-enabled context — `#nullable enable` at its top, or commit a project file with <Nullable>enable</Nullable> — and resolve warnings rather than suppressing with `!`.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 13 of 55 WCAG 2.2 Level A/AA success criteria (24%; ≈26% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 42 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
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 — 2 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 4 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 4 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Repo shows no audit-logging mechanism (IAuditable, an immutable audit log, an EF SaveChanges interceptor) for sensitive changes — absence of evidence is not evidence of a working control. Record an audit trail in code (or document where it lives) so this dimension can be scored.
C4 Data Retention — Repo shows no data-retention / TTL / cleanup mechanism for personal data — absence of evidence is not evidence of a working control. Define retention periods and a purge/cleanup job (or TTL) in code, or document where retention is enforced, so this dimension can be scored.
C5 Data-Subject Rights — Repo shows no corroborated data-subject-rights mechanism (erasure / export-portability / consent) tied to a subject id or GDPR vocabulary — absence of evidence is not evidence of a working control. Implement erasure, data export/portability and consent tracking over the subject's records.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 49 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.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AC5 ARIA correctness — No ARIA usage found in the parsed markup — AC5 not applicable here.
AX1 Captive dependencies — no DI registrations detected
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — [0m - InvalidDefaultArgInFrom: Default value for ARG ${BASE_IMAGE} results in empty or invalid base image name (line 2) Dockerfile:2 -------------------- 1 | ARG BASE_IMAGE 2 | >>> FROM ${BASE_IMAGE} 3 | COPY python/ C:/Python/ 4 | ENV CGS_PYTHON=C:/Python/python.exe -------------------- ERROR: failed to solve: base name (${BASE_IMAGE}) should not be blank; likely cause (not identified): the image build failed, and its output does not match a cause we recognise; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D21 Naming Consistency — Naming consistency does not read html yet; not measured.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only; comments in this repository's .py source were not judged.
D25 ADR Conformance — no ADRs to check
D26 Project Cohesion — Project cohesion is assessed over the .NET project set; this target exposed no projects, so project size and spread could not be assessed. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D27 Navigability — Most of this repository's production source (.cs, .m) was not read by navigability analysis, so tracing effort was not assessed — whatever else resolved (another language's projects) is not this repository's navigability. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — 11 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 project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (1 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 (this repository commits no MSBuild project, so its C# was read as syntax-only projects — a handler marked ONLY by an interface from a package is not visible without a build)
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P2 Observability — Observability was not assessed: this check reads a source model that does not carry this repository's product — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of a logging idiom this check recognises is NOT evidence that this repo lacks structured logging (it may log through its own ecosystem's logger). This is a gap in the analyzer, not a finding about this repository.
P7 Outbound HTTP resilience — not measured — the application kind could not be determined for this repo
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — coverage data present for 7 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
PF2 Allocation hygiene — 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.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
R5 Dependency Freshness — no package-lock.json — dependency freshness not measured (would require an npm lockfile); JS/npm CVEs are scored in D30 (Dependency Vulnerabilities), which answers every ecosystem
R8 Dependency Hygiene — Not measured — no package.json declares any dependency, so there is nothing to check imports against (imports may resolve through a host runtime rather than node).
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
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
X24 Document value interpolated into markup unescaped — 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
X27 Collection changed while being enumerated — This check needs a compiled C# program and this repository commits no project file to compile, so only its syntax could be read. That is a limit of the analyzer, not a finding about your code.
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
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/IImageImporter.cs:220— `PrepareImageData` is a shipped member whose body only throws — and it is REACHED: Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/IImageImporter.cs:215 references it. This is not dead surface that can be deleted — anything taking that path throws at runtime. Implement the member, or remove the code that reaches it.
S1 · Cryptographic Hygiene· Password hashing without a KDF · ×1
Password hashing without a KDF Assets/Scripts/Cgs/Play/Multiplayer/LobbyPassword.cs:38— `sha256.ComputeHash(…)` puts the password `PasswordDomain` through a fast general-purpose digest, so a stolen hash is guessed at billions of candidates a second whether or not it is salted — no key-derivation function (PBKDF2/scrypt/Argon2/bcrypt) stands between the password and the stored value.
Serious — 620 finding(s)
AX2 · Stateful singletons· Process-global static state · ×34
Process-global static state: PSSR Assets/Plugins/PdfSharp/Didstopia/root/PSSR.cs:46— `PSSR` 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 (_resmngr; e.g. `_resmngr` at line 360). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: XKnownColorTable Assets/Plugins/PdfSharp/Didstopia/Drawing/XKnownColorTable.cs:39— `XKnownColorTable` 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 (ColorTable; e.g. `ColorTable` at line 219). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: FontFactory Assets/Plugins/PdfSharp/Didstopia/Fonts/FontFactory.cs:59— `FontFactory` 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 (FontResolverInfosByName, FontSourcesByName, FontSourcesByKey; e.g. `FontResolverInfosByName` at line 107). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: GlobalFontSettings Assets/Plugins/PdfSharp/Didstopia/Fonts/GlobalFontSettings.cs:39— `GlobalFontSettings` 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 (_fontResolver, _fontEncoding, _fontEncodingInitialized; e.g. `_fontResolver` at line 72). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Diagnostics Assets/Plugins/PdfSharp/Didstopia/Internal/Diagnostics.cs:52— `Diagnostics` 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 (_notImplementedBehaviour; e.g. `_notImplementedBehaviour` at line 57). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Lock Assets/Plugins/PdfSharp/Didstopia/Internal/Lock.cs:40— `Lock` 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 (_gdiPlusLockCount, _fontFactoryLockCount; e.g. `_gdiPlusLockCount` at line 48). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: PdfDocument Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDocument.cs:49— `PdfDocument` 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 (_nameCount, tls; e.g. `_nameCount` at line 209). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDocumentInformation.cs:128— `Keys` 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 (_meta; e.g. `_meta` at line 194). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfOutline.cs:673— `Keys` 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 (_meta; e.g. `_meta` at line 801). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:742— `Keys` 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 (_meta; e.g. `_meta` at line 946). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPages.cs:699— `Keys` 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 (_meta; e.g. `_meta` at line 734). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: PdfReferenceTable_old Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:45— `PdfReferenceTable_old` 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 (_nestingLevel; e.g. `_nestingLevel` at line 430). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfViewerPreferences.cs:155— `Keys` 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 (_meta; e.g. `_meta` at line 295). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfAcroForm.cs:72— `Keys` 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 (s_meta; e.g. `s_meta` at line 134). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfCheckBoxField.cs:374— `Keys` 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 (_meta; e.g. `_meta` at line 388). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfChoiceField.cs:129— `Keys` 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 (_meta; e.g. `_meta` at line 166). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfComboBoxField.cs:108— `Keys` 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 (_meta; e.g. `_meta` at line 117). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfGenericField.cs:52— `Keys` 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 (_meta; e.g. `_meta` at line 56). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfListBoxField.cs:69— `Keys` 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 (_meta; e.g. `_meta` at line 75). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfPushButtonField.cs:54— `Keys` 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 (_meta; e.g. `_meta` at line 58). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfRadioButtonField.cs:102— `Keys` 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 (_meta; e.g. `_meta` at line 119). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfSignatureField.cs:52— `Keys` 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 (_meta; e.g. `_meta` at line 121). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfTextField.cs:289— `Keys` 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 (_meta; e.g. `_meta` at line 302). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:126— `Keys` 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 (_meta; e.g. `_meta` at line 216). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Process-global static state: Keys Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCatalog.cs:217— `Keys` 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 (_meta; e.g. `_meta` at line 416). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:206— The branch `if (_formState == FormState.NotATemplate)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:1009— The branch `if (value != XPageDirection.Downwards)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:1024— The branch `if (value != new XPoint())` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:384— The `default:` section (reached by `JPEG`, `JPEGGRAY`, `JPEGRGBW`, `JPEGCMYK`) throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:456— The branch `if (components == 1)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws a "not implemented" exception Assets/Plugins/PdfSharp/Didstopia/Drawing_Layout/XTextFormatter.cs:141— The branch `if (format.Alignment != XStringAlignment.Near || format.LineAlignment != XLineAlignment.Near)` throws `ArgumentException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:843— The branch `if (path == null)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:855— The branch `if (_clipLevel != _gfxState.Level)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:885— The branch `if (_clipLevel != _gfxState.Level)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Fonts/FontResolverInfo.cs:110— The branch `if (collectionNumber != 0)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/KeysMeta.cs:154— The section `case KeyType.NumberTree:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/KeysMeta.cs:157— The section `case KeyType.NameOrArray:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/KeysMeta.cs:160— The section `case KeyType.ArrayOrDictionary:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/KeysMeta.cs:163— The section `case KeyType.StreamOrArray:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:703— The branch `if (obj is PdfLiteral)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:806— The branch `if (ReadWord(imageBits, 0) != 0x4d42 || // "BM" ReadDWord(imageBits, 2) != streamLength || ReadDWord(imageBits, 14) != 40 || // sizeof BITMAPINFOHEADER ReadDWord(imageBits, 18) != width || ReadDWord(imageBits, 22) != height)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:813— The branch `if (ReadWord(imageBits, 26) != 1 || (!hasAlpha && ReadWord(imageBits, 28) != components * bits || hasAlpha && ReadWord(imageBits, 28) != (components + 1) * bits) || ReadDWord(imageBits, 30) != 0)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:871— The branch `if (components == 1)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:1001— The branch `if (ReadWord(imageBits, 0) != 0x4d42 || // "BM" ReadDWord(imageBits, 2) != streamLength || ReadDWord(imageBits, 14) != 40 || // sizeof BITMAPINFOHEADER #if WPF // TODOWPF: bug with height and width??? With which files??? ReadDWord(imageBits, 18) != width || ReadDWord(imageBits, 22) != height) #else ReadDWord(imageBits, 18) != width || ReadDWord(imageBits, 22) != height)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:1019— The branch `if (ReadWord(imageBits, 26) != 1 || ReadWord(imageBits, 28) != bits || ReadDWord(imageBits, 30) != 0)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:1027— The branch `if ((bytesFileOffset - bytesColorPaletteOffset) / 4 != paletteColors)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf_Content_Objects/CObjects.cs:699— The section `case CStringType.HexString:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf_Content_Objects/CObjects.cs:703— The section `case CStringType.UnicodeString:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf_Content_Objects/CObjects.cs:707— The section `case CStringType.UnicodeHexString:` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
Unfinished branch — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:323— The branch `if (dict.Elements["/F"] != null)` throws `NotImplementedException` while the member's other paths do the work — the branch was never written, so every input that reaches it fails at run time. Implement the branch, or reject the input where it enters with an exception that says it is not supported.
TooManyMethods: XGraphics Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs— TooManyMethods — 666 significant lines (blank, comment-only and punctuation-only lines excluded), 120 methods. The bar is 30 methods; this is 90 over it, 4.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: XMatrix Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs— TooManyMethods — 544 significant lines (blank, comment-only and punctuation-only lines excluded), 70 methods. The bar is 30 methods; this is 40 over it, 2.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.
TooManyMethods: CgsNetPlayer Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs— TooManyMethods — 499 significant lines (blank, comment-only and punctuation-only lines excluded), 69 methods. The bar is 30 methods; this is 39 over it, 2.30× 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: PlayController Assets/Scripts/Cgs/Play/PlayController.cs— TooManyMethods — 725 significant lines (blank, comment-only and punctuation-only lines excluded), 66 methods. The bar is 30 methods; this is 36 over it, 2.20× 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: CgsNetPlayable Assets/Scripts/Cgs/CardGameView/Multiplayer/CgsNetPlayable.cs— TooManyMethods — 561 significant lines (blank, comment-only and punctuation-only lines excluded), 66 methods. The bar is 30 methods; this is 36 over it, 2.20× 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: XGraphicsPdfRenderer Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs— TooManyMethods — 767 significant lines (blank, comment-only and punctuation-only lines excluded), 64 methods. The bar is 30 methods; this is 34 over it, 2.13× 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: DictionaryElements Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs— TooManyMethods — 476 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods. The bar is 30 methods; this is 25 over it, 1.83× 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: CardModel Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs— TooManyMethods — 612 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: PlayableViewer Assets/Scripts/Cgs/CardGameView/Viewer/PlayableViewer.cs— TooManyMethods — 438 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 30 methods; this is 17 over it, 1.57× 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: CardStack Assets/Scripts/Cgs/CardGameView/Multiplayer/CardStack.cs— TooManyMethods — 444 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 30 methods; this is 13 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.
TooManyMethods: XRect Assets/Plugins/PdfSharp/Didstopia/Drawing/XRect.cs— TooManyMethods — 282 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 30 methods; this is 13 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.
TooManyMethods: CardGameManager Assets/Scripts/Cgs/CardGameManager.cs— TooManyMethods — 528 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 30 methods; this is 12 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: DeckEditor Assets/Scripts/Cgs/Decks/DeckEditor.cs— TooManyMethods — 404 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 30 methods; this is 8 over it, 1.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: XVector Assets/Plugins/PdfSharp/Didstopia/Drawing/XVector.cs— TooManyMethods — 107 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 30 methods; this is 6 over it, 1.20× 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: XGraphicsPath Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphicsPath.cs— TooManyMethods — 96 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 30 methods; this is 6 over it, 1.20× 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: DeckLoadMenu Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs— TooManyMethods — 317 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: PdfWriter Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfWriter.cs— TooManyMethods — 298 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Parser Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs— TooManyMethods — 580 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CardGameEditorMenu Assets/Scripts/Cgs/Menu/CardGameEditorMenu.cs— TooManyMethods — 351 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CardViewer Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs— TooManyMethods — 455 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CgsNetManager Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs— TooManyMethods — 365 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03× 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: MainMenu Assets/Scripts/Cgs/Menu/MainMenu.cs— TooManyMethods — 296 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03× 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.
FileTooLong: FinolDigital.Cgs.Json.Unity/UnityCardGame.cs Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs— FileTooLong — 1070 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 570 over it, 2.14× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Drawing_Pdf/XGraphicsPdfRenderer.cs Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs— FileTooLong — 778 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 278 over it, 1.56× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Play/PlayController.cs Assets/Scripts/Cgs/Play/PlayController.cs— FileTooLong — 763 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 263 over it, 1.53× 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: Drawing/XGraphics.cs Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs— FileTooLong — 705 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 205 over it, 1.41× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Pdf/PdfDictionary.cs Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs— FileTooLong — 683 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 183 over it, 1.37× 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: Drawing/XMatrix.cs Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs— FileTooLong — 646 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 146 over it, 1.29× 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: Multiplayer/CardModel.cs Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs— FileTooLong — 634 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 134 over it, 1.27× 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: Pdf_IO/Parser.cs Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs— FileTooLong — 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 over it, 1.20× 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: Multiplayer/CgsNetPlayable.cs Assets/Scripts/Cgs/CardGameView/Multiplayer/CgsNetPlayable.cs— FileTooLong — 588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 88 over it, 1.18× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Fonts_OpenType/OpenTypeFontTables.cs Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs— FileTooLong — 585 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 85 over it, 1.17× 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: Cgs/CardGameManager.cs Assets/Scripts/Cgs/CardGameManager.cs— FileTooLong — 549 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 49 over it, 1.10× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Multiplayer/CgsNetPlayer.cs Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs— FileTooLong — 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 over it, 1.09× 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.
D4 · Code Duplication· Edited copy of a member (8 corresponding lines) · ×12
Edited copy of a member (8 corresponding lines) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityDeck.cs:188— Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityDeck.cs:188-195 | Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityDeck.cs:198-205 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/XPoint.cs:168— Assets/Plugins/PdfSharp/Didstopia/Drawing/XPoint.cs:168-175 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XSize.cs:135-146 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:193— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:193-200 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:194-201 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) Assets/Scripts/Cgs/Cards/CardSelector.cs:32— Assets/Scripts/Cgs/Cards/CardSelector.cs:32-39 | Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:37-44 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfInternals.cs:178— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfInternals.cs:178-185 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfInternals.cs:257-265 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) Assets/Scripts/Cgs/Localization/CgsLocalizeStringEvent.cs:16— Assets/Scripts/Cgs/Localization/CgsLocalizeStringEvent.cs:16-23 | Assets/Scripts/Cgs/Localization/LocalizedMessageBinding.cs:54-63 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/ContentWriter.cs:110— Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/ContentWriter.cs:110-118 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfWriter.cs:440-447 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:2059— Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:2059-2105 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:275-282 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) Assets/Scripts/Cgs/Decks/DeckSaveMenu.cs:215— Assets/Scripts/Cgs/Decks/DeckSaveMenu.cs:215-224 | Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:453-460 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) Assets/Scripts/Cgs/Menu/MainMenu.cs:441— Assets/Scripts/Cgs/Menu/MainMenu.cs:441-448 | Assets/Scripts/Cgs/Menu/Settings.cs:246-254 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:126— Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:126-133 | Assets/Scripts/Cgs/CardGameView/Multiplayer/CardStack.cs:237-244 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (8 corresponding lines) Assets/Shaders and Materials/Shader Graph/17.0.4/UGUI Shaders/Scripts/Runtime/CustomSlider.cs:25— Assets/Shaders and Materials/Shader Graph/17.0.4/UGUI Shaders/Scripts/Runtime/CustomSlider.cs:25-32 | Assets/Shaders and Materials/Shader Graph/17.0.4/UGUI Shaders/Scripts/Runtime/RangeBar.cs:28-35 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (9 corresponding lines) · ×11
Edited copy of a member (9 corresponding lines) Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:516— Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:516-526 | Assets/Scripts/Cgs/Play/Multiplayer/LobbyMenu.cs:492-500 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) Assets/Scripts/Cgs/Cards/CardsExplorer.cs:200— Assets/Scripts/Cgs/Cards/CardsExplorer.cs:200-208 | Assets/Scripts/Cgs/Decks/DeckEditor.cs:652-661 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) Assets/Scripts/Cgs/CardGameManager.cs:110— Assets/Scripts/Cgs/CardGameManager.cs:110-118 | Assets/Scripts/Cgs/CardGameManager.cs:142-150 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Annotations/PdfRubberStampAnnotation.cs:70— Assets/Plugins/PdfSharp/Didstopia/Pdf_Annotations/PdfRubberStampAnnotation.cs:70-78 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Annotations/PdfTextAnnotation.cs:88-96 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) Assets/Scripts/Cgs/CardGameView/Multiplayer/Counter.cs:59— Assets/Scripts/Cgs/CardGameView/Multiplayer/Counter.cs:59-67 | Assets/Scripts/Cgs/CardGameView/Multiplayer/Die.cs:88-96 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Annotations/PdfRubberStampAnnotation.cs:80— Assets/Plugins/PdfSharp/Didstopia/Pdf_Annotations/PdfRubberStampAnnotation.cs:80-88 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Annotations/PdfTextAnnotation.cs:98-106 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:542— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:542-550 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:543-551 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) Assets/Scripts/Cgs/Cards/SearchResultsLayout.cs:15— Assets/Scripts/Cgs/Cards/SearchResultsLayout.cs:15-25 | Assets/Scripts/Cgs/Decks/SearchResultsLayout.cs:16-24 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) Assets/Scripts/Cgs/CardGameView/Viewer/CardActionPanel.cs:144— Assets/Scripts/Cgs/CardGameView/Viewer/CardActionPanel.cs:144-152 | Assets/Scripts/Cgs/CardGameView/Viewer/PlayableViewer.cs:613-621 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) Assets/Scripts/Cgs/Cards/CardSelector.cs:210— Assets/Scripts/Cgs/Cards/CardSelector.cs:210-218 | Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:192-200 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (9 corresponding lines) Assets/Scripts/Cgs/Cards/CardSelector.cs:227— Assets/Scripts/Cgs/Cards/CardSelector.cs:227-235 | Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:217-225 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
X2 · Cancellation propagation· Async method without CancellationToken · ×11
Async method without CancellationToken: SignInAnonymouslyAsync Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:146— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: AllocateRelayServerAndGetCode Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:235— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: CreateLobby Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:271— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: JoinLobbyById Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:421— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: JoinLobbyByCode Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:495— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: JoinRelay Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:598— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: UpdatePlayerRelayInfoAsync Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:622— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: RefreshLobbies Assets/Scripts/Cgs/Play/Multiplayer/LobbyMenu.cs:230— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: JoinServiceAsync Assets/Scripts/Cgs/Play/Multiplayer/LobbyPassword.cs:49— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: SendBroadcastsAsync Assets/Scripts/Cgs/Play/Multiplayer/NetworkDiscovery.cs:105— No CancellationToken parameter — this work can't be stopped early once started.
Async method without CancellationToken: ReceiveBroadcastAsync Assets/Scripts/Cgs/Play/Multiplayer/NetworkDiscovery.cs:268— No CancellationToken parameter — this work can't be stopped early once started.
Hotspot: Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:377— Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in UnityCardGame.Download at line 377. 1 of those changes was a fix/bug commit, and the other 10 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 11:12:14 -06:00' --until='2026-11-14 11:12:14 -06:00' --full-history --no-merges -- Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.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: Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:284— Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in CardViewer.Update at line 284. 2 of those changes were fix/bug commits, and the other 10 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 11:12:14 -06:00' --until='2026-11-14 11:12:14 -06:00' --full-history --no-merges -- Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.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: Assets/Scripts/UnityExtensionMethods/UnityFileMethods.cs Assets/Scripts/UnityExtensionMethods/UnityFileMethods.cs:266— Assets/Scripts/UnityExtensionMethods/UnityFileMethods.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in UnityFileMethods.SaveUrlToFile at line 266. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 11:12:14 -06:00' --until='2026-11-14 11:12:14 -06:00' --full-history --no-merges -- Assets/Scripts/UnityExtensionMethods/UnityFileMethods.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: Assets/Scripts/Cgs/Play/PlayController.cs Assets/Scripts/Cgs/Play/PlayController.cs:612— Assets/Scripts/Cgs/Play/PlayController.cs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PlayController.CreateCardStack at line 612. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 11:12:14 -06:00' --until='2026-11-14 11:12:14 -06:00' --full-history --no-merges -- Assets/Scripts/Cgs/Play/PlayController.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: Assets/Scripts/Cgs/Menu/MainMenu.cs Assets/Scripts/Cgs/Menu/MainMenu.cs:132— Assets/Scripts/Cgs/Menu/MainMenu.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in MainMenu.Update at line 132. 1 of those changes was a fix/bug commit, and the other 8 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 11:12:14 -06:00' --until='2026-11-14 11:12:14 -06:00' --full-history --no-merges -- Assets/Scripts/Cgs/Menu/MainMenu.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: Assets/Scripts/Cgs/Editor/Localization/AuthoredUiBinder.cs Assets/Scripts/Cgs/Editor/Localization/AuthoredUiBinder.cs:187— Assets/Scripts/Cgs/Editor/Localization/AuthoredUiBinder.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in AuthoredUiBinder.Bind at line 187. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 11:12:14 -06:00' --until='2026-11-14 11:12:14 -06:00' --full-history --no-merges -- Assets/Scripts/Cgs/Editor/Localization/AuthoredUiBinder.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: Assets/Scripts/Cgs/Menu/ProgressBar.cs Assets/Scripts/Cgs/Menu/ProgressBar.cs:25— Assets/Scripts/Cgs/Menu/ProgressBar.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ProgressBar.Update at line 25. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 11:12:14 -06:00' --until='2026-11-14 11:12:14 -06:00' --full-history --no-merges -- Assets/Scripts/Cgs/Menu/ProgressBar.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: Assets/Scripts/Cgs/Editor/Localization/FontCatalogBuilder.cs Assets/Scripts/Cgs/Editor/Localization/FontCatalogBuilder.cs:103— Assets/Scripts/Cgs/Editor/Localization/FontCatalogBuilder.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in FontCatalogBuilder.ValidateGlyphs at line 103. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 11:12:14 -06:00' --until='2026-11-14 11:12:14 -06:00' --full-history --no-merges -- Assets/Scripts/Cgs/Editor/Localization/FontCatalogBuilder.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: tools/startup-benchmark/android_benchmark.py tools/startup-benchmark/android_benchmark.py:57— tools/startup-benchmark/android_benchmark.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in android_benchmark.run_once at line 57. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 11:12:14 -06:00' --until='2026-11-14 11:12:14 -06:00' --full-history --no-merges -- tools/startup-benchmark/android_benchmark.py`: 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: Assets/Scripts/Cgs/UI/ScrollRects/ScrollRectAutoScroll.cs Assets/Scripts/Cgs/UI/ScrollRects/ScrollRectAutoScroll.cs:29— Assets/Scripts/Cgs/UI/ScrollRects/ScrollRectAutoScroll.cs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ScrollRectAutoScroll.LateUpdate at line 29. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 11:12:14 -06:00' --until='2026-11-14 11:12:14 -06:00' --full-history --no-merges -- Assets/Scripts/Cgs/UI/ScrollRects/ScrollRectAutoScroll.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.
Duplicated block (5 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:238— Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:238-242 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:267-271 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:242— Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:242-246 | Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:286-290 — 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 `Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:242` 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 (5 lines × 2) Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:310— Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:310-314 | Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:344-348 — 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 `Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:310` 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 (5 lines × 2) Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:89— Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:89-93 | Assets/Scripts/Cgs/Menu/DownloadMenu.cs:34-38 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:89` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:522— Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:522-526 | Assets/Scripts/Cgs/Menu/DownloadMenu.cs:169-173 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:522` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) Assets/Scripts/Cgs/Menu/MainMenu.cs:227— Assets/Scripts/Cgs/Menu/MainMenu.cs:227-231 | Assets/Scripts/Cgs/Menu/MainMenu.cs:295-299 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:554— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:554-558 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfDictionaryWithContentStream.cs:123-127 — 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) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:573— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:573-577 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfDictionaryWithContentStream.cs:142-146 — 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) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:180— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:180-184 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:181-185 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/ContentWriter.cs:121— Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/ContentWriter.cs:121-125 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfWriter.cs:450-455 — 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.
Swallowed exception (empty catch) Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:59— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterJpeg.cs:77— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:767— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfComboBoxField.cs:96— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:89— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:104— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:129— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:138— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:176— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) Assets/Scripts/Cgs/Play/Multiplayer/NetworkDiscovery.cs:158— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
MethodTooLong: PdfImage.ReadIndexedMemoryBitmap Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:945— MethodTooLong — ReadIndexedMemoryBitmap runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05× 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: UnityCardGame.LoadCardFromJToken Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:924— MethodTooLong — LoadCardFromJToken runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71× 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: UnityCardGame.Download Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:377— MethodTooLong — Download runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 69 over it, 1.69× 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: XKnownColorTable.InitColorTable Assets/Plugins/PdfSharp/Didstopia/Drawing/XKnownColorTable.cs:72— MethodTooLong — InitColorTable runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44× 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: AotTypeEnforcer.Awake Assets/Scripts/Cgs/AotTypeEnforcer.cs:22— MethodTooLong — Awake runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PdfReader.Open Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:278— MethodTooLong — Open runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17× 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: UnityCardGame.PopulateCardProperty Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:1197— MethodTooLong — PopulateCardProperty runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17× 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: XGraphicsPdfRenderer.DrawString Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:427— MethodTooLong — DrawString runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ImagePrivateDataBitmap.CopyIndexedMemoryBitmap Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:475— MethodTooLong — CopyIndexedMemoryBitmap runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Duplicated block (12 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:48— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:48-59 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:67-78 — 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 (12 lines × 2) Assets/Scripts/Cgs/Decks/DeckEditor.cs:218— Assets/Scripts/Cgs/Decks/DeckEditor.cs:218-229 | Assets/Scripts/Cgs/Decks/DeckEditor.cs:265-276 — 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 `Assets/Scripts/Cgs/Decks/DeckEditor.cs:218` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:1012— Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:1012-1023 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:1048-1059 — 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 (12 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDocumentSettings.cs:53— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDocumentSettings.cs:53-64 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:194-205 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDocumentSettings.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs` as WHOLE FILES: 83% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (12 lines × 2) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:643— Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:643-654 | Assets/Scripts/Cgs/CardGameView/Multiplayer/CgsNetPlayable.cs:686-697 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) Assets/Scripts/Cgs/Play/Drawer/CardDrawer.cs:160— Assets/Scripts/Cgs/Play/Drawer/CardDrawer.cs:160-171 | Assets/Scripts/Cgs/Play/Drawer/CardDrawer.cs:193-204 — 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 `Assets/Scripts/Cgs/Play/Drawer/CardDrawer.cs:160` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:365— Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:365-376 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:392-403 — 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 `Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:365` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:156— Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:156-167 | Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:200-211 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:156` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:212` calls `Last`, `GetPropertyValueString` and `Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:168` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (12 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:713— Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:713-724 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:808-819 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (11 lines × 2) Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:383— Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:383-393 | Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:450-460 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) Assets/Scripts/Cgs/UI/SelectionPanel.cs:131— Assets/Scripts/Cgs/UI/SelectionPanel.cs:131-141 | Assets/Scripts/Cgs/UI/SelectionPanel.cs:160-170 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:309— Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:309-319 | Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:345-355 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:399— Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:399-409 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:541-551 — 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 `Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:399` 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 (11 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfResources.cs:137— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfResources.cs:137-147 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfResources.cs:155-165 — 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `pattern` to `PdfShadingPattern` in one and `PdfTilingPattern` 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 (11 lines × 2) Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:409— Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:409-419 | Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:476-486 — 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 `Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:409` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:265— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:265-275 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:266-276 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:265` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/IImageImporter.cs:220— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:167— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterJpeg.cs:203— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfCustomValues.cs:53— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1354— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1379— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1508— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
Stateful shared instance: ThreadLocalStorage Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/ThreadLocalStorage.cs:41— `ThreadLocalStorage` is not registered, but `PdfDocument` creates it and keeps it in the static `tls`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_importedDocuments; e.g. `_importedDocuments` at line 50).
Stateful shared instance: LzwDecode Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/LzwDecode.cs:38— `LzwDecode` is not registered, but `Filtering` creates it and keeps it in the static `_lzwDecode`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_data, _bytePointer, _nextData, _nextBits, _stringTable, _tableIndex; e.g. `_data` at line 62).
Stateful shared instance: StartupTimelineSession Assets/Scripts/Cgs/Performance/StartupTimelineSession.cs:16— `StartupTimelineSession` is not registered, but `StartupTimeline` creates it and keeps it in the static `Session`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_marks, IsLaunchSummaryWritten, IsPlaySummaryWritten, PlayOutcome, FailedMilestone, FailureReason; e.g. `_marks` at line 86).
Stateful shared instance: ImageQueueService Assets/Scripts/FinolDigital.Cgs.Json.Unity/ImageQueueService.cs:15— `ImageQueueService` keeps one instance of itself in the static `Instance`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_pending, _active; e.g. `_pending` at line 45).
Stateful shared instance: UnityCard Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCard.cs:13— `UnityCard` keeps one instance of itself in the static `Blank`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (_imageFileType, _orientedImageSprite, _imageSprite, IsLoadingImage; e.g. `_imageFileType` at line 22).
Stateful shared instance: UnityCardGame Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:31— `UnityCardGame` keeps one instance of itself in the static `UnityInvalid`, so that one instance serves the whole process and is shared by every thread that reaches it — and it mutates instance state outside any lock (ContentGeneration, _isDownloading, _downloadStatus, DownloadStage, DownloadItemCount, DownloadItemTotal; e.g. `ContentGeneration` at line 92).
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:167— `PrepareImage` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterJpeg.cs:203— `PrepareImage` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfCustomValues.cs:53— `CompressionMode` is a shipped property whose accessors only throw NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1354— `Remove` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1379— `Contains` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Unfinished stub — throws NotImplementedException Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1508— `CopyTo` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
X20 · Mistyped argument guard· Argument guard throws the exception its own condition disproves · ×5
Argument guard throws the exception its own condition disproves Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:134— The guard on line 133 rejects `viewBox` and line 134 reports that rejection as `ArgumentNullException` — but the condition's own test `viewBox.Width < 1` is true of a value that is NOT null: it reads a member of `viewBox`, so it can only be evaluated on a non-null `viewBox` (a null one would throw `NullReferenceException` before the guard decided anything). So a caller whose `viewBox` is present but fails that test is told it was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows this case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` (or `ArgumentOutOfRangeException` for a bound) for what the condition actually tests, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves Assets/Plugins/PdfSharp/Didstopia/Fonts/FontDescriptorCache.cs:102— The guard on line 101 rejects `fontFamilyName` and line 102 reports that rejection as `ArgumentNullException` — but the condition's own test `string.IsNullOrEmpty(fontFamilyName)` is true of a value that is NOT null: it is satisfied by an EMPTY `fontFamilyName`, and on that path `fontFamilyName` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows this case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` (or `ArgumentOutOfRangeException` for a bound) for what the condition actually tests, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves Assets/Plugins/PdfSharp/Didstopia/Fonts/FontResolverInfo.cs:108— The guard on line 107 rejects `faceName` and line 108 reports that rejection as `ArgumentNullException` — but the condition's own test `String.IsNullOrEmpty(faceName)` is true of a value that is NOT null: it is satisfied by an EMPTY `faceName`, and on that path `faceName` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows this case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` (or `ArgumentOutOfRangeException` for a bound) for what the condition actually tests, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1398— The guard on line 1397 rejects `key` and line 1398 reports that rejection as `ArgumentNullException` — but the condition's own test `String.IsNullOrEmpty(key)` is true of a value that is NOT null: it is satisfied by an EMPTY `key`, and on that path `key` was already proven non-null by the very expression that decided it (`||` short-circuits, so the null test to its left had to be false to get here). So a caller who passes a valid empty argument is told a parameter was null. That is not a wording problem: the exception type is the contract. A caller catching `ArgumentNullException` to handle a real null swallows this case with it, and whoever reads the stack trace later is told a failure the source disproves. .NET separates the two on purpose — `ArgumentNullException.ThrowIfNull` and `ArgumentException.ThrowIfNullOrEmpty` are two helpers because they are two failures. Throw `ArgumentException` (or `ArgumentOutOfRangeException` for a bound) for what the condition actually tests, or split the guard and throw each on its own condition.
Argument guard throws the exception its own condition disproves Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfOutlineCollection.cs:246— The guard on line 245 rejects `value` only when `value == null`, and line 246 reports that rejection as `ArgumentOutOfRangeException` — but the condition is a NULL test: no value out of any range reaches the throw, only a missing `value`. So a caller who passes null is told the argument was out of range, and a caller catching `ArgumentNullException` to handle a missing argument never sees this one. Throw `ArgumentNullException` for it — `ArgumentNullException.ThrowIfNull(value)`.
D4 · Code Duplication· Edited copy of a member (12 corresponding lines) · ×4
Edited copy of a member (12 corresponding lines) Assets/Scripts/Cgs/Cards/CardsExplorer.cs:65— Assets/Scripts/Cgs/Cards/CardsExplorer.cs:65-76 | Assets/Scripts/Cgs/Decks/DeckEditor.cs:140-153 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:1154— Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:1154-1167 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XRect.cs:239-250 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardStack.cs:416— Assets/Scripts/Cgs/CardGameView/Multiplayer/CardStack.cs:416-427 | Assets/Scripts/Cgs/CardGameView/Multiplayer/Die.cs:144-155 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (12 corresponding lines) Assets/Scripts/Cgs/Play/PlayController.cs:1098— Assets/Scripts/Cgs/Play/PlayController.cs:1098-1109 | Assets/Scripts/Cgs/Play/PlayController.cs:1127-1139 — 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 (20 corresponding lines) · ×4
Edited copy of a member (20 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.FaxEncode.cs:351— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.FaxEncode.cs:351-370 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.FaxEncode.cs:378-397 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeDescriptor.cs:345— Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeDescriptor.cs:345-367 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeDescriptor.cs:380-399 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:645— Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:645-664 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:676-701 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (20 corresponding lines) Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:249— Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:249-268 | Assets/Scripts/Cgs/Menu/CardGameEditorMenu.cs:329-348 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (14 corresponding lines) · ×4
Edited copy of a member (14 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:146— Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:146-163 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:327-340 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) Assets/Scripts/Cgs/GameContent/GameContentText.cs:23— Assets/Scripts/Cgs/GameContent/GameContentText.cs:23-36 | Assets/Scripts/Cgs/GameContent/GameContentText.cs:39-52 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:557— Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:557-570 | Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:573-586 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (14 corresponding lines) Assets/Scripts/FinolDigital.Cgs.Json.Unity/AuthoredDeckFiles.cs:229— Assets/Scripts/FinolDigital.Cgs.Json.Unity/AuthoredDeckFiles.cs:229-244 | Assets/Scripts/FinolDigital.Cgs.Json.Unity/GameLocalizationCatalogs.cs:146-159 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (7 corresponding lines) · ×4
Edited copy of a member (7 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/CoreGraphicsPath.cs:281— Assets/Plugins/PdfSharp/Didstopia/Drawing/CoreGraphicsPath.cs:281-287 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:1170-1176 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) Assets/Scripts/Cgs/Cards/CardDeletionManager.cs:30— Assets/Scripts/Cgs/Cards/CardDeletionManager.cs:30-36 | Assets/Scripts/Cgs/Cards/CardEditorManager.cs:28-34 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:434— Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:434-441 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:523-529 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (7 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfArray.cs:347— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfArray.cs:347-357 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1184-1190 — 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.
Duplicated block (9 lines × 2) Assets/Scripts/Cgs/GameContent/GameContentText.cs:24— Assets/Scripts/Cgs/GameContent/GameContentText.cs:24-32 | Assets/Scripts/Cgs/GameContent/GameContentText.cs:40-48 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) Assets/Scripts/Cgs/Play/Multiplayer/NetworkDiscovery.cs:245— Assets/Scripts/Cgs/Play/Multiplayer/NetworkDiscovery.cs:245-253 | Assets/Scripts/Cgs/Play/Multiplayer/NetworkDiscovery.cs:270-278 — 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 `Assets/Scripts/Cgs/Play/Multiplayer/NetworkDiscovery.cs:245` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) Assets/Scripts/Cgs/Play/PlayController.cs:508— Assets/Scripts/Cgs/Play/PlayController.cs:508-517 | Assets/Scripts/Cgs/Play/PlayController.cs:544-552 — 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 `Assets/Scripts/Cgs/Play/PlayController.cs:508` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:69— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:69-77 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:66-78 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
ClassTooLong: UnityCardGame Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs— ClassTooLong — 1051 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 651 over it, 2.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.
ClassTooLong: PdfImage Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.FaxEncode.cs— ClassTooLong — 734 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods, declared across 2 files: Pdf_Advanced/PdfImage.FaxEncode.cs (8), Pdf_Advanced/PdfImage.cs (8). The bar is 400 significant lines; this is 334 over it, 1.84× 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: Lexer Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs— ClassTooLong — 414 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 14 over it, 1.04× 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 (27 corresponding lines) · ×3
Edited copy of a member (27 corresponding lines) Assets/Scripts/Cgs/UI/SelectionPanel.cs:130— Assets/Scripts/Cgs/UI/SelectionPanel.cs:130-156 | Assets/Scripts/Cgs/UI/SelectionPanel.cs:159-185 — 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) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:93— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:93-121 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfTrueTypeFont.cs:119-145 — 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) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Streams/InflaterInputStream.cs:208— Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Streams/InflaterInputStream.cs:208-234 | Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Streams/InflaterInputStream.cs:244-271 — 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 (10 corresponding lines) · ×3
Edited copy of a member (10 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/CoreGraphicsPath.cs:219— Assets/Plugins/PdfSharp/Didstopia/Drawing/CoreGraphicsPath.cs:219-228 | Assets/Plugins/PdfSharp/Didstopia/Drawing/CoreGraphicsPath.cs:231-240 — 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) Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:264— Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:264-276 | Assets/Scripts/Cgs/Menu/CardGameEditorMenu.cs:161-170 — 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) Assets/Scripts/Cgs/CardGameView/Multiplayer/Counter.cs:126— Assets/Scripts/Cgs/CardGameView/Multiplayer/Counter.cs:126-135 | Assets/Scripts/Cgs/CardGameView/Multiplayer/Die.cs:198-207 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (22 corresponding lines) · ×3
Edited copy of a member (22 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing_BarCodes/Code2of5Interleaved.cs:92— Assets/Plugins/PdfSharp/Didstopia/Drawing_BarCodes/Code2of5Interleaved.cs:92-113 | Assets/Plugins/PdfSharp/Didstopia/Drawing_BarCodes/Code3of9Standard.cs:215-239 — These two members are one piece of code written twice and then edited apart: 22 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 (22 corresponding lines) Assets/Scripts/Cgs/Play/Drawer/CardDrawer.cs:159— Assets/Scripts/Cgs/Play/Drawer/CardDrawer.cs:159-180 | Assets/Scripts/Cgs/Play/Drawer/CardDrawer.cs:192-213 — These two members are one piece of code written twice and then edited apart: 22 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 (22 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfExtGState.cs:86— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfExtGState.cs:86-107 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfExtGState.cs:114-136 — These two members are one piece of code written twice and then edited apart: 22 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 (16 corresponding lines) · ×3
Edited copy of a member (16 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:47— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:47-62 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:66-81 — These two members are one piece of code written twice and then edited apart: 16 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 (16 corresponding lines) Assets/Scripts/Cgs/Cards/CardDeletionManager.cs:65— Assets/Scripts/Cgs/Cards/CardDeletionManager.cs:65-82 | Assets/Scripts/Cgs/Cards/CardsExplorer.cs:147-162 — These two members are one piece of code written twice and then edited apart: 16 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 (16 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing_BarCodes/Code2of5Interleaved.cs:120— Assets/Plugins/PdfSharp/Didstopia/Drawing_BarCodes/Code2of5Interleaved.cs:120-135 | Assets/Plugins/PdfSharp/Didstopia/Drawing_BarCodes/Code3of9Standard.cs:175-190 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (11 corresponding lines) · ×3
Edited copy of a member (11 corresponding lines) Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:734— Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:734-744 | Assets/Scripts/Cgs/Menu/CardGameEditorMenu.cs:685-700 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs:422— Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs:422-432 | Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs:470-480 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs:694— Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs:694-704 | Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs:723-735 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 6+ corresponding lines) · ×3
Edited copies of one member (3 members, 6+ corresponding lines) Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:137— Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:137-142 | Assets/Scripts/Cgs/Decks/DeckSaveMenu.cs:48-54 | Assets/Scripts/Cgs/Menu/CgsGamesBrowser.cs:50-56 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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.
Edited copies of one member (3 members, 6+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:466— Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:466-472 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:553-558 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfDictionaryWithContentStream.cs:122-127 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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.
Edited copies of one member (3 members, 6+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:497— Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:497-503 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:572-577 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfDictionaryWithContentStream.cs:141-146 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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 (4 corresponding lines) · ×3
Edited copy of a member (4 corresponding lines) Assets/Scripts/FinolDigital.Cgs.Json.Unity/GameLocalizationAssets.cs:171— Assets/Scripts/FinolDigital.Cgs.Json.Unity/GameLocalizationAssets.cs:171-174 | Assets/Scripts/FinolDigital.Cgs.Json.Unity/GameLocalizationCatalogs.cs:162-172 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) Assets/Scripts/Cgs/Cards/CardSelector.cs:26— Assets/Scripts/Cgs/Cards/CardSelector.cs:26-29 | Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:31-34 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (4 corresponding lines) Assets/Scripts/Cgs/Cards/CardSelector.cs:244— Assets/Scripts/Cgs/Cards/CardSelector.cs:244-247 | Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:317-320 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (5 corresponding lines) · ×3
Edited copy of a member (5 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/AnsiEncoding.cs:94— Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/AnsiEncoding.cs:94-99 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/RawEncoding.cs:121-125 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/AnsiEncoding.cs:113— Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/AnsiEncoding.cs:113-117 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/RawEncoding.cs:79-93 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (5 corresponding lines) Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:96— Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:96-100 | Assets/Scripts/Cgs/Menu/Settings.cs:95-100 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (20 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:353— Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:353-372 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:453-472 — 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 `Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:353` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (20 lines × 2) Assets/Scripts/Cgs/Decks/DeckEditor.cs:192— Assets/Scripts/Cgs/Decks/DeckEditor.cs:192-211 | Assets/Scripts/Cgs/Decks/DeckEditor.cs:239-258 — 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 `Assets/Scripts/Cgs/Decks/DeckEditor.cs:192` 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 (20 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Drawing/GeometryHelper.cs:355— Assets/Plugins/PdfSharp/Didstopia/Drawing/GeometryHelper.cs:355-374 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:1065-1084 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (13 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:498— Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:498-510 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:518-530 — 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 `Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:498` 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) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:84— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:84-96 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:85-97 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (13 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:66— Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:66-78 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:111-123 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:559— Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:559-566 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:551-558 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:559` 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 (8 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:994— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:994-1001 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1055-1062 — 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 `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:994` 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 (8 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:543— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:543-550 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:544-551 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (7 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:194— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:194-200 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:195-201 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (7 lines × 2) Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:202— Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:202-208 | Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:222-229 — 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 (7 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/ContentWriter.cs:101— Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/ContentWriter.cs:101-107 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfWriter.cs:441-447 — 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.
Off the main sequence: Unity.UI.Shaders.Sample — Unity.UI.Shaders.Sample: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Off the main sequence: Cgs.Localization — Cgs.Localization: abstractness 0.08, instability 0.00, distance 0.92 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: PdfSharp — PdfSharp: abstractness 0.09, instability 0.00, distance 0.91 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Sync-over-async blocking — 3 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) — these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking Assets/Scripts/Cgs/Editor/Localization/CatalogImporter.cs:242— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
Sync-over-async blocking Assets/Scripts/Cgs/Editor/Localization/CatalogImporter.cs:243— `.GetAwaiter().GetResult()` blocks this thread until the async work completes — it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one).
X5 · Nullable reference types· Symbol treated as nullable, then dereferenced unguarded · ×3
Symbol treated as nullable, then dereferenced unguarded Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1118— This method contradicts itself about `obj`: line 1115 assigns it with `as PdfObject`, which hands back null rather than throwing when the value is not a `PdfObject`, but line 1118 then dereferences it directly as `obj.Reference` with no null test between them and no guard around it. If the `as` is right, that dereference throws NullReferenceException on the input it was written for — and the NullReferenceException names neither the cast nor the type that failed. Settle it one way — test `obj` once before the first use and handle the null case, or cast with `(PdfObject)` so the failure is reported where it happens — rather than leaving the two readings side by side.
Symbol treated as nullable, then dereferenced unguarded Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPages.cs:608— This method contradicts itself about `xref3`: line 607 assigns it with `as PdfReference`, which hands back null rather than throwing when the value is not a `PdfReference`, but line 608 then dereferences it directly as `xref3.Value` with no null test between them and no guard around it. If the `as` is right, that dereference throws NullReferenceException on the input it was written for — and the NullReferenceException names neither the cast nor the type that failed. Settle it one way — test `xref3` once before the first use and handle the null case, or cast with `(PdfReference)` so the failure is reported where it happens — rather than leaving the two readings side by side.
Symbol treated as nullable, then dereferenced unguarded Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfFormXObjectTable.cs:219— This method contradicts itself about `selector`: line 216 assigns it with `as Selector`, which hands back null rather than throwing when the value is not a `Selector`, but line 219 then dereferences it directly as `selector._path` with no null test between them and no guard around it. If the `as` is right, that dereference throws NullReferenceException on the input it was written for — and the NullReferenceException names neither the cast nor the type that failed. Settle it one way — test `selector` once before the first use and handle the null case, or cast with `(Selector)` so the failure is reported where it happens — rather than leaving the two readings side by side.
AC3 · Page structure· Page without a main landmark · ×2
Page without a main landmark firebase/public/404.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark firebase/public/index.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
No assertions: BundledFonts_CoverCatalogsAndEveryNativeName Assets/Tests/EditMode/LocalizationCatalogTests.cs:315— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: GeneratedTables_MatchValidatedCatalogs Assets/Tests/EditMode/LocalizationCatalogTests.cs:321— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) — so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
XGraphicsPdfRenderer.DrawImage (cognitive 16) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:646— XGraphicsPdfRenderer.DrawImage has cognitive complexity 16 (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. This shape REPEATS in the file: one other method here (XGraphicsPdfRenderer.DrawImage) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
XGraphicsPdfRenderer.DrawImage (cognitive 16) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:704— XGraphicsPdfRenderer.DrawImage has cognitive complexity 16 (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. This shape REPEATS in the file: one other method here (XGraphicsPdfRenderer.DrawImage) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
D4 · Code Duplication· Edited copy of a member (28 corresponding lines) · ×2
Edited copy of a member (28 corresponding lines) Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:132— Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:132-159 | Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:162-189 — These two members are one piece of code written twice and then edited apart: 28 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 (28 corresponding lines) Assets/Scripts/Cgs/Editor/Localization/AuthoredUiBinder.cs:68— Assets/Scripts/Cgs/Editor/Localization/AuthoredUiBinder.cs:68-95 | Assets/Scripts/Cgs/Editor/Localization/AuthoredUiBinder.cs:117-170 — These two members are one piece of code written twice and then edited apart: 28 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 (23 corresponding lines) · ×2
Edited copy of a member (23 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:636— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:636-658 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:682-708 — These two members are one piece of code written twice and then edited apart: 23 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 (23 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:187— Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:187-209 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:229-251 — These two members are one piece of code written twice and then edited apart: 23 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) · ×2
Edited copy of a member (24 corresponding lines) Assets/Scripts/Cgs/Menu/CgsGamesBrowser.cs:67— Assets/Scripts/Cgs/Menu/CgsGamesBrowser.cs:67-90 | Assets/Scripts/Cgs/Play/MoveMenu.cs:94-121 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (24 corresponding lines) Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:104— Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:104-127 | Assets/Scripts/Cgs/Menu/GamesManagementMenu.cs:101-124 — 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 copy of a member (15 corresponding lines) · ×2
Edited copy of a member (15 corresponding lines) Assets/Scripts/Cgs/Decks/DeckEditor.cs:285— Assets/Scripts/Cgs/Decks/DeckEditor.cs:285-299 | Assets/Scripts/Cgs/Decks/DeckEditor.cs:302-316 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (15 corresponding lines) Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:275— Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:275-289 | Assets/Scripts/Cgs/Menu/CardGameEditorMenu.cs:354-368 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 14+ corresponding lines) · ×2
Edited copies of one member (3 members, 14+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/FontFamilyCache.cs:122— Assets/Plugins/PdfSharp/Didstopia/Drawing/FontFamilyCache.cs:122-135 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/GlyphTypefaceCache.cs:96-109 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontfaceCache.cs:122-135 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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.
Edited copies of one member (3 members, 14+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:660— Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:660-673 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:679-694 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:757-770 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (21 corresponding lines) · ×2
Edited copy of a member (21 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfChoiceField.cs:58— Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfChoiceField.cs:58-97 | Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfChoiceField.cs:103-123 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (21 corresponding lines) Assets/Scripts/Cgs/Cards/SetImportMenu.cs:127— Assets/Scripts/Cgs/Cards/SetImportMenu.cs:127-147 | Assets/Scripts/Cgs/Menu/CardGameEditorMenu.cs:637-657 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (17 corresponding lines) · ×2
Edited copy of a member (17 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfExtGStateTable.cs:51— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfExtGStateTable.cs:51-67 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfExtGStateTable.cs:73-90 — 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) Assets/Scripts/Cgs/CardGameView/Viewer/PlayableViewer.cs:536— Assets/Scripts/Cgs/CardGameView/Viewer/PlayableViewer.cs:536-552 | Assets/Scripts/Cgs/CardGameView/Viewer/PlayableViewer.cs:679-695 — 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 (13 corresponding lines) · ×2
Edited copy of a member (13 corresponding lines) Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:314— Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:314-326 | Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:330-343 — 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) Assets/Scripts/Cgs/CardGameManager.cs:90— Assets/Scripts/Cgs/CardGameManager.cs:90-104 | Assets/Scripts/Cgs/CardGameManager.cs:124-136 — 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 copies of one member (3 members, 9+ corresponding lines) · ×2
Edited copies of one member (3 members, 9+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:1194— Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:1194-1204 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XRect.cs:277-285 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XSize.cs:258-267 — 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.
Edited copies of one member (3 members, 9+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/FontFamilyCache.cs:63— Assets/Plugins/PdfSharp/Didstopia/Drawing/FontFamilyCache.cs:63-72 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/GlyphTypefaceCache.cs:50-58 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontfaceCache.cs:55-63 — 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 (6 corresponding lines) · ×2
Edited copy of a member (6 corresponding lines) Assets/Scripts/FinolDigital.Cgs.Json.Unity/GameLocalizationAssets.cs:34— Assets/Scripts/FinolDigital.Cgs.Json.Unity/GameLocalizationAssets.cs:34-39 | Assets/Scripts/FinolDigital.Cgs.Json.Unity/GameLocalizationCatalogs.cs:25-31 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (6 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:179— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:179-184 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:180-185 — 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 (21 lines × 2) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:623— Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:623-643 | Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:724-744 — 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 `Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:623` 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 (21 lines × 2) Assets/Scripts/Cgs/Cards/CardSelector.cs:178— Assets/Scripts/Cgs/Cards/CardSelector.cs:178-198 | Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:293-313 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (16 lines × 2) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:398— Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:398-413 | Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:460-475 — 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 `Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:398` 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 (16 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:334— Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:334-349 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:471-486 — 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 `Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:334` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:155— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:155-171 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:156-172 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (17 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Drawing/XColor.cs:470— Assets/Plugins/PdfSharp/Didstopia/Drawing/XColor.cs:470-486 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XColor.cs:510-526 — 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 (14 lines × 2) Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs:356— Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs:356-369 | Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs:962-975 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs:354` calls `Record` and `Assets/Scripts/Cgs/Play/Multiplayer/CgsNetPlayer.cs:960` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (14 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Drawing/GeometryHelper.cs:303— Assets/Plugins/PdfSharp/Didstopia/Drawing/GeometryHelper.cs:303-316 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:1013-1026 — 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 (15 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:146— Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:146-160 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:175-192 — 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 `Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:146` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (15 lines × 2) Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:330— Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:330-344 | Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:348-362 — 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 `Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:330` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9–10 lines × 2) Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:367— Assets/Scripts/Cgs/Cards/CardEditorMenu.cs:367-375 | Assets/Scripts/Cgs/Cards/SetImportMenu.cs:218-227 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9–10 lines × 2) Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:171— Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:171-179 | Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:182-191 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) Assets/Scripts/Cgs/CardGameView/Viewer/StackViewer.cs:159— Assets/Scripts/Cgs/CardGameView/Viewer/StackViewer.cs:159-164 | Assets/Scripts/Cgs/CardGameView/Viewer/StackViewer.cs:179-184 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Drawing/CoreGraphicsPath.cs:222— Assets/Plugins/PdfSharp/Didstopia/Drawing/CoreGraphicsPath.cs:222-227 | Assets/Plugins/PdfSharp/Didstopia/Drawing/CoreGraphicsPath.cs:234-239 — 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.
IC1 · Incompleteness & stubs· Both branches open with the same statements · ×2
Both branches open with the same statements — the condition does not decide them Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:246— The first 2 statements of the `if` and of the `else` are identical, so they run on both paths regardless of the condition. Lift them above the `if` — leaving them duplicated inside makes the branches read as though they handled this differently.
Both branches open with the same statements — the condition does not decide them Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:448— The first 4 statements of the `if` and of the `else` are identical, so they run on both paths regardless of the condition. Lift them above the `if` — leaving them duplicated inside makes the branches read as though they handled this differently.
IC1 · Incompleteness & stubs· Bound check compiled out of the shipping build · ×2
Bound check compiled out of the shipping build Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontWriter.cs:52— The only thing establishing that `tag` is long enough before it is indexed is a `Debug.Assert`, which is `[Conditional("DEBUG")]` — the compiler deletes the call from Release, so the build your users install indexes `tag` with no length check at all and throws at the indexer instead of failing diagnosably. `tag` comes from outside this method, so its length is a contract, not something this code can see. Bound it with a check that ships (`if (tag.Count < n) throw …`, or `ArgumentOutOfRangeException.ThrowIfLessThan`), and keep the assert for the invariant you believe holds.
Bound check compiled out of the shipping build Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfOutline.cs:513— The only thing establishing that `_outlines` is long enough before it is indexed is a `Debug.Assert`, which is `[Conditional("DEBUG")]` — the compiler deletes the call from Release, so the build your users install indexes `_outlines` with no length check at all and throws at the indexer instead of failing diagnosably. `_outlines` comes from outside this method, so its length is a contract, not something this code can see. Bound it with a check that ships (`if (_outlines.Count < n) throw …`, or `ArgumentOutOfRangeException.ThrowIfLessThan`), and keep the assert for the invariant you believe holds.
Sync-over-async (deadlock risk) Assets/Scripts/Cgs/Editor/Localization/CatalogImporter.cs:242— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process.
Sync-over-async (deadlock risk) Assets/Scripts/Cgs/Editor/Localization/CatalogImporter.cs:243— Blocking on a Task with `.Wait()`/`.GetAwaiter().GetResult()` can deadlock (and wastes a thread). Prefer awaiting it: make the caller `async` and `await` instead. Where a synchronous entry point must stay — a public sync API you cannot break, or a process entry point that must not return until the work finishes — the block belongs in ONE documented bridge and never inside code that is already async; and where it already is that bridge, give the wait a TIMEOUT so a hung task fails the call instead of hanging the process.
Swallowed exception (caught, then discarded) Assets/Scripts/Cgs/Play/Multiplayer/NetworkDiscovery.cs:116— `catch (ObjectDisposedException)` does nothing with the exception it caught — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch. Log it through whatever this codebase already uses to report problems, or let it propagate; if one specific failure genuinely cannot matter, catch exactly that exception type and say why in a comment on the catch.
Swallowed exception (caught, then discarded) Assets/Scripts/UnityExtensionMethods/UnityFileMethods.cs:656— `ContinueWith` with a continuation that does nothing discards the antecedent's failure — the task it returns completes successfully whether or not the work faulted, so the failure vanishes with no log and no rethrow. Await the task and handle the exception, or report the fault from the continuation (`t.Exception`).
AC1 · Text alternatives· <canvas> without a text alternative · ×1
<canvas> without a text alternative firebase/public/index.html:13— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
AC3 · Page structure· Heading level jumps from h1 to h3 · ×1
Heading level jumps from h1 to h3 firebase/public/404.html:29— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
PdfImage.ReadIndexedMemoryBitmap (cyclomatic 81) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:945— PdfImage.ReadIndexedMemoryBitmap has cyclomatic complexity 81 (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.
UnityCardGame.Download (cyclomatic 58) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:377— UnityCardGame.Download has cyclomatic complexity 58 (threshold 15). Of this number, 57 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.
UnityCardGame.LoadCardFromJToken (cyclomatic 55) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:924— UnityCardGame.LoadCardFromJToken has cyclomatic complexity 55 (threshold 15). Of this number, 54 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.
ImagePrivateDataBitmap.CopyIndexedMemoryBitmap (cyclomatic 48) Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:475— ImagePrivateDataBitmap.CopyIndexedMemoryBitmap has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
UnityCardGame.PopulateCardProperty (cyclomatic 44) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:1197— UnityCardGame.PopulateCardProperty has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CLexer.ScanLiteralString (cyclomatic 39) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:330— CLexer.ScanLiteralString has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
UnityDeck.LoadTxt (cyclomatic 38) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityDeck.cs:239— UnityDeck.LoadTxt has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Lexer.ScanLiteralString (cyclomatic 33) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:373— Lexer.ScanLiteralString has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PdfImage.ReadTrueColorMemoryBitmap (cyclomatic 32) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:741— PdfImage.ReadTrueColorMemoryBitmap has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PlayableViewer.Redisplay (cyclomatic 32) Assets/Scripts/Cgs/CardGameView/Viewer/PlayableViewer.cs:210— PlayableViewer.Redisplay has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
PlayController.ResetPlayArea (cyclomatic 32) Assets/Scripts/Cgs/Play/PlayController.cs:318— PlayController.ResetPlayArea has cyclomatic complexity 32 (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.
CardModel.UpdatePosition (cyclomatic 30) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:626— CardModel.UpdatePosition has cyclomatic complexity 30 (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.
CardViewer.Update (cyclomatic 30) Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:284— CardViewer.Update 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.
PdfGraphicsState.RealizePen (cyclomatic 29) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/PdfGraphicsState.cs:101— PdfGraphicsState.RealizePen has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PdfReader.Open (cyclomatic 29) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:278— PdfReader.Open has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
UnityFileMethods.SaveUrlToFile (cyclomatic 29) Assets/Scripts/UnityExtensionMethods/UnityFileMethods.cs:266— UnityFileMethods.SaveUrlToFile has cyclomatic complexity 29 (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.
PdfPages.InsertRange (cyclomatic 27) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPages.cs:207— PdfPages.InsertRange 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.
Ascii85Decode.Decode (cyclomatic 27) Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:137— Ascii85Decode.Decode 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.
CardModel.PostDragPlayable (cyclomatic 27) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:493— CardModel.PostDragPlayable 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.
GeometryHelper.BezierCurveFromArc (cyclomatic 26) Assets/Plugins/PdfSharp/Didstopia/Drawing/GeometryHelper.cs:221— GeometryHelper.BezierCurveFromArc has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
XGraphicsPdfRenderer.AppendPartialArc (cyclomatic 26) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:934— XGraphicsPdfRenderer.AppendPartialArc has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DeflaterEngine.DeflateSlow (cyclomatic 26) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterEngine.cs:723— DeflaterEngine.DeflateSlow has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Inflater.Decode (cyclomatic 26) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Inflater.cs:460— Inflater.Decode has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PieceGraphicRaycaster.Raycast (cyclomatic 26) Assets/Scripts/Cgs/CardGameView/PieceGraphicRaycaster.cs:19— PieceGraphicRaycaster.Raycast has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
GameContentNetwork.ReceiveHost (cyclomatic 26) Assets/Scripts/Cgs/Play/Multiplayer/GameContentNetwork.cs:291— GameContentNetwork.ReceiveHost has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
AuthoredUiBinder.Bind (cyclomatic 26) Assets/Scripts/Cgs/Editor/Localization/AuthoredUiBinder.cs:187— AuthoredUiBinder.Bind has cyclomatic 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, 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.
XGraphicsPdfRenderer.DrawString (cyclomatic 25) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:427— XGraphicsPdfRenderer.DrawString has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PdfCheckBoxField.Checked.set (cyclomatic 25) Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfCheckBoxField.cs:227— PdfCheckBoxField.Checked.set has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Parser.ReadObject (cyclomatic 25) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:110— Parser.ReadObject has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PdfEncoders.FormatStringLiteral (cyclomatic 24) Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/PdfEncoders.cs:307— PdfEncoders.FormatStringLiteral has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
LocalizationCache.Publish (cyclomatic 24) Assets/Scripts/FinolDigital.Cgs.Json.Unity/LocalizationCache.cs:141— LocalizationCache.Publish has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
UnityCardGame.FilterCards (cyclomatic 24) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:1605— UnityCardGame.FilterCards has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DictionaryElements.GetValue (cyclomatic 23) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:814— DictionaryElements.GetValue 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.
CatalogImporter.ValidateGenerated (cyclomatic 23) Assets/Scripts/Cgs/Editor/Localization/CatalogImporter.cs:97— CatalogImporter.ValidateGenerated 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.
FontCatalogBuilder.ValidateGlyphs (cyclomatic 23) Assets/Scripts/Cgs/Editor/Localization/FontCatalogBuilder.cs:103— FontCatalogBuilder.ValidateGlyphs has cyclomatic complexity 23 (threshold 15). Of this number, 22 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.
InflaterDynHeader.Decode (cyclomatic 22) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/InflaterDynHeader.cs:74— InflaterDynHeader.Decode 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.
CardGameEditorMenu.CreateGame (cyclomatic 22) Assets/Scripts/Cgs/Menu/CardGameEditorMenu.cs:552— CardGameEditorMenu.CreateGame 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.
UnityCardGame.ReadProperties (cyclomatic 22) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:239— UnityCardGame.ReadProperties has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
NameTable.Read (cyclomatic 21) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:678— NameTable.Read has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Parser.ParseObject (cyclomatic 21) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:419— Parser.ParseObject has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
CardSelector.Select (cyclomatic 21) Assets/Scripts/Cgs/Cards/CardSelector.cs:158— CardSelector.Select has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ProgressBar.Update (cyclomatic 21) Assets/Scripts/Cgs/Menu/ProgressBar.cs:25— ProgressBar.Update has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
OpenTypeFontface.Read (cyclomatic 20) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontface.cs:294— OpenTypeFontface.Read has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
DeflaterEngine.FindLongestMatch (cyclomatic 20) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterEngine.cs:495— DeflaterEngine.FindLongestMatch has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Tree.BuildTree (cyclomatic 20) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:237— Tree.BuildTree has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
PlayableViewer.RedisplayDie (cyclomatic 20) Assets/Scripts/Cgs/CardGameView/Viewer/PlayableViewer.cs:251— PlayableViewer.RedisplayDie has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (PlayableViewer.RedisplayCounter) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
PlayableViewer.RedisplayCounter (cyclomatic 20) Assets/Scripts/Cgs/CardGameView/Viewer/PlayableViewer.cs:277— PlayableViewer.RedisplayCounter has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (PlayableViewer.RedisplayDie) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
CardSearchMenu.AddPropertyPanel (cyclomatic 20) Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:147— CardSearchMenu.AddPropertyPanel has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
FloatingTextKeyboard.LateUpdate (cyclomatic 20) Assets/Scripts/Cgs/UI/FloatingTextKeyboard.cs:43— FloatingTextKeyboard.LateUpdate has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
UnityCardGame.Load (cyclomatic 20) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:608— UnityCardGame.Load has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ImageImporterBmp.TestBitmapInfoHeader (cyclomatic 19) Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:84— ImageImporterBmp.TestBitmapInfoHeader has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DeflaterEngine.DeflateFast (cyclomatic 19) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterEngine.cs:633— DeflaterEngine.DeflateFast has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CardModel.UpdateCardZonePosition (cyclomatic 19) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:695— CardModel.UpdateCardZonePosition has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
DeckCardSelector.SelectResults (cyclomatic 19) Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:261— DeckCardSelector.SelectResults has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Modal.FocusToggle (cyclomatic 19) Assets/Scripts/Cgs/Menu/Modal.cs:62— Modal.FocusToggle has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CardScrollArea.Update (cyclomatic 19) Assets/Scripts/Cgs/UI/ScrollRects/CardScrollArea.cs:37— CardScrollArea.Update 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.
UnityCardGame.PopulateCardSets (cyclomatic 19) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:1393— UnityCardGame.PopulateCardSets has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CustomSlider.OnMove (cyclomatic 19) Assets/Shaders and Materials/Shader Graph/17.0.4/UGUI Shaders/Scripts/Runtime/CustomSlider.cs:203— CustomSlider.OnMove has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PdfObject.FixUpObject (cyclomatic 18) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfObject.cs:418— PdfObject.FixUpObject 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.
PdfReferenceTable_old.TransitiveClosureImplementation (cyclomatic 18) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:426— PdfReferenceTable_old.TransitiveClosureImplementation 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.
PdfCrossReferenceTable.TransitiveClosureImplementation (cyclomatic 18) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:427— PdfCrossReferenceTable.TransitiveClosureImplementation 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.
CardModel.OnChangeId (cyclomatic 18) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:862— CardModel.OnChangeId has cyclomatic 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: 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.
CardDrawer.RefreshCardStackDropdown (cyclomatic 18) Assets/Scripts/Cgs/Play/Drawer/CardDrawer.cs:222— CardDrawer.RefreshCardStackDropdown 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.
BuildCgs.BuildWithOptions (cyclomatic 18) Assets/Scripts/Cgs/Editor/BuildCgs.cs:59— BuildCgs.BuildWithOptions 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.
GameLocalizationAssets.Refresh (cyclomatic 18) Assets/Scripts/FinolDigital.Cgs.Json.Unity/GameLocalizationAssets.cs:68— GameLocalizationAssets.Refresh 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.
UnityCardGame.LoadAsyncImpl (cyclomatic 18) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:704— UnityCardGame.LoadAsyncImpl has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ImagePrivateDataBitmap.CopyTrueColorMemoryBitmap (cyclomatic 17) Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:395— ImagePrivateDataBitmap.CopyTrueColorMemoryBitmap 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.
XGraphicsPdfRenderer.BeginPage (cyclomatic 17) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:1611— XGraphicsPdfRenderer.BeginPage 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.
PdfOutline.PrepareForSave (cyclomatic 17) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfOutline.cs:503— PdfOutline.PrepareForSave 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.
Lexer.ScanNextToken (cyclomatic 17) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:87— Lexer.ScanNextToken has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
Deflater.Deflate (cyclomatic 17) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Deflater.cs:421— Deflater.Deflate 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.
Inflater.DecodeHuffman (cyclomatic 17) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Inflater.cs:314— Inflater.DecodeHuffman 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.
CardViewer.Redisplay (cyclomatic 17) Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:594— CardViewer.Redisplay has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
MainMenu.Update (cyclomatic 17) Assets/Scripts/Cgs/Menu/MainMenu.cs:132— MainMenu.Update 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.
BenchmarkOptions.Parse (cyclomatic 17) Assets/Scripts/Cgs/Performance/BenchmarkOptions.cs:40— BenchmarkOptions.Parse 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.
RotateZoomableScrollRect.Update (cyclomatic 17) Assets/Scripts/Cgs/UI/ScrollRects/RotateZoomableScrollRect.cs:179— RotateZoomableScrollRect.Update 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.
LocalizationFiles.ReadDefinitionOrigin (cyclomatic 17) Assets/Scripts/FinolDigital.Cgs.Json.Unity/LocalizationFiles.cs:132— LocalizationFiles.ReadDefinitionOrigin 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.
MatrixHelper.MultiplyMatrix (cyclomatic 16) Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:1378— MatrixHelper.MultiplyMatrix 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.
Dialog.LateUpdate (cyclomatic 16) Assets/Scripts/Cgs/Menu/Dialog.cs:86— Dialog.LateUpdate has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
GameContentNetwork.Update (cyclomatic 16) Assets/Scripts/Cgs/Play/Multiplayer/GameContentNetwork.cs:196— GameContentNetwork.Update has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
PlayController.CreateCardStack (cyclomatic 16) Assets/Scripts/Cgs/Play/PlayController.cs:612— PlayController.CreateCardStack 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.
PlayMatRotationZoomController.Update (cyclomatic 16) Assets/Scripts/Cgs/Play/PlayMatRotationZoomController.cs:59— PlayMatRotationZoomController.Update has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ScrollRectAutoScroll.LateUpdate (cyclomatic 16) Assets/Scripts/Cgs/UI/ScrollRects/ScrollRectAutoScroll.cs:29— ScrollRectAutoScroll.LateUpdate has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
AuthoredUiBinder.ValidateAsset (cyclomatic 16) Assets/Scripts/Cgs/Editor/Localization/AuthoredUiBinder.cs:116— AuthoredUiBinder.ValidateAsset has cyclomatic complexity 16 (threshold 15). Of this number, 15 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.
LocalizationCache.Read (cyclomatic 16) Assets/Scripts/FinolDigital.Cgs.Json.Unity/LocalizationCache.cs:98— LocalizationCache.Read has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
PdfImage.ReadIndexedMemoryBitmap (cognitive 158) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:945— PdfImage.ReadIndexedMemoryBitmap has cognitive complexity 158 (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.
PdfCheckBoxField.Checked.set (cognitive 114) Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfCheckBoxField.cs:227— PdfCheckBoxField.Checked.set has cognitive complexity 114 (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.
UnityCardGame.LoadCardFromJToken (cognitive 100) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:924— UnityCardGame.LoadCardFromJToken has cognitive complexity 100 (threshold 15). Of this number, 98 points are the body's own statements and 2 belong 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.
UnityCardGame.Download (cognitive 95) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:377— UnityCardGame.Download has cognitive complexity 95 (threshold 15). Of this number, 94 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.
UnityCardGame.PopulateCardProperty (cognitive 94) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:1197— UnityCardGame.PopulateCardProperty has cognitive complexity 94 (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.
ImagePrivateDataBitmap.CopyIndexedMemoryBitmap (cognitive 75) Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:475— ImagePrivateDataBitmap.CopyIndexedMemoryBitmap has cognitive complexity 75 (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.
PdfPages.InsertRange (cognitive 74) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPages.cs:207— PdfPages.InsertRange has cognitive complexity 74 (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.
CLexer.ScanLiteralString (cognitive 70) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:330— CLexer.ScanLiteralString has cognitive complexity 70 (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.
PdfReader.Open (cognitive 70) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfReader.cs:278— PdfReader.Open has cognitive complexity 70 (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.
PdfImage.ReadTrueColorMemoryBitmap (cognitive 69) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.cs:741— PdfImage.ReadTrueColorMemoryBitmap has cognitive complexity 69 (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.
DictionaryElements.GetValue (cognitive 58) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:814— DictionaryElements.GetValue has cognitive complexity 58 (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.
Lexer.ScanLiteralString (cognitive 55) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:373— Lexer.ScanLiteralString has cognitive complexity 55 (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.
PdfEncoders.FormatStringLiteral (cognitive 53) Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/PdfEncoders.cs:307— PdfEncoders.FormatStringLiteral has cognitive complexity 53 (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.
NameTable.Read (cognitive 52) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:678— NameTable.Read has cognitive complexity 52 (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.
AuthoredUiBinder.Bind (cognitive 52) Assets/Scripts/Cgs/Editor/Localization/AuthoredUiBinder.cs:187— AuthoredUiBinder.Bind has cognitive complexity 52 (threshold 15). Of this number, 51 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.
InflaterDynHeader.Decode (cognitive 49) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/InflaterDynHeader.cs:74— InflaterDynHeader.Decode 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.
UnityDeck.LoadTxt (cognitive 48) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityDeck.cs:239— UnityDeck.LoadTxt has cognitive complexity 48 (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.
PdfReferenceTable_old.TransitiveClosureImplementation (cognitive 46) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:426— PdfReferenceTable_old.TransitiveClosureImplementation has cognitive complexity 46 (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.
PdfCrossReferenceTable.TransitiveClosureImplementation (cognitive 46) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:427— PdfCrossReferenceTable.TransitiveClosureImplementation has cognitive complexity 46 (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.
UnityCardGame.FilterCards (cognitive 45) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:1605— UnityCardGame.FilterCards has cognitive complexity 45 (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.
DeflaterEngine.DeflateSlow (cognitive 44) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterEngine.cs:723— DeflaterEngine.DeflateSlow has cognitive complexity 44 (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.
PdfObject.FixUpObject (cognitive 43) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfObject.cs:418— PdfObject.FixUpObject has cognitive complexity 43 (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.
ImagePrivateDataBitmap.CopyTrueColorMemoryBitmap (cognitive 42) Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:395— ImagePrivateDataBitmap.CopyTrueColorMemoryBitmap has cognitive complexity 42 (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.
CardViewer.Update (cognitive 42) Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:284— CardViewer.Update 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.
PlayController.ResetPlayArea (cognitive 42) Assets/Scripts/Cgs/Play/PlayController.cs:318— PlayController.ResetPlayArea 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.
Inflater.DecodeHuffman (cognitive 41) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Inflater.cs:314— Inflater.DecodeHuffman 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.
UnityCardGame.PopulateCardSets (cognitive 40) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:1393— UnityCardGame.PopulateCardSets 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.
PdfGraphicsState.RealizePen (cognitive 39) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/PdfGraphicsState.cs:101— PdfGraphicsState.RealizePen has cognitive complexity 39 (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.
CardGameEditorMenu.CreateGame (cognitive 38) Assets/Scripts/Cgs/Menu/CardGameEditorMenu.cs:552— CardGameEditorMenu.CreateGame has cognitive complexity 38 (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.
GeometryHelper.BezierCurveFromArc (cognitive 37) Assets/Plugins/PdfSharp/Didstopia/Drawing/GeometryHelper.cs:221— GeometryHelper.BezierCurveFromArc has cognitive complexity 37 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
XGraphicsPdfRenderer.AppendPartialArc (cognitive 37) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:934— XGraphicsPdfRenderer.AppendPartialArc has cognitive complexity 37 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Ascii85Decode.Decode (cognitive 37) Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:137— Ascii85Decode.Decode has cognitive complexity 37 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Modal.FocusToggle (cognitive 34) Assets/Scripts/Cgs/Menu/Modal.cs:62— Modal.FocusToggle 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.
PdfOutline.PrepareForSave (cognitive 33) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfOutline.cs:503— PdfOutline.PrepareForSave 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.
Deflater.Deflate (cognitive 33) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Deflater.cs:421— Deflater.Deflate 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.
ImageImporterBmp.TestBitmapInfoHeader (cognitive 32) Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterBmp.cs:84— ImageImporterBmp.TestBitmapInfoHeader 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.
PieceGraphicRaycaster.Raycast (cognitive 32) Assets/Scripts/Cgs/CardGameView/PieceGraphicRaycaster.cs:19— PieceGraphicRaycaster.Raycast has cognitive complexity 32 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
UnityFileMethods.SaveUrlToFile (cognitive 32) Assets/Scripts/UnityExtensionMethods/UnityFileMethods.cs:266— UnityFileMethods.SaveUrlToFile has cognitive complexity 32 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
DeflaterEngine.DeflateFast (cognitive 31) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterEngine.cs:633— DeflaterEngine.DeflateFast 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.
Tree.BuildTree (cognitive 31) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:237— Tree.BuildTree has cognitive complexity 31 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
CardDrawer.RefreshCardStackDropdown (cognitive 31) Assets/Scripts/Cgs/Play/Drawer/CardDrawer.cs:222— CardDrawer.RefreshCardStackDropdown 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.
PlayController.LoadDeck (cognitive 31) Assets/Scripts/Cgs/Play/PlayController.cs:483— PlayController.LoadDeck 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.
FontCatalogBuilder.ValidateGlyphs (cognitive 31) Assets/Scripts/Cgs/Editor/Localization/FontCatalogBuilder.cs:103— FontCatalogBuilder.ValidateGlyphs has cognitive complexity 31 (threshold 15). Of this number, 30 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.
CustomSlider.OnMove (cognitive 31) Assets/Shaders and Materials/Shader Graph/17.0.4/UGUI Shaders/Scripts/Runtime/CustomSlider.cs:203— CustomSlider.OnMove 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.
XGraphicsPdfRenderer.DrawString (cognitive 30) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:427— XGraphicsPdfRenderer.DrawString 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.
Parser.ReadXRefTableAndTrailer (cognitive 28) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:1052— Parser.ReadXRefTableAndTrailer 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.
CardModel.UpdatePosition (cognitive 28) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:626— CardModel.UpdatePosition has cognitive complexity 28 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
CLexer.ScanNumber (cognitive 26) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:245— CLexer.ScanNumber has cognitive complexity 26 (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.
Parser.ReadObject (cognitive 26) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:110— Parser.ReadObject has cognitive complexity 26 (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.
CardModel.PostDragPlayable (cognitive 26) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:493— CardModel.PostDragPlayable 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.
FlowLayoutGroup.SetCellsAlongAxis (cognitive 26) Assets/Scripts/Cgs/UI/FlowLayoutGroup.cs:105— FlowLayoutGroup.SetCellsAlongAxis has cognitive complexity 26 (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.
PdfPage.InheritValues (cognitive 25) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:635— PdfPage.InheritValues has cognitive complexity 25 (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.
PlayableViewer.Redisplay (cognitive 25) Assets/Scripts/Cgs/CardGameView/Viewer/PlayableViewer.cs:210— PlayableViewer.Redisplay has cognitive complexity 25 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
CardSelector.Select (cognitive 25) Assets/Scripts/Cgs/Cards/CardSelector.cs:158— CardSelector.Select 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.
AuthoredUiBinder.ValidateAsset (cognitive 25) Assets/Scripts/Cgs/Editor/Localization/AuthoredUiBinder.cs:116— AuthoredUiBinder.ValidateAsset has cognitive complexity 25 (threshold 15). Of this number, 24 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.
GameLocalizationAssets.Refresh (cognitive 25) Assets/Scripts/FinolDigital.Cgs.Json.Unity/GameLocalizationAssets.cs:68— GameLocalizationAssets.Refresh 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.
LocalizationFiles.ReadDefinitionOrigin (cognitive 25) Assets/Scripts/FinolDigital.Cgs.Json.Unity/LocalizationFiles.cs:132— LocalizationFiles.ReadDefinitionOrigin 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.
UnityCardGame.Load (cognitive 25) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:608— UnityCardGame.Load has cognitive complexity 25 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
PdfImage.FaxEncode2DRow (cognitive 23) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfImage.FaxEncode.cs:447— PdfImage.FaxEncode2DRow 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.
Parser.ParseDateTime (cognitive 23) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:1300— Parser.ParseDateTime 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.
Inflater.Decode (cognitive 23) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Inflater.cs:460— Inflater.Decode has cognitive complexity 23 (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.
CardModel.SnapToGrid (cognitive 23) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:573— CardModel.SnapToGrid 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.
CardStack.OnCardsUpdated (cognitive 23) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardStack.cs:519— CardStack.OnCardsUpdated 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.
CgsNetDiagnostics.Update (cognitive 23) Assets/Scripts/Cgs/Play/Multiplayer/CgsNetDiagnostics.cs:84— CgsNetDiagnostics.Update 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.
XTextFormatter.CreateLayout (cognitive 22) Assets/Plugins/PdfSharp/Didstopia/Drawing_Layout/XTextFormatter.cs:226— XTextFormatter.CreateLayout 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.
BuildCgs.BuildWithOptions (cognitive 22) Assets/Scripts/Cgs/Editor/BuildCgs.cs:59— BuildCgs.BuildWithOptions 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.
CatalogImporter.ValidateGenerated (cognitive 22) Assets/Scripts/Cgs/Editor/Localization/CatalogImporter.cs:97— CatalogImporter.ValidateGenerated 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.
UnityCardGame.ReadProperties (cognitive 22) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:239— UnityCardGame.ReadProperties has cognitive complexity 22 (threshold 15). Of this number, 21 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.
UnityCardGame.LoadAsyncImpl (cognitive 22) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:704— UnityCardGame.LoadAsyncImpl has cognitive complexity 22 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
FontFactory.ResolveTypeface (cognitive 21) Assets/Plugins/PdfSharp/Didstopia/Fonts/FontFactory.cs:74— FontFactory.ResolveTypeface has cognitive complexity 21 (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.
OpenTypeDescriptor.Initialize (cognitive 21) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeDescriptor.cs:110— OpenTypeDescriptor.Initialize has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PdfOutline.Initialize (cognitive 21) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfOutline.cs:326— PdfOutline.Initialize has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PdfPage.Contents.get (cognitive 21) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:331— PdfPage.Contents.get has cognitive complexity 21 (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.
Tree.WriteTree (cognitive 21) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:453— Tree.WriteTree has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Tree.BuildLength (cognitive 21) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:517— Tree.BuildLength has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InflaterHuffmanTree.BuildTree (cognitive 21) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/InflaterHuffmanTree.cs:111— InflaterHuffmanTree.BuildTree has cognitive complexity 21 (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.
DeckEditor.ConsolidateVertical (cognitive 21) Assets/Scripts/Cgs/Decks/DeckEditor.cs:190— DeckEditor.ConsolidateVertical has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DeckEditor.ConsolidateHorizontal) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
DeckEditor.ConsolidateHorizontal (cognitive 21) Assets/Scripts/Cgs/Decks/DeckEditor.cs:237— DeckEditor.ConsolidateHorizontal has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DeckEditor.ConsolidateVertical) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
BenchmarkOptions.Parse (cognitive 21) Assets/Scripts/Cgs/Performance/BenchmarkOptions.cs:40— BenchmarkOptions.Parse has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GameLocalizationCatalogs.Refresh (cognitive 21) Assets/Scripts/FinolDigital.Cgs.Json.Unity/GameLocalizationCatalogs.cs:90— GameLocalizationCatalogs.Refresh has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MatrixHelper.TransformRect (cognitive 20) Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:1470— MatrixHelper.TransformRect has cognitive complexity 20 (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.
XTextFormatter.CreateBlocks (cognitive 20) Assets/Plugins/PdfSharp/Didstopia/Drawing_Layout/XTextFormatter.cs:168— XTextFormatter.CreateBlocks 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.
XGraphicsPdfRenderer.BeginPage (cognitive 20) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:1611— XGraphicsPdfRenderer.BeginPage 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.
OpenTypeFontface.Read (cognitive 20) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontface.cs:294— OpenTypeFontface.Read has cognitive complexity 20 (threshold 15). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
TokenizerHelper.NextToken (cognitive 20) Assets/Plugins/PdfSharp/Didstopia/Internal/TokenizerHelper.cs:120— TokenizerHelper.NextToken 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.
PdfPages.CloneElement (cognitive 20) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPages.cs:457— PdfPages.CloneElement has cognitive complexity 20 (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.
PdfChoiceField.IndexInOptArray (cognitive 20) Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfChoiceField.cs:57— PdfChoiceField.IndexInOptArray has cognitive complexity 20 (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.
StartupBenchmark.PlayToFirstCardAction (cognitive 20) Assets/Scripts/Cgs/Performance/StartupBenchmark.cs:208— StartupBenchmark.PlayToFirstCardAction 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.
LobbyMenu.Join (cognitive 20) Assets/Scripts/Cgs/Play/Multiplayer/LobbyMenu.cs:420— LobbyMenu.Join 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.
FloatingTextKeyboard.LateUpdate (cognitive 20) Assets/Scripts/Cgs/UI/FloatingTextKeyboard.cs:43— FloatingTextKeyboard.LateUpdate has cognitive complexity 20 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
ImageQueueService.LoadImageSprite (cognitive 20) Assets/Scripts/FinolDigital.Cgs.Json.Unity/ImageQueueService.cs:141— ImageQueueService.LoadImageSprite has cognitive complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PdfWriter.WriteEndObject (cognitive 19) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/PdfWriter.cs:356— PdfWriter.WriteEndObject has cognitive complexity 19 (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.
Inflater.Inflate (cognitive 19) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Inflater.cs:746— Inflater.Inflate 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.
DeckCardSelector.Update (cognitive 19) Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:47— DeckCardSelector.Update 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.
DeckCardSelector.SelectResults (cognitive 19) Assets/Scripts/Cgs/Decks/DeckCardSelector.cs:261— DeckCardSelector.SelectResults has cognitive complexity 19 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
GameContentNetwork.ReceiveHost (cognitive 19) Assets/Scripts/Cgs/Play/Multiplayer/GameContentNetwork.cs:291— GameContentNetwork.ReceiveHost 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.
PlayController.CreateCardStack (cognitive 19) Assets/Scripts/Cgs/Play/PlayController.cs:612— PlayController.CreateCardStack 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.
PlayMatRotationZoomController.Update (cognitive 19) Assets/Scripts/Cgs/Play/PlayMatRotationZoomController.cs:59— PlayMatRotationZoomController.Update has cognitive complexity 19 (threshold 15). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
RotateZoomableScrollRect.Update (cognitive 19) Assets/Scripts/Cgs/UI/ScrollRects/RotateZoomableScrollRect.cs:179— RotateZoomableScrollRect.Update 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.
ImageQueueService.RunLoad (cognitive 19) Assets/Scripts/FinolDigital.Cgs.Json.Unity/ImageQueueService.cs:81— ImageQueueService.RunLoad has cognitive complexity 19 (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.
LocalizationCache.Publish (cognitive 19) Assets/Scripts/FinolDigital.Cgs.Json.Unity/LocalizationCache.cs:141— LocalizationCache.Publish has cognitive complexity 19 (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.
UnityDeck.PrintPdf (cognitive 19) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityDeck.cs:336— UnityDeck.PrintPdf 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.
CustomToggle.UpdateMaterial (cognitive 19) Assets/Shaders and Materials/Shader Graph/17.0.4/UGUI Shaders/Scripts/Runtime/CustomToggle.cs:96— CustomToggle.UpdateMaterial 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.
TokenizerHelper.ScanToNextToken (cognitive 18) Assets/Plugins/PdfSharp/Didstopia/Internal/TokenizerHelper.cs:196— TokenizerHelper.ScanToNextToken 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.
Tree.CalcBLFreq (cognitive 18) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:391— Tree.CalcBLFreq 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.
MoveMenu.BuildCardZoneSelectionOptions (cognitive 18) Assets/Scripts/Cgs/Play/MoveMenu.cs:145— MoveMenu.BuildCardZoneSelectionOptions has cognitive complexity 18 (threshold 15). Of this number, 12 points are the body's own statements and 6 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.
FontCatalogBuilder.Build (cognitive 18) Assets/Scripts/Cgs/Editor/Localization/FontCatalogBuilder.cs:28— FontCatalogBuilder.Build 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.
UnityCardGame.LoadJsonFromFile (cognitive 18) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:850— UnityCardGame.LoadJsonFromFile has cognitive complexity 18 (threshold 15). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
DeflaterEngine.SetLevel (cognitive 17) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterEngine.cs:324— DeflaterEngine.SetLevel 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.
CardModel.UpdateCardZonePosition (cognitive 17) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:695— CardModel.UpdateCardZonePosition has cognitive complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
CardModel.OnChangeId (cognitive 17) Assets/Scripts/Cgs/CardGameView/Multiplayer/CardModel.cs:862— CardModel.OnChangeId has cognitive complexity 17 (threshold 15). Of this number, 15 points are the body's own statements and 2 belong to one function literal inside it that branches. 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.
CardViewer.Redisplay (cognitive 17) Assets/Scripts/Cgs/CardGameView/Viewer/CardViewer.cs:594— CardViewer.Redisplay has cognitive complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
SetImportMenu.ImportSet (cognitive 17) Assets/Scripts/Cgs/Cards/SetImportMenu.cs:170— SetImportMenu.ImportSet 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.
GameLocalizationCatalogs.Available (cognitive 17) Assets/Scripts/FinolDigital.Cgs.Json.Unity/GameLocalizationCatalogs.cs:54— GameLocalizationCatalogs.Available 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.
UnityDeck.Parse (cognitive 17) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityDeck.cs:71— UnityDeck.Parse 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.
GeometryHelper.AppendPartialArcQuadrant (cognitive 16) Assets/Plugins/PdfSharp/Didstopia/Drawing/GeometryHelper.cs:321— GeometryHelper.AppendPartialArcQuadrant has cognitive complexity 16 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
MatrixHelper.MultiplyMatrix (cognitive 16) Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs:1378— MatrixHelper.MultiplyMatrix 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.
XPdfForm.ExtractPageNumber (cognitive 16) Assets/Plugins/PdfSharp/Didstopia/Drawing/XPdfForm.cs:361— XPdfForm.ExtractPageNumber has cognitive complexity 16 (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.
ImageImporterJpeg.ImportImage (cognitive 16) Assets/Plugins/PdfSharp/Didstopia/Drawing_Internal/ImageImporterJpeg.cs:42— ImageImporterJpeg.ImportImage 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.
XGraphicsPdfRenderer.AppendPartialArcQuadrant (cognitive 16) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:1031— XGraphicsPdfRenderer.AppendPartialArcQuadrant has cognitive complexity 16 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
Parser.ReadXRefStream (cognitive 16) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:1115— Parser.ReadXRefStream 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.
GamesManagementMenu.Sync (cognitive 16) Assets/Scripts/Cgs/Menu/GamesManagementMenu.cs:259— GamesManagementMenu.Sync 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.
MainMenu.Update (cognitive 16) Assets/Scripts/Cgs/Menu/MainMenu.cs:132— MainMenu.Update has cognitive complexity 16 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
Modal.FocusInputField (cognitive 16) Assets/Scripts/Cgs/Menu/Modal.cs:147— Modal.FocusInputField 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.
ToolTip.UpdateSingleLine (cognitive 16) Assets/Scripts/Cgs/UI/ToolTip.cs:196— ToolTip.UpdateSingleLine 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.
LocalizationFiles.RecordOrigin (cognitive 16) Assets/Scripts/FinolDigital.Cgs.Json.Unity/LocalizationFiles.cs:182— LocalizationFiles.RecordOrigin 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.
index.acceptsMarkdown (cognitive 16) edge-worker/src/index.js:39— index.acceptsMarkdown has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Edited copy of a member (42 corresponding lines) · ×1
Edited copy of a member (42 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:817— Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:817-865 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:872-946 — These two members are one piece of code written twice and then edited apart: 42 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 (100 corresponding lines) · ×1
Edited copy of a member (100 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/GeometryHelper.cs:322— Assets/Plugins/PdfSharp/Didstopia/Drawing/GeometryHelper.cs:322-421 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:1032-1140 — These two members are one piece of code written twice and then edited apart: 100 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 (59 corresponding lines) · ×1
Edited copy of a member (59 corresponding lines) Assets/Scripts/Cgs/Menu/MainMenu.cs:217— Assets/Scripts/Cgs/Menu/MainMenu.cs:217-275 | Assets/Scripts/Cgs/Menu/MainMenu.cs:285-343 — These two members are one piece of code written twice and then edited apart: 59 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 (71 corresponding lines) · ×1
Edited copy of a member (71 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/GeometryHelper.cs:223— Assets/Plugins/PdfSharp/Didstopia/Drawing/GeometryHelper.cs:223-295 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:935-1005 — These two members are one piece of code written twice and then edited apart: 71 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 (80 corresponding lines) · ×1
Edited copy of a member (80 corresponding lines) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:610— Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:610-689 | Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:707-819 — These two members are one piece of code written twice and then edited apart: 80 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 (45 corresponding lines) · ×1
Edited copy of a member (45 corresponding lines) Assets/Scripts/Cgs/Decks/DeckEditor.cs:191— Assets/Scripts/Cgs/Decks/DeckEditor.cs:191-235 | Assets/Scripts/Cgs/Decks/DeckEditor.cs:238-282 — These two members are one piece of code written twice and then edited apart: 45 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 (55 corresponding lines) · ×1
Edited copy of a member (55 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:647— Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:647-701 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:705-763 — These two members are one piece of code written twice and then edited apart: 55 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 (35 corresponding lines) · ×1
Edited copy of a member (35 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:547— Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:547-581 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:539-574 — These two members are one piece of code written twice and then edited apart: 35 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 (41 corresponding lines) · ×1
Edited copy of a member (41 corresponding lines) Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:379— Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:379-419 | Assets/Scripts/Cgs/Play/Multiplayer/CgsNetManager.cs:446-486 — 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) Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:346— Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:346-429 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:431-467 — 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 (31 corresponding lines) · ×1
Edited copy of a member (31 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfType0Font.cs:49— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfType0Font.cs:49-79 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfType0Font.cs:83-116 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (56 corresponding lines) · ×1
Edited copy of a member (56 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:392— Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:392-447 | Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/DeflaterHuffman.cs:454-515 — These two members are one piece of code written twice and then edited apart: 56 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, 25+ corresponding lines) · ×1
Edited copies of one member (3 members, 25+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/CoreGraphicsPath.cs:243— Assets/Plugins/PdfSharp/Didstopia/Drawing/CoreGraphicsPath.cs:243-267 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:204-236 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:358-386 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 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 (30 corresponding lines) · ×1
Edited copy of a member (30 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:398— Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:398-427 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:540-569 — These two members are one piece of code written twice and then edited apart: 30 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 (29 corresponding lines) · ×1
Edited copy of a member (29 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/PdfEncoders.cs:208— Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/PdfEncoders.cs:208-236 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/PdfEncoders.cs:254-284 — These two members are one piece of code written twice and then edited apart: 29 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 (57 corresponding lines) · ×1
Edited copy of a member (57 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:991— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:991-1049 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:1052-1108 — These two members are one piece of code written twice and then edited apart: 57 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, 24+ corresponding lines) · ×1
Edited copies of one member (3 members, 24+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:324— Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:324-349 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:461-486 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontTables.cs:606-629 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 8+ corresponding lines) · ×1
Edited copies of one member (4 members, 8+ corresponding lines) Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:53— Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:53-60 | Assets/Scripts/Cgs/Menu/DownloadMenu.cs:31-38 | Assets/Scripts/Cgs/Menu/GamesManagementMenu.cs:75-84 | Assets/Scripts/Cgs/Play/Multiplayer/LobbyMenu.cs:102-110 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 22+ corresponding lines) · ×1
Edited copies of one member (3 members, 22+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfArray.cs:263— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfArray.cs:263-288 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:390-411 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:437-467 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (65 corresponding lines) · ×1
Edited copy of a member (65 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:211— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:211-275 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:212-276 — These two members are one piece of code written twice and then edited apart: 65 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, 16+ corresponding lines) · ×1
Edited copies of one member (3 members, 16+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Fonts/FontDescriptorCache.cs:75— Assets/Plugins/PdfSharp/Didstopia/Fonts/FontDescriptorCache.cs:75-93 | Assets/Plugins/PdfSharp/Didstopia/Fonts/FontDescriptorCache.cs:100-122 | Assets/Plugins/PdfSharp/Didstopia/Fonts/FontDescriptorCache.cs:125-140 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 7+ corresponding lines) · ×1
Edited copies of one member (5 members, 7+ corresponding lines) Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:512— Assets/Scripts/Cgs/Cards/CardSearchMenu.cs:512-519 | Assets/Scripts/Cgs/Decks/DeckSaveMenu.cs:266-272 | Assets/Scripts/Cgs/Menu/CgsGamesBrowser.cs:241-247 | Assets/Scripts/Cgs/Menu/DownloadMenu.cs:166-173 | Assets/Scripts/Cgs/Menu/GamesManagementMenu.cs:303-310 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 7 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 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (43 corresponding lines) · ×1
Edited copy of a member (43 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Fonts/FontFactory.cs:267— Assets/Plugins/PdfSharp/Didstopia/Fonts/FontFactory.cs:267-309 | Assets/Plugins/PdfSharp/Didstopia/Fonts/FontFactory.cs:315-357 — These two members are one piece of code written twice and then edited apart: 43 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 (4 members, 22+ corresponding lines) · ×1
Edited copies of one member (4 members, 22+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/XUnit.cs:103— Assets/Plugins/PdfSharp/Didstopia/Drawing/XUnit.cs:103-124 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XUnit.cs:173-194 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XUnit.cs:208-229 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XUnit.cs:243-264 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (18 corresponding lines) · ×1
Edited copy of a member (18 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfArray.cs:323— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfArray.cs:323-340 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfDictionary.cs:591-613 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (26 corresponding lines) · ×1
Edited copy of a member (26 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Streams/DeflaterOutputStream.cs:147— Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Streams/DeflaterOutputStream.cs:147-192 | Assets/Plugins/PdfSharp/Didstopia/SharpZipLib/Zip/Compression/Streams/DeflaterOutputStream.cs:361-386 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 13+ corresponding lines) · ×1
Edited copies of one member (3 members, 13+ corresponding lines) Assets/Scripts/Cgs/Play/PlayController.cs:954— Assets/Scripts/Cgs/Play/PlayController.cs:954-971 | Assets/Scripts/Cgs/Play/PlayController.cs:984-1000 | Assets/Scripts/Cgs/Play/PlayController.cs:1112-1124 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 5+ corresponding lines) · ×1
Edited copies of one member (3 members, 5+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontface.cs:587— Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontface.cs:587-591 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontface.cs:597-601 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontface.cs:607-611 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (5 members, 12+ corresponding lines) · ×1
Edited copies of one member (5 members, 12+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfResources.cs:64— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfResources.cs:64-75 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfResources.cs:82-93 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfResources.cs:100-111 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfResources.cs:118-129 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfResources.cs:172-183 — These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 7+ corresponding lines) · ×1
Edited copies of one member (3 members, 7+ corresponding lines) Assets/Shaders and Materials/Shader Graph/17.0.4/UGUI Shaders/ShaderGraphExtensions/ShaderGraph.Editor/Nodes/MeterValueNode.cs:22— Assets/Shaders and Materials/Shader Graph/17.0.4/UGUI Shaders/ShaderGraphExtensions/ShaderGraph.Editor/Nodes/MeterValueNode.cs:22-29 | Assets/Shaders and Materials/Shader Graph/17.0.4/UGUI Shaders/ShaderGraphExtensions/ShaderGraph.Editor/Nodes/SelectableStateNode.cs:21-27 | Assets/Shaders and Materials/Shader Graph/17.0.4/UGUI Shaders/ShaderGraphExtensions/ShaderGraph.Editor/Nodes/ToggleStateNode.cs:22-28 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 13+ corresponding lines) · ×1
Edited copies of one member (4 members, 13+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/FontFamilyCache.cs:104— Assets/Plugins/PdfSharp/Didstopia/Drawing/FontFamilyCache.cs:104-117 | Assets/Plugins/PdfSharp/Didstopia/Fonts/FontDescriptorCache.cs:153-165 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/GlyphTypefaceCache.cs:78-91 | Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/OpenTypeFontfaceCache.cs:104-117 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 4+ corresponding lines) · ×1
Edited copies of one member (3 members, 4+ corresponding lines) Assets/Scripts/FinolDigital.Cgs.Json.Unity/AuthoredDeckFiles.cs:325— Assets/Scripts/FinolDigital.Cgs.Json.Unity/AuthoredDeckFiles.cs:325-328 | Assets/Scripts/FinolDigital.Cgs.Json.Unity/LocalizationCache.cs:225-228 | Assets/Scripts/FinolDigital.Cgs.Json.Unity/LocalizationFiles.cs:241-245 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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 (3 corresponding lines) · ×1
Edited copy of a member (3 corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:1282— Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:1282-1284 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphicsPath.cs:392-394 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (4 members, 6+ corresponding lines) · ×1
Edited copies of one member (4 members, 6+ corresponding lines) Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:416— Assets/Plugins/PdfSharp/Didstopia/Drawing/XForm.cs:416-422 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:506-511 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfDictionaryWithContentStream.cs:93-98 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfFormXObject.cs:270-275 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
Duplicated block (38–139 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/Chars.cs:37— Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/Chars.cs:37-74 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Chars.cs:35-173 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/Chars.cs:37` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (107 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:428— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:428-534 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:429-535 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (49 lines × 2) Assets/Scripts/Cgs/CardGameView/Multiplayer/Board.cs:62— Assets/Scripts/Cgs/CardGameView/Multiplayer/Board.cs:62-110 | Assets/Scripts/Cgs/CardGameView/Multiplayer/DiceZone.cs:71-119 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (42 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:380— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:380-421 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:381-422 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (30–42 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:817— Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:817-858 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:910-939 — 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 `Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Parser.cs:817` 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 (35 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:308— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:308-342 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:309-343 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (29–35 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:126— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:126-154 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfType0Font.cs:167-201 — 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 `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:126` 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 (32–33 lines × 3) Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:378— Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:378-409 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs:477-508 | Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs:408-440 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf_Content/CLexer.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_IO/Lexer.cs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (30 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:400— Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:400-429 | Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:438-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 `Assets/Plugins/PdfSharp/Didstopia/Drawing/XGraphics.cs:400` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (31–32 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:659— Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:659-690 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:722-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. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:659` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (22–27 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Internal/Calc.cs:61— Assets/Plugins/PdfSharp/Didstopia/Internal/Calc.cs:61-82 | Assets/Plugins/PdfSharp/Didstopia/root/PageSizeConverter.cs:50-76 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Plugins/PdfSharp/Didstopia/Internal/Calc.cs:61` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (25 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfObject.cs:461— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfObject.cs:461-485 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfObject.cs:523-547 — 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 `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfObject.cs:461` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfObject.cs:521` calls `Assert` and `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfObject.cs:456` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (25–27 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/PdfEncoders.cs:210— Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/PdfEncoders.cs:210-234 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Internal/PdfEncoders.cs:256-282 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12–26 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfChoiceField.cs:59— Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfChoiceField.cs:59-84 | Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfRadioButtonField.cs:81-92 — 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 `Assets/Plugins/PdfSharp/Didstopia/Pdf_AcroForms/PdfChoiceField.cs:59` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (23 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:1642— Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:1642-1664 | Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/XGraphicsPdfRenderer.cs:1694-1716 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (20–21 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfObject.cs:275— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfObject.cs:275-295 | Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfObject.cs:369-388 — 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 (20 lines × 3) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:126— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:126-147 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfTrueTypeFont.cs:150-169 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfType0Font.cs:167-192 — 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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:126` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfType0Font.cs:201` calls `KeyInfo` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfTrueTypeFont.cs:170` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (19–20 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Drawing_BarCodes/CodeDataMatrix.cs:162— Assets/Plugins/PdfSharp/Didstopia/Drawing_BarCodes/CodeDataMatrix.cs:162-180 | Assets/Plugins/PdfSharp/Didstopia/Drawing_BarCodes/CodeOmr.cs:48-67 — 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 `Assets/Plugins/PdfSharp/Didstopia/Drawing_BarCodes/CodeDataMatrix.cs:162` 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 (19 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:282— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs:282-300 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs:283-301 — before extracting anything, compare `Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfReferenceTable.cs` and `Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCrossReferenceTable.cs` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 277 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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 (17 lines × 3) Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:111— Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:111-127 | Assets/Scripts/Cgs/Menu/GamesManagementMenu.cs:108-124 | Assets/Scripts/Cgs/Play/MoveMenu.cs:105-121 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:111` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 4) Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:106— Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:106-119 | Assets/Scripts/Cgs/Menu/CgsGamesBrowser.cs:69-82 | Assets/Scripts/Cgs/Menu/GamesManagementMenu.cs:103-116 | Assets/Scripts/Cgs/Play/MoveMenu.cs:100-113 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Scripts/Cgs/Decks/DeckLoadMenu.cs:106` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14–15 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:107— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfCIDFont.cs:107-120 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfTrueTypeFont.cs:123-137 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (13–14 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfType0Font.cs:56— Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfType0Font.cs:56-68 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfType0Font.cs:90-103 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10–11 lines × 2) Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:222— Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:222-232 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:249-258 — 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 `Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:222` 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 3) Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:69— Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:69-77 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:98-106 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/Ascii85Decode.cs:114-122 — 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 (10 lines × 2) Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:667— Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:667-676 | Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:780-789 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `Assets/Scripts/FinolDigital.Cgs.Json.Unity/UnityCardGame.cs:667` 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 (5 lines × 3) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:507— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:507-511 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfDictionaryWithContentStream.cs:94-98 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfFormXObject.cs:271-275 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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 (6 lines × 3) Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:535— Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfPage.cs:535-542 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfDictionaryWithContentStream.cs:106-111 | Assets/Plugins/PdfSharp/Didstopia/Pdf_Advanced/PdfFormXObject.cs:286-291 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
IC1 · Incompleteness & stubs· Both branches are identical · ×1
Both branches are identical — the condition decides nothing Assets/Plugins/PdfSharp/Didstopia/Drawing_Pdf/PdfGraphicsState.cs:378— 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.
IC1 · Incompleteness & stubs· Dead `#if false` region · ×1
Dead `#if false` region Assets/Plugins/PdfSharp/Didstopia/Pdf/PdfRectangle.cs:400— Code inside a `#if false` block is permanently excluded from the build — disabled code that should be removed or restored.
Duplicated block (5 lines × 2 locations) REDACTED:85— REDACTED:85 · REDACTED:167 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Complex function handleRequest (cyclomatic 15, cognitive 13) edge-worker/src/index.js:125— handleRequest has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function acceptsMarkdown (cyclomatic 11, cognitive 16) edge-worker/src/index.js:39— acceptsMarkdown has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R4 · Test Coverage· No test reaches this file · ×1
No test reaches this file firebase/public/ServiceWorker.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No lint script — test ✓ · lint ✗ · typecheck ✓ — read from this repository's package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: `test` for the suite, `lint` or `prettier` for linting, `typecheck`/`type-check`/`tsc` for type checking. ✗ therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline — a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A ✓ means the wiring is DECLARED — a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite.
Weak hash algorithm Assets/Plugins/PdfSharp/Didstopia/Pdf_Security/PdfStandardSecurityHandler.cs:622— MD5/SHA1 is constructed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ for content integrity, or a KDF (PBKDF2/Argon2/BCrypt) for password storage. If it only derives a non-security identifier (a cache key, a file or mutex name), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as `System.IO.Hashing.XxHash64`/`Crc32` says it in code — since the algorithm alone cannot distinguish the two uses.
Rethrow loses stack trace (`throw ex;`) Assets/Plugins/PdfSharp/Didstopia/Fonts_OpenType/GlyphDataTable.cs:76— `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.
Irreversible deploy step: production deploy on every push REDACTED:764— Job `deployToFirebaseTest` rolls out to production on every branch push, with no environment, no manual approval and no test it waits for — every push is a production release, and nothing stops a bad one before users get it.
Irreversible deploy step: production deploy on every push REDACTED:804— Job `deployToFirebaseProduction` rolls out to production on every branch push, with no environment, no manual approval and no test it waits for — every push is a production release, and nothing stops a bad one before users get it.
Irreversible deploy step: production deploy on every push REDACTED:954— Job `deployToSteam` rolls out to production on every branch push, with no environment, no manual approval and no test it waits for — every push is a production release, and nothing stops a bad one before users get it.
Silent fallback default in catch Assets/Plugins/PdfSharp/Didstopia/Pdf_Filters/LzwDecode.cs:174— `NextCode` swallows every exception into `return 257;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch Assets/Scripts/Cgs/Performance/StartupTimeline.cs:73— `BeforeSceneLoad` swallows every exception and sets `arguments = Array.Empty<string>();` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Silent fallback default in catch tools/startup-reference/Assets/Scripts/ReferenceStartup.cs:160— `ProcessStartOffsetMs` swallows every exception into `return null;` — a data error becomes a silent behavior change with no trail. Log the failure or let validation throw.
Fat interface: IInputField (17 members) Assets/WebGLSupport/WebGLInput/Wrapper/IInputField.cs:24— `IInputField` declares 17 members: `contentType`, `lineType`, `fontSize`, `text`, `placeholder`, `characterLimit`, `caretPosition`, `isFocused`, `selectionFocusPosition`, `selectionAnchorPosition`, `ReadOnly`, `OnFocusSelectAll`, `EnableMobileSupport`, `GetScreenCoordinates`, `ActivateInputField`, `DeactivateInputField`, `Rebuild`. 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.
No ADRs found ProjectSettings/ProjectVersion.txt:1— No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `ProjectSettings/ProjectVersion.txt` makes this repository a deployable product (line 1).
D28 · Secrets (history)· Rotate the exposed credentials · ×1
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P3 · Security & performance tooling· Dependabot does not watch npm/pip · ×1
Dependabot does not watch npm/pip REDACTED:6— `REDACTED` schedules updates, but no `package-ecosystem` entry covers `npm`, `pip`, which this tree depends on — so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the `updates:` list.
Changelog looks stale/thin — The changelog this check read carries 0 versioned entries, against a bar of 3. Counted as either the distinct `x.y.z` versions it names (a link's target is not counted) or its version-shaped section headings (`## [1.2.0]`, `## V14.x.x`, `## Updates in 8.0.x`), whichever is the larger — so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read — release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository — are not counted here, and this row is about what is re-findable in the tree rather than about how often you release.
Duplicated predicate tools/startup-benchmark/android_benchmark.py:125— `result.get("failedMilestone") or "failed"` appears character-identically in 2 files — tools/startup-benchmark/android_benchmark.py, tools/startup-benchmark/desktop_benchmark.py. 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.
X2 · Cancellation propagation· Not all async methods take a CancellationToken · ×1
Not all async methods take a CancellationToken — Only 1/12 async methods accept a CancellationToken, so in-flight work can't be stopped early when the caller gives up — whatever ends it in your host (shutdown signal, timeout, abandoned request, user cancel). Thread a token through the call chain and honour it at each await and loop; where a method genuinely cannot be interrupted, omitting it is a deliberate choice — judge against your hosting model.
Nullable reference types not enabled everywhere — 0/524 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets <Nullable>enable</Nullable> for it: a file is enabled only by its own `#nullable enable`, by a Unity `csc.rsp` with `-nullable:enable` for its assembly, or as a file-based app (`#:` directives) whose `#:property Nullable` does not turn it off. NRTs catch a whole class of null-deref bugs at compile time.
Silent fallback default on parse failure Assets/Scripts/Cgs/Performance/BenchmarkOptions.cs:147— `ParseDelay` falls back to `0` when `double.TryParse(value, NumberStyles.Float, CultureInfo.InvariantCulture, out var…` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Outdated: fastlane — `fastlane` is resolved to 2.240.1 in the committed REDACTED but 2.242.0 is the current release on rubygems.org, and Gemfile declares no version requirement for it, so nothing but the lockfile is holding it back. This build is therefore missing every fix published since, including any security fix. Run `bundle update fastlane` and commit the updated REDACTED.
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.
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 11 file(s) — `Assets/Plugins/PdfSharp/Didstopia/Drawing/XColorResourceManager.cs`, `Assets/Plugins/PdfSharp/Didstopia/Drawing/XFontFamily.cs`, `Assets/Plugins/PdfSharp/Didstopia/Drawing/XMatrix.cs`, `Assets/Plugins/PdfSharp/Didstopia/Drawing/XPoint.cs`, `Assets/Plugins/PdfSharp/Didstopia/Drawing/XVector.cs`, … (+6 more) — 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 01a1ea85-9ca1-73cb-a55a-1a20e1d59952 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 77 · Warnings: 620 · Recommendations: 18 · Info: 1 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 17-11-2026 @ 17:19 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.