Public report of matthw-labs/cupola, 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, 13:27 UTC · Survey ID cd_5b5d10f2f2574ad98707d1e6057e2893
matthw-labs/cupola
Measured 17 November 2026, 13:26 UTC, at code version 99883c9
Bus factor is not measured: One contributor carries this repository.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 303,854 lines of product code in 10 projects, tests not counted · Estimated rebuild effort: about 5.1 person-years · Weakest lens: Security and Compliance, 45.6
Findings by how serious they are
18 critical1219 serious73 minor
8 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, 13:26 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 ▸
67of 67 dimensions measured by tools.
1302of 1310 findings point to an exact file and line, so you can open each one in the code. The other 8 concern the repository as a whole, such as missing documentation.
67dimensions across 8 lenses, read from 303,854 lines of product code in 10 projects.
matthw-labs/cupola falls short of our standard for production, held back most by its Security and Compliance lens, the code's security and compliance. It scores 52.3 out of 100 and is rated Adequate, and four of its 18 critical findings are security problems.
Security and Compliance, at 45.6, is the weakest lens and counts most in the score. The best first step is restoring certificate checks, worth about 5.7 points. Making the controls keyboard-usable comes next, worth about 3.7 points. Raising Security and Compliance to 70 would lift the score to about 57.4.
One automatic update takes new releases before a bad one can be spotted. One password or key is open to anyone who can read the repository, and four controls can't be used without a mouse. Making the controls work with a keyboard, setting a waiting period for automatic updates and replacing the exposed password or key would close these risks. Switching the validation back on would fix the security check on connections or logins switched off, and the unsafe setting in infrastructure or container files needs changing to safe values. Giving the shared object a factory instead of the short-lived one would take care of the seven shared objects holding on to short-lived ones.
The product code is 303,854 lines, about €740,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 Security and Compliance rose from 45.6 to 70, the lowest score rated Strong, the score would rise from 52.3 to about 57.4.
Code composition: what the lines of code are
Product code 49%Tests 51%
Rebuild cost: about €740,000 · Estimate
Cost to rebuild
€250,000 to €1,200,000, for 4,120 to 13,070 hours of work, about 5.1 person-years for 3 to 10 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 52. 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: 303,854 lines of product code
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Stop accepting every TLS certificate: delete the `badCertificateCallback` / `onBadCertificate` / `validateCertificate` that returns `true` so the chain, hostname and expiry are verified, and trust a self-signed or private server by loading its CA into a `SecurityContext` — never by switching verification off.
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
Raises the score by about 3.7 points · Medium effort · Keyboard semantics
3
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED.
Raises the score by about 1.6 points · Low effort · Secret Scanning
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €740,000 to build again, about 5.1 person-years of work. Its weakest lens is Security and Compliance, at 45.6 (Weak). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Stop accepting every TLS certificate: delete the `badCertificateCallback` / `onBadCertificate` / `validateCertificate` that returns `true` so the chain, hostname and expiry are verified, and trust a self-signed or private server by loading its CA into a `SecurityContext` — never by switching verification off. Of all the actions in this report, it raises the score most for the work it takes: about 5.7 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.3 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 795,855 lines over the last 90 days, which is about 3,227,634 lines a year. At that pace, the extra work comes to an estimated 161.4 to 1075.9 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.
54 modules, with 17 dependencies between them. One loop runs through 2 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 14 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
com.matthwlabs.cupola.outside.OutsideContent uses com.matthwlabs.cupola.outside, so a change to com.matthwlabs.cupola.outside can break com.matthwlabs.cupola.outside.OutsideContent, while a change to com.matthwlabs.cupola.outside.OutsideContent can't break com.matthwlabs.cupola.outside.
Position
Below the diagonal: com.matthwlabs.cupola.outside.OutsideContent uses a module listed above it, which is the healthy direction.
com.matthwlabs.cupola.outside.OutsideKind uses com.matthwlabs.cupola.outside, so a change to com.matthwlabs.cupola.outside can break com.matthwlabs.cupola.outside.OutsideKind, while a change to com.matthwlabs.cupola.outside.OutsideKind can't break com.matthwlabs.cupola.outside.
Position
Below the diagonal: com.matthwlabs.cupola.outside.OutsideKind uses a module listed above it, which is the healthy direction.
com.matthwlabs.cupola.outside.OutsideSnapshot uses com.matthwlabs.cupola.outside, so a change to com.matthwlabs.cupola.outside can break com.matthwlabs.cupola.outside.OutsideSnapshot, while a change to com.matthwlabs.cupola.outside.OutsideSnapshot can't break com.matthwlabs.cupola.outside.
Position
Below the diagonal: com.matthwlabs.cupola.outside.OutsideSnapshot uses a module listed above it, which is the healthy direction.
com.matthwlabs.cupola.outside.OutsideTone uses com.matthwlabs.cupola.outside, so a change to com.matthwlabs.cupola.outside can break com.matthwlabs.cupola.outside.OutsideTone, while a change to com.matthwlabs.cupola.outside.OutsideTone can't break com.matthwlabs.cupola.outside.
Position
Below the diagonal: com.matthwlabs.cupola.outside.OutsideTone uses a module listed above it, which is the healthy direction.
dev.steenbakker.mobile_scanner uses dev.steenbakker.mobile_scanner.MobileScannerPermissions, so a change to dev.steenbakker.mobile_scanner.MobileScannerPermissions can break dev.steenbakker.mobile_scanner, while a change to dev.steenbakker.mobile_scanner can't break dev.steenbakker.mobile_scanner.MobileScannerPermissions.
Position
Below the diagonal: dev.steenbakker.mobile_scanner uses a module listed above it, which is the healthy direction.
dev.steenbakker.mobile_scanner uses dev.steenbakker.mobile_scanner.objects, so a change to dev.steenbakker.mobile_scanner.objects can break dev.steenbakker.mobile_scanner, while a change to dev.steenbakker.mobile_scanner can't break dev.steenbakker.mobile_scanner.objects.
Position
Below the diagonal: dev.steenbakker.mobile_scanner uses a module listed above it, which is the healthy direction.
dev.steenbakker.mobile_scanner.objects.BarcodeFormats uses dev.steenbakker.mobile_scanner.objects, so a change to dev.steenbakker.mobile_scanner.objects can break dev.steenbakker.mobile_scanner.objects.BarcodeFormats, while a change to dev.steenbakker.mobile_scanner.objects.BarcodeFormats can't break dev.steenbakker.mobile_scanner.objects.
Position
Below the diagonal: dev.steenbakker.mobile_scanner.objects.BarcodeFormats uses a module listed above it, which is the healthy direction.
dev.steenbakker.mobile_scanner.objects.DetectionSpeed uses dev.steenbakker.mobile_scanner.objects, so a change to dev.steenbakker.mobile_scanner.objects can break dev.steenbakker.mobile_scanner.objects.DetectionSpeed, while a change to dev.steenbakker.mobile_scanner.objects.DetectionSpeed can't break dev.steenbakker.mobile_scanner.objects.
Position
Below the diagonal: dev.steenbakker.mobile_scanner.objects.DetectionSpeed uses a module listed above it, which is the healthy direction.
28 pairs of types, where a type in repository uses a type in packages~mobile_scanner~darwin~mobile_scanner~mobile_scanner. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
repository uses packages~mobile_scanner~darwin~mobile_scanner~mobile_scanner, so a change to packages~mobile_scanner~darwin~mobile_scanner~mobile_scanner can break repository, while a change to repository can't break packages~mobile_scanner~darwin~mobile_scanner~mobile_scanner.
Position
Below the diagonal: repository uses a module listed above it, which is the healthy direction.
repository.features uses repository.src, so a change to repository.src can break repository.features, while a change to repository.features can't break repository.src.
Position
Below the diagonal: repository.features uses a module listed above it, which is the healthy direction.
36→40 repository.features uses repository.corepart of a loop✕
Connections
215 pairs of types, where a type in repository.features uses a type in repository.core. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
repository.features uses repository.core, so a change to repository.core can break repository.features, while a change to repository.features can't break repository.core.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
website.src.data uses website.src.data.titles, so a change to website.src.data.titles can break website.src.data, while a change to website.src.data can't break website.src.data.titles.
Position
Below the diagonal: website.src.data uses a module listed above it, which is the healthy direction.
website.src.data.pages uses website.src.data.titles, so a change to website.src.data.titles can break website.src.data.pages, while a change to website.src.data.pages can't break website.src.data.titles.
Position
Below the diagonal: website.src.data.pages uses a module listed above it, which is the healthy direction.
website.src.lib uses website.src.data.titles, so a change to website.src.data.titles can break website.src.lib, while a change to website.src.lib can't break website.src.data.titles.
Position
Below the diagonal: website.src.lib uses a module listed above it, which is the healthy direction.
website.src.lib uses website.src.lib.registry, so a change to website.src.lib.registry can break website.src.lib, while a change to website.src.lib can't break website.src.lib.registry.
Position
Below the diagonal: website.src.lib uses a module listed above it, which is the healthy direction.
website.src.lib uses website.src.lib.repo, so a change to website.src.lib.repo can break website.src.lib, while a change to website.src.lib can't break website.src.lib.repo.
Position
Below the diagonal: website.src.lib uses a module listed above it, which is the healthy direction.
47 pairs of types, where a type in repository.core uses a type in repository.features. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
repository.core uses repository.features, so a change to repository.features can break repository.core, while a change to repository.core can't break repository.features.
Position
Below the diagonal: repository.core uses a module listed above it, which is the healthy direction.
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
4
High / Critical
A03:2025 — Software Supply Chain Failures
2
Medium
A07:2025 — Authentication Failures
1
High / Critical
A02:2025 — Security Misconfiguration
1
High / Critical
Roadmap
Top priorities: Stop accepting every TLS certificate: delete the `badCertificateCallback` / `onBadCertificate` / `validateCertificate` that returns `true` so the chain, hostname and expiry are verified, and trust a self-signed or private server by loading its CA into a `SecurityContext` — never by switching verification off; Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href; Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Stop accepting every TLS certificate: delete the `badCertificateCallback` / `onBadCertificate` / `validateCertificate` that returns `true` so the chain, hostname and expiry are verified, and trust a self-signed or private server by loading its CA into a `SecurityContext` — never by switching verification off.
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 — 18
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 — 1219
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 — 73
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 8
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 67 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 67 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, 1302 of 1310 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.dart, .py) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo.
D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.dart, .py) but the built-in reliability runner does not support this repository's ecosystem, so flakiness couldn't be assessed. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D12 Dependency Hygiene — 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. Not scored — 4 Maven/Gradle manifest(s) were read, stating a version for 5 dependency(ies) and leaving 0 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
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 Gradle build (build.gradle/build.gradle.kts), but the licence verdict published here was taken over its pub package dependencies. Nothing was read about its Gradle 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 package.json, but the licence verdict published here was taken over its pub package dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D21 Naming Consistency — 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.
D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D22 Internal API Consistency — not measured this run — 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's deterministic call-shape rules are gated per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
D27 Navigability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `packages/mobile_scanner/darwin/mobile_scanner/Sources/mobile_scanner/MobileScannerPlugin.swift`, `website/src/data/faq.ts`, `website/src/data/pages.ts`, `website/src/data/titles.ts` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
AX7 Slice cohesion — 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. 154 further occurrence(s) are not listed individually; the score already reflects all 194.
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 DockerCompose (docker-compose.e2e.yml). compose up failed (exit 18 — an image could not be pulled) — readarr Pulling nzbget Pulling sabnzbd Pulling sabnzbd Error Get "https://lscr.io/v2/": Forbidden nzbget Error context canceled readarr Error context canceled Error response from daemon: Get "https://lscr.io/v2/": Forbidden; the earlier `compose pull` step reported: readarr Pulling nzbget Pulling sabnzbd Pulling sabnzbd Error Get "https://lscr.io/v2/": Forbidden nzbget Error context canceled readarr Error context canceled Error response from daemon: Get "https://lscr.io/v2/": Forbidden; the runtime sandbox reaches registries only through the in-fence pull-through mirror, so an image the mirror does not carry cannot be fetched — this is a limit of our sandbox, not of your stack; runtime evidence skipped.
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.
X10 Duplicated predicate — 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. 16 further occurrence(s) are not listed individually; the score already reflects all 56.
X24 Document value interpolated into markup unescaped — 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 check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
X3 Exception handling — 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. 80 further occurrence(s) are not listed individually; the score already reflects all 120.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality 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.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
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.
AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
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.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
DM4 Rich vs anemic domain model: Behaviour is detected as state mutation inside a method body — a method that enforces an invariant by validating-and-throwing without mutating reads as a query, and mutation delegated through an interface the scan can't resolve isn't credited; entities with zero public properties still drop out of the population. It detects that state changes, not whether the rule is correct.
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".
P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
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.
116 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was _MediaPageState.build at 116. A further 3 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being _NpmSection.build at 17 — they are counted neither in the figure above nor in this dimension's score. 3 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: lib/features/npm/presentation/npm_screen.dart (_NpmSection.build at 17), lib/core/capability/role_gate_copy.dart (RoleGateCopy._doing at 16), lib/core/status/media_status.dart (MediaStatusInfo._baseTone at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 111 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 _MediaPageState.build (cyclomatic 116). — Refactoring it lifts Cyclomatic Complexity from 5.9 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.
+ 190 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 4 bodies over 60 down to 60 or less in Cognitive Complexity — start with _MediaPageState.build (cognitive 129), RequestBottomSheet.build (cognitive 81), _ArtistPageState.build (cognitive 74). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 4 together lifts Cognitive Complexity from 5.5 to about 6.4/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.4 / 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 64 MethodTooLong finding(s) in God Classes — start with media_episodes_graph.dart (2), theme.dart (2), onboarding_walk.dart (2). — One of this dimension's main actionable groups (64 warning-level).
Resolve the 54 FileTooLong finding(s) in God Classes — start with media_page.dart, service_settings_screen.dart, media_browse_scaffold.dart. — One of this dimension's main actionable groups (54 warning-level).
Resolve the 20 TooManyMethods finding(s) in God Classes — start with service_settings_screen.dart, seerr_service.dart, service_routes.dart. — One of this dimension's main actionable groups (20 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.
185 duplicated block group(s) detected. 4.4 % of the production lines (13,304 of 303,854) are in a reported copy. A further 190 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 11 of the 375 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 150 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 18 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with bazarr_library_screen.dart (2), floating_bottom_nav_bar.dart, settings_switch_row.dart. — One of this dimension's main actionable groups (18 warning-level).
Resolve the 14 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with seerr_service.dart, continue_watching_module.dart, movies_find.dart. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 13 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with service_overview.dart, activity_download_row.dart, bazarr_models.dart. — One of this dimension's main actionable groups (13 warning-level).
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
7 production modules (Gradle+npm+SwiftPM+pub), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; edges a convention plugin adds from buildSrc or build-logic are not visible there; 0 module(s) off the main sequence, with abstractness counted on 4 of the 7 (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).
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 29 Low cohesion finding(s) in Cohesion (LCOM4) — start with profile_network.dart (3), manual_import_provider.dart (2), emby_dialect.dart. — One of this dimension's main actionable groups (29 warning-level).
Detailed fixes: d6_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.
1 secret(s) detected. 1 detection(s) were excluded as holding no minted credential in material that runs: a name, reference or comparison rather than a value, a readable phrase or pattern, a value that declares itself fake, or development, test, example, mock or demo material.
REDACTED
What to do
Resolve the 1 Leaked secret finding(s) in Secret Scanning — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.md.
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 133 resolved pub package(s) use a banned license. Licences were read from pub.dev's analysis of each package's licence file, over every package this repository's pubspec.lock resolves from pub.dev, direct and transitive, at the locked version; the 3 package(s) the lock marks direct dev are excluded, and SDK, path and git packages have no registry release to read. pub.dev analyses only recent releases, so for 36 package(s) locked at an older version the licence read is that of the package's latest analysed release, not of the locked one. ★ COVERAGE OF THIS VERDICT: it grades this repository's pub package dependencies and nothing else. The repository also declares a Gradle build (build.gradle/build.gradle.kts) and 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.
Top hotspots: lib/features/media/presentation/media_page.dart (55×116=6380); lib/demo/world/fakes/media_fakes.dart (44×140=6160); lib/demo/world/fakes/arr_fakes.dart (40×82=3280) Repeated repair below the complexity floor: lib/features/nzbget/presentation/nzbget_screen.dart (21 of 28 changes were fixes); lib/features/activity/presentation/widgets/activity_item_tiles.dart (20 of 34 changes were fixes); lib/features/sabnzbd/presentation/sabnzbd_screen.dart (20 of 27 changes were fixes)
Resolve the 139 Repeated repair finding(s) in Churn × Complexity Hotspots — start with nzbget_screen.dart, activity_item_tiles.dart, sabnzbd_screen.dart. — One of this dimension's main actionable groups (139 warning-level).
Resolve the 70 Hotspot finding(s) in Churn × Complexity Hotspots — start with media_page.dart, media_fakes.dart, arr_fakes.dart. — One of this dimension's main actionable groups (70 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 303854 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.
2 of 2 documentation facets pass in full. 125 document(s) read across 10 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.
No ADRs foundmacos/Runner.xcodeproj/project.pbxproj:1
What to do
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with project.pbxproj. — 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.
1 of 10 build units (Gradle, SwiftPM, Xcode, npm, pub) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesionpubspec.yaml:1
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with pubspec.yaml. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
4 finding(s): 0 critical, 1 high, 3 medium, 0 low. semgrep hit a parse error in 4 file(s) — `scripts/release.sh`, `website/src/data/faq.ts` (line 92), `website/src/data/pages.ts` (line 148), `website/src/data/titles.ts` (line 26) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-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 Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
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 953 of the 1188 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.
Resolve the 7 Change coupling finding(s) in Change Coupling — start with lidarr_overview_screen.dart, sabnzbd_screen.dart, nzbget_screen.dart. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 4 Change coupling clique finding(s) in Change Coupling — start with movies_screen.dart, radarr_service.dart, radarr_overview_provider.dart. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with services_provider.dart. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
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 the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
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 4 platform declaration(s) and 5 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 alternatives6.4 / 10Adequate✓ 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.
An svg presented as an image needs a name — add a <title> child or an aria-label/aria-labelledby. — design/system/motion/ServiceRingMotion/preview.html:0
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 & labels7.6 / 10Strong✓ Tool-verified
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.
A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one). — design/system/motion/ReelLine/preview.html:32
What to do
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
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>. (×10) — design/system/motion/DetailHeroCollapse/preview.html:3, design/system/motion/MotionTokens/preview.html:3, design/system/motion/NavPillTransition/preview.html:3, …
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 interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".
The repo's own CSS styles .cp-nav-item with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler. (×4) — design/system/motion/ServicePortalPhysics/preview.html:34, design/system/motion/ServicePortalPhysics/preview.html:35, design/system/motion/ServicePortalPhysics/preview.html:36, …
What to do
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
aria-hidden="true" here hides the subtree from assistive tech, but a focusable descendant stays in the tab order — a keyboard user can land on a control screen readers can't see. Add inert, take the descendants out of the tab order (tabindex="-1"), or drop aria-hidden. — design/system/motion/PosterFlight/preview.html:23
What to do
Use valid, non-abstract roles, supply the ARIA state each role requires, and never put aria-hidden on a focusable element.
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.
`.cp-service-ring-motion-svg .is-hit:focus-visible` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — design/system/motion/motion.css:253
`.cp-motion-switch-track::after` moves (`transition: transform 200ms cubic-bezier(0.215, 0.61, 0.355, 1), background-color 200ms linear`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — design/system/motion/motion.css:75
`.cp-shimmer-sweep-block::after` moves (`animation: cp-shimmer-sweep-v 1600ms cubic-bezier(0.445, 0.05, 0.55, 0.95) infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — design/system/motion/motion.css:144
`.cp-nav-pill-transition-ind` moves (`transition: left calc(320ms * var(--k)) cubic-bezier(0.2, 0.8, 0.2, 1), width calc(320ms * var(--k)) cubic-bezier(0.2, 0.8, 0.2, 1)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — design/system/motion/motion.css:161
`.cp-service-portal-physics-coach` moves (`transition: transform calc(320ms * var(--k)) cubic-bezier(0.2, 0.8, 0.2, 1), opacity calc(320ms * var(--k)) linear`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — design/system/motion/motion.css:272
What to do
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Other · Architecture — Whether any singleton service captures a scoped/transient dependency — a silent lifetime/threading bug.
Method: Roslyn scan: DI registrations parsed from AddSingleton/Scoped/Transient; each singleton checked for captured shorter-lifetime dependencies. Exhaustive, deterministic.
`releaseSearchReachResolverProvider` is a keep-alive Riverpod provider and calls `ref.read(releaseSearchReachProvider…)`, which is declared auto-dispose (lib/features/release_search/presentation/release_search_entry.dart:61). Read in build, `releaseSearchReachProvider` has no listener once the read returns, so it is disposed at once — its ref.onDispose closes what it handed out — while `releaseSearchReachResolverProvider` keeps that value for the life of the ProviderContainer. Mark `releaseSearchReachProvider` keepAlive too, make `releaseSearchReachResolverProvider` auto-dispose, or read it per use outside build. — lib/features/release_search/presentation/release_search_entry.dart:274
`releaseSearchRunnerProvider` is a keep-alive Riverpod provider and calls `ref.read(releaseSearchTransportProvider…)`, which is declared auto-dispose (lib/features/release_search/presentation/release_search_entry.dart:159). Read in build, `releaseSearchTransportProvider` has no listener once the read returns, so it is disposed at once — its ref.onDispose closes what it handed out — while `releaseSearchRunnerProvider` keeps that value for the life of the ProviderContainer. Mark `releaseSearchTransportProvider` keepAlive too, make `releaseSearchRunnerProvider` auto-dispose, or read it per use outside build. — lib/features/release_search/presentation/release_search_entry.dart:293
`bestMissingProvider` is a keep-alive Riverpod provider and calls `ref.watch(seerrNumberingProvider…)`, which is declared auto-dispose (lib/features/discover/presentation/discover_details_provider.dart:33). The keep-alive provider listens to it for the life of the ProviderContainer, so `seerrNumberingProvider` is never disposed — the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark `seerrNumberingProvider` keepAlive too, make `bestMissingProvider` auto-dispose, or read it per use outside build. — lib/features/discover/presentation/catalog_providers.dart:37
`catalogHideOwnedProvider` is a keep-alive Riverpod provider and calls `ref.watch(seerrServerFactsProvider…)`, which is declared auto-dispose (lib/features/discover/data/seerr_accounts.dart:255). The keep-alive provider listens to it for the life of the ProviderContainer, so `seerrServerFactsProvider` is never disposed — the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark `seerrServerFactsProvider` keepAlive too, make `catalogHideOwnedProvider` auto-dispose, or read it per use outside build. — lib/features/discover/presentation/catalog_providers.dart:286
`atriumShelfKeeperProvider` is a keep-alive Riverpod provider and calls `ref.watch(seerrNumberingProvider…)`, which is declared auto-dispose (lib/features/discover/presentation/discover_details_provider.dart:33). The keep-alive provider listens to it for the life of the ProviderContainer, so `seerrNumberingProvider` is never disposed — the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark `seerrNumberingProvider` keepAlive too, make `atriumShelfKeeperProvider` auto-dispose, or read it per use outside build. — lib/features/discover/presentation/catalog_providers.dart:318
`completeTheCollectionProvider` is a keep-alive Riverpod provider and calls `ref.watch(seerrNumberingProvider…)`, which is declared auto-dispose (lib/features/discover/presentation/discover_details_provider.dart:33). The keep-alive provider listens to it for the life of the ProviderContainer, so `seerrNumberingProvider` is never disposed — the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark `seerrNumberingProvider` keepAlive too, make `completeTheCollectionProvider` auto-dispose, or read it per use outside build. — lib/features/discover/presentation/library_shelves_provider.dart:85
`completeTheCollectionProvider` is a keep-alive Riverpod provider and calls `ref.watch(collectionDetailProvider…)`, which is declared auto-dispose (lib/features/discover/presentation/discover_details_provider.dart:61). The keep-alive provider listens to it for the life of the ProviderContainer, so `collectionDetailProvider` is never disposed — the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark `collectionDetailProvider` keepAlive too, make `completeTheCollectionProvider` auto-dispose, or read it per use outside build. — lib/features/discover/presentation/library_shelves_provider.dart:87
What to do
Riverpod: a keepAlive provider must only watch, listen to or read in build other keepAlive providers — mark the dependency @Riverpod(keepAlive: true) (or drop .autoDispose), make the consumer auto-dispose too, or read the dependency per use from a Notifier method instead of in build (riverpod_lint: only_use_keep_alive_inside_keep_alive).
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 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 the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
`MediaBrowserDialect` declares 17 abstract methods: `service`, `basePath`, `serviceHeaders`, `interceptors`, `isThisServer`, `sessionsQuery`, `liveSessions`, `browseFields`, `users`, `credentialKind`, `tokenUserAsViewer`, `rawItem`, `resume`, `nextUp`, `search`, `virtualFolders`, `episodeSortBy`. Counted over its public methods with no body, once per name; concrete methods and `_`-private members are not counted, because no implementer that extends it is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — lib/features/jellyfin/data/media_browser_dialect.dart:37
`StreamServerClient` declares 21 abstract methods: `probeVersion`, `verifyCredential`, `getSessions`, `stopSession`, `getLibraries`, `getLibraryItemCount`, `search`, `getLibraryPage`, `getItem`, `getSeriesKey`, `getTitleKey`, `getChildren`, `getEpisodes`, `lookupByExternalId`, `getContinueWatching`, `getNextUp`, `getRecentlyAdded`, `getRecentlyWatched`, `getViewers`, `imageFor`, `close`. Counted over its public methods with no body, once per name; concrete methods and `_`-private members are not counted, because no implementer that extends it is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — lib/features/stream/domain/stream_server_client.dart:60
What to do
Split fat interfaces into focused role-interfaces so clients depend only on what they use.
Other · Architecture — Whether feature slices stay independent (no direct cross-slice references) — the discipline that makes vertical-slice architecture pay off.
Method: Roslyn scan (vertical-slice gated): feature slices resolved from namespaces (.Features.*, .Slices.*) or project names; cross-slice type references detected. Deterministic, traceable.
`ActivityServiceResult` (slice 'activity') depends on `ServiceKey` from slice 'settings'. — lib/features/activity/presentation/activity_provider.dart:46
`ActivityFeed` (slice 'activity') depends on `SourceCoverage` from slice 'services'. — lib/features/activity/presentation/activity_provider.dart:168
`GlobalActivityItem` (slice 'activity') depends on `ServiceKey` from slice 'settings'. — lib/features/activity/presentation/activity_provider.dart:236
`ArrCalendarScreen` (slice 'activity') depends on `ServiceKey` from slice 'settings'. — lib/features/activity/presentation/arr_calendar_screen.dart:28
`_Commands` (slice 'activity') depends on `ServiceQueueItem` from slice 'services'. — lib/features/activity/presentation/download_page.dart:488
`ActivityDownloadRow` (slice 'activity') depends on `ServiceQueueItem` from slice 'services'. — lib/features/activity/presentation/widgets/activity_download_row.dart:56
`ActivityHistoryRow` (slice 'activity') depends on `ArrHistoryEntry` from slice 'services'. — lib/features/activity/presentation/widgets/activity_history_row.dart:26
`DecisionFaultCard` (slice 'activity') depends on `DashboardDecision` from slice 'services'. — lib/features/activity/presentation/widgets/decision_fault_card.dart:33
`_Row` (slice 'activity') depends on `ServiceQueueItem` from slice 'services'. — lib/features/activity/presentation/widgets/download_table.dart:368
`EveryoneRequestRow` (slice 'activity') depends on `MyRequest` from slice 'requests'. — lib/features/activity/presentation/widgets/everyone_request_row.dart:30
`ReportedProblemsCard` (slice 'activity') depends on `DashboardDecision` from slice 'services'. — lib/features/activity/presentation/widgets/reported_problems_card.dart:37
`_IssueLine` (slice 'activity') depends on `DashboardDecision` from slice 'services'. — lib/features/activity/presentation/widgets/reported_problems_card.dart:142
`SonarrWantedHierarchy` (slice 'activity') depends on `SonarrService` from slice 'series'. — lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart:17
`_SeriesExpansionTile` (slice 'activity') depends on `SonarrService` from slice 'series'. — lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart:89
`_SeasonExpansionTile` (slice 'activity') depends on `SonarrService` from slice 'series'. — lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart:146
`_EpisodeListTile` (slice 'activity') depends on `SonarrService` from slice 'series'. — lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart:214
`StorageAlertCard` (slice 'activity') depends on `DashboardDecision` from slice 'services'. — lib/features/activity/presentation/widgets/storage_alert_card.dart:53
`ViolationDecisionRow` (slice 'activity') depends on `DashboardDecision` from slice 'services'. — lib/features/activity/presentation/widgets/violation_rows.dart:110
`CalendarKind` (slice 'discover') depends on `ServiceKey` from slice 'settings'. — lib/features/discover/domain/library_calendar.dart:30
`CalendarMediaTarget` (slice 'discover') depends on `MediaKey` from slice 'media'. — lib/features/discover/domain/library_calendar.dart:180
`CalendarShelfTarget` (slice 'discover') depends on `ServiceKey` from slice 'settings'. — lib/features/discover/domain/library_calendar.dart:198
`CalendarReading` (slice 'discover') depends on `ServiceKey` from slice 'settings'. — lib/features/discover/domain/library_calendar.dart:540
`SeerrArrServer` (slice 'discover') depends on `ServiceKey` from slice 'settings'. — lib/features/discover/domain/seerr_arr_server.dart:63
`SeerrApproveTarget` (slice 'discover') depends on `ServiceKey` from slice 'settings'. — lib/features/discover/domain/seerr_arr_server.dart:303
`SeerrInvite` (slice 'discover') depends on `ConnectionAccess` from slice 'settings'. — lib/features/discover/domain/seerr_invite.dart:99
`SeerrBoundCopy` (slice 'discover') depends on `ServiceKey` from slice 'settings'. — lib/features/discover/domain/seerr_media_copy.dart:90
`_TitleRow` (slice 'discover') depends on `SearchTitle` from slice 'search'. — lib/features/discover/presentation/discover_page.dart:490
`_SilentSource` (slice 'discover') depends on `GlobalSearchServiceResults` from slice 'search'. — lib/features/discover/presentation/discover_page.dart:590
`_AlbumRow` (slice 'discover') depends on `LidarrAlbum` from slice 'music'. — lib/features/discover/presentation/more_from_your_artists_page.dart:169
`SearchRowSetUp` (slice 'discover') depends on `ServiceKey` from slice 'settings'. — lib/features/discover/presentation/widgets/search_row.dart:69
`FeaturedArrival` (slice 'home') depends on `ArrHistoryEntry` from slice 'services'. — lib/features/home/domain/featured.dart:80
`StoragePool` (slice 'home') depends on `ServiceKey` from slice 'settings'. — lib/features/home/domain/storage.dart:41
`ArrivedCard` (slice 'home') depends on `ArrHistoryEntry` from slice 'services'. — lib/features/home/presentation/widgets/arrived_module.dart:236
`_WhoAreYou` (slice 'home') depends on `ServiceKey` from slice 'settings'. — lib/features/home/presentation/widgets/continue_watching_module.dart:347
`DownloadRow` (slice 'home') depends on `ServiceQueueItem` from slice 'services'. — lib/features/home/presentation/widgets/downloads_module.dart:334
`_StuckRemedy` (slice 'home') depends on `ServiceQueueItem` from slice 'services'. — lib/features/home/presentation/widgets/downloads_module.dart:511
`_HealthDot` (slice 'home') depends on `StackHealth` from slice 'shell'. — lib/features/home/presentation/widgets/home_header.dart:156
`HomeCoverageNote` (slice 'home') depends on `SourceCoverage` from slice 'services'. — lib/features/home/presentation/widgets/home_module_parts.dart:71
`NowPlayingRow` (slice 'home') depends on `StreamActivityRow` from slice 'stream'. — lib/features/home/presentation/widgets/now_playing_module.dart:140
`_PersonDisc` (slice 'home') depends on `StreamActivityRow` from slice 'stream'. — lib/features/home/presentation/widgets/now_playing_module.dart:242
What to do
Keep slices independent: share cross-slice needs via an explicit contract/shared-kernel, not direct references between slices.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Do you agree with this assessment?
DM4 · Rich vs anemic domain model10.0 / 10Exemplary✓ Tool-verified
Other · Domain Modelling — Whether domain entities own their behaviour — a data-only entity with public mutable state whose logic lives in a foreign service is anemic. Rich models enforce their own invariants; an immutable `@freezed`/`@immutable` value class is rich by construction.
Method: Roslyn (DDD-gated): entity method BODIES classified mutator-vs-query — only methods that mutate the entity's own declared state count as invariant-protecting behaviour, so a getter/passthrough doesn't rescue an anemic class. Deterministic, exhaustive over domain-layer entities.
Coverage: Population: entities by name/base convention; rich-vs-anemic judged by classifying each method body mutator-vs-query — logic-bearing domain types outside the convention are invisible.
Other · Domain Modelling — Whether an entity protects its own invariants — a class whose identity is derived from its fields (value equality) but whose fields are publicly mutable bypasses that invariant. Encapsulated state keeps identity-bearing fields immutable.
Method: Roslyn (DDD-gated): entities scanned for publicly writable state — public setters, and (C#/VB) own mutable collections handed out through an auto-property, a public field or a bare-field expression getter, where a computed/copying getter is never charged. One finding per entity; score softened when Marten/EF rehydration frameworks present. Deterministic, framework-aware.
Coverage: Population: entities by convention; encapsulation (setter shape) checked exhaustively within the set.
Other · Code Health — Unreviewed-generation residue in this repository's Dart: methods whose whole body still throws UnimplementedError or a "not implemented" error, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
A placeholder string ("admin@example.com / changeme login. If i…") is still in shipped code — typical of generated boilerplate that was never filled in. — lib/features/npm/presentation/npm_screen.dart:537
What to do
Finish or delete the methods that still throw UnimplementedError, and replace placeholder text before shipping.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Dart: methods that only throw UnimplementedError or a "not implemented" exception, methods that take inputs and return a constant or do nothing, dead `if (false)` branches, and skeleton classes most of whose methods are holes.
Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.
`setFocusPoint`'s body only throws an UnsupportedError or an UnimplementedError that gives its reason — sometimes a deliberate refusal, often an unfinished stub. Confirm it's intentional. — packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:426
What to do
Clear the softer debt: re-enable or delete tests marked `skip:`, decide whether each empty method or UnsupportedError is deliberate (and say so in a comment), and replace `// ignore_for_file: type=lint` with targeted, justified ignores.
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.
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 an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability1.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
No logging call was found in the 1211 JavaScript/TypeScript, Dart, JVM, Swift production file(s) this check read across 10 module(s). Each was searched for its ecosystem's logging libraries (JVM: SLF4J, Log4j2, java.util.logging, Logback, kotlin-logging, scala-logging; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger; Swift: os.Logger/os_log/NSLog, swift-log, CocoaLumberjack, SwiftyBeaver, XCGLogger; Dart: package:logging, package:logger, dart:developer's log()) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.
What to do
Adopt `package:logging` (or `package:logger`) and log at meaningful points in the apps and servers you run.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add the Dart analyzer's security lints plus `semgrep --config=auto` as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — .github/workflows/ci.yml:6
`REDACTED` schedules updates, but no `package-ecosystem` entry covers `npm`, `gradle`, 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:4
What to do
Add a SAST step to CI running what this repository's stack ships: the Dart analyzer's security lints plus `semgrep --config=auto` — so a security regression fails the build instead of landing.
Dependabot is configured but does not watch `npm`, `gradle` — add those `package-ecosystem` entries to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
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.
Do you agree with this assessment?
P5 · DR & Backup7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.
Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.
What to do
Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).
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.
Other · Security — Read from this repository's Dart source: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS certificate validation — facts about code that hold whether or not it serves anything itself. The TLS protocol version is not read: `dart:io` leaves the protocol floor to the platform's TLS library and has no switch that admits an obsolete version. This repository commits the configuration that serves its own HTTP surface, so that configuration was read in full for the security response headers it sets. This repository serves HTTP itself (lib/features/pairing/data/pair_server.dart:100 — `HttpServer.bind(`), so its Dart source was also read for the server controls: TLS served or HSTS set, security response headers, cookie flags and inbound validation — each credited where its Dart spelling appears in production source, not proven on every route.
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.
`onBadCertificate` returning `true` is set on a TLS client, so every peer certificate is accepted — including one an attacker presents. Chain, expiry, revocation and hostname are all skipped, so an attacker on the network path can present any certificate and read or rewrite the traffic — the connection is encrypted to the attacker, not to the intended host. Remove the callback so `dart:io` validates the peer. If the server presents a self-signed or privately-issued certificate, trust THAT issuer rather than every certificate: load its CA into a `SecurityContext` (`setTrustedCertificatesBytes`) and pass it as `HttpClient(context: …)` / `SecureSocket.connect(…, context: …)`, which keeps the chain and hostname checks on. A callback that must exist should compare the presented certificate with a pinned fingerprint, never return `true`. — lib/core/network/cert_trust.dart:137
This repository runs an HTTP server that is not bound to the loopback interface alone — or binds it at an address its source does not spell out — and nothing in its Dart source secures the transport: no `HttpServer.bindSecure` or `securityContext:`, no `Strict-Transport-Security` header, no `X-Forwarded-Proto` read from a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: lib/features/pairing/data/pair_server.dart:100 — `HttpServer.bind(`.
No handler of this repository's Dart server answers 400, 413 or 422 (`Response.badRequest`, `HttpStatus.badRequest`, `statusCode = 400`) and no validation package (luthor, acanthis, ez_validator, json_schema, …) is imported — nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (−2.0 on this card.) The server: lib/features/pairing/data/pair_server.dart:100 — `HttpServer.bind(`.
What to do
Stop accepting every TLS certificate: delete the `badCertificateCallback` / `onBadCertificate` / `validateCertificate` that returns `true` so the chain, hostname and expiry are verified, and trust a self-signed or private server by loading its CA into a `SecurityContext` — never by switching verification off.
Secure the server's transport: serve TLS itself (`HttpServer.bindSecure(…, context)`, or `shelf_io.serve(…, securityContext: context)`), or run it behind a TLS-terminating proxy and check `X-Forwarded-Proto`; send `Strict-Transport-Security` once it is HTTPS-only. A server only this device needs to reach should bind `InternetAddress.loopbackIPv4` instead.
Validate what the server reads from a request — path, query, headers, body size and shape — and answer what fails with 400 (413 for an oversized body) before a handler acts on it, so a client and a proxy can tell a refusal from a success.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
This function unwraps IPv4-MAPPED IPv6 (`[10] == 0xff`, line 91) and then rejects `10.0.0.0/8` on its IPv4 path — but the IPv6 decision at line 86 classifies the address as written, and IPv4 reaches IPv6 through three MORE embeddings this function never mentions: IPv4-compatible (`::a.b.c.d`), 6to4 (`2002::/16`) and NAT64 (`64:ff9b::/96`). So `::10.0.0.1`, `2002:0a00:0001::` and `64:ff9b::10.0.0.0` all name a host inside `10.0.0.0/8` — the range this same function declares non-public — and all reach the IPv6 decision un-unwrapped, taking the opposite verdict. Unwrap every embedding to its IPv4 form before classifying, or reject any IPv6 address carrying an embedded IPv4 outright. — lib/core/network/local_network_target.dart:86
What to do
Each finding names the IPv4 branch that rejects the host and the IPv6 branch that accepts the same host in another notation. Confirm from the two, then unwrap every IPv4-in-IPv6 embedding before classifying, or reject non-native IPv6 outright.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document1.8 / 10Critical✓ Tool-verified
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
`TrueNasDataset.fromJson` is public and takes `Map<String, dynamic> json` from its caller, and it calls itself at line 74 (`TrueNasDataset.fromJson`) with a piece of `json` — and nowhere in `TrueNasDataset.fromJson` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `TrueNasDataset.fromJson` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — lib/features/truenas/domain/models/dataset.dart:74
`qbittorrentRssFeedsFromJson` is public, takes a document from its caller (line 79) and hands it to `visit`, which calls itself at line 108 (`visit`) with a piece of `node` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — lib/features/qbittorrent/domain/models/rss.dart:108
`sonarrCutoffResolution` is public, takes a document from its caller (line 537) and hands it to `resolution`, which calls itself at line 548 (`resolution`) with a piece of `item` — and nowhere in `resolution` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `resolution` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — lib/features/media/domain/media_series.dart:548
`formatActivityValue` is public and takes `dynamic value` from its caller, and it calls itself at line 231 (`formatActivityValue`) with a piece of `value` — and nowhere in `formatActivityValue` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `formatActivityValue` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — lib/features/activity/presentation/widgets/activity_formatters.dart:231
`unwrapFailure` is public and takes `Object ? error` from its caller, and it calls itself at line 534 (`unwrapFailure`) with a piece of `error` — and nowhere in `unwrapFailure` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `unwrapFailure` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — lib/core/network/connection_failure.dart:534
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
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.
`MobileScannerWeb` carries a disposal duty — it declares its own release — and it creates `_barcodesController` itself (line 51, `StreamController.broadcast`), which makes that instance its own. Nothing in the class releases it — no `_barcodesController.close()`, no tear-off of it, on any path — nothing elsewhere in the library releases it through another instance, and it is never handed on as a value (passed positionally, returned, stored, collected), so no other owner can be ending it. Passing it as a named argument does not: a widget or animation never disposes a controller it was given. On what was read, `StreamController.broadcast` outlives the object that made it — its listeners, and through them this object and everything it references, stay reachable, and a ticker, timer or subscription keeps calling into a disposed object. Release it where the duty is discharged: `_barcodesController.close();` in `dispose()` before `super.dispose()`. — packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:51
`MobileScannerWeb` carries a disposal duty — it declares its own release — and it creates `_settingsController` itself (line 66, `StreamController.broadcast`), which makes that instance its own. Nothing in the class releases it — no `_settingsController.close()`, no tear-off of it, on any path — nothing elsewhere in the library releases it through another instance, and it is never handed on as a value (passed positionally, returned, stored, collected), so no other owner can be ending it. Passing it as a named argument does not: a widget or animation never disposes a controller it was given. On what was read, `StreamController.broadcast` outlives the object that made it — its listeners, and through them this object and everything it references, stay reachable, and a ticker, timer or subscription keeps calling into a disposed object. Release it where the duty is discharged: `_settingsController.close();` in `dispose()` before `super.dispose()`. — packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:66
What to do
Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
Other · Code Health — Whether functions that make a cancellable request accept or pass on an AbortSignal or a CancelToken (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 7/27 functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http; Dio, AbortableRequest) accept an AbortSignal or a CancelToken or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a `signal` (Dart: `CancelToken? cancelToken`) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
`text` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — website/scripts/indexnow.mjs:18
`_query` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/unraid/data/unraid_client.dart:208
`_call` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. (×2) — lib/features/transmission/data/transmission_client.dart:276, lib/features/nzbget/data/nzbget_client.dart:88
`checkPlex` calls `dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/tracearr/data/tracearr_owner_client.dart:399
`_knockOnce` calls `dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/settings/data/route_knock.dart:223
`_call` calls `_dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/sabnzbd/data/sabnzbd_client.dart:93
`qbittorrentCredentialMark` calls `_dio.fetch(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/qbittorrent/data/qbittorrent_client.dart:148
`_doAuthenticate` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/qbittorrent/data/qbittorrent_client.dart:276
`getVersion` calls `_dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/qbittorrent/data/qbittorrent_client.dart:412
`post` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. (×2) — lib/features/qbittorrent/data/qbittorrent_client.dart:433, lib/core/api/api_client.dart:204
`_login` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/npm/data/npm_client.dart:476
`_request` calls `_dio.request(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/npm/data/npm_client.dart:553
`createPin` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/discover/data/plex_tv_client.dart:42
`authTokenOf` calls `_dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/discover/data/plex_tv_client.dart:56
`_askWhoAmI` calls `_dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/features/discover/data/seerr_session.dart:390
`gatewayAtUpgrade` calls `dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/core/network/upgrade_gateway.dart:24
`put` calls `_dio.put(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/core/api/api_client.dart:220
`patch` calls `_dio.patch(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`. — lib/core/api/api_client.dart:228
What to do
Thread an AbortSignal or a CancelToken through functions that make requests, so the work stops when its caller gives up.
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 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?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen. Whether a `for … in` loop leaves the `List`, `Map` or `Set` it is walking alone — Dart's collection iterators check that the collection has not changed since the loop began, so a body that adds to or removes from the very collection the loop is walking (or the map whose `keys`, `values` or `entries` it walks) makes the next step throw `ConcurrentModificationError` and the remaining elements are never seen. Whether a `for (x in c)` or `c.forEach { … }` leaves the collection it is walking alone — a `mutableListOf`/`ArrayList`, `mutableMapOf`/`HashMap` or `mutableSetOf`/`HashSet` is a `java.util` collection on the JVM and is walked by its own fail-fast iterator, so a body that adds to or removes from the very collection the loop is walking makes the next step throw `ConcurrentModificationException` and the remaining elements are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
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.
`on Object catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×4) — packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:204, packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:359, packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:391, …
`on Object` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — packages/mobile_scanner/lib/src/web/barcode_detector/barcode_detector_js.dart:13
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. (×5) — packages/mobile_scanner/darwin/mobile_scanner/Sources/mobile_scanner/MobileScannerPlugin.swift:578, lib/features/truenas/presentation/truenas_hub_screen.dart:77, lib/features/services/presentation/service_all_screens.dart:52, …
`catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — packages/mobile_scanner/android/src/main/kotlin/dev/steenbakker/mobile_scanner/MobileScanner.kt:646
`catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — macos/Runner/MainFlutterWindow.swift:359
`catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×28) — lib/features/truenas/presentation/truenas_capability.dart:45, lib/features/truenas/presentation/truenas_capability.dart:51, lib/features/truenas/presentation/dashboard/truenas_dashboard_screen.dart:248, …
What to do
Swallowed exception (caught, then discarded)
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 Dart's sound null safety is on and is not undermined by null assertions — a package whose `environment: sdk:` lower bound is 2.12 or above is null safe, so `String` cannot hold null and `String?` must be checked before use, and each postfix `!` is a run-time `Null check operator used on a null value` the author has told the analyzer cannot happen.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 15 of 55 WCAG 2.2 Level A/AA success criteria (27%; ≈30% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 40 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 — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X6 Hand-rolled structured-format parsing — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 18 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not included — 55 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.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No class in this Kotlin code is a Spring, JSR-330 or CDI singleton bean. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. No Swift request handler (a Vapor, Hummingbird, Kitura, Swifter or Perfect route handler, as a method or a registered closure) is declared, so no state is shared between request threads. Dart isolates share no mutable memory, so no two requests write one object at the same instant. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX4 Dependency direction — not applicable to a vertical-slice architecture (the inward-dependency rule is for layered/clean styles)
AX8 Test isolation — no test/production split to check
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — compose up failed (exit 18 — an image could not be pulled) — readarr Pulling nzbget Pulling sabnzbd Pulling sabnzbd Error Get "https://lscr.io/v2/": Forbidden nzbget Error context canceled readarr Error context canceled Error response from daemon: Get "https://lscr.io/v2/": Forbidden; the earlier `compose pull` step reported: readarr Pulling nzbget Pulling sabnzbd Pulling sabnzbd Error Get "https://lscr.io/v2/": Forbidden nzbget Error context canceled readarr Error context canceled Error response from daemon: Get "https://lscr.io/v2/": Forbidden; the runtime sandbox reaches registries only through the in-fence pull-through mirror, so an image the mirror does not carry cannot be fetched — this is a limit of our sandbox, not of your stack; 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.
C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Drift table, an Isar, ObjectBox, Floor or Hive entity, or a Serverpod table model — and no database or data-store client (sqflite, Drift, Isar, Hive, Realm, Firestore, Supabase, postgres, …) in the source either, so this repository keeps no data at rest for these controls to protect.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository stands up no server another machine can reach (no HttpServer or shelf server bound beyond loopback, no dart_frog route, no Serverpod endpoint, no Conduit, Alfred or Angel application) and keeps no data in a hosted backend. Access control is therefore N/A here — a Flutter app or pub package is authorized by the server it calls, not by itself; hiding a screen authorizes nothing. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Drift table, an ObjectBox/Floor @Entity, an Isar @collection, a Hive @HiveType or a Serverpod table model — and no database or data-store client (sqflite, Firestore, Supabase, postgres, …) imported either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a hosted backend configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Drift table, an ObjectBox/Floor @Entity, an Isar @collection, a Hive @HiveType or a Serverpod table model — and no database or data-store client (sqflite, Firestore, Supabase, postgres, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Drift table, an ObjectBox/Floor @Entity, an Isar @collection, a Hive @HiveType or a Serverpod table model — and no database or data-store client (sqflite, Firestore, Supabase, postgres, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~314714 lines of test source are present (.dart, .py) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — no .dart test runner
D12 Dependency Hygiene — Not scored — 4 Maven/Gradle manifest(s) were read, stating a version for 5 dependency(ies) and leaving 0 to a parent or an imported BOM, but no build resolved the dependency graph, so the outdated signal was not established. NOT a finding that these dependencies are current or healthy.
D16 Bus Factor — bus factor 1 — one contributor carries this repository
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 — API consistency is measured on C#, TypeScript, Go only; the exposed Swift surface was not measured.
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 .dart, .kt, .py, .swift source were not judged.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.dart), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — 4 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
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
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Aggregate boundaries — no aggregates detected — aggregate-boundary check not applicable
DM2 Strongly-typed ids — no in-repo typed-id idiom — primitive-obsession recorded as advisory DM8, DM2 not gated
DM3 Integration-event coupling — no integration events detected — coupling check not applicable
DM6 Domain ↔ infrastructure boundary — this Dart repository maps no type to a persistence framework (drift/floor/isar/objectbox/hive), so DM6's domain↔infrastructure fusion read has no population to be taken over
DM7 Repository granularity — no repository abstraction detected (e.g. uses a document session)
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and this analysis resolves a call's owner only where the receiver's type is written down in the source. Reported as guidance rather than measured
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, which this analysis does not build from source alone for this language. Reported as guidance rather than measured
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Dart, JVM, JavaScript/TypeScript, Python, Swift source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for classes extending benchmark_harness's `BenchmarkBase`, `AsyncBenchmarkBase` or `PerfBenchmarkBase` (directly or through a base of your own), `benchmark(…)` calls under the pub `benchmark` package, Flutter's `benchmarkWidgets`, `watchPerformance` or `traceAction` in a test importing flutter_test, integration_test or flutter_driver, or benchmark_harness, benchmark or web_benchmarks in a pubspec.yaml, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
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
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
X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X24 Document value interpolated into markup unescaped — X24 reached only 2% of this repository's production lines — dart (286,623 lines), swift (2,127 lines), kotlin (1,701 lines), cpp (493 lines), c (148 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Dart was read, and it logs through none: package:logging, package:logger, talker and dart:developer take one finished message and no template arguments or fields (as log4net does in C#), so an interpolated message there loses nothing the API could have kept. Sentry's structured logs (`Sentry.logger`) would be judged.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
Captive dependency: keepAlive provider releaseSearchReachResolverProvider captures autoDispose releaseSearchReachProvider lib/features/release_search/presentation/release_search_entry.dart:274— `releaseSearchReachResolverProvider` is a keep-alive Riverpod provider and calls `ref.read(releaseSearchReachProvider…)`, which is declared auto-dispose (lib/features/release_search/presentation/release_search_entry.dart:61). Read in build, `releaseSearchReachProvider` has no listener once the read returns, so it is disposed at once — its ref.onDispose closes what it handed out — while `releaseSearchReachResolverProvider` keeps that value for the life of the ProviderContainer. Mark `releaseSearchReachProvider` keepAlive too, make `releaseSearchReachResolverProvider` auto-dispose, or read it per use outside build.
Captive dependency: keepAlive provider releaseSearchRunnerProvider captures autoDispose releaseSearchTransportProvider lib/features/release_search/presentation/release_search_entry.dart:293— `releaseSearchRunnerProvider` is a keep-alive Riverpod provider and calls `ref.read(releaseSearchTransportProvider…)`, which is declared auto-dispose (lib/features/release_search/presentation/release_search_entry.dart:159). Read in build, `releaseSearchTransportProvider` has no listener once the read returns, so it is disposed at once — its ref.onDispose closes what it handed out — while `releaseSearchRunnerProvider` keeps that value for the life of the ProviderContainer. Mark `releaseSearchTransportProvider` keepAlive too, make `releaseSearchRunnerProvider` auto-dispose, or read it per use outside build.
Captive dependency: keepAlive provider bestMissingProvider captures autoDispose seerrNumberingProvider lib/features/discover/presentation/catalog_providers.dart:37— `bestMissingProvider` is a keep-alive Riverpod provider and calls `ref.watch(seerrNumberingProvider…)`, which is declared auto-dispose (lib/features/discover/presentation/discover_details_provider.dart:33). The keep-alive provider listens to it for the life of the ProviderContainer, so `seerrNumberingProvider` is never disposed — the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark `seerrNumberingProvider` keepAlive too, make `bestMissingProvider` auto-dispose, or read it per use outside build.
Captive dependency: keepAlive provider catalogHideOwnedProvider captures autoDispose seerrServerFactsProvider lib/features/discover/presentation/catalog_providers.dart:286— `catalogHideOwnedProvider` is a keep-alive Riverpod provider and calls `ref.watch(seerrServerFactsProvider…)`, which is declared auto-dispose (lib/features/discover/data/seerr_accounts.dart:255). The keep-alive provider listens to it for the life of the ProviderContainer, so `seerrServerFactsProvider` is never disposed — the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark `seerrServerFactsProvider` keepAlive too, make `catalogHideOwnedProvider` auto-dispose, or read it per use outside build.
Captive dependency: keepAlive provider atriumShelfKeeperProvider captures autoDispose seerrNumberingProvider lib/features/discover/presentation/catalog_providers.dart:318— `atriumShelfKeeperProvider` is a keep-alive Riverpod provider and calls `ref.watch(seerrNumberingProvider…)`, which is declared auto-dispose (lib/features/discover/presentation/discover_details_provider.dart:33). The keep-alive provider listens to it for the life of the ProviderContainer, so `seerrNumberingProvider` is never disposed — the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark `seerrNumberingProvider` keepAlive too, make `atriumShelfKeeperProvider` auto-dispose, or read it per use outside build.
Captive dependency: keepAlive provider completeTheCollectionProvider captures autoDispose seerrNumberingProvider lib/features/discover/presentation/library_shelves_provider.dart:85— `completeTheCollectionProvider` is a keep-alive Riverpod provider and calls `ref.watch(seerrNumberingProvider…)`, which is declared auto-dispose (lib/features/discover/presentation/discover_details_provider.dart:33). The keep-alive provider listens to it for the life of the ProviderContainer, so `seerrNumberingProvider` is never disposed — the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark `seerrNumberingProvider` keepAlive too, make `completeTheCollectionProvider` auto-dispose, or read it per use outside build.
Captive dependency: keepAlive provider completeTheCollectionProvider captures autoDispose collectionDetailProvider lib/features/discover/presentation/library_shelves_provider.dart:87— `completeTheCollectionProvider` is a keep-alive Riverpod provider and calls `ref.watch(collectionDetailProvider…)`, which is declared auto-dispose (lib/features/discover/presentation/discover_details_provider.dart:61). The keep-alive provider listens to it for the life of the ProviderContainer, so `collectionDetailProvider` is never disposed — the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark `collectionDetailProvider` keepAlive too, make `completeTheCollectionProvider` auto-dispose, or read it per use outside build.
AC4 · Keyboard semantics· Clickable element isn't keyboard-operable · ×4
Clickable element isn't keyboard-operable design/system/motion/ServicePortalPhysics/preview.html:34— The repo's own CSS styles .cp-nav-item with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
Clickable element isn't keyboard-operable design/system/motion/ServicePortalPhysics/preview.html:35— The repo's own CSS styles .cp-nav-item with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
Clickable element isn't keyboard-operable design/system/motion/ServicePortalPhysics/preview.html:36— The repo's own CSS styles .cp-nav-item with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
Clickable element isn't keyboard-operable design/system/motion/ServicePortalPhysics/preview.html:37— The repo's own CSS styles .cp-nav-item with `cursor: pointer`, so this <span> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
AC1 · Text alternatives· <svg role="img"> without an accessible name · ×1
<svg role="img"> without an accessible name design/system/motion/ServiceRingMotion/preview.html— An svg presented as an image needs a name — add a <title> child or an aria-label/aria-labelledby.
AC2 · Forms & labels· <button> with no accessible text · ×1
<button> with no accessible text design/system/motion/ReelLine/preview.html:32— A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one).
AC5 · ARIA correctness· aria-hidden hides a focusable element · ×1
aria-hidden hides a focusable element design/system/motion/PosterFlight/preview.html:23— aria-hidden="true" here hides the subtree from assistive tech, but a focusable descendant stays in the tab order — a keyboard user can land on a control screen readers can't see. Add inert, take the descendants out of the tab order (tabindex="-1"), or drop aria-hidden.
TLS certificate validation disabled lib/core/network/cert_trust.dart:137— `onBadCertificate` returning `true` is set on a TLS client, so every peer certificate is accepted — including one an attacker presents. Chain, expiry, revocation and hostname are all skipped, so an attacker on the network path can present any certificate and read or rewrite the traffic — the connection is encrypted to the attacker, not to the intended host. Remove the callback so `dart:io` validates the peer. If the server presents a self-signed or privately-issued certificate, trust THAT issuer rather than every certificate: load its CA into a `SecurityContext` (`setTrustedCertificatesBytes`) and pass it as `HttpClient(context: …)` / `SecureSocket.connect(…, context: …)`, which keeps the chain and hostname checks on. A callback that must exist should compare the presented certificate with a pinned fingerprint, never return `true`.
Repeated repair: lib/features/nzbget/presentation/nzbget_screen.dart lib/features/nzbget/presentation/nzbget_screen.dart:184— lib/features/nzbget/presentation/nzbget_screen.dart changed 28 times in last 90 days and 21 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is _NzbgetActionsBar.build at line 184), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day”; “fix(clients): under the stale band, the rail's rates read a dash”; “fix(clients): a download queue that stopped coming back says how old it is”; “fix(clients): Stop follows Stopped, queues say Queue, Set up X comes back”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/nzbget/presentation/nzbget_screen.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/activity/presentation/widgets/activity_item_tiles.dart lib/features/activity/presentation/widgets/activity_item_tiles.dart:883— lib/features/activity/presentation/widgets/activity_item_tiles.dart changed 34 times in last 90 days and 20 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is _DesktopActivityRowState.build at line 883), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(activity): a decision on a request is the operator's, named as the gate says”; “fix(activity): a wanted date reads Tue 29 Sep, not 2026-09-29”; “fix(tone): the green scheme role is a tone, and names state no status”; “fix(activity): a protocol and a date are plain chips, not a status tone”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/activity/presentation/widgets/activity_item_tiles.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/sabnzbd/presentation/sabnzbd_screen.dart lib/features/sabnzbd/presentation/sabnzbd_screen.dart:194— lib/features/sabnzbd/presentation/sabnzbd_screen.dart changed 27 times in last 90 days and 20 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is _SabnzbdActionsBar.build at line 194), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day”; “fix(clients): under the stale band, the rail's rates read a dash”; “fix(clients): a download queue that stopped coming back says how old it is”; “fix(clients): Stop follows Stopped, queues say Queue, Set up X comes back”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/sabnzbd/presentation/sabnzbd_screen.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/core/network/connection_failure.dart lib/core/network/connection_failure.dart:310— lib/core/network/connection_failure.dart changed 29 times in last 90 days and 19 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is UnexpectedAnswer.isWebPage at line 310), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(qbittorrent): a 401 at sign-in is a refused address, not a wrong password”; “fix(testlab): isolate the seeded app and harden the lab's control paths”; “fix(connections): a port that never spoke https is named, whatever its handshake did”; “fix(connections): https on an http port says so, and a certificate stays to be trusted”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/core/network/connection_failure.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/settings/data/service_verification.dart lib/features/settings/data/service_verification.dart:246— lib/features/settings/data/service_verification.dart changed 34 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is ServiceDiagnosis.withFinding at line 246), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(qbittorrent): a 401 at sign-in is a refused address, not a wrong password”; “fix(connections): a port that never spoke https is named, whatever its handshake did”; “fix(connections): https on an http port says so, and a certificate stays to be trusted”; “fix(connections): at home is decided by a local address, and a row names its connection”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/settings/data/service_verification.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/npm/presentation/npm_screen.dart lib/features/npm/presentation/npm_screen.dart:873— lib/features/npm/presentation/npm_screen.dart changed 31 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is _CertificateTile.build at line 873), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day”; “fix(npm): route the advanced block, skip loopback upstreams, one host row”; “fix(services): the six services as the lab found them”; “fix(copy): a wrapped line never starts with the dot, and MB/s stays whole”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/npm/presentation/npm_screen.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/core/status/lexicon.dart lib/core/status/lexicon.dart:329— lib/core/status/lexicon.dart changed 29 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is Lexicon.inline at line 329), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(sonarr): an episode with no air date is neither aired nor Missing”; “fix(words): a paused playback reads Paused, and Bazarr counts its wanted once”; “fix(requester): the line says when the server stopped answering, or no time”; “fix(copy): the app writes American English”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/core/status/lexicon.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/transmission/presentation/transmission_screen.dart lib/features/transmission/presentation/transmission_screen.dart:379— lib/features/transmission/presentation/transmission_screen.dart changed 24 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is _TorrentMenu.build at line 379), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day”; “fix(clients): under the stale band, the rail's rates read a dash”; “fix(clients): a download queue that stopped coming back says how old it is”; “fix(services): the six services as the lab found them”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/transmission/presentation/transmission_screen.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/shell/presentation/desktop/inspector_pane.dart lib/features/shell/presentation/desktop/inspector_pane.dart:27— lib/features/shell/presentation/desktop/inspector_pane.dart changed 22 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is InspectorPane.build at line 27), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(activity): the desktop inspector reads its queue and history again while open”; “fix(desktop): the inspector does not say nothing downloads beside a stuck torrent”; “fix(desktop): the inspector's header buttons keep the pointer floor”; “fix(design): spacing and radius in the shell chrome sit on the scale”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/shell/presentation/desktop/inspector_pane.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/activity/presentation/activity_provider.dart lib/features/activity/presentation/activity_provider.dart:145— lib/features/activity/presentation/activity_provider.dart changed 30 times in last 90 days and 17 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 2 (its worst body is ActivityServiceResult.reached at line 145), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(copy): a wrapped line never starts with the dot, and MB/s stays whole”; “fix(activity): Stuck waits for the client's own thirty minutes”; “fix(activity): a decision on a request is the operator's, named as the gate says”; “fix(activity): a download is matched to its movie or episode the same way as on home”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/activity/presentation/activity_provider.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/qbittorrent/presentation/torrent_detail_screen.dart lib/features/qbittorrent/presentation/torrent_detail_screen.dart:336— lib/features/qbittorrent/presentation/torrent_detail_screen.dart changed 29 times in last 90 days and 17 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is _InfoTab._editTags at line 336), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(qbittorrent): a torrent's page keeps its frame while loading, failed or gone”; “fix(clients): Stop follows Stopped, queues say Queue, Set up X comes back”; “fix(copy): a wrapped line never starts with the dot, and MB/s stays whole”; “fix(chrome): every top bar is the glass bar”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/qbittorrent/presentation/torrent_detail_screen.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/services/domain/dashboard_decision.dart lib/features/services/domain/dashboard_decision.dart:376— lib/features/services/domain/dashboard_decision.dart changed 29 times in last 90 days and 16 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 1 (its worst body is DashboardDecision.isFault at line 376), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(needs-you): a failed download is the arr's, and a held release says when it goes”; “fix(services): the six services as the lab found them”; “fix(copy): a wrapped line never starts with the dot, and MB/s stays whole”; “fix(home): Needs you says connections that failed alike once”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/services/domain/dashboard_decision.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/unraid/presentation/unraid_screen.dart lib/features/unraid/presentation/unraid_screen.dart:131— lib/features/unraid/presentation/unraid_screen.dart changed 27 times in last 90 days and 16 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 15 (its worst body is _UnraidSection.build at line 131), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(unraid): containers and figures on Unraid 7.2 and later, with CPU and memory”; “fix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day”; “fix(services): the six services as the lab found them”; “fix(copy): a wrapped line never starts with the dot, and MB/s stays whole”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/unraid/presentation/unraid_screen.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/services/presentation/service_all_screens.dart lib/features/services/presentation/service_all_screens.dart:38— lib/features/services/presentation/service_all_screens.dart changed 27 times in last 90 days and 16 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is ServiceAllRequestsScreen.build at line 38), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(chrome): every top bar is the glass bar”; “fix(copy): the app writes American English”; “fix(copy): the app says "Could not", never "Couldn't"”; “fix(seerr): Resolve on an issue goes through the role gate”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/services/presentation/service_all_screens.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/core/widgets/app_error_state.dart lib/core/widgets/app_error_state.dart:143— lib/core/widgets/app_error_state.dart changed 19 times in last 90 days and 16 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 6 (its worst body is AppErrorState._detail at line 143), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(failure-lines): one beside-or-under layout, and no sentence cut at 200%”; “fix(failure): a household member reads one line with its time, never a cause”; “fix(network): a read caught by a settings change reads again, never an outage”; “fix(ui): a web page answering for a service reads the same everywhere, as the wrong address”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/core/widgets/app_error_state.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/settings/domain/connection_presentation.dart lib/features/settings/domain/connection_presentation.dart:170— lib/features/settings/domain/connection_presentation.dart changed 24 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 1 (its worst body is FailurePresentation.didNotAnswer at line 170), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(qbittorrent): a 401 at sign-in is a refused address, not a wrong password”; “fix(security): close credential replay and pairing trust gaps”; “fix(connections): a port that never spoke https is named, whatever its handshake did”; “fix(connections): https on an http port says so, and a certificate stays to be trusted”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/settings/domain/connection_presentation.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/core/widgets/download_queue_tile.dart lib/core/widgets/download_queue_tile.dart:148— lib/core/widgets/download_queue_tile.dart changed 21 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is DownloadQueueTile.build at line 148), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(clients): a stale row says it is not updating, and draws no rates”; “fix(clients): a download queue that stopped coming back says how old it is”; “fix(clients): Stop follows Stopped, queues say Queue, Set up X comes back”; “fix(copy): a wrapped line never starts with the dot, and MB/s stays whole”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/core/widgets/download_queue_tile.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/core/theme.dart lib/core/theme.dart:1070— lib/core/theme.dart changed 25 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is AppTheme._buildTheme at line 1070), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(theme): a switch that is off can be seen, and the demo has something to hide”; “fix(theme): a transparent app bar takes the room's status bar too”; “fix(buttons): a page's primary is button-l, 52 at radius 16, as the brand book draws it”; “fix(focus): the keyboard's place is a ring, 2pt outside the control”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/core/theme.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/series/presentation/series_screen.dart lib/features/series/presentation/series_screen.dart:77— lib/features/series/presentation/series_screen.dart changed 23 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 7 (its worst body is SeriesScreen.build at line 77), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(services): the six services as the lab found them”; “fix(posters): a tile with no artwork shows what it is, not a movie clapper”; “fix(copy): a search hint is the field's own words, with no ellipsis”; “fix(arrs): a pasted token re-keys a library grid's posters at once”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/series/presentation/series_screen.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/shell/presentation/desktop/window_chrome.dart lib/features/shell/presentation/desktop/window_chrome.dart:139— lib/features/shell/presentation/desktop/window_chrome.dart changed 23 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is WindowChrome._strip at line 139), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(icons): every Symbols glyph comes from the family a release build draws”; “fix(desktop): the window strip leaves a media server's tab to its header”; “fix(copy): the app writes American English”; “fix(tone): the Close hover and the info chips wear the room's own tone”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/shell/presentation/desktop/window_chrome.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/jellyfin/presentation/jellyfin_tab_screens.dart lib/features/jellyfin/presentation/jellyfin_tab_screens.dart:362— lib/features/jellyfin/presentation/jellyfin_tab_screens.dart changed 21 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is _UserRow.build at line 362), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(stream): what the real servers showed, and a library that is the library”; “fix(stream): a media server visit stays on the connection it opened on”; “fix(stream): Jellyfin and Plex pages are read per connection, and Home no longer moves the lens”; “fix(copy): a wrapped line never starts with the dot, and MB/s stays whole”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/jellyfin/presentation/jellyfin_tab_screens.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/import/presentation/manual_import_widgets.dart lib/features/import/presentation/manual_import_widgets.dart:602— lib/features/import/presentation/manual_import_widgets.dart changed 19 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 14 (its worst body is ManualImportReviewFooter.build at line 602), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(copy): a wrapped line never starts with the dot, and MB/s stays whole”; “fix(spacing): every gap is a step of the scale”; “fix(buttons): a page's primary is button-l, 52 at radius 16, as the brand book draws it”; “fix(copy): a search hint is the field's own words, with no ellipsis”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/import/presentation/manual_import_widgets.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/dockge/presentation/dockge_stack_detail_screen.dart lib/features/dockge/presentation/dockge_stack_detail_screen.dart:326— lib/features/dockge/presentation/dockge_stack_detail_screen.dart changed 19 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 5 (its worst body is _ActionBar._confirmDelete at line 326), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day”; “fix(actions): Dockge, NPM and client actions finish after their page is gone”; “fix(copy): a failed action says "Could not", never "Failed to"”; “fix(dockge): the terminal's text is the plate's ink in both themes”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/dockge/presentation/dockge_stack_detail_screen.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/core/widgets/fault_band.dart lib/core/widgets/fault_band.dart:127— lib/core/widgets/fault_band.dart changed 16 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is FaultBand.fault at line 127), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(services): the six services as the lab found them”; “fix(health): a server reached that never replied has timed out”; “fix(clients): a failed probe is a band over the last read, an empty queue one line”; “fix(failure-lines): one beside-or-under layout, and no sentence cut at 200%”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/core/widgets/fault_band.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: lib/features/release_search/domain/release_search_job.dart lib/features/release_search/domain/release_search_job.dart:185— lib/features/release_search/domain/release_search_job.dart changed 14 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 4 (its worst body is ReleaseSearchJob.grabWindowRemaining at line 185), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(copy): a wrapped line never starts with the dot, and MB/s stays whole”; “fix(copy): the app writes American English”; “fix(format): one duration formatter, in the brand book's units”; “fix(search): a search that stopped with no verdict says so one way”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/release_search/domain/release_search_job.dart`: 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: lib/features/media/presentation/media_page.dart lib/features/media/presentation/media_page.dart:603— lib/features/media/presentation/media_page.dart changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 116 in _MediaPageState.build at line 603. 10 of those changes were fix/bug commits, and the other 45 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/media/presentation/media_page.dart`: 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: lib/demo/world/fakes/media_fakes.dart lib/demo/world/fakes/media_fakes.dart:757— lib/demo/world/fakes/media_fakes.dart changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 140 in SeerrFake.answer at line 757. 6 of those changes were fix/bug commits, and the other 38 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/demo/world/fakes/media_fakes.dart`: 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: lib/demo/world/fakes/arr_fakes.dart lib/demo/world/fakes/arr_fakes.dart:1195— lib/demo/world/fakes/arr_fakes.dart changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in SonarrFake.own at line 1195. 3 of those changes were fix/bug commits, and the other 37 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/demo/world/fakes/arr_fakes.dart`: 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: lib/features/settings/presentation/service_settings_screen.dart lib/features/settings/presentation/service_settings_screen.dart:1045— lib/features/settings/presentation/service_settings_screen.dart changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in _ServiceSettingsScreenState._buildScaffold at line 1045. 30 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/settings/presentation/service_settings_screen.dart`: 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: lib/core/widgets/media_browse_scaffold.dart lib/core/widgets/media_browse_scaffold.dart:1014— lib/core/widgets/media_browse_scaffold.dart changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in _MediaBrowseScaffoldState.build at line 1014. 20 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/core/widgets/media_browse_scaffold.dart`: 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: lib/features/services/presentation/dashboard_sections.dart lib/features/services/presentation/dashboard_sections.dart:90— lib/features/services/presentation/dashboard_sections.dart changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DecisionRow.build at line 90. 34 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/services/presentation/dashboard_sections.dart`: 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: lib/features/services/presentation/service_matrix.dart lib/features/services/presentation/service_matrix.dart:723— lib/features/services/presentation/service_matrix.dart changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ServiceMatrixCell.build at line 723. 27 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/services/presentation/service_matrix.dart`: 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: lib/features/activity/presentation/activity_page.dart lib/features/activity/presentation/activity_page.dart:531— lib/features/activity/presentation/activity_page.dart changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in _NeedsYouSectionState.build at line 531. 5 of those changes were fix/bug commits, and the other 15 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/activity/presentation/activity_page.dart`: 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: lib/features/shell/presentation/shell_screen.dart lib/features/shell/presentation/shell_screen.dart:210— lib/features/shell/presentation/shell_screen.dart changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _ShellScreenState.build at line 210. 9 of those changes were fix/bug commits, and the other 23 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/shell/presentation/shell_screen.dart`: 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: lib/features/onboarding/presentation/widgets/onboarding_walk.dart lib/features/onboarding/presentation/widgets/onboarding_walk.dart:795— lib/features/onboarding/presentation/widgets/onboarding_walk.dart changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _OnboardingWalkState._form at line 795. 21 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/onboarding/presentation/widgets/onboarding_walk.dart`: 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: lib/features/plex/data/plex_client.dart lib/features/plex/data/plex_client.dart:845— lib/features/plex/data/plex_client.dart changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in PlexClient.lookupByExternalId at line 845. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/plex/data/plex_client.dart`: 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: lib/features/onboarding/presentation/onboarding_screen.dart lib/features/onboarding/presentation/onboarding_screen.dart:1110— lib/features/onboarding/presentation/onboarding_screen.dart changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _OnboardingScreenState.build at line 1110. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/onboarding/presentation/onboarding_screen.dart`: 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: lib/features/settings/data/settings_service.dart lib/features/settings/data/settings_service.dart:1080— lib/features/settings/data/settings_service.dart changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in SettingsService._saveInstances at line 1080. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/settings/data/settings_service.dart`: 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: lib/features/onboarding/presentation/widgets/onboarding_parts.dart lib/features/onboarding/presentation/widgets/onboarding_parts.dart:1003— lib/features/onboarding/presentation/widgets/onboarding_parts.dart changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _OnboardingFieldState._build at line 1003. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/onboarding/presentation/widgets/onboarding_parts.dart`: 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: lib/features/discover/presentation/discover_page.dart lib/features/discover/presentation/discover_page.dart:386— lib/features/discover/presentation/discover_page.dart changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _Results.build at line 386. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/discover/presentation/discover_page.dart`: 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: lib/features/shell/presentation/desktop/desktop_shell.dart lib/features/shell/presentation/desktop/desktop_shell.dart:186— lib/features/shell/presentation/desktop/desktop_shell.dart changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in _DesktopShellState.build at line 186. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/shell/presentation/desktop/desktop_shell.dart`: 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: lib/features/music/presentation/artist_page.dart lib/features/music/presentation/artist_page.dart:316— lib/features/music/presentation/artist_page.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in _ArtistPageState.build at line 316. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/music/presentation/artist_page.dart`: 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: lib/features/discover/presentation/calendar_page.dart lib/features/discover/presentation/calendar_page.dart:129— lib/features/discover/presentation/calendar_page.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in _CalendarPageState.build at line 129. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/discover/presentation/calendar_page.dart`: 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: lib/core/widgets/service_offline_state.dart lib/core/widgets/service_offline_state.dart:164— lib/core/widgets/service_offline_state.dart changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ServiceOfflineState.build at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/core/widgets/service_offline_state.dart`: 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: lib/demo/world/profile_network.dart lib/demo/world/profile_network.dart:601— lib/demo/world/profile_network.dart changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ProfileNetwork._respond at line 601. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/demo/world/profile_network.dart`: 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: lib/features/discover/presentation/widgets/request_bottom_sheet.dart lib/features/discover/presentation/widgets/request_bottom_sheet.dart:65— lib/features/discover/presentation/widgets/request_bottom_sheet.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in RequestBottomSheet.build at line 65. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/discover/presentation/widgets/request_bottom_sheet.dart`: 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: lib/features/discover/domain/library_calendar.dart lib/features/discover/domain/library_calendar.dart:371— lib/features/discover/domain/library_calendar.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in CalendarEvent.spoken at line 371. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/discover/domain/library_calendar.dart`: 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: lib/features/prowlarr/presentation/prowlarr_library_screen.dart lib/features/prowlarr/presentation/prowlarr_library_screen.dart:252— lib/features/prowlarr/presentation/prowlarr_library_screen.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _ProwlarrLibraryScreenState.build at line 252. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/prowlarr/presentation/prowlarr_library_screen.dart`: 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: lib/features/home/presentation/widgets/downloads_module.dart lib/features/home/presentation/widgets/downloads_module.dart:52— lib/features/home/presentation/widgets/downloads_module.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in HomeDownloadsModule.build at line 52. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/features/home/presentation/widgets/downloads_module.dart`: 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: lib/demo/world/fakes/client_fakes.dart lib/demo/world/fakes/client_fakes.dart:501— lib/demo/world/fakes/client_fakes.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in SabnzbdFake.answer at line 501. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-19 14:17:35 +01:00' --until='2026-11-17 14:17:35 +01:00' --full-history --no-merges -- lib/demo/world/fakes/client_fakes.dart`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
MethodTooLong: _ArtistPageState.build lib/features/music/presentation/artist_page.dart:316— MethodTooLong — build runs 295 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 195 over it, 2.95× 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: _CalendarPageState.build lib/features/discover/presentation/calendar_page.dart:129— MethodTooLong — build runs 286 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 186 over it, 2.86× 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: _MediaEpisodesGraphSheetState.build lib/features/media/presentation/media_episodes_graph.dart:291— MethodTooLong — build runs 249 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 149 over it, 2.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _TransmissionSessionBodyState.build lib/features/transmission/presentation/transmission_tab_screens.dart:472— MethodTooLong — build runs 242 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 142 over it, 2.42× 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: _ProwlarrLibraryScreenState.build lib/features/prowlarr/presentation/prowlarr_library_screen.dart:252— MethodTooLong — build runs 236 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 136 over it, 2.36× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: AppTheme._buildTheme lib/core/theme.dart:1070— MethodTooLong — _buildTheme runs 203 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 103 over it, 2.03× 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: _AuthorPageState.build lib/features/readarr/presentation/author_page.dart:103— MethodTooLong — build runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _RowState.build lib/features/activity/presentation/widgets/download_table.dart:424— MethodTooLong — build runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81× 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: _MediaEpisodeSheetState.build lib/features/media/presentation/media_episode_sheet.dart:127— MethodTooLong — build runs 178 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 78 over it, 1.78× 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: _BlockedImportReviewPageState._content lib/features/import/presentation/blocked_import_review_page.dart:249— MethodTooLong — _content runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73× 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: _CalendarBandState.build lib/features/discover/presentation/widgets/calendar_band.dart:109— MethodTooLong — build 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: _OnboardingWalkState._form lib/features/onboarding/presentation/widgets/onboarding_walk.dart:795— MethodTooLong — _form runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _MediaBrowseScaffoldState.build lib/core/widgets/media_browse_scaffold.dart:1014— MethodTooLong — build runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65× 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: RequestBottomSheet.build lib/features/discover/presentation/widgets/request_bottom_sheet.dart:65— MethodTooLong — build runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _DesktopShellState.build lib/features/shell/presentation/desktop/desktop_shell.dart:186— MethodTooLong — build runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _FaultCardState.build lib/features/activity/presentation/widgets/fault_card.dart:187— MethodTooLong — build runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48× 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: _SeerrIssueThreadScreenState._thread lib/features/media/presentation/seerr_issue_thread_screen.dart:206— MethodTooLong — _thread runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47× 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: SearchRow.build lib/features/discover/presentation/widgets/search_row.dart:267— MethodTooLong — build runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42× 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: _OnboardingScreenState.build lib/features/onboarding/presentation/onboarding_screen.dart:1110— MethodTooLong — build runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42× 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: _MediaAddSheetState.build lib/features/media/presentation/media_add_sheet.dart:212— MethodTooLong — build runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40× 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: AppTheme._buildTextTheme lib/core/theme.dart:1508— MethodTooLong — _buildTextTheme runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39× 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: _AddTorrentFormState.build lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart:84— MethodTooLong — build runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39× 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: CollectionTally.build lib/features/discover/presentation/widgets/collection_tally.dart:58— MethodTooLong — build runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _ReleaseListItemState.build lib/core/widgets/release_list_widgets.dart:93— MethodTooLong — build runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: _ShellScreenState.build lib/features/shell/presentation/shell_screen.dart:210— MethodTooLong — build runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FileTooLong: presentation/media_page.dart lib/features/media/presentation/media_page.dart— FileTooLong — 2378 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1878 over it, 4.76× 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: presentation/service_settings_screen.dart lib/features/settings/presentation/service_settings_screen.dart— FileTooLong — 1638 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: _ServiceSettingsScreenState (141-2577). The bar is 500 significant lines; this is 1138 over it, 3.28× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: widgets/media_browse_scaffold.dart lib/core/widgets/media_browse_scaffold.dart— FileTooLong — 1607 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: _MediaBrowseScaffoldState (417-2070). The bar is 500 significant lines; this is 1107 over it, 3.21× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: presentation/service_kpi_provider.dart lib/features/services/presentation/service_kpi_provider.dart— FileTooLong — 1222 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 722 over it, 2.44× 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: design_tokens/generate.dart tool/design_tokens/generate.dart— FileTooLong — 1184 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 684 over it, 2.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: core/theme.dart lib/core/theme.dart— FileTooLong — 1055 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 555 over it, 2.11× 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: presentation/services_queue.dart lib/features/services/presentation/services_queue.dart— FileTooLong — 1008 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 508 over it, 2.02× 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: widgets/service_overview.dart lib/core/widgets/service_overview.dart— FileTooLong — 998 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 498 over it, 2.00× 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: domain/library_calendar.dart lib/features/discover/domain/library_calendar.dart— FileTooLong — 998 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 498 over it, 2.00× 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: presentation/artist_page.dart lib/features/music/presentation/artist_page.dart— FileTooLong — 986 significant lines (blank, comment-only and punctuation-only lines excluded), about 63% of them inside a single declaration: artistReadEvery (98-984). The bar is 500 significant lines; this is 486 over it, 1.97× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: widgets/onboarding_walk.dart lib/features/onboarding/presentation/widgets/onboarding_walk.dart— FileTooLong — 967 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 467 over it, 1.93× 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: presentation/calendar_page.dart lib/features/discover/presentation/calendar_page.dart— FileTooLong — 938 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 438 over it, 1.88× 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: presentation/manual_import_provider.dart lib/features/import/presentation/manual_import_provider.dart— FileTooLong — 870 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: ManualImportFlowNotifier (418-1344). The bar is 500 significant lines; this is 370 over it, 1.74× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: widgets/onboarding_found.dart lib/features/onboarding/presentation/widgets/onboarding_found.dart— FileTooLong — 860 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 360 over it, 1.72× 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: data/settings_service.dart lib/features/settings/data/settings_service.dart— FileTooLong — 860 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: SettingsService (133-1580). The bar is 500 significant lines; this is 360 over it, 1.72× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: data/plex_client.dart lib/features/plex/data/plex_client.dart— FileTooLong — 855 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: PlexClient (158-1612). The bar is 500 significant lines; this is 355 over it, 1.71× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: presentation/blocked_import_parts.dart lib/features/import/presentation/blocked_import_parts.dart— FileTooLong — 841 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 341 over it, 1.68× 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: presentation/manual_import_review_screen.dart lib/features/import/presentation/manual_import_review_screen.dart— FileTooLong — 824 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 324 over it, 1.65× 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: presentation/transmission_tab_screens.dart lib/features/transmission/presentation/transmission_tab_screens.dart— FileTooLong — 824 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 324 over it, 1.65× 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: data/seerr_service.dart lib/features/discover/data/seerr_service.dart— FileTooLong — 778 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: SeerrService (181-1487). The bar is 500 significant lines; this is 278 over it, 1.56× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: presentation/service_matrix.dart lib/features/services/presentation/service_matrix.dart— FileTooLong — 772 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 272 over it, 1.54× 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: presentation/activity_page.dart lib/features/activity/presentation/activity_page.dart— FileTooLong — 771 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 271 over it, 1.54× 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: presentation/onboarding_screen.dart lib/features/onboarding/presentation/onboarding_screen.dart— FileTooLong — 734 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: _OnboardingScreenState (71-1362). The bar is 500 significant lines; this is 234 over it, 1.47× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: data/service_verification.dart lib/features/settings/data/service_verification.dart— FileTooLong — 720 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 220 over it, 1.44× 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: presentation/manual_import_fix_sheet.dart lib/features/import/presentation/manual_import_fix_sheet.dart— FileTooLong — 713 significant lines (blank, comment-only and punctuation-only lines excluded), about 72% of them inside a single declaration: _MatchSheetState (66-790). The bar is 500 significant lines; this is 213 over it, 1.43× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
Cross-slice coupling: activity → settings lib/features/activity/presentation/activity_provider.dart:46— `ActivityServiceResult` (slice 'activity') depends on `ServiceKey` from slice 'settings'.
Cross-slice coupling: activity → services lib/features/activity/presentation/activity_provider.dart:168— `ActivityFeed` (slice 'activity') depends on `SourceCoverage` from slice 'services'.
Cross-slice coupling: activity → settings lib/features/activity/presentation/activity_provider.dart:236— `GlobalActivityItem` (slice 'activity') depends on `ServiceKey` from slice 'settings'.
Cross-slice coupling: activity → settings lib/features/activity/presentation/arr_calendar_screen.dart:28— `ArrCalendarScreen` (slice 'activity') depends on `ServiceKey` from slice 'settings'.
Cross-slice coupling: activity → services lib/features/activity/presentation/download_page.dart:488— `_Commands` (slice 'activity') depends on `ServiceQueueItem` from slice 'services'.
Cross-slice coupling: activity → services lib/features/activity/presentation/widgets/activity_download_row.dart:56— `ActivityDownloadRow` (slice 'activity') depends on `ServiceQueueItem` from slice 'services'.
Cross-slice coupling: activity → services lib/features/activity/presentation/widgets/activity_history_row.dart:26— `ActivityHistoryRow` (slice 'activity') depends on `ArrHistoryEntry` from slice 'services'.
Cross-slice coupling: activity → services lib/features/activity/presentation/widgets/decision_fault_card.dart:33— `DecisionFaultCard` (slice 'activity') depends on `DashboardDecision` from slice 'services'.
Cross-slice coupling: activity → services lib/features/activity/presentation/widgets/download_table.dart:368— `_Row` (slice 'activity') depends on `ServiceQueueItem` from slice 'services'.
Cross-slice coupling: activity → requests lib/features/activity/presentation/widgets/everyone_request_row.dart:30— `EveryoneRequestRow` (slice 'activity') depends on `MyRequest` from slice 'requests'.
Cross-slice coupling: activity → services lib/features/activity/presentation/widgets/reported_problems_card.dart:37— `ReportedProblemsCard` (slice 'activity') depends on `DashboardDecision` from slice 'services'.
Cross-slice coupling: activity → services lib/features/activity/presentation/widgets/reported_problems_card.dart:142— `_IssueLine` (slice 'activity') depends on `DashboardDecision` from slice 'services'.
Cross-slice coupling: activity → series lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart:17— `SonarrWantedHierarchy` (slice 'activity') depends on `SonarrService` from slice 'series'.
Cross-slice coupling: activity → series lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart:89— `_SeriesExpansionTile` (slice 'activity') depends on `SonarrService` from slice 'series'.
Cross-slice coupling: activity → series lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart:146— `_SeasonExpansionTile` (slice 'activity') depends on `SonarrService` from slice 'series'.
Cross-slice coupling: activity → series lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart:214— `_EpisodeListTile` (slice 'activity') depends on `SonarrService` from slice 'series'.
Cross-slice coupling: activity → services lib/features/activity/presentation/widgets/storage_alert_card.dart:53— `StorageAlertCard` (slice 'activity') depends on `DashboardDecision` from slice 'services'.
Cross-slice coupling: activity → services lib/features/activity/presentation/widgets/violation_rows.dart:110— `ViolationDecisionRow` (slice 'activity') depends on `DashboardDecision` from slice 'services'.
Cross-slice coupling: discover → settings lib/features/discover/domain/library_calendar.dart:30— `CalendarKind` (slice 'discover') depends on `ServiceKey` from slice 'settings'.
Cross-slice coupling: discover → media lib/features/discover/domain/library_calendar.dart:180— `CalendarMediaTarget` (slice 'discover') depends on `MediaKey` from slice 'media'.
Cross-slice coupling: discover → settings lib/features/discover/domain/library_calendar.dart:198— `CalendarShelfTarget` (slice 'discover') depends on `ServiceKey` from slice 'settings'.
Cross-slice coupling: discover → settings lib/features/discover/domain/library_calendar.dart:540— `CalendarReading` (slice 'discover') depends on `ServiceKey` from slice 'settings'.
Cross-slice coupling: discover → settings lib/features/discover/domain/seerr_arr_server.dart:63— `SeerrArrServer` (slice 'discover') depends on `ServiceKey` from slice 'settings'.
Cross-slice coupling: discover → settings lib/features/discover/domain/seerr_arr_server.dart:303— `SeerrApproveTarget` (slice 'discover') depends on `ServiceKey` from slice 'settings'.
Cross-slice coupling: discover → settings lib/features/discover/domain/seerr_invite.dart:99— `SeerrInvite` (slice 'discover') depends on `ConnectionAccess` from slice 'settings'.
Swallowed exception (caught, then discarded) packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:204— `on Object catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:359— `on Object catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:391— `on Object catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) packages/mobile_scanner/lib/src/web/preferred_device_storage.dart:14— `on Object catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) packages/mobile_scanner/lib/src/web/barcode_detector/barcode_detector_js.dart:13— `on Object` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) packages/mobile_scanner/android/src/main/kotlin/dev/steenbakker/mobile_scanner/MobileScanner.kt:646— `catch (_: Exception)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) macos/Runner/MainFlutterWindow.swift:359— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/truenas/presentation/truenas_capability.dart:45— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/truenas/presentation/truenas_capability.dart:51— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/truenas/presentation/dashboard/truenas_dashboard_screen.dart:248— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/truenas/data/truenas_ws_client.dart:320— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/truenas/data/truenas_ws_client.dart:609— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/transmission/presentation/transmission_overview_provider.dart:372— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/tracearr/data/tracearr_owner_client.dart:506— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/stream/presentation/play_with.dart:145— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/stream/presentation/widgets/stream_now_playing_section.dart:707— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/stream/data/stream_app_launcher.dart:29— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/stream/data/stream_app_launcher.dart:38— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/settings/presentation/widgets/donation_sheet.dart:135— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/settings/domain/service_key.dart:957— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/settings/data/operator_adds_via_provider.dart:24— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/settings/data/route_knock.dart:301— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/settings/data/service_verification.dart:493— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/settings/data/stream_player_provider.dart:46— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) lib/features/services/presentation/kept_waiting_provider.dart:52— `catch (_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Low cohesion: EmbyDialect (LCOM4 17) lib/features/emby/data/emby_dialect.dart:13— EmbyDialect's methods fall into 17 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: LidarrService (LCOM4 15) lib/features/music/data/lidarr_service.dart:26— LidarrService's methods fall into 15 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: SidePaneSlotRoute (LCOM4 14) lib/core/utils/side_pane_route.dart:29— SidePaneSlotRoute's methods fall into 14 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: _FakeResponse (LCOM4 11) lib/demo/world/profile_network.dart:888— _FakeResponse's methods fall into 11 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ReadarrService (LCOM4 11) lib/features/readarr/data/readarr_service.dart:6— ReadarrService's methods fall into 11 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: SonarrService (LCOM4 9) lib/features/series/data/sonarr_service.dart:25— SonarrService's methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ManualImportFlowNotifier (LCOM4 8) lib/features/import/presentation/manual_import_provider.dart:418— ManualImportFlowNotifier's methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: _FakeRequest (LCOM4 7) lib/demo/world/profile_network.dart:808— _FakeRequest's methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ManualImportFlowState (LCOM4 7) lib/features/import/presentation/manual_import_provider.dart:159— ManualImportFlowState's methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: RadarrService (LCOM4 7) lib/features/movies/data/radarr_service.dart:20— RadarrService's methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ArrLife (LCOM4 6) lib/demo/world/arr_life.dart:119— ArrLife's methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: _RenderFade (LCOM4 5) lib/core/widgets/ambient_scaffold.dart:282— _RenderFade's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: _RenderScrim (LCOM4 5) lib/core/widgets/glass_app_bar.dart:149— _RenderScrim's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: DiscoverDetailViewModel (LCOM4 5) lib/features/discover/presentation/discover_detail_view_model.dart:13— DiscoverDetailViewModel's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: RequestFormNotifier (LCOM4 5) lib/features/discover/presentation/request_form_provider.dart:306— RequestFormNotifier's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: RenderBesideOrBelow (LCOM4 4) lib/core/widgets/beside_or_below.dart:73— RenderBesideOrBelow's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: WebSocketLink (LCOM4 4) lib/demo/world/fake_socket.dart:37— WebSocketLink's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: _FakeHeaders (LCOM4 4) lib/demo/world/profile_network.dart:736— _FakeHeaders's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ActivityFeed (LCOM4 4) lib/features/activity/presentation/activity_provider.dart:163— ActivityFeed's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: BazarrProviderStatus (LCOM4 4) lib/features/bazarr/domain/models/bazarr_models.dart:330— BazarrProviderStatus's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: StackLights (LCOM4 4) lib/features/home/domain/stack_lights.dart:74— StackLights's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: RenderBalancedColumns (LCOM4 4) lib/features/home/presentation/widgets/balanced_columns.dart:60— RenderBalancedColumns's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: _SeerrIssueThreadScreenState (LCOM4 4) lib/features/media/presentation/seerr_issue_thread_screen.dart:125— _SeerrIssueThreadScreenState's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: OutsideShelf (LCOM4 4) lib/features/outside/data/outside_shelf.dart:35— OutsideShelf's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Torrent (LCOM4 4) lib/features/qbittorrent/domain/models/torrent.dart:87— Torrent's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
TooManyMethods: _ServiceSettingsScreenState lib/features/settings/presentation/service_settings_screen.dart:141— TooManyMethods — 79 methods. The bar is 30 methods; this is 49 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.
TooManyMethods: SeerrService lib/features/discover/data/seerr_service.dart:181— TooManyMethods — 76 methods. The bar is 30 methods; this is 46 over it, 2.53× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: ServiceRoutes lib/core/utils/service_routes.dart:8— TooManyMethods — 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: _MediaBrowseScaffoldState lib/core/widgets/media_browse_scaffold.dart:417— TooManyMethods — 54 methods. The bar is 30 methods; this is 24 over it, 1.80× 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: PlexClient lib/features/plex/data/plex_client.dart:144— TooManyMethods — 53 methods. The bar is 30 methods; this is 23 over it, 1.77× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: SettingsService lib/features/settings/data/settings_service.dart:133— TooManyMethods — 50 methods. The bar is 30 methods; this is 20 over it, 1.67× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: MediaBrowserClient lib/features/jellyfin/data/media_browser_client.dart:27— TooManyMethods — 48 methods. The bar is 30 methods; this is 18 over it, 1.60× 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: SeerrSignInFlow lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:100— TooManyMethods — 44 methods. The bar is 30 methods; this is 14 over it, 1.47× 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: DockgeClient lib/features/dockge/data/dockge_client.dart:61— TooManyMethods — 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: ProwlarrService lib/features/prowlarr/data/prowlarr_service.dart:11— TooManyMethods — 41 methods. The bar is 30 methods; this is 11 over it, 1.37× 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: _MatchSheetState lib/features/import/presentation/manual_import_fix_sheet.dart:66— TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× 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: LidarrService lib/features/music/data/lidarr_service.dart:26— TooManyMethods — 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: _OnboardingScreenState lib/features/onboarding/presentation/onboarding_screen.dart:71— TooManyMethods — 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: SettingsModel lib/features/settings/domain/settings_model.dart:35— TooManyMethods — 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: ManualImportFlowNotifier lib/features/import/presentation/manual_import_provider.dart:418— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.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: _MediaPageState lib/features/media/presentation/media_page.dart:137— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.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: ServiceInstance lib/features/settings/domain/service_instance.dart:9— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.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: TransmissionClient lib/features/transmission/data/transmission_client.dart:55— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.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: TracearrClient lib/features/tracearr/data/tracearr_client.dart:197— TooManyMethods — 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: SonarrService lib/features/series/data/sonarr_service.dart:25— TooManyMethods — 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.
X2 · Cancellation propagation· Function without a CancelToken · ×19
Function without a CancelToken: _query lib/features/unraid/data/unraid_client.dart:208— `_query` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: _call lib/features/transmission/data/transmission_client.dart:276— `_call` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: checkPlex lib/features/tracearr/data/tracearr_owner_client.dart:399— `checkPlex` calls `dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: _knockOnce lib/features/settings/data/route_knock.dart:223— `_knockOnce` calls `dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: _call lib/features/sabnzbd/data/sabnzbd_client.dart:93— `_call` calls `_dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: qbittorrentCredentialMark lib/features/qbittorrent/data/qbittorrent_client.dart:148— `qbittorrentCredentialMark` calls `_dio.fetch(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: _doAuthenticate lib/features/qbittorrent/data/qbittorrent_client.dart:276— `_doAuthenticate` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: getVersion lib/features/qbittorrent/data/qbittorrent_client.dart:412— `getVersion` calls `_dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: post lib/features/qbittorrent/data/qbittorrent_client.dart:433— `post` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: _call lib/features/nzbget/data/nzbget_client.dart:88— `_call` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: _login lib/features/npm/data/npm_client.dart:476— `_login` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: _request lib/features/npm/data/npm_client.dart:553— `_request` calls `_dio.request(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: createPin lib/features/discover/data/plex_tv_client.dart:42— `createPin` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: authTokenOf lib/features/discover/data/plex_tv_client.dart:56— `authTokenOf` calls `_dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: _askWhoAmI lib/features/discover/data/seerr_session.dart:390— `_askWhoAmI` calls `_dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: gatewayAtUpgrade lib/core/network/upgrade_gateway.dart:24— `gatewayAtUpgrade` calls `dio.get(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: post lib/core/api/api_client.dart:204— `post` calls `_dio.post(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: put lib/core/api/api_client.dart:220— `put` calls `_dio.put(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Function without a CancelToken: patch lib/core/api/api_client.dart:228— `patch` calls `_dio.patch(…)` but takes no CancelToken and hands the request none its caller can reach, so its caller cannot cancel the request once it has started. Take `CancelToken? cancelToken` and pass it on as `cancelToken: cancelToken` — or, in a widget's State or a notifier, hold one and cancel it in `dispose`.
Duplicated block (13 lines × 2) lib/core/widgets/floating_bottom_nav_bar.dart:594— lib/core/widgets/floating_bottom_nav_bar.dart:594-606 | lib/core/widgets/floating_nav_rail.dart:234-246 — 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 `lib/core/widgets/floating_bottom_nav_bar.dart:594` 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) lib/core/widgets/settings_switch_row.dart:54— lib/core/widgets/settings_switch_row.dart:54-66 | lib/features/release_search/presentation/release_search_settings_screen.dart:684-696 — 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 `lib/core/widgets/settings_switch_row.dart:54` 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, `lib/core/widgets/settings_switch_row.dart:67` calls `ExcludeSemantics` and `lib/features/release_search/presentation/release_search_settings_screen.dart:697` 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 (13 lines × 2) lib/features/activity/presentation/widgets/activity_history_row.dart:90— lib/features/activity/presentation/widgets/activity_history_row.dart:90-102 | lib/features/media/presentation/media_page.dart:2916-2930 — 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 `lib/features/activity/presentation/widgets/activity_history_row.dart:90` 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) lib/features/bazarr/presentation/bazarr_library_screen.dart:162— lib/features/bazarr/presentation/bazarr_library_screen.dart:162-174 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:176-188 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_library_screen.dart` and `lib/features/bazarr/presentation/bazarr_wanted_screen.dart` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/bazarr/presentation/bazarr_library_screen.dart:162` 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 (13 lines × 2) lib/features/bazarr/presentation/bazarr_library_screen.dart:188— lib/features/bazarr/presentation/bazarr_library_screen.dart:188-200 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:202-214 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_library_screen.dart` and `lib/features/bazarr/presentation/bazarr_wanted_screen.dart` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/bazarr/presentation/bazarr_library_screen.dart:188` 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 (13 lines × 2) lib/features/home/presentation/widgets/your_requests_module.dart:150— lib/features/home/presentation/widgets/your_requests_module.dart:150-162 | lib/features/requests/presentation/requests_screen.dart:375-387 — 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 `lib/features/home/presentation/widgets/your_requests_module.dart:150` 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 (13 lines × 2) lib/features/media/presentation/arr_bulk.dart:352— lib/features/media/presentation/arr_bulk.dart:352-364 | lib/features/music/presentation/lidarr_add_parts.dart:369-381 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/media/presentation/arr_bulk.dart:352` 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 (13 lines × 2) lib/features/media/presentation/media_episodes_graph.dart:749— lib/features/media/presentation/media_episodes_graph.dart:749-761 | lib/features/media/presentation/shelf_page.dart:619-631 — 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 `lib/features/media/presentation/media_episodes_graph.dart:749` 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) lib/features/movies/presentation/movies_find.dart:161— lib/features/movies/presentation/movies_find.dart:161-173 | lib/features/series/presentation/series_find.dart:171-183 — 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 `lib/features/movies/presentation/movies_find.dart:161` 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 (13 lines × 2) lib/features/music/presentation/artist_page.dart:836— lib/features/music/presentation/artist_page.dart:836-848 | lib/features/readarr/presentation/author_page.dart:410-422 — before extracting anything, compare `lib/features/music/presentation/artist_page.dart` and `lib/features/readarr/presentation/author_page.dart` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 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 `lib/features/music/presentation/artist_page.dart:836` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) lib/features/music/presentation/lidarr_add_album_sheet.dart:301— lib/features/music/presentation/lidarr_add_album_sheet.dart:301-313 | lib/features/music/presentation/lidarr_add_artist_sheet.dart:346-358 — 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 `lib/features/music/presentation/lidarr_add_album_sheet.dart:301` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 2) lib/features/npm/presentation/npm_screen.dart:557— lib/features/npm/presentation/npm_screen.dart:557-569 | lib/features/npm/presentation/npm_screen.dart:995-1007 — 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 `lib/features/npm/presentation/npm_screen.dart:557` 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 (13 lines × 2) lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:36— lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:36-48 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:31-43 — before extracting anything, compare `lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart` and `lib/features/prowlarr/presentation/prowlarr_tags_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:36` 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 (13 lines × 2) lib/features/prowlarr/presentation/prowlarr_library_screen.dart:822— lib/features/prowlarr/presentation/prowlarr_library_screen.dart:822-834 | lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:332-344 — 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 `lib/features/prowlarr/presentation/prowlarr_library_screen.dart:822` 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 (13 lines × 2) lib/features/transmission/presentation/transmission_screen.dart:148— lib/features/transmission/presentation/transmission_screen.dart:148-160 | lib/features/transmission/presentation/transmission_screen.dart:176-188 — 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 `lib/features/transmission/presentation/transmission_screen.dart:148` 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 (13 lines × 2) lib/features/truenas/presentation/shares/truenas_shares_screen.dart:163— lib/features/truenas/presentation/shares/truenas_shares_screen.dart:163-175 | lib/features/truenas/presentation/shares/truenas_shares_screen.dart:295-308 — 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 `lib/features/truenas/presentation/shares/truenas_shares_screen.dart:163` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lib/features/truenas/presentation/shares/truenas_shares_screen.dart:162` calls `TrueNasFormField` and `lib/features/truenas/presentation/shares/truenas_shares_screen.dart:295` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 2) lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:47— lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:47-59 | lib/features/unraid/presentation/unraid_overview_screen.dart:71-86 — 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) ios/Runner/AppDelegate.swift:192— ios/Runner/AppDelegate.swift:192-204 | macos/Runner/MainFlutterWindow.swift:243-255 — before extracting anything, compare `ios/Runner/AppDelegate.swift` and `macos/Runner/MainFlutterWindow.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 145 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 `ios/Runner/AppDelegate.swift: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.
ClassTooLong: _ServiceSettingsScreenState lib/features/settings/presentation/service_settings_screen.dart:141— ClassTooLong — 1434 significant lines (blank, comment-only and punctuation-only lines excluded), 79 methods. The bar is 400 significant lines; this is 1034 over it, 3.59× 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: _MediaBrowseScaffoldState lib/core/widgets/media_browse_scaffold.dart:417— ClassTooLong — 981 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods. The bar is 400 significant lines; this is 581 over it, 2.45× 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: PlexClient lib/features/plex/data/plex_client.dart:144— ClassTooLong — 790 significant lines (blank, comment-only and punctuation-only lines excluded), 53 methods. The bar is 400 significant lines; this is 390 over it, 1.98× 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: SettingsService lib/features/settings/data/settings_service.dart:133— ClassTooLong — 771 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 371 over it, 1.93× 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: SeerrService lib/features/discover/data/seerr_service.dart:181— ClassTooLong — 699 significant lines (blank, comment-only and punctuation-only lines excluded), 76 methods. The bar is 400 significant lines; this is 299 over it, 1.75× 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: _OnboardingScreenState lib/features/onboarding/presentation/onboarding_screen.dart:71— ClassTooLong — 691 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 291 over it, 1.73× 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: MediaBrowserClient lib/features/jellyfin/data/media_browser_client.dart:27— ClassTooLong — 592 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods. The bar is 400 significant lines; this is 192 over it, 1.48× 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: ManualImportFlowNotifier lib/features/import/presentation/manual_import_provider.dart:418— ClassTooLong — 561 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 161 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: _SeerrIssueThreadScreenState lib/features/media/presentation/seerr_issue_thread_screen.dart:125— ClassTooLong — 547 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 147 over it, 1.37× 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: AppTheme lib/core/theme.dart:847— ClassTooLong — 526 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 126 over it, 1.32× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: _MatchSheetState lib/features/import/presentation/manual_import_fix_sheet.dart:66— ClassTooLong — 514 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 114 over it, 1.29× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: _ManualImportReviewScreenState lib/features/import/presentation/manual_import_review_screen.dart:142— ClassTooLong — 469 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 69 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: SeerrSignInFlow lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:100— ClassTooLong — 447 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 47 over it, 1.12× 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: DockgeClient lib/features/dockge/data/dockge_client.dart:61— ClassTooLong — 417 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 17 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.
ClassTooLong: _OnboardingWalkState lib/features/onboarding/presentation/widgets/onboarding_walk.dart:411— ClassTooLong — 414 significant lines (blank, comment-only and punctuation-only lines excluded), 20 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.
ClassTooLong: ServiceRoutes lib/core/utils/service_routes.dart:8— ClassTooLong — 402 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods. The bar is 400 significant lines; this is 2 over it, 1.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: _CalendarPageState lib/features/discover/presentation/calendar_page.dart:64— ClassTooLong — 401 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 1 over it, 1.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.
Duplicated block (12 lines × 2) lib/features/discover/data/seerr_service.dart:411— lib/features/discover/data/seerr_service.dart:411-422 | lib/features/discover/data/seerr_service.dart:573-584 — 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 `lib/features/discover/data/seerr_service.dart:411` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) lib/features/home/presentation/widgets/continue_watching_module.dart:294— lib/features/home/presentation/widgets/continue_watching_module.dart:294-305 | lib/features/home/presentation/widgets/now_playing_module.dart:173-184 — 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 `lib/features/home/presentation/widgets/continue_watching_module.dart:294` 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) lib/features/movies/presentation/movies_find.dart:76— lib/features/movies/presentation/movies_find.dart:76-87 | lib/features/series/presentation/series_find.dart:79-90 — 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 `lib/features/movies/presentation/movies_find.dart:76` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) lib/features/music/presentation/artist_page.dart:674— lib/features/music/presentation/artist_page.dart:674-685 | lib/features/readarr/presentation/author_page.dart:330-341 — before extracting anything, compare `lib/features/music/presentation/artist_page.dart` and `lib/features/readarr/presentation/author_page.dart` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 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 `lib/features/music/presentation/artist_page.dart:674` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) lib/features/music/presentation/music_find.dart:101— lib/features/music/presentation/music_find.dart:101-112 | lib/features/music/presentation/music_find.dart:320-331 — 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 `lib/features/music/presentation/music_find.dart:101` 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, `lib/features/music/presentation/music_find.dart:113` calls `watchMusicReach` and `lib/features/music/presentation/music_find.dart:332` 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 (12 lines × 2) lib/features/npm/presentation/npm_advanced_config_screen.dart:62— lib/features/npm/presentation/npm_advanced_config_screen.dart:62-73 | lib/features/npm/presentation/npm_screen.dart:587-598 — 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 `lib/features/npm/presentation/npm_advanced_config_screen.dart:62` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) lib/features/npm/presentation/npm_screen.dart:378— lib/features/npm/presentation/npm_screen.dart:378-389 | lib/features/npm/presentation/npm_screen.dart:428-439 — 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 `lib/features/npm/presentation/npm_screen.dart:378` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) lib/features/nzbget/presentation/nzbget_overview_screen.dart:207— lib/features/nzbget/presentation/nzbget_overview_screen.dart:207-218 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:134-145 — 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 `lib/features/nzbget/presentation/nzbget_overview_screen.dart:207` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) lib/features/onboarding/presentation/widgets/onboarding_found.dart:1030— lib/features/onboarding/presentation/widgets/onboarding_found.dart:1030-1041 | lib/features/onboarding/presentation/widgets/onboarding_walk.dart:213-224 — 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 `lib/features/onboarding/presentation/widgets/onboarding_found.dart:1030` 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) lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart:116— lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart:116-127 | lib/features/readarr/presentation/widgets/readarr_tiles.dart:122-133 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart:116` 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 (12 lines × 2) lib/features/readarr/presentation/readarr_activity_screen.dart:131— lib/features/readarr/presentation/readarr_activity_screen.dart:131-142 | lib/features/readarr/presentation/readarr_history_screen.dart:133-145 — before extracting anything, compare `lib/features/readarr/presentation/readarr_activity_screen.dart` and `lib/features/readarr/presentation/readarr_history_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/readarr/presentation/readarr_activity_screen.dart:131` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12 lines × 2) lib/features/transmission/presentation/transmission_screen.dart:162— lib/features/transmission/presentation/transmission_screen.dart:162-173 | lib/features/transmission/presentation/transmission_screen.dart:190-201 — 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 `lib/features/transmission/presentation/transmission_screen.dart:162` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) lib/features/truenas/presentation/shares/truenas_shares_screen.dart:150— lib/features/truenas/presentation/shares/truenas_shares_screen.dart:150-161 | lib/features/truenas/presentation/shares/truenas_shares_screen.dart:284-295 — 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 `lib/features/truenas/presentation/shares/truenas_shares_screen.dart:150` 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, `lib/features/truenas/presentation/shares/truenas_shares_screen.dart:162` calls `TrueNasFormField` and `lib/features/truenas/presentation/shares/truenas_shares_screen.dart:296` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (12 lines × 2) lib/features/truenas/presentation/system/truenas_system_config_screens.dart:279— lib/features/truenas/presentation/system/truenas_system_config_screens.dart:279-291 | lib/features/truenas/presentation/virt/truenas_virt_detail_screen.dart:175-186 — 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 `lib/features/truenas/presentation/system/truenas_system_config_screens.dart:279` 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 (11 lines × 2) lib/core/widgets/service_overview.dart:1516— lib/core/widgets/service_overview.dart:1516-1528 | lib/core/widgets/service_overview.dart:1568-1578 — 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 `lib/core/widgets/service_overview.dart:1516` 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) lib/features/activity/presentation/widgets/activity_download_row.dart:149— lib/features/activity/presentation/widgets/activity_download_row.dart:149-159 | lib/features/activity/presentation/widgets/download_table.dart:459-469 — 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 `lib/features/activity/presentation/widgets/activity_download_row.dart:149` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11 lines × 2) lib/features/bazarr/domain/models/bazarr_models.dart:582— lib/features/bazarr/domain/models/bazarr_models.dart:582-592 | lib/features/bazarr/domain/models/bazarr_models.dart:598-608 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/bazarr/domain/models/bazarr_models.dart:582` 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) lib/features/home/presentation/widgets/continue_watching_module.dart:71— lib/features/home/presentation/widgets/continue_watching_module.dart:71-82 | lib/features/home/presentation/widgets/requests_module.dart:72-82 — 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 `lib/features/home/presentation/widgets/continue_watching_module.dart:71` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) lib/features/home/presentation/widgets/downloads_module.dart:424— lib/features/home/presentation/widgets/downloads_module.dart:424-434 | lib/features/services/presentation/dashboard_sections.dart:603-613 — 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 `lib/features/home/presentation/widgets/downloads_module.dart:424` 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) lib/features/import/presentation/manual_import_provider.dart:123— lib/features/import/presentation/manual_import_provider.dart:123-133 | lib/features/import/presentation/manual_import_provider.dart:140-150 — 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 `lib/features/import/presentation/manual_import_provider.dart:123` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11 lines × 2) lib/features/music/presentation/artist_page.dart:411— lib/features/music/presentation/artist_page.dart:411-421 | lib/features/readarr/presentation/author_page.dart:168-178 — before extracting anything, compare `lib/features/music/presentation/artist_page.dart` and `lib/features/readarr/presentation/author_page.dart` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 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.
Duplicated block (11 lines × 2) lib/features/nzbget/presentation/nzbget_screen.dart:295— lib/features/nzbget/presentation/nzbget_screen.dart:295-305 | lib/features/transmission/presentation/transmission_screen.dart:347-357 — before extracting anything, compare `lib/features/nzbget/presentation/nzbget_screen.dart` and `lib/features/transmission/presentation/transmission_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 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 `lib/features/nzbget/presentation/nzbget_screen.dart:295` 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) lib/features/prowlarr/presentation/prowlarr_library_screen.dart:436— lib/features/prowlarr/presentation/prowlarr_library_screen.dart:436-446 | lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:118-128 — 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 `lib/features/prowlarr/presentation/prowlarr_library_screen.dart:436` 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) lib/features/unraid/presentation/unraid_screen.dart:689— lib/features/unraid/presentation/unraid_screen.dart:689-699 | lib/features/unraid/presentation/unraid_screen.dart:850-861 — 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 `lib/features/unraid/presentation/unraid_screen.dart:689` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:766— lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:766-776 | lib/features/tracearr/presentation/tracearr_owner_sign_in_flow.dart:352-362 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) ios/Runner/AppDelegate.swift:353— ios/Runner/AppDelegate.swift:353-363 | macos/Runner/MainFlutterWindow.swift:398-408 — before extracting anything, compare `ios/Runner/AppDelegate.swift` and `macos/Runner/MainFlutterWindow.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 145 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) lib/demo/world/fakes/arr_fakes.dart:737— lib/demo/world/fakes/arr_fakes.dart:737-747 | lib/demo/world/fakes/arr_fakes.dart:1304-1314 — 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 `lib/demo/world/fakes/arr_fakes.dart:737` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) lib/core/widgets/content_card.dart:174— lib/core/widgets/content_card.dart:174-183 | lib/core/widgets/media_poster_card.dart:99-108 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) lib/core/widgets/service_overview.dart:262— lib/core/widgets/service_overview.dart:262-271 | lib/features/home/presentation/widgets/home_module_frame.dart:211-220 — 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 `lib/core/widgets/service_overview.dart:262` 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 (10 lines × 2) lib/features/bazarr/presentation/bazarr_wanted_screen.dart:338— lib/features/bazarr/presentation/bazarr_wanted_screen.dart:338-347 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:277-286 — 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 `lib/features/bazarr/presentation/bazarr_wanted_screen.dart:338` 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 (10 lines × 2) lib/features/discover/presentation/widgets/calendar_agenda.dart:360— lib/features/discover/presentation/widgets/calendar_agenda.dart:360-370 | lib/features/media/presentation/media_parts.dart:98-107 — 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 `lib/features/discover/presentation/widgets/calendar_agenda.dart:360` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) lib/features/media/presentation/media_add_sheet.dart:333— lib/features/media/presentation/media_add_sheet.dart:333-342 | lib/features/music/presentation/lidarr_add_artist_sheet.dart:202-211 — 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 `lib/features/media/presentation/media_add_sheet.dart:333` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lib/features/music/presentation/lidarr_add_artist_sheet.dart:200` calls `_Header`, `SizedBox` and `lib/features/media/presentation/media_add_sheet.dart:332` 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 (10 lines × 2) lib/features/media/presentation/media_copy_panel_card.dart:194— lib/features/media/presentation/media_copy_panel_card.dart:194-203 | lib/features/media/presentation/media_decision_card.dart:67-76 — 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 `lib/features/media/presentation/media_copy_panel_card.dart:194` 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 (10 lines × 2) lib/features/music/presentation/artist_page.dart:813— lib/features/music/presentation/artist_page.dart:813-822 | lib/features/readarr/presentation/author_page.dart:386-396 — before extracting anything, compare `lib/features/music/presentation/artist_page.dart` and `lib/features/readarr/presentation/author_page.dart` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 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 `lib/features/music/presentation/artist_page.dart:813` 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 (10 lines × 2) lib/features/prowlarr/domain/models/prowlarr_models.dart:264— lib/features/prowlarr/domain/models/prowlarr_models.dart:264-273 | lib/features/prowlarr/domain/models/prowlarr_models.dart:796-805 — 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 (10 lines × 2) lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:81— lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:81-90 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:101-110 — before extracting anything, compare `lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart` and `lib/features/prowlarr/presentation/prowlarr_tags_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:81` 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 (10 lines × 2) lib/features/qbittorrent/data/qbittorrent_service.dart:50— lib/features/qbittorrent/data/qbittorrent_service.dart:50-59 | lib/features/qbittorrent/data/qbittorrent_service.dart:65-74 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) lib/demo/world/fakes/arr_fakes.dart:594— lib/demo/world/fakes/arr_fakes.dart:594-603 | lib/demo/world/fakes/arr_fakes.dart:1204-1213 — 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 `lib/demo/world/fakes/arr_fakes.dart:594` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) lib/features/activity/presentation/activity_page.dart:996— lib/features/activity/presentation/activity_page.dart:996-1005 | lib/features/home/presentation/widgets/downloads_module.dart:617-624 — 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 `lib/features/activity/presentation/activity_page.dart:996` 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 (8 lines × 2) lib/features/activity/presentation/widgets/activity_download_row.dart:335— lib/features/activity/presentation/widgets/activity_download_row.dart:335-342 | lib/features/discover/presentation/widgets/search_row.dart:844-851 — 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 (8 lines × 2) lib/features/activity/presentation/widgets/stuck_download_card.dart:101— lib/features/activity/presentation/widgets/stuck_download_card.dart:101-110 | lib/features/home/presentation/widgets/downloads_module.dart:547-554 — 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 `lib/features/activity/presentation/widgets/stuck_download_card.dart:101` 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 (8 lines × 2) lib/features/discover/presentation/seerr_overview_screen.dart:145— lib/features/discover/presentation/seerr_overview_screen.dart:145-153 | lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:104-111 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/discover/presentation/seerr_overview_screen.dart:145` 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) lib/features/media/presentation/media_page.dart:3304— lib/features/media/presentation/media_page.dart:3304-3311 | lib/features/media/presentation/media_series_manage.dart:676-683 — before extracting anything, compare `lib/features/media/presentation/media_page.dart` and `lib/features/media/presentation/media_series_manage.dart` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/media/presentation/media_page.dart:3304` 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) lib/features/media/presentation/media_parts.dart:276— lib/features/media/presentation/media_parts.dart:276-283 | lib/features/media/presentation/media_parts.dart:328-337 — 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 `lib/features/media/presentation/media_parts.dart:276` 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 (8 lines × 2) lib/features/npm/presentation/npm_overview_screen.dart:189— lib/features/npm/presentation/npm_overview_screen.dart:189-197 | lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:172-179 — 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 `lib/features/npm/presentation/npm_overview_screen.dart:189` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 (8 lines × 2) lib/features/transmission/presentation/transmission_overview_screen.dart:151— lib/features/transmission/presentation/transmission_overview_screen.dart:151-160 | lib/features/transmission/presentation/transmission_overview_screen.dart:291-298 — 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 `lib/features/transmission/presentation/transmission_overview_screen.dart:151` 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) lib/core/widgets/brief_failure_line.dart:39— lib/core/widgets/brief_failure_line.dart:39-46 | lib/core/widgets/not_configured_placeholder.dart:143-150 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) lib/features/bazarr/presentation/bazarr_library_screen.dart:202— lib/features/bazarr/presentation/bazarr_library_screen.dart:202-209 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:216-223 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_library_screen.dart` and `lib/features/bazarr/presentation/bazarr_wanted_screen.dart` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. 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 (8 lines × 2) lib/demo/world/fakes/arr_fakes.dart:638— lib/demo/world/fakes/arr_fakes.dart:638-645 | lib/demo/world/fakes/arr_fakes.dart:1224-1231 — 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 `lib/demo/world/fakes/arr_fakes.dart:638` 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.
AC3 · Page structure· Page without a main landmark · ×10
Page without a main landmark design/system/motion/DetailHeroCollapse/preview.html:3— 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 design/system/motion/MotionTokens/preview.html:3— 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 design/system/motion/NavPillTransition/preview.html:3— 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 design/system/motion/PosterFlight/preview.html:3— 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 design/system/motion/PressableScale/preview.html:3— 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 design/system/motion/ReelLine/preview.html:3— 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 design/system/motion/ServicePortalPhysics/preview.html:3— 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 design/system/motion/ServiceRingMotion/preview.html:3— 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 design/system/motion/ShimmerSweep/preview.html:3— 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 design/system/motion/StatusBadgeAnimated/preview.html:3— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
D4 · Code Duplication· Edited copy of a member (27 corresponding lines) · ×8
Edited copy of a member (27 corresponding lines) lib/features/bazarr/presentation/bazarr_detail_view_model.dart:69— lib/features/bazarr/presentation/bazarr_detail_view_model.dart:69-99 | lib/features/bazarr/presentation/bazarr_detail_view_model.dart:101-127 — 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) lib/features/discover/presentation/widgets/search_row.dart:509— lib/features/discover/presentation/widgets/search_row.dart:509-544 | lib/features/discover/presentation/widgets/search_row.dart:546-572 — 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) lib/features/shell/presentation/desktop/desktop_nav_rail.dart:626— lib/features/shell/presentation/desktop/desktop_nav_rail.dart:626-652 | lib/features/shell/presentation/desktop/desktop_nav_rail.dart:678-720 — 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) lib/features/discover/presentation/widgets/search_row.dart:677— lib/features/discover/presentation/widgets/search_row.dart:677-703 | lib/features/media/presentation/media_parts.dart:505-534 — 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) lib/features/pairing/presentation/pair_receive_screen.dart:454— lib/features/pairing/presentation/pair_receive_screen.dart:454-480 | lib/features/settings/presentation/service_settings_screen.dart:2828-2854 — 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) lib/features/bazarr/presentation/bazarr_wanted_screen.dart:425— lib/features/bazarr/presentation/bazarr_wanted_screen.dart:425-451 | lib/features/pairing/presentation/pair_scan_screen.dart:163-197 — 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) lib/features/settings/presentation/widgets/settings_summary_cards.dart:412— lib/features/settings/presentation/widgets/settings_summary_cards.dart:412-438 | lib/features/settings/presentation/widgets/settings_summary_cards.dart:445-471 — 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) lib/features/music/presentation/lidarr_overview_screen.dart:62— lib/features/music/presentation/lidarr_overview_screen.dart:62-88 | lib/features/readarr/presentation/readarr_overview_screen.dart:45-72 — 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 (24 corresponding lines) · ×8
Edited copy of a member (24 corresponding lines) lib/features/qbittorrent/presentation/torrent_detail_screen.dart:480— lib/features/qbittorrent/presentation/torrent_detail_screen.dart:480-503 | lib/features/qbittorrent/presentation/torrent_detail_screen.dart:608-631 — 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) lib/features/npm/presentation/npm_screen.dart:455— lib/features/npm/presentation/npm_screen.dart:455-481 | lib/features/unraid/presentation/unraid_screen.dart:641-664 — 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) lib/features/discover/presentation/seerr_overview_screen.dart:401— lib/features/discover/presentation/seerr_overview_screen.dart:401-424 | lib/features/home/presentation/widgets/arrived_module.dart:205-228 — 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) lib/features/music/presentation/artist_page.dart:754— lib/features/music/presentation/artist_page.dart:754-777 | lib/features/readarr/presentation/author_page.dart:358-381 — 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) lib/features/discover/presentation/calendar_page.dart:1031— lib/features/discover/presentation/calendar_page.dart:1031-1058 | lib/features/media/presentation/media_parts.dart:466-489 — 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) lib/features/nzbget/presentation/nzbget_screen.dart:352— lib/features/nzbget/presentation/nzbget_screen.dart:352-375 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:404-427 — 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) ios/Runner/AppDelegate.swift:233— ios/Runner/AppDelegate.swift:233-257 | macos/Runner/MainFlutterWindow.swift:272-295 — 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) lib/features/prowlarr/presentation/prowlarr_history_screen.dart:75— lib/features/prowlarr/presentation/prowlarr_history_screen.dart:75-99 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart: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.
Change coupling: lidarr_overview_screen.dart ↔ sonarr_overview_screen.dart lib/features/music/presentation/lidarr_overview_screen.dart:1— `lib/features/music/presentation/lidarr_overview_screen.dart` and `lib/features/series/presentation/sonarr_overview_screen.dart` change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `cb0ca8ad` fix(overview): Sonarr and Lidarr keep the Needs attention count throu…; `3c054904` refactor(overview): share the arr Overviews' rows, history section, p…; `a07fc4af` refactor(overview): one page for the shell of fourteen Overviews — run `git show` on any of them.
Change coupling: sabnzbd_screen.dart ↔ transmission_screen.dart lib/features/sabnzbd/presentation/sabnzbd_screen.dart:1— `lib/features/sabnzbd/presentation/sabnzbd_screen.dart` and `lib/features/transmission/presentation/transmission_screen.dart` change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `5743f039` refactor(clients): read a download client's queue page once, and draw…; `46c948b9` fix(clients): under the stale band, the rail's rates read a dash; `9859322d` fix(clients): a download queue that stopped coming back says how old … — run `git show` on any of them.
Change coupling: nzbget_screen.dart ↔ transmission_screen.dart lib/features/nzbget/presentation/nzbget_screen.dart:1— `lib/features/nzbget/presentation/nzbget_screen.dart` and `lib/features/transmission/presentation/transmission_screen.dart` change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `5743f039` refactor(clients): read a download client's queue page once, and draw…; `46c948b9` fix(clients): under the stale band, the rail's rates read a dash; `9859322d` fix(clients): a download queue that stopped coming back says how old … — run `git show` on any of them.
Change coupling: jellyfin_client.dart ↔ plex_client.dart lib/features/jellyfin/data/jellyfin_client.dart:1— `lib/features/jellyfin/data/jellyfin_client.dart` and `lib/features/plex/data/plex_client.dart` change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `8a0c5a51` refactor(stream): remove the refresh write and the unchecked external…; `14e66fc9` feat(stream): a media server reads the page key of a series; `3d241db7` chore: drop three readers that could say the wrong thing, none of the… — run `git show` on any of them.
Change coupling: radarr_overview_screen.dart ↔ sonarr_overview_screen.dart lib/features/movies/presentation/radarr_overview_screen.dart:1— `lib/features/movies/presentation/radarr_overview_screen.dart` and `lib/features/series/presentation/sonarr_overview_screen.dart` change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `3c054904` refactor(overview): share the arr Overviews' rows, history section, p…; `a07fc4af` refactor(overview): one page for the shell of fourteen Overviews; `01cfba48` feat(settings): only at home is said once, and its remedy opens the a… — run `git show` on any of them.
Change coupling: npm_screen.dart ↔ unraid_screen.dart lib/features/npm/presentation/npm_screen.dart:1— `lib/features/npm/presentation/npm_screen.dart` and `lib/features/unraid/presentation/unraid_screen.dart` change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are `d8ddf2b5` fix(services): a Retry on a client's page asks the server again; `f50cb2e2` feat(status): a band over a silent service says since when; `ad0d4089` fix(clients): a failed probe is a band over the last read, an empty q… — run `git show` on any of them.
Change coupling: in_flight.dart ↔ dashboard_sections.dart lib/features/services/domain/in_flight.dart:1— `lib/features/services/domain/in_flight.dart` and `lib/features/services/presentation/dashboard_sections.dart` change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `4e9466e0` feat(home): the Home of modules, arranged by each person; `947c5434` fix(home): a download paused on purpose is backlog on every client; `58c91a98` fix(home): needs a decision, in flight and recently added count every… — run `git show` on any of them.
Duplicated block (9 lines × 2) lib/features/dockge/presentation/dockge_screen.dart:61— lib/features/dockge/presentation/dockge_screen.dart:61-69 | lib/features/npm/presentation/npm_screen.dart:221-229 — 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 `lib/features/dockge/presentation/dockge_screen.dart:61` 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 (9 lines × 2) lib/features/import/presentation/manual_import_progress_screen.dart:303— lib/features/import/presentation/manual_import_progress_screen.dart:303-311 | lib/features/import/presentation/manual_import_review_rows.dart:717-725 — 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 `lib/features/import/presentation/manual_import_progress_screen.dart:303` 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) lib/features/movies/presentation/movies_screen.dart:145— lib/features/movies/presentation/movies_screen.dart:145-153 | lib/features/series/presentation/series_screen.dart:148-156 — 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 `lib/features/movies/presentation/movies_screen.dart:145` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) lib/features/qbittorrent/presentation/torrent_detail_screen.dart:490— lib/features/qbittorrent/presentation/torrent_detail_screen.dart:490-498 | lib/features/qbittorrent/presentation/torrent_detail_screen.dart:618-626 — 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 `lib/features/qbittorrent/presentation/torrent_detail_screen.dart:490` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart:122— lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart:122-130 | lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart:173-181 — 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 `lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart:122` 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 (9 lines × 2) lib/features/readarr/presentation/readarr_activity_screen.dart:44— lib/features/readarr/presentation/readarr_activity_screen.dart:44-52 | lib/features/readarr/presentation/readarr_history_screen.dart:33-41 — before extracting anything, compare `lib/features/readarr/presentation/readarr_activity_screen.dart` and `lib/features/readarr/presentation/readarr_history_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (9 lines × 2) lib/demo/world/fakes/arr_fakes.dart:2824— lib/demo/world/fakes/arr_fakes.dart:2824-2832 | lib/demo/world/fakes/arr_fakes.dart:2845-2853 — 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 `lib/demo/world/fakes/arr_fakes.dart:2824` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 2) lib/features/prowlarr/domain/models/prowlarr_models.dart:256— lib/features/prowlarr/domain/models/prowlarr_models.dart:256-261 | lib/features/prowlarr/domain/models/prowlarr_models.dart:792-797 — 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) lib/core/models/media_preview.dart:85— lib/core/models/media_preview.dart:85-90 | lib/features/music/domain/models/lidarr_album.dart:46-52 — 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. 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) lib/features/bazarr/presentation/bazarr_library_screen.dart:137— lib/features/bazarr/presentation/bazarr_library_screen.dart:137-142 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:151-156 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_library_screen.dart` and `lib/features/bazarr/presentation/bazarr_wanted_screen.dart` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (6 lines × 2) lib/features/jellyfin/data/media_browser_client.dart:668— lib/features/jellyfin/data/media_browser_client.dart:668-673 | lib/features/plex/data/plex_client.dart:809-814 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) lib/features/truenas/data/apps_api.dart:11— lib/features/truenas/data/apps_api.dart:11-16 | lib/features/truenas/data/dataset_api.dart:27-32 — 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 (6 lines × 2) lib/demo/world/fakes/arr_fakes.dart:583— lib/demo/world/fakes/arr_fakes.dart:583-590 | lib/demo/world/fakes/arr_fakes.dart:1195-1200 — 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 `lib/demo/world/fakes/arr_fakes.dart:583` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) lib/demo/world/fakes/arr_fakes.dart:1368— lib/demo/world/fakes/arr_fakes.dart:1368-1373 | lib/demo/world/fakes/arr_fakes.dart:2181-2188 — 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 `lib/demo/world/fakes/arr_fakes.dart:1368` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×6
Edited copy of a member (19 corresponding lines) lib/features/unraid/presentation/unraid_screen.dart:322— lib/features/unraid/presentation/unraid_screen.dart:322-340 | lib/features/unraid/presentation/unraid_screen.dart:482-502 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:118— lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:118-136 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:168-186 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) ios/Runner/AppDelegate.swift:192— ios/Runner/AppDelegate.swift:192-217 | macos/Runner/MainFlutterWindow.swift:243-261 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) lib/features/home/presentation/widgets/downloads_module.dart:637— lib/features/home/presentation/widgets/downloads_module.dart:637-655 | lib/features/import/presentation/manual_import_progress_screen.dart:259-289 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) lib/features/requests/presentation/widgets/request_answer_controls.dart:276— lib/features/requests/presentation/widgets/request_answer_controls.dart:276-297 | lib/features/requests/presentation/widgets/request_answer_controls.dart:299-317 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (19 corresponding lines) lib/core/theme.dart:824— lib/core/theme.dart:824-844 | lib/core/theme.dart:1022-1040 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (10 corresponding lines) · ×6
Edited copy of a member (10 corresponding lines) lib/features/discover/presentation/widgets/calendar_agenda.dart:435— lib/features/discover/presentation/widgets/calendar_agenda.dart:435-444 | lib/features/stream/presentation/widgets/stream_now_playing_section.dart:670-680 — 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) lib/features/activity/presentation/widgets/download_parts.dart:301— lib/features/activity/presentation/widgets/download_parts.dart:301-310 | lib/features/home/presentation/widgets/home_module_parts.dart:156-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) lib/features/media/presentation/media_page.dart:3216— lib/features/media/presentation/media_page.dart:3216-3227 | lib/features/media/presentation/media_series_manage.dart:454-463 — 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) lib/features/npm/presentation/npm_screen.dart:296— lib/features/npm/presentation/npm_screen.dart:296-305 | lib/features/npm/presentation/npm_screen.dart:307-316 — 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) lib/features/media/presentation/seerr_issue_thread_parts.dart:113— lib/features/media/presentation/seerr_issue_thread_parts.dart:113-122 | lib/features/music/presentation/music_find.dart:269-279 — 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) lib/features/settings/presentation/widgets/requester_settings_rows.dart:145— lib/features/settings/presentation/widgets/requester_settings_rows.dart:145-155 | lib/features/settings/presentation/widgets/settings_app_rows.dart:118-127 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (14 lines × 2) lib/features/media/presentation/media_page.dart:3179— lib/features/media/presentation/media_page.dart:3179-3192 | lib/features/media/presentation/media_series_manage.dart:396-409 — before extracting anything, compare `lib/features/media/presentation/media_page.dart` and `lib/features/media/presentation/media_series_manage.dart` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lib/features/media/presentation/media_series_manage.dart:392` calls `read`, `sonarrServiceForProvider` and `lib/features/media/presentation/media_page.dart:3177` 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) lib/features/media/presentation/media_page.dart:3194— lib/features/media/presentation/media_page.dart:3194-3207 | lib/features/media/presentation/media_series_manage.dart:411-424 — before extracting anything, compare `lib/features/media/presentation/media_page.dart` and `lib/features/media/presentation/media_series_manage.dart` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/media/presentation/media_page.dart:3194` 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 (14 lines × 2) lib/features/nzbget/presentation/nzbget_overview_screen.dart:119— lib/features/nzbget/presentation/nzbget_overview_screen.dart:119-132 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:229-242 — 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 `lib/features/nzbget/presentation/nzbget_overview_screen.dart:119` 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 (14 lines × 2) lib/features/readarr/data/readarr_service.dart:74— lib/features/readarr/data/readarr_service.dart:74-87 | lib/features/series/data/sonarr_service.dart:136-149 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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 × 2) lib/features/truenas/presentation/apps/truenas_apps_screen.dart:60— lib/features/truenas/presentation/apps/truenas_apps_screen.dart:60-73 | lib/features/truenas/presentation/storage/truenas_storage_screen.dart:37-50 — `lib/features/truenas/presentation/apps/truenas_apps_screen.dart` and `lib/features/truenas/presentation/storage/truenas_storage_screen.dart` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 37 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/truenas/presentation/apps/truenas_apps_screen.dart:60` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (14 lines × 2) lib/features/truenas/presentation/shares/truenas_shares_screen.dart:458— lib/features/truenas/presentation/shares/truenas_shares_screen.dart:458-471 | lib/features/truenas/presentation/system/truenas_credentials_screen.dart:317-330 — 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 `lib/features/truenas/presentation/shares/truenas_shares_screen.dart:458` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication· Edited copy of a member (26 corresponding lines) · ×5
Edited copy of a member (26 corresponding lines) lib/features/discover/data/seerr_service.dart:399— lib/features/discover/data/seerr_service.dart:399-428 | lib/features/discover/data/seerr_service.dart:565-590 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:32— lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:32-68 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:86-111 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) lib/features/bazarr/presentation/bazarr_history_screen.dart:115— lib/features/bazarr/presentation/bazarr_history_screen.dart:115-140 | lib/features/bazarr/presentation/bazarr_history_screen.dart:142-168 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) lib/features/plex/presentation/plex_tab_screens.dart:58— lib/features/plex/presentation/plex_tab_screens.dart:58-83 | lib/features/plex/presentation/plex_tab_screens.dart:92-117 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (26 corresponding lines) lib/features/import/presentation/manual_import_review_screen.dart:1025— lib/features/import/presentation/manual_import_review_screen.dart:1025-1059 | lib/features/import/presentation/manual_import_review_screen.dart:1068-1093 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×5
Edited copy of a member (25 corresponding lines) lib/features/activity/presentation/activity_page.dart:982— lib/features/activity/presentation/activity_page.dart:982-1013 | lib/features/home/presentation/widgets/downloads_module.dart:605-629 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) lib/features/activity/presentation/widgets/requests_board.dart:570— lib/features/activity/presentation/widgets/requests_board.dart:570-594 | lib/features/activity/presentation/widgets/requests_board.dart:596-621 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) lib/core/widgets/content_card.dart:161— lib/core/widgets/content_card.dart:161-192 | lib/features/media/presentation/shelf_page.dart:529-553 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) lib/features/qbittorrent/presentation/widgets/torrent_edit_dialogs.dart:120— lib/features/qbittorrent/presentation/widgets/torrent_edit_dialogs.dart:120-144 | lib/features/transmission/presentation/transmission_tab_screens.dart:1113-1137 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (25 corresponding lines) lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:123— lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:123-147 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:158-187 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (15 corresponding lines) · ×5
Edited copy of a member (15 corresponding lines) lib/features/bazarr/domain/models/bazarr_models.dart:578— lib/features/bazarr/domain/models/bazarr_models.dart:578-592 | lib/features/bazarr/domain/models/bazarr_models.dart:594-608 — 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) ios/CupolaWidgets/OutsideDownloads.swift:70— ios/CupolaWidgets/OutsideDownloads.swift:70-84 | ios/CupolaWidgets/OutsideRequests.swift:63-78 — 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) lib/features/discover/domain/models/seerr_issue.dart:95— lib/features/discover/domain/models/seerr_issue.dart:95-110 | lib/features/discover/domain/models/seerr_issue.dart:437-451 — 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) lib/features/discover/presentation/widgets/approve_request_sheet.dart:304— lib/features/discover/presentation/widgets/approve_request_sheet.dart:304-321 | lib/features/discover/presentation/widgets/approve_request_sheet.dart:323-337 — 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) lib/features/discover/presentation/discover_atrium.dart:665— lib/features/discover/presentation/discover_atrium.dart:665-681 | lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart:491-505 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (21 corresponding lines) · ×5
Edited copy of a member (21 corresponding lines) lib/core/widgets/service_overview.dart:1438— lib/core/widgets/service_overview.dart:1438-1458 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:250-282 — 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) lib/features/home/presentation/widgets/set_up_next_module.dart:254— lib/features/home/presentation/widgets/set_up_next_module.dart:254-276 | lib/features/media/presentation/media_episodes_graph.dart:749-769 — 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) lib/features/prowlarr/presentation/prowlarr_stats_screen.dart:162— lib/features/prowlarr/presentation/prowlarr_stats_screen.dart:162-187 | lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:407-427 — 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) ios/Runner/AppDelegate.swift:135— ios/Runner/AppDelegate.swift:135-156 | macos/Runner/MainFlutterWindow.swift:186-206 — 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) lib/features/pairing/presentation/pair_offer_screen.dart:316— lib/features/pairing/presentation/pair_offer_screen.dart:316-336 | lib/features/pairing/presentation/pair_offer_screen.dart:338-361 — 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 (12 corresponding lines) · ×5
Edited copy of a member (12 corresponding lines) lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:138— lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:138-149 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:188-201 — 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) lib/features/npm/domain/models/npm_models.dart:371— lib/features/npm/domain/models/npm_models.dart:371-382 | lib/features/qbittorrent/domain/models/rss.dart:57-70 — 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) lib/features/bazarr/presentation/widgets/bazarr_detail_sections.dart:143— lib/features/bazarr/presentation/widgets/bazarr_detail_sections.dart:143-154 | lib/features/discover/presentation/catalog_page.dart:486-503 — 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) lib/core/network/observed_transport.dart:194— lib/core/network/observed_transport.dart:194-210 | lib/demo/world/fake_socket.dart:91-102 — 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) lib/features/music/domain/models/lidarr_artist.dart:100— lib/features/music/domain/models/lidarr_artist.dart:100-112 | lib/features/series/domain/models/sonarr_series.dart:156-167 — 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 (9 corresponding lines) · ×5
Edited copy of a member (9 corresponding lines) android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideComingUp.kt:77— android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideComingUp.kt:77-85 | android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideDownloads.kt:65-73 — 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) lib/features/tracearr/domain/models/tracearr_server.dart:50— lib/features/tracearr/domain/models/tracearr_server.dart:50-59 | lib/features/tracearr/domain/models/tracearr_server.dart:126-134 — 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) lib/features/discover/data/seerr_service.dart:329— lib/features/discover/data/seerr_service.dart:329-337 | lib/features/discover/data/seerr_service.dart:800-811 — 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) lib/features/prowlarr/presentation/prowlarr_library_screen.dart:800— lib/features/prowlarr/presentation/prowlarr_library_screen.dart:800-808 | lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:370-378 — 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) lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:778— lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:778-786 | lib/features/tracearr/presentation/tracearr_owner_sign_in_flow.dart:364-372 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (7 corresponding lines) · ×5
Edited copy of a member (7 corresponding lines) android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideComingUp.kt:68— android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideComingUp.kt:68-74 | android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideRequests.kt:65-71 — 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) lib/features/discover/domain/models/discover_detail_model.dart:14— lib/features/discover/domain/models/discover_detail_model.dart:14-20 | lib/features/discover/domain/models/discover_detail_model.dart:241-250 — 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) lib/features/truenas/domain/models/share.dart:96— lib/features/truenas/domain/models/share.dart:96-103 | lib/features/import/domain/manual_import_models.dart:720-726 — 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) lib/features/tracearr/data/tracearr_owner_accounts.dart:203— lib/features/tracearr/data/tracearr_owner_accounts.dart:203-209 | lib/features/tracearr/presentation/tracearr_owner_sign_in_flow.dart:107-113 — 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) lib/core/utils/route_utils.dart:59— lib/core/utils/route_utils.dart:59-66 | lib/features/pairing/presentation/pair_offer_screen.dart:68-74 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (8 corresponding lines) · ×5
Edited copy of a member (8 corresponding lines) lib/features/unraid/data/unraid_client.dart:374— lib/features/unraid/data/unraid_client.dart:374-382 | lib/features/unraid/data/unraid_client.dart:400-407 — 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) lib/features/tracearr/data/tracearr_client.dart:83— lib/features/tracearr/data/tracearr_client.dart:83-92 | lib/features/tracearr/data/tracearr_client.dart:125-132 — 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) lib/features/prowlarr/presentation/prowlarr_library_screen.dart:122— lib/features/prowlarr/presentation/prowlarr_library_screen.dart:122-129 | lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:65-72 — 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) lib/features/discover/presentation/seerr_sign_in_notice.dart:293— lib/features/discover/presentation/seerr_sign_in_notice.dart:293-300 | lib/features/tracearr/presentation/tracearr_owner_notice.dart:180-187 — 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) lib/features/pairing/presentation/pair_offer_screen.dart:82— lib/features/pairing/presentation/pair_offer_screen.dart:82-89 | lib/features/settings/presentation/widgets/invite_sheet.dart:106-114 — 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.
Duplicated block (11–12 lines × 2) lib/features/bazarr/presentation/bazarr_library_screen.dart:264— lib/features/bazarr/presentation/bazarr_library_screen.dart:264-275 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:256-266 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_library_screen.dart` and `lib/features/bazarr/presentation/bazarr_wanted_screen.dart` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/bazarr/presentation/bazarr_library_screen.dart:264` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11–12 lines × 2) lib/features/home/presentation/widgets/set_up_next_module.dart:265— lib/features/home/presentation/widgets/set_up_next_module.dart:265-276 | lib/features/media/presentation/shelf_page.dart:631-641 — 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 `lib/features/home/presentation/widgets/set_up_next_module.dart:265` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11–12 lines × 2) lib/features/media/presentation/media_page.dart:3246— lib/features/media/presentation/media_page.dart:3246-3256 | lib/features/media/presentation/media_series_manage.dart:519-530 — before extracting anything, compare `lib/features/media/presentation/media_page.dart` and `lib/features/media/presentation/media_series_manage.dart` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/media/presentation/media_page.dart:3246` 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 (11–12 lines × 2) lib/features/music/presentation/artist_page.dart:321— lib/features/music/presentation/artist_page.dart:321-332 | lib/features/readarr/presentation/author_page.dart:108-118 — before extracting anything, compare `lib/features/music/presentation/artist_page.dart` and `lib/features/readarr/presentation/author_page.dart` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 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 `lib/features/music/presentation/artist_page.dart:321` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
Duplicated block (11–12 lines × 2) lib/demo/world/fakes/media_fakes.dart:2003— lib/demo/world/fakes/media_fakes.dart:2003-2014 | lib/demo/world/fakes/media_fakes.dart:2378-2388 — 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 `lib/demo/world/fakes/media_fakes.dart:2003` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×5
Recursive walk over a caller-supplied document has no depth cap lib/features/truenas/domain/models/dataset.dart:74— `TrueNasDataset.fromJson` is public and takes `Map<String, dynamic> json` from its caller, and it calls itself at line 74 (`TrueNasDataset.fromJson`) with a piece of `json` — and nowhere in `TrueNasDataset.fromJson` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `TrueNasDataset.fromJson` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap lib/features/qbittorrent/domain/models/rss.dart:108— `qbittorrentRssFeedsFromJson` is public, takes a document from its caller (line 79) and hands it to `visit`, which calls itself at line 108 (`visit`) with a piece of `node` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap lib/features/media/domain/media_series.dart:548— `sonarrCutoffResolution` is public, takes a document from its caller (line 537) and hands it to `resolution`, which calls itself at line 548 (`resolution`) with a piece of `item` — and nowhere in `resolution` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `resolution` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap lib/features/activity/presentation/widgets/activity_formatters.dart:231— `formatActivityValue` is public and takes `dynamic value` from its caller, and it calls itself at line 231 (`formatActivityValue`) with a piece of `value` — and nowhere in `formatActivityValue` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `formatActivityValue` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap lib/core/network/connection_failure.dart:534— `unwrapFailure` is public and takes `Object ? error` from its caller, and it calls itself at line 534 (`unwrapFailure`) with a piece of `error` — and nowhere in `unwrapFailure` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. `jsonDecode` sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws `StackOverflowError` from about 20,000 levels — 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser's stack). That is an `Error`, not an `Exception`: an `on Exception catch` around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through `unwrapFailure` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Swallowed exception (empty catch) packages/mobile_scanner/darwin/mobile_scanner/Sources/mobile_scanner/MobileScannerPlugin.swift:578— 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) lib/features/truenas/presentation/truenas_hub_screen.dart: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) lib/features/services/presentation/service_all_screens.dart:52— 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) lib/features/services/presentation/stack_screen.dart:331— 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) lib/features/requests/presentation/requests_screen.dart:84— 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.
AC6 · Visual & motion safety· Animation without a prefers-reduced-motion guard · ×4
Animation without a prefers-reduced-motion guard design/system/motion/motion.css:75— `.cp-motion-switch-track::after` moves (`transition: transform 200ms cubic-bezier(0.215, 0.61, 0.355, 1), background-color 200ms linear`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard design/system/motion/motion.css:144— `.cp-shimmer-sweep-block::after` moves (`animation: cp-shimmer-sweep-v 1600ms cubic-bezier(0.445, 0.05, 0.55, 0.95) infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard design/system/motion/motion.css:161— `.cp-nav-pill-transition-ind` moves (`transition: left calc(320ms * var(--k)) cubic-bezier(0.2, 0.8, 0.2, 1), width calc(320ms * var(--k)) cubic-bezier(0.2, 0.8, 0.2, 1)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard design/system/motion/motion.css:272— `.cp-service-portal-physics-coach` moves (`transition: transform calc(320ms * var(--k)) cubic-bezier(0.2, 0.8, 0.2, 1), opacity calc(320ms * var(--k)) linear`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Change coupling clique: movies_screen.dart, music_screen.dart, series_screen.dart lib/features/movies/presentation/movies_screen.dart— 3 files — `lib/features/movies/presentation/movies_screen.dart`, `lib/features/music/presentation/music_screen.dart`, `lib/features/series/presentation/series_screen.dart` — all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
Change coupling clique: radarr_service.dart, lidarr_service.dart, sonarr_service.dart lib/features/movies/data/radarr_service.dart— 3 files — `lib/features/movies/data/radarr_service.dart`, `lib/features/music/data/lidarr_service.dart`, `lib/features/series/data/sonarr_service.dart` — all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
Change coupling clique: radarr_overview_provider.dart, lidarr_overview_provider.dart, sonarr_overview_provider.dart lib/features/movies/presentation/radarr_overview_provider.dart— 3 files — `lib/features/movies/presentation/radarr_overview_provider.dart`, `lib/features/music/presentation/lidarr_overview_provider.dart`, `lib/features/series/presentation/sonarr_overview_provider.dart` — all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
Change coupling clique: service_verification.dart, connection_presentation.dart, transmission_actions.dart lib/features/settings/data/service_verification.dart— 3 files — `lib/features/settings/data/service_verification.dart`, `lib/features/settings/domain/connection_presentation.dart`, `lib/features/transmission/presentation/transmission_actions.dart` — all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique's coupling clears at once — you do not need to break each pair individually.
D4 · Code Duplication· Edited copy of a member (13 corresponding lines) · ×4
Edited copy of a member (13 corresponding lines) ios/CupolaWidgets/OutsideComingUp.swift:74— ios/CupolaWidgets/OutsideComingUp.swift:74-87 | ios/CupolaWidgets/OutsideRequests.swift:80-92 — 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) lib/features/jellyfin/domain/models/jellyfin_models.dart:101— lib/features/jellyfin/domain/models/jellyfin_models.dart:101-113 | lib/features/transmission/domain/models/transmission_models.dart:454-468 — 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) lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:118— lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:118-130 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:132-156 — 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) lib/features/activity/presentation/widgets/requests_board.dart:552— lib/features/activity/presentation/widgets/requests_board.dart:552-564 | lib/features/tracearr/presentation/tracearr_history_screen.dart:196-208 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (6 corresponding lines) · ×4
Edited copy of a member (6 corresponding lines) lib/features/onboarding/presentation/widgets/onboarding_found.dart:556— lib/features/onboarding/presentation/widgets/onboarding_found.dart:556-562 | lib/features/settings/presentation/widgets/connection_access_fields.dart:555-560 — 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) lib/features/truenas/domain/models/share.dart:58— lib/features/truenas/domain/models/share.dart:58-64 | lib/features/dockge/domain/models/dockge_stack.dart:109-114 — 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) lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:558— lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:558-563 | lib/features/tracearr/presentation/tracearr_owner_sign_in_flow.dart:293-298 — 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) lib/features/dockge/domain/models/dockge_stack.dart:23— lib/features/dockge/domain/models/dockge_stack.dart:23-28 | lib/features/transmission/domain/models/transmission_models.dart:25-30 — 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 (17 lines × 2) lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:345— lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:345-361 | lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart:152-168 — 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 `lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:345` 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) lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:217— lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:217-233 | lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:592-608 — 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 `lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:217` 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 (17 lines × 2) lib/features/truenas/presentation/system/truenas_system_config_screens.dart:510— lib/features/truenas/presentation/system/truenas_system_config_screens.dart:510-526 | lib/features/truenas/presentation/system/truenas_system_config_screens.dart:555-571 — 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 `lib/features/truenas/presentation/system/truenas_system_config_screens.dart:510` 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, `lib/features/truenas/presentation/system/truenas_system_config_screens.dart:527` calls `Icon`, `SizedBox` and `lib/features/truenas/presentation/system/truenas_system_config_screens.dart:572` 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 (17 lines × 2) ios/Runner/AppDelegate.swift:135— ios/Runner/AppDelegate.swift:135-151 | macos/Runner/MainFlutterWindow.swift:186-202 — before extracting anything, compare `ios/Runner/AppDelegate.swift` and `macos/Runner/MainFlutterWindow.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 145 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 `ios/Runner/AppDelegate.swift:135` 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) lib/features/bazarr/presentation/bazarr_history_screen.dart:228— lib/features/bazarr/presentation/bazarr_history_screen.dart:228-243 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:184-199 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_history_screen.dart` and `lib/features/prowlarr/presentation/prowlarr_history_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 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 `lib/features/bazarr/presentation/bazarr_history_screen.dart:228` 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 (16 lines × 2) lib/features/bazarr/presentation/bazarr_history_screen.dart:285— lib/features/bazarr/presentation/bazarr_history_screen.dart:285-300 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:236-251 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_history_screen.dart` and `lib/features/prowlarr/presentation/prowlarr_history_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 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 `lib/features/bazarr/presentation/bazarr_history_screen.dart:285` 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 (16 lines × 2) lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:47— lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:47-62 | lib/features/bazarr/presentation/bazarr_series_detail_screen.dart:52-67 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart` and `lib/features/bazarr/presentation/bazarr_series_detail_screen.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:47` 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 (16 lines × 2) lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart:141— lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart:141-156 | lib/features/prowlarr/presentation/widgets/prowlarr_tag_selector.dart:152-167 — 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 `lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart:141` 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) lib/features/pairing/presentation/pair_offer_screen.dart:151— lib/features/pairing/presentation/pair_offer_screen.dart:151-164 | lib/features/settings/presentation/settings_hints_screen.dart:26-40 — before extracting anything, compare `lib/features/pairing/presentation/pair_offer_screen.dart` and `lib/features/settings/presentation/settings_hints_screen.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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 `lib/features/pairing/presentation/pair_offer_screen.dart:151` 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) lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart:605— lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart:605-618 | lib/features/readarr/presentation/widgets/readarr_tiles.dart:142-156 — 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 `lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart:605` 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 (14–15 lines × 2) lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:187— lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:187-200 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:196-210 — before extracting anything, compare `lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart` and `lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:187` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `child` to `schemaAsync.when( data: (definitions` in one and `schemaAsync.when( data: (implementations` 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 (14–15 lines × 2) lib/features/truenas/presentation/dashboard/truenas_dashboard_screen.dart:401— lib/features/truenas/presentation/dashboard/truenas_dashboard_screen.dart:401-414 | lib/features/truenas/presentation/storage/truenas_pool_detail_screen.dart:96-110 — 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 `lib/features/truenas/presentation/dashboard/truenas_dashboard_screen.dart:401` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 2) lib/features/bazarr/domain/models/bazarr_models.dart:86— lib/features/bazarr/domain/models/bazarr_models.dart:86-92 | lib/features/bazarr/domain/models/bazarr_models.dart:139-145 — 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) lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:143— lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:143-149 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:195-201 — before extracting anything, compare `lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart` and `lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:143` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) lib/features/pairing/presentation/pair_code.dart:62— lib/features/pairing/presentation/pair_code.dart:62-68 | lib/features/release_search/presentation/release_search_sheet.dart:386-392 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) lib/demo/world/fakes/media_fakes.dart:960— lib/demo/world/fakes/media_fakes.dart:960-966 | lib/demo/world/fakes/media_fakes.dart:1131-1137 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
Members sharing a duplicated core (4 members, 50+ identical tokens) lib/features/npm/presentation/npm_advanced_config_screen.dart:45— lib/features/npm/presentation/npm_advanced_config_screen.dart:45-91 | lib/features/npm/presentation/npm_screen.dart:557-599 | lib/features/npm/presentation/npm_screen.dart:826-864 | lib/features/npm/presentation/npm_screen.dart:995-1026 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) lib/features/truenas/presentation/apps/truenas_apps_screen.dart:30— lib/features/truenas/presentation/apps/truenas_apps_screen.dart:30-82 | lib/features/truenas/presentation/datasets/truenas_datasets_screen.dart:25-70 | lib/features/truenas/presentation/storage/truenas_storage_screen.dart:24-59 | lib/features/truenas/presentation/system/truenas_services_screen.dart:23-69 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) lib/features/truenas/presentation/datasets/truenas_dataset_detail_screen.dart:332— lib/features/truenas/presentation/datasets/truenas_dataset_detail_screen.dart:332-398 | lib/features/truenas/presentation/shares/truenas_shares_screen.dart:528-586 | lib/features/truenas/presentation/system/truenas_credentials_screen.dart:124-185 | lib/features/truenas/presentation/system/truenas_credentials_screen.dart:240-299 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication· Edited copy of a member (35 corresponding lines) · ×3
Edited copy of a member (35 corresponding lines) lib/features/movies/domain/models/radarr_movie.dart:98— lib/features/movies/domain/models/radarr_movie.dart:98-137 | lib/features/series/domain/models/sonarr_series.dart:120-154 — 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.
Edited copy of a member (35 corresponding lines) lib/features/tracearr/presentation/tracearr_history_screen.dart:210— lib/features/tracearr/presentation/tracearr_history_screen.dart:210-251 | lib/features/tracearr/presentation/tracearr_history_screen.dart:253-287 — 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.
Edited copy of a member (35 corresponding lines) lib/features/home/presentation/widgets/home_module_parts.dart:22— lib/features/home/presentation/widgets/home_module_parts.dart:22-56 | lib/features/media/presentation/media_manage_parts.dart:135-172 — 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 (36 corresponding lines) · ×3
Edited copy of a member (36 corresponding lines) lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:80— lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:80-116 | lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:125-160 — These two members are one piece of code written twice and then edited apart: 36 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 (36 corresponding lines) lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:92— lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:92-127 | lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:135-170 — These two members are one piece of code written twice and then edited apart: 36 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 (36 corresponding lines) lib/features/unraid/presentation/unraid_overview_screen.dart:107— lib/features/unraid/presentation/unraid_overview_screen.dart:107-142 | lib/features/unraid/presentation/unraid_overview_screen.dart:195-232 — These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (34 corresponding lines) · ×3
Edited copy of a member (34 corresponding lines) lib/features/npm/presentation/npm_screen.dart:359— lib/features/npm/presentation/npm_screen.dart:359-392 | lib/features/npm/presentation/npm_screen.dart:406-442 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (34 corresponding lines) lib/features/discover/presentation/widgets/discover_door.dart:350— lib/features/discover/presentation/widgets/discover_door.dart:350-387 | lib/features/discover/presentation/widgets/discover_door.dart:397-430 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (34 corresponding lines) lib/core/widgets/fault_note.dart:41— lib/core/widgets/fault_note.dart:41-76 | lib/features/release_search/presentation/release_search_settings_screen.dart:390-423 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (23 corresponding lines) · ×3
Edited copy of a member (23 corresponding lines) lib/features/dockge/data/dockge_client.dart:277— lib/features/dockge/data/dockge_client.dart:277-304 | lib/features/truenas/data/truenas_ws_client.dart:269-291 — 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) lib/features/onboarding/presentation/widgets/onboarding_found.dart:1062— lib/features/onboarding/presentation/widgets/onboarding_found.dart:1062-1084 | lib/features/requests/presentation/requests_screen.dart:324-349 — 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) lib/features/truenas/presentation/apps/truenas_apps_screen.dart:178— lib/features/truenas/presentation/apps/truenas_apps_screen.dart:178-205 | lib/features/truenas/presentation/storage/truenas_pool_detail_screen.dart:236-258 — 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 (18 corresponding lines) · ×3
Edited copy of a member (18 corresponding lines) lib/features/music/presentation/artist_page.dart:831— lib/features/music/presentation/artist_page.dart:831-848 | lib/features/readarr/presentation/author_page.dart:405-422 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) lib/features/music/presentation/artist_page.dart:812— lib/features/music/presentation/artist_page.dart:812-829 | lib/features/readarr/presentation/author_page.dart:383-403 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (18 corresponding lines) lib/features/tracearr/presentation/tracearr_history_screen.dart:289— lib/features/tracearr/presentation/tracearr_history_screen.dart:289-312 | lib/features/tracearr/presentation/tracearr_history_screen.dart:314-331 — 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 (17 corresponding lines) · ×3
Edited copy of a member (17 corresponding lines) lib/features/transmission/presentation/transmission_tab_screens.dart:838— lib/features/transmission/presentation/transmission_tab_screens.dart:838-857 | lib/features/transmission/presentation/transmission_tab_screens.dart:859-875 — 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) lib/features/home/presentation/edit_home_page.dart:249— lib/features/home/presentation/edit_home_page.dart:249-268 | lib/features/media/presentation/shelf_page.dart:833-849 — 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) lib/features/settings/presentation/widgets/seerr_sign_in_steps.dart:268— lib/features/settings/presentation/widgets/seerr_sign_in_steps.dart:268-284 | lib/features/tracearr/presentation/tracearr_owner_fields.dart:264-283 — 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 (14 corresponding lines) · ×3
Edited copy of a member (14 corresponding lines) lib/features/import/presentation/manual_import_provider.dart:1051— lib/features/import/presentation/manual_import_provider.dart:1051-1064 | lib/features/import/presentation/manual_import_provider.dart:1066-1079 — 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) lib/features/qbittorrent/data/qbittorrent_service.dart:49— lib/features/qbittorrent/data/qbittorrent_service.dart:49-62 | lib/features/qbittorrent/data/qbittorrent_service.dart:64-77 — 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) lib/features/discover/presentation/discover_atrium.dart:241— lib/features/discover/presentation/discover_atrium.dart:241-257 | lib/features/discover/presentation/discover_atrium.dart:1038-1051 — 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 copies of one member (3 members, 15+ corresponding lines) · ×3
Edited copies of one member (3 members, 15+ corresponding lines) lib/features/nzbget/presentation/nzbget_tab_screens.dart:19— lib/features/nzbget/presentation/nzbget_tab_screens.dart:19-33 | lib/features/nzbget/presentation/nzbget_tab_screens.dart:41-55 | lib/features/nzbget/presentation/nzbget_tab_screens.dart:63-77 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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, 15+ corresponding lines) lib/features/prowlarr/domain/models/prowlarr_models.dart:488— lib/features/prowlarr/domain/models/prowlarr_models.dart:488-502 | lib/features/prowlarr/domain/models/prowlarr_models.dart:658-673 | lib/features/prowlarr/domain/models/prowlarr_models.dart:866-880 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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, 15+ corresponding lines) lib/features/activity/presentation/widgets/detail_sheets.dart:25— lib/features/activity/presentation/widgets/detail_sheets.dart:25-41 | lib/features/activity/presentation/widgets/detail_sheets.dart:43-57 | lib/features/activity/presentation/widgets/detail_sheets.dart:59-73 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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.
Duplicated block (24 lines × 2) lib/features/bazarr/presentation/bazarr_history_screen.dart:185— lib/features/bazarr/presentation/bazarr_history_screen.dart:185-208 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:141-164 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_history_screen.dart` and `lib/features/prowlarr/presentation/prowlarr_history_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 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 `lib/features/bazarr/presentation/bazarr_history_screen.dart:185` 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 (24 lines × 2) lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:156— lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:156-179 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:209-232 — before extracting anything, compare `lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart` and `lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart: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.
Duplicated block (24 lines × 2) lib/features/readarr/presentation/readarr_activity_screen.dart:67— lib/features/readarr/presentation/readarr_activity_screen.dart:67-90 | lib/features/readarr/presentation/readarr_history_screen.dart:73-96 — before extracting anything, compare `lib/features/readarr/presentation/readarr_activity_screen.dart` and `lib/features/readarr/presentation/readarr_history_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/readarr/presentation/readarr_activity_screen.dart:67` 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 (18 lines × 2) lib/features/music/presentation/lidarr_add_album_sheet.dart:315— lib/features/music/presentation/lidarr_add_album_sheet.dart:315-332 | lib/features/music/presentation/lidarr_add_artist_sheet.dart:360-377 — 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 `lib/features/music/presentation/lidarr_add_album_sheet.dart:315` 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 (18 lines × 2) lib/features/nzbget/presentation/nzbget_screen.dart:191— lib/features/nzbget/presentation/nzbget_screen.dart:191-208 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:201-218 — before extracting anything, compare `lib/features/nzbget/presentation/nzbget_screen.dart` and `lib/features/sabnzbd/presentation/sabnzbd_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 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 `lib/features/nzbget/presentation/nzbget_screen.dart:191` 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 (18 lines × 2) lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:348— lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:348-365 | lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:506-523 — 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 `lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:348` 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 (10–12 lines × 2) lib/features/activity/presentation/widgets/violation_rows.dart:118— lib/features/activity/presentation/widgets/violation_rows.dart:118-127 | lib/features/services/presentation/dashboard_sections.dart:594-605 — 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 `lib/features/activity/presentation/widgets/violation_rows.dart:118` 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 (10–12 lines × 2) lib/features/discover/presentation/seerr_overview_screen.dart:138— lib/features/discover/presentation/seerr_overview_screen.dart:138-149 | lib/features/discover/presentation/seerr_overview_screen.dart:309-318 — 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 `lib/features/discover/presentation/seerr_overview_screen.dart:138` 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 (10–12 lines × 2) lib/features/truenas/presentation/system/truenas_system_config_screens.dart:92— lib/features/truenas/presentation/system/truenas_system_config_screens.dart:92-101 | lib/features/truenas/presentation/system/truenas_system_config_screens.dart:161-172 — 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 `lib/features/truenas/presentation/system/truenas_system_config_screens.dart:92` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 2) lib/features/bazarr/domain/models/bazarr_models.dart:96— lib/features/bazarr/domain/models/bazarr_models.dart:96-100 | lib/features/bazarr/domain/models/bazarr_models.dart:149-153 — 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) lib/features/truenas/domain/models/data_protection.dart:75— lib/features/truenas/domain/models/data_protection.dart:75-79 | lib/features/truenas/domain/models/data_protection.dart:81-85 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 2) lib/features/bazarr/presentation/bazarr_history_screen.dart:170— lib/features/bazarr/presentation/bazarr_history_screen.dart:170-174 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:126-130 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_history_screen.dart` and `lib/features/prowlarr/presentation/prowlarr_history_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 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.
D4 · Code Duplication· Edited copy of a member (60 corresponding lines) · ×2
Edited copy of a member (60 corresponding lines) lib/features/movies/presentation/movies_find.dart:124— lib/features/movies/presentation/movies_find.dart:124-183 | lib/features/series/presentation/series_find.dart:127-193 — These two members are one piece of code written twice and then edited apart: 60 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 (60 corresponding lines) lib/core/widgets/floating_bottom_nav_bar.dart:560— lib/core/widgets/floating_bottom_nav_bar.dart:560-633 | lib/core/widgets/floating_nav_rail.dart:210-269 — These two members are one piece of code written twice and then edited apart: 60 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 (62 corresponding lines) · ×2
Edited copy of a member (62 corresponding lines) lib/features/bazarr/presentation/bazarr_history_screen.dart:313— lib/features/bazarr/presentation/bazarr_history_screen.dart:313-381 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:259-320 — These two members are one piece of code written twice and then edited apart: 62 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 (62 corresponding lines) lib/features/dockge/presentation/dockge_screen.dart:128— lib/features/dockge/presentation/dockge_screen.dart:128-189 | lib/features/unraid/presentation/unraid_screen.dart:891-974 — These two members are one piece of code written twice and then edited apart: 62 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 (49 corresponding lines) · ×2
Edited copy of a member (49 corresponding lines) lib/features/shell/presentation/desktop/window_chrome.dart:521— lib/features/shell/presentation/desktop/window_chrome.dart:521-569 | lib/features/shell/presentation/desktop/window_chrome.dart:589-658 — These two members are one piece of code written twice and then edited apart: 49 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 (49 corresponding lines) lib/features/music/presentation/lidarr_add_album_sheet.dart:209— lib/features/music/presentation/lidarr_add_album_sheet.dart:209-259 | lib/features/readarr/presentation/author_page.dart:535-583 — These two members are one piece of code written twice and then edited apart: 49 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 (50 corresponding lines) · ×2
Edited copy of a member (50 corresponding lines) lib/features/npm/presentation/npm_screen.dart:500— lib/features/npm/presentation/npm_screen.dart:500-549 | lib/features/truenas/presentation/widgets/truenas_version_banner.dart:16-69 — These two members are one piece of code written twice and then edited apart: 50 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 (50 corresponding lines) lib/core/widgets/service_overview.dart:1697— lib/core/widgets/service_overview.dart:1697-1746 | lib/features/discover/presentation/seerr_overview_screen.dart:432-485 — These two members are one piece of code written twice and then edited apart: 50 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) · ×2
Edited copy of a member (45 corresponding lines) lib/features/truenas/presentation/system/truenas_system_hub_screen.dart:130— lib/features/truenas/presentation/system/truenas_system_hub_screen.dart:130-174 | lib/features/truenas/presentation/truenas_hub_screen.dart:127-173 — 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.
Edited copy of a member (45 corresponding lines) lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:101— lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:101-145 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:190-242 — 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 (43 corresponding lines) · ×2
Edited copy of a member (43 corresponding lines) lib/features/bazarr/presentation/bazarr_history_screen.dart:210— lib/features/bazarr/presentation/bazarr_history_screen.dart:210-254 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:166-208 — 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.
Edited copy of a member (43 corresponding lines) lib/features/truenas/presentation/shares/truenas_shares_screen.dart:458— lib/features/truenas/presentation/shares/truenas_shares_screen.dart:458-502 | lib/features/truenas/presentation/system/truenas_credentials_screen.dart:317-359 — 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 (3 members, 37+ corresponding lines) · ×2
Edited copies of one member (3 members, 37+ corresponding lines) lib/features/jellyfin/presentation/jellyfin_tab_screens.dart:56— lib/features/jellyfin/presentation/jellyfin_tab_screens.dart:56-93 | lib/features/jellyfin/presentation/jellyfin_tab_screens.dart:109-146 | lib/features/jellyfin/presentation/jellyfin_tab_screens.dart:165-201 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 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, 37+ corresponding lines) lib/features/npm/presentation/npm_overview_screen.dart:127— lib/features/npm/presentation/npm_overview_screen.dart:127-167 | lib/features/npm/presentation/npm_overview_screen.dart:212-249 | lib/features/npm/presentation/npm_overview_screen.dart:286-322 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 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, 31+ corresponding lines) · ×2
Edited copies of one member (3 members, 31+ corresponding lines) lib/features/movies/presentation/movies_find.dart:61— lib/features/movies/presentation/movies_find.dart:61-101 | lib/features/readarr/presentation/readarr_find.dart:45-75 | lib/features/series/presentation/series_find.dart:64-104 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 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, 31+ corresponding lines) lib/features/truenas/presentation/shares/truenas_shares_screen.dart:150— lib/features/truenas/presentation/shares/truenas_shares_screen.dart:150-186 | lib/features/truenas/presentation/shares/truenas_shares_screen.dart:284-318 | lib/features/truenas/presentation/system/truenas_credentials_screen.dart:65-95 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 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 (41 corresponding lines) · ×2
Edited copy of a member (41 corresponding lines) lib/core/widgets/release_list_widgets.dart:695— lib/core/widgets/release_list_widgets.dart:695-743 | lib/core/widgets/tag_chip.dart:36-76 — 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.
Edited copy of a member (41 corresponding lines) lib/features/import/presentation/manual_import_fix_sheet.dart:976— lib/features/import/presentation/manual_import_fix_sheet.dart:976-1016 | lib/features/media/presentation/media_parts.dart:318-362 — 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 (31 corresponding lines) · ×2
Edited copy of a member (31 corresponding lines) lib/features/nzbget/presentation/nzbget_overview_screen.dart:91— lib/features/nzbget/presentation/nzbget_overview_screen.dart:91-132 | lib/features/nzbget/presentation/nzbget_overview_screen.dart:188-218 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (31 corresponding lines) lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:370— lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:370-401 | lib/features/transmission/presentation/transmission_overview_screen.dart:207-237 — 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 (33 corresponding lines) · ×2
Edited copy of a member (33 corresponding lines) lib/features/transmission/presentation/transmission_overview_screen.dart:78— lib/features/transmission/presentation/transmission_overview_screen.dart:78-132 | lib/features/transmission/presentation/transmission_overview_screen.dart:140-172 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (33 corresponding lines) lib/features/bazarr/presentation/bazarr_history_screen.dart:176— lib/features/bazarr/presentation/bazarr_history_screen.dart:176-208 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:132-164 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (32 corresponding lines) · ×2
Edited copy of a member (32 corresponding lines) lib/features/unraid/presentation/unraid_screen.dart:672— lib/features/unraid/presentation/unraid_screen.dart:672-703 | lib/features/unraid/presentation/unraid_screen.dart:831-865 — These two members are one piece of code written twice and then edited apart: 32 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 (32 corresponding lines) lib/features/stream/presentation/stream_libraries_screen.dart:69— lib/features/stream/presentation/stream_libraries_screen.dart:69-100 | lib/features/stream/presentation/stream_overview_screen.dart:96-140 — These two members are one piece of code written twice and then edited apart: 32 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) · ×2
Edited copy of a member (29 corresponding lines) lib/features/movies/presentation/radarr_overview_screen.dart:196— lib/features/movies/presentation/radarr_overview_screen.dart:196-224 | lib/features/series/presentation/sonarr_overview_screen.dart:211-241 — 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.
Edited copy of a member (29 corresponding lines) lib/features/media/presentation/media_add_sheet.dart:406— lib/features/media/presentation/media_add_sheet.dart:406-435 | lib/features/music/presentation/lidarr_add_parts.dart:400-428 — 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 (28 corresponding lines) · ×2
Edited copy of a member (28 corresponding lines) lib/features/qbittorrent/presentation/torrent_detail_screen.dart:371— lib/features/qbittorrent/presentation/torrent_detail_screen.dart:371-398 | lib/features/qbittorrent/presentation/torrent_detail_screen.dart:412-451 — 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) lib/features/transmission/presentation/transmission_screen.dart:329— lib/features/transmission/presentation/transmission_screen.dart:329-357 | lib/features/transmission/presentation/transmission_tab_screens.dart:374-401 — 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 (22 corresponding lines) · ×2
Edited copy of a member (22 corresponding lines) lib/core/widgets/service_overview.dart:1407— lib/core/widgets/service_overview.dart:1407-1428 | lib/features/npm/presentation/npm_overview_screen.dart:175-203 — 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) lib/features/onboarding/presentation/widgets/onboarding_found.dart:1026— lib/features/onboarding/presentation/widgets/onboarding_found.dart:1026-1047 | lib/features/onboarding/presentation/widgets/onboarding_walk.dart:205-231 — 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 (20 corresponding lines) · ×2
Edited copy of a member (20 corresponding lines) lib/features/release_search/presentation/release_search_sheet.dart:318— lib/features/release_search/presentation/release_search_sheet.dart:318-346 | lib/features/release_search/presentation/release_search_sheet.dart:806-825 — 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) lib/core/widgets/service_overview.dart:818— lib/core/widgets/service_overview.dart:818-837 | lib/features/music/presentation/lidarr_add_parts.dart:361-383 — 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 copies of one member (3 members, 17+ corresponding lines) · ×2
Edited copies of one member (3 members, 17+ corresponding lines) lib/core/widgets/tag_chip.dart:85— lib/core/widgets/tag_chip.dart:85-106 | lib/features/stream/presentation/widgets/stream_poster_tile.dart:151-167 | lib/features/truenas/presentation/apps/truenas_apps_screen.dart:211-237 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 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, 17+ corresponding lines) lib/features/npm/presentation/npm_overview_screen.dart:257— lib/features/npm/presentation/npm_overview_screen.dart:257-277 | lib/features/npm/presentation/npm_overview_screen.dart:330-346 | lib/features/stream/presentation/stream_overview_screen.dart:400-419 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 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, 18+ corresponding lines) · ×2
Edited copies of one member (3 members, 18+ corresponding lines) lib/features/music/presentation/lidarr_add_artist_sheet.dart:117— lib/features/music/presentation/lidarr_add_artist_sheet.dart:117-138 | lib/features/music/presentation/lidarr_add_parts.dart:138-155 | lib/features/music/presentation/lidarr_add_parts.dart:157-178 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 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, 18+ corresponding lines) lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:343— lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:343-361 | lib/features/readarr/presentation/readarr_overview_screen.dart:162-179 | lib/features/transmission/presentation/transmission_overview_screen.dart:180-199 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 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 (11 corresponding lines) · ×2
Edited copy of a member (11 corresponding lines) lib/features/tracearr/data/tracearr_client.dart:341— lib/features/tracearr/data/tracearr_client.dart:341-354 | lib/features/tracearr/data/tracearr_client.dart:372-382 — 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) lib/features/settings/data/operator_adds_via_provider.dart:16— lib/features/settings/data/operator_adds_via_provider.dart:16-27 | lib/features/settings/data/stream_player_provider.dart:39-49 — 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 copy of a member (3 corresponding lines) · ×2
Edited copy of a member (3 corresponding lines) ios/Runner/AppDelegate.swift:291— ios/Runner/AppDelegate.swift:291-293 | macos/Runner/MainFlutterWindow.swift:343-345 — 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.
Edited copy of a member (3 corresponding lines) lib/features/jellyfin/data/media_browser_client.dart:664— lib/features/jellyfin/data/media_browser_client.dart:664-666 | lib/features/plex/data/plex_client.dart:805-807 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (2 corresponding lines) · ×2
Edited copy of a member (2 corresponding lines) lib/core/network/redirect_guard.dart:239— lib/core/network/redirect_guard.dart:239-240 | lib/core/network/same_origin_http_client.dart:124-125 — These two members are one piece of code written twice and then edited apart: 2 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 (2 corresponding lines) lib/features/truenas/data/dataset_api.dart:37— lib/features/truenas/data/dataset_api.dart:37-38 | lib/features/truenas/data/sharing_api.dart:15-16 — These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (4 corresponding lines) · ×2
Edited copy of a member (4 corresponding lines) ios/Runner/AppDelegate.swift:371— ios/Runner/AppDelegate.swift:371-374 | macos/Runner/MainFlutterWindow.swift:414-417 — 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) lib/demo/world/fakes/client_fakes.dart:310— lib/demo/world/fakes/client_fakes.dart:310-313 | lib/demo/world/fakes/infra_fakes.dart:400-403 — 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) · ×2
Edited copy of a member (5 corresponding lines) lib/features/truenas/data/credentials_api.dart:14— lib/features/truenas/data/credentials_api.dart:14-18 | lib/features/truenas/data/system_api.dart:28-32 — 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) lib/demo/world/fakes/arr_fakes.dart:399— lib/demo/world/fakes/arr_fakes.dart:399-406 | lib/demo/world/fakes/arr_fakes.dart:907-911 — 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 (18–23 lines × 2) lib/core/widgets/service_overview.dart:1407— lib/core/widgets/service_overview.dart:1407-1424 | lib/features/npm/presentation/npm_overview_screen.dart:175-197 — 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 `lib/core/widgets/service_overview.dart:1407` 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 (18–23 lines × 2) lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:409— lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:409-431 | lib/features/unraid/presentation/unraid_overview_screen.dart:327-344 — 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. 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) lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:206— lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:206-228 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:290-312 — before extracting anything, compare `lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart` and `lib/features/prowlarr/presentation/prowlarr_tags_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:206` 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 (23 lines × 2) lib/features/readarr/presentation/readarr_activity_screen.dart:93— lib/features/readarr/presentation/readarr_activity_screen.dart:93-115 | lib/features/readarr/presentation/readarr_history_screen.dart:99-121 — before extracting anything, compare `lib/features/readarr/presentation/readarr_activity_screen.dart` and `lib/features/readarr/presentation/readarr_history_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/readarr/presentation/readarr_activity_screen.dart:93` 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 (21 lines × 2) lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart:90— lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart:90-110 | lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart:185-205 — 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 `lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart:90` 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 (21 lines × 2) ios/Runner/AppDelegate.swift:237— ios/Runner/AppDelegate.swift:237-257 | macos/Runner/MainFlutterWindow.swift:275-295 — before extracting anything, compare `ios/Runner/AppDelegate.swift` and `macos/Runner/MainFlutterWindow.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 145 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 `ios/Runner/AppDelegate.swift:237` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (20 lines × 3) lib/features/jellyfin/presentation/jellyfin_tab_screens.dart:56— lib/features/jellyfin/presentation/jellyfin_tab_screens.dart:56-75 | lib/features/jellyfin/presentation/jellyfin_tab_screens.dart:109-128 | lib/features/jellyfin/presentation/jellyfin_tab_screens.dart:165-184 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/jellyfin/presentation/jellyfin_tab_screens.dart:56` 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 × 3) lib/features/npm/presentation/npm_screen.dart:643— lib/features/npm/presentation/npm_screen.dart:643-662 | lib/features/unraid/presentation/unraid_screen.dart:746-765 | lib/features/unraid/presentation/unraid_screen.dart:910-929 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/npm/presentation/npm_screen.dart:643` 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 (17–18 lines × 2) lib/features/home/presentation/widgets/continue_watching_module.dart:396— lib/features/home/presentation/widgets/continue_watching_module.dart:396-413 | lib/features/home/presentation/widgets/ready_to_watch_module.dart:200-216 — 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 `lib/features/home/presentation/widgets/continue_watching_module.dart:396` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17–18 lines × 2) lib/features/jellyfin/data/media_browser_client.dart:705— lib/features/jellyfin/data/media_browser_client.dart:705-722 | lib/features/plex/data/plex_client.dart:845-861 — 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 `lib/features/jellyfin/data/media_browser_client.dart:705` 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 (14–16 lines × 2) lib/features/activity/presentation/activity_page.dart:605— lib/features/activity/presentation/activity_page.dart:605-618 | lib/features/activity/presentation/activity_page.dart:638-653 — 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 `lib/features/activity/presentation/activity_page.dart:605` 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 (14–16 lines × 2) lib/features/music/presentation/lidarr_overview_screen.dart:212— lib/features/music/presentation/lidarr_overview_screen.dart:212-225 | lib/features/readarr/presentation/readarr_overview_screen.dart:139-154 — 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 `lib/features/music/presentation/lidarr_overview_screen.dart:212` 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 (15 lines × 2) lib/features/bazarr/presentation/bazarr_library_screen.dart:347— lib/features/bazarr/presentation/bazarr_library_screen.dart:347-361 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:312-326 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_library_screen.dart` and `lib/features/bazarr/presentation/bazarr_wanted_screen.dart` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/bazarr/presentation/bazarr_library_screen.dart:347` 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 (15 lines × 2) lib/features/nzbget/presentation/nzbget_screen.dart:281— lib/features/nzbget/presentation/nzbget_screen.dart:281-295 | lib/features/transmission/presentation/transmission_screen.dart:329-343 — before extracting anything, compare `lib/features/nzbget/presentation/nzbget_screen.dart` and `lib/features/transmission/presentation/transmission_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 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 `lib/features/nzbget/presentation/nzbget_screen.dart:281` 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 (13–15 lines × 2) lib/features/home/presentation/widgets/continue_watching_module.dart:250— lib/features/home/presentation/widgets/continue_watching_module.dart:250-262 | lib/features/home/presentation/widgets/now_playing_module.dart:190-204 — 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 `lib/features/home/presentation/widgets/continue_watching_module.dart:250` 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–15 lines × 2) lib/features/truenas/presentation/system/truenas_system_config_screens.dart:469— lib/features/truenas/presentation/system/truenas_system_config_screens.dart:469-481 | lib/features/truenas/presentation/system/truenas_system_config_screens.dart:560-574 — 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 `lib/features/truenas/presentation/system/truenas_system_config_screens.dart:469` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12 lines × 3) lib/features/npm/presentation/npm_screen.dart:584— lib/features/npm/presentation/npm_screen.dart:584-595 | lib/features/npm/presentation/npm_screen.dart:849-860 | lib/features/npm/presentation/npm_screen.dart:1011-1022 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/npm/presentation/npm_screen.dart:584` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 3) lib/features/truenas/presentation/apps/truenas_apps_screen.dart:62— lib/features/truenas/presentation/apps/truenas_apps_screen.dart:62-73 | lib/features/truenas/presentation/datasets/truenas_datasets_screen.dart:41-52 | lib/features/truenas/presentation/storage/truenas_storage_screen.dart:39-50 — `lib/features/truenas/presentation/apps/truenas_apps_screen.dart` and `lib/features/truenas/presentation/storage/truenas_storage_screen.dart` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 37 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/truenas/presentation/apps/truenas_apps_screen.dart:62` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10–11 lines × 2) lib/features/home/presentation/home_screen.dart:359— lib/features/home/presentation/home_screen.dart:359-368 | lib/features/settings/presentation/requester_account_page.dart:206-216 — 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 `lib/features/settings/presentation/requester_account_page.dart:206` 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 (10–11 lines × 2) lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:314— lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:314-323 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:265-275 — 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 `lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:314` 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 (10 lines × 3) lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart:260— lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart:260-269 | lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart:113-122 | lib/features/readarr/presentation/widgets/readarr_tiles.dart:119-128 — before extracting anything, compare `lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart` and `lib/features/readarr/presentation/widgets/readarr_tiles.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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 `lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart:260` 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 (10 lines × 3) lib/features/unraid/presentation/unraid_screen.dart:328— lib/features/unraid/presentation/unraid_screen.dart:328-337 | lib/features/unraid/presentation/unraid_screen.dart:489-499 | lib/features/unraid/presentation/unraid_screen.dart:594-604 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/unraid/presentation/unraid_screen.dart:328` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8–10 lines × 2) lib/core/widgets/service_overview.dart:1292— lib/core/widgets/service_overview.dart:1292-1299 | lib/core/widgets/service_overview.dart:1356-1365 — 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 `lib/core/widgets/service_overview.dart:1292` 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–10 lines × 2) lib/features/activity/presentation/activity_needs_you_page.dart:51— lib/features/activity/presentation/activity_needs_you_page.dart:51-58 | lib/features/activity/presentation/activity_page.dart:552-561 — 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 (9–10 lines × 2) lib/features/discover/presentation/widgets/discover_door.dart:375— lib/features/discover/presentation/widgets/discover_door.dart:375-384 | lib/features/discover/presentation/widgets/discover_door.dart:420-428 — 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 `lib/features/discover/presentation/widgets/discover_door.dart:375` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–10 lines × 2) lib/demo/world/fakes/arr_fakes.dart:2161— lib/demo/world/fakes/arr_fakes.dart:2161-2170 | lib/demo/world/fakes/arr_fakes.dart:2550-2558 — 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 `lib/demo/world/fakes/arr_fakes.dart:2161` 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 (6 lines × 3) lib/features/media/presentation/media_page.dart:149— lib/features/media/presentation/media_page.dart:149-156 | lib/features/music/presentation/artist_page.dart:194-201 | lib/features/readarr/presentation/author_page.dart:90-95 — before extracting anything, compare `lib/features/music/presentation/artist_page.dart` and `lib/features/readarr/presentation/author_page.dart` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 3) lib/features/discover/presentation/collection_page.dart:45— lib/features/discover/presentation/collection_page.dart:45-50 | lib/features/discover/presentation/person_page.dart:61-66 | lib/features/discover/presentation/widgets/calendar_band.dart:102-107 — 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.
X18 · Disposal-pattern correctness· Owned disposable field is never released · ×2
Owned disposable field is never released packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:51— `MobileScannerWeb` carries a disposal duty — it declares its own release — and it creates `_barcodesController` itself (line 51, `StreamController.broadcast`), which makes that instance its own. Nothing in the class releases it — no `_barcodesController.close()`, no tear-off of it, on any path — nothing elsewhere in the library releases it through another instance, and it is never handed on as a value (passed positionally, returned, stored, collected), so no other owner can be ending it. Passing it as a named argument does not: a widget or animation never disposes a controller it was given. On what was read, `StreamController.broadcast` outlives the object that made it — its listeners, and through them this object and everything it references, stay reachable, and a ticker, timer or subscription keeps calling into a disposed object. Release it where the duty is discharged: `_barcodesController.close();` in `dispose()` before `super.dispose()`.
Owned disposable field is never released packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:66— `MobileScannerWeb` carries a disposal duty — it declares its own release — and it creates `_settingsController` itself (line 66, `StreamController.broadcast`), which makes that instance its own. Nothing in the class releases it — no `_settingsController.close()`, no tear-off of it, on any path — nothing elsewhere in the library releases it through another instance, and it is never handed on as a value (passed positionally, returned, stored, collected), so no other owner can be ending it. Passing it as a named argument does not: a widget or animation never disposes a controller it was given. On what was read, `StreamController.broadcast` outlives the object that made it — its listeners, and through them this object and everything it references, stay reachable, and a ticker, timer or subscription keeps calling into a disposed object. Release it where the duty is discharged: `_settingsController.close();` in `dispose()` before `super.dispose()`.
AC6 · Visual & motion safety· Focus outline removed in CSS without a · ×1
Focus outline removed in CSS without a :focus replacement design/system/motion/motion.css:253— `.cp-service-ring-motion-svg .is-hit:focus-visible` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
_MediaPageState.build (cyclomatic 116) lib/features/media/presentation/media_page.dart:603— _MediaPageState.build has cyclomatic complexity 116 (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.
_ArtistPageState.build (cyclomatic 55) lib/features/music/presentation/artist_page.dart:316— _ArtistPageState.build has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_LeadBar.build (cyclomatic 44) lib/features/media/presentation/media_page.dart:2502— _LeadBar.build 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.
_NeedsYouSectionState.build (cyclomatic 42) lib/features/activity/presentation/activity_page.dart:531— _NeedsYouSectionState.build has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_Scope._parseTypography (cyclomatic 37) tool/design_tokens/generate.dart:528— _Scope._parseTypography has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
board.main (cyclomatic 37) tool/design_system/board.py:381— board.main has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_MediaBrowseScaffoldState.build (cyclomatic 35) lib/core/widgets/media_browse_scaffold.dart:1014— _MediaBrowseScaffoldState.build has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ActivityDownloadRow.build (cyclomatic 35) lib/features/activity/presentation/widgets/activity_download_row.dart:69— ActivityDownloadRow.build has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CalendarEvent.spoken (cyclomatic 34) lib/features/discover/domain/library_calendar.dart:371— CalendarEvent.spoken has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_CalendarPageState.build (cyclomatic 33) lib/features/discover/presentation/calendar_page.dart:129— _CalendarPageState.build 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.
_SeerrIssueThreadScreenState._thread (cyclomatic 33) lib/features/media/presentation/seerr_issue_thread_screen.dart:206— _SeerrIssueThreadScreenState._thread has cyclomatic complexity 33 (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.
RequestBottomSheet.build (cyclomatic 31) lib/features/discover/presentation/widgets/request_bottom_sheet.dart:65— RequestBottomSheet.build has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_ServiceSettingsScreenState._buildScaffold (cyclomatic 31) lib/features/settings/presentation/service_settings_screen.dart:1045— _ServiceSettingsScreenState._buildScaffold has cyclomatic complexity 31 (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.
_BlockedImportReviewPageState._content (cyclomatic 30) lib/features/import/presentation/blocked_import_review_page.dart:249— _BlockedImportReviewPageState._content 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.
_MediaAddSheetState.build (cyclomatic 30) lib/features/media/presentation/media_add_sheet.dart:212— _MediaAddSheetState.build 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.
CalendarRow.build (cyclomatic 29) lib/features/discover/presentation/widgets/calendar_agenda.dart:74— CalendarRow.build 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.
_BlockedImportReviewPageState.build (cyclomatic 29) lib/features/import/presentation/blocked_import_review_page.dart:146— _BlockedImportReviewPageState.build 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.
CatalogTitleRow.build (cyclomatic 28) lib/features/discover/presentation/widgets/catalog_title_row.dart:97— CatalogTitleRow.build has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
HomeContinueWatchingModule.build (cyclomatic 28) lib/features/home/presentation/widgets/continue_watching_module.dart:45— HomeContinueWatchingModule.build has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
HomeDownloadsModule.build (cyclomatic 28) lib/features/home/presentation/widgets/downloads_module.dart:52— HomeDownloadsModule.build has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_MediaEpisodesGraphSheetState.build (cyclomatic 28) lib/features/media/presentation/media_episodes_graph.dart:291— _MediaEpisodesGraphSheetState.build has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_AuthorPageState.build (cyclomatic 28) lib/features/readarr/presentation/author_page.dart:103— _AuthorPageState.build has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ServiceMatrixCell.build (cyclomatic 28) lib/features/services/presentation/service_matrix.dart:723— ServiceMatrixCell.build has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SettingsService._saveInstances (cyclomatic 27) lib/features/settings/data/settings_service.dart:1080— SettingsService._saveInstances 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.
_DesktopShellState.build (cyclomatic 27) lib/features/shell/presentation/desktop/desktop_shell.dart:186— _DesktopShellState.build has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_RowState.build (cyclomatic 26) lib/features/activity/presentation/widgets/download_table.dart:424— _RowState.build has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SearchRow.build (cyclomatic 26) lib/features/discover/presentation/widgets/search_row.dart:267— SearchRow.build has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
MatchedFileRow.build (cyclomatic 26) lib/features/import/presentation/manual_import_review_rows.dart:281— MatchedFileRow.build has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_DownloadsSection.build (cyclomatic 25) lib/features/activity/presentation/activity_page.dart:812— _DownloadsSection.build 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.
PairPackage.fromJson (cyclomatic 25) lib/features/pairing/domain/pair_package.dart:227— PairPackage.fromJson 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.
_ServiceSettingsScreenState.initState (cyclomatic 25) lib/features/settings/presentation/service_settings_screen.dart:229— _ServiceSettingsScreenState.initState has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SeerrGrant.may (cyclomatic 24) lib/features/discover/domain/seerr_grant.dart:144— SeerrGrant.may has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
_Results.build (cyclomatic 24) lib/features/discover/presentation/discover_page.dart:386— _Results.build 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.
HomeComingUpModule.build (cyclomatic 24) lib/features/home/presentation/widgets/coming_up_module.dart:36— HomeComingUpModule.build has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
DownloadRow.build (cyclomatic 24) lib/features/home/presentation/widgets/downloads_module.dart:345— DownloadRow.build has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_MediaPageState._manage (cyclomatic 24) lib/features/media/presentation/media_page.dart:1483— _MediaPageState._manage 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.
_ProwlarrLibraryScreenState.build (cyclomatic 24) lib/features/prowlarr/presentation/prowlarr_library_screen.dart:252— _ProwlarrLibraryScreenState.build 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.
_ServiceMatrixCellBody.build (cyclomatic 24) lib/features/services/presentation/service_matrix.dart:974— _ServiceMatrixCellBody.build has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_CellRow.build (cyclomatic 24) lib/features/services/presentation/service_matrix.dart:1160— _CellRow.build 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.
_ShellScreenState.build (cyclomatic 24) lib/features/shell/presentation/shell_screen.dart:210— _ShellScreenState.build 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.
_PressableScaleState.build (cyclomatic 23) lib/core/widgets/pressable_scale.dart:123— _PressableScaleState.build has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_FaultCardState.build (cyclomatic 23) lib/features/activity/presentation/widgets/fault_card.dart:187— _FaultCardState.build has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CatalogQuery.parameters (cyclomatic 23) lib/features/discover/domain/catalog_query.dart:256— CatalogQuery.parameters has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_CalendarBandState.build (cyclomatic 23) lib/features/discover/presentation/widgets/calendar_band.dart:109— _CalendarBandState.build 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.
_BlockedImportNeedYouRowState.build (cyclomatic 23) lib/features/import/presentation/blocked_import_parts.dart:564— _BlockedImportNeedYouRowState.build has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
_ManualImportReviewScreenState._buildRows (cyclomatic 23) lib/features/import/presentation/manual_import_review_screen.dart:445— _ManualImportReviewScreenState._buildRows 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.
_ServerRow._reading (cyclomatic 23) lib/features/media/presentation/media_page.dart:2862— _ServerRow._reading 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.
ArrQueueEntry._resolve (cyclomatic 22) lib/core/status/arr_queue_snapshot.dart:147— ArrQueueEntry._resolve has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
_MediaBrowseScaffoldState._perform (cyclomatic 22) lib/core/widgets/media_browse_scaffold.dart:795— _MediaBrowseScaffoldState._perform 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.
_Commands.build (cyclomatic 22) lib/features/activity/presentation/download_page.dart:503— _Commands.build 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.
_Report.build (cyclomatic 22) lib/features/activity/presentation/widgets/import_done_card.dart:169— _Report.build has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CollectionTally.build (cyclomatic 22) lib/features/discover/presentation/widgets/collection_tally.dart:58— CollectionTally.build has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_MediaEpisodeSheetState.build (cyclomatic 22) lib/features/media/presentation/media_episode_sheet.dart:127— _MediaEpisodeSheetState.build 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.
_MusicFindLibraryState.build (cyclomatic 22) lib/features/music/presentation/music_find.dart:101— _MusicFindLibraryState.build has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_OnboardingWalkState._form (cyclomatic 22) lib/features/onboarding/presentation/widgets/onboarding_walk.dart:795— _OnboardingWalkState._form 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.
_RequestsBoardState.build (cyclomatic 21) lib/features/activity/presentation/widgets/requests_board.dart:241— _RequestsBoardState.build 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.
_Day.build (cyclomatic 21) lib/features/discover/presentation/widgets/calendar_month_grid.dart:136— _Day.build has cyclomatic complexity 21 (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.
PlexClient.lookupByExternalId (cyclomatic 21) lib/features/plex/data/plex_client.dart:845— PlexClient.lookupByExternalId 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.
PlexTranscodeSession.reasons (cyclomatic 21) lib/features/plex/domain/models/plex_transcode_session.dart:241— PlexTranscodeSession.reasons has cyclomatic complexity 21 (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.
_ArrTabScreenState._content (cyclomatic 20) lib/features/activity/presentation/arr_tab_screen.dart:204— _ArrTabScreenState._content has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_DayPanel.build (cyclomatic 20) lib/features/discover/presentation/calendar_page.dart:652— _DayPanel.build has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
CalendarWeekStrip._day (cyclomatic 20) lib/features/discover/presentation/widgets/calendar_week_strip.dart:89— CalendarWeekStrip._day 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.
HomeRequestsModule.build (cyclomatic 20) lib/features/home/presentation/widgets/requests_module.dart:49— HomeRequestsModule.build has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ManualImportFlowNotifier.startBlocked (cyclomatic 20) lib/features/import/presentation/manual_import_provider.dart:509— ManualImportFlowNotifier.startBlocked has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
MediaBrowserClient.getRecentlyWatched (cyclomatic 20) lib/features/jellyfin/data/media_browser_client.dart:868— MediaBrowserClient.getRecentlyWatched has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_IndexerFormState.build (cyclomatic 20) lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:151— _IndexerFormState.build 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.
_AddTorrentFormState.build (cyclomatic 20) lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart:84— _AddTorrentFormState.build has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_ServiceSettingsScreenState._testConnection (cyclomatic 20) lib/features/settings/presentation/service_settings_screen.dart:481— _ServiceSettingsScreenState._testConnection has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
gallery.markdown (cyclomatic 20) tool/design_system/gallery.py:62— gallery.markdown has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_ActivityNeedsYouPageState.build (cyclomatic 19) lib/features/activity/presentation/activity_needs_you_page.dart:42— _ActivityNeedsYouPageState.build has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
DockgeClient._connect (cyclomatic 19) lib/features/dockge/data/dockge_client.dart:306— DockgeClient._connect 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.
_BlockedImportNeedYouRowState._episodeChoice (cyclomatic 19) lib/features/import/presentation/blocked_import_parts.dart:715— _BlockedImportNeedYouRowState._episodeChoice 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.
MediaIdentity.of (cyclomatic 19) lib/features/media/presentation/media_identity.dart:126— MediaIdentity.of 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.
_OnboardingScreenState.build (cyclomatic 19) lib/features/onboarding/presentation/onboarding_screen.dart:1110— _OnboardingScreenState.build 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.
_Outcome.build (cyclomatic 19) lib/features/onboarding/presentation/widgets/onboarding_walk.dart:1124— _Outcome.build 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.
ProwlarrIndexerTile.build (cyclomatic 19) lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart:57— ProwlarrIndexerTile.build 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.
_ProviderFormState.build (cyclomatic 19) lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:203— _ProviderFormState.build 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.
RequesterRequestRow.build (cyclomatic 19) lib/features/requests/presentation/widgets/requester_request_row.dart:57— RequesterRequestRow.build 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.
_TracearrViolationScreenState._write (cyclomatic 19) lib/features/tracearr/presentation/tracearr_violation_screen.dart:180— _TracearrViolationScreenState._write 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.
OutsideDownloadsKt.statSmall (cyclomatic 19) android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideDownloads.kt:85— OutsideDownloadsKt.statSmall 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.
PersonShelf.of (cyclomatic 18) lib/features/discover/domain/person_shelf.dart:37— PersonShelf.of 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.
_DayCell.build (cyclomatic 18) lib/features/discover/presentation/widgets/calendar_band.dart:479— _DayCell.build 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.
_MusicFindLidarrState.build (cyclomatic 18) lib/features/music/presentation/music_find.dart:320— _MusicFindLidarrState.build 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.
_OnboardingScreenState._save (cyclomatic 18) lib/features/onboarding/presentation/onboarding_screen.dart:665— _OnboardingScreenState._save 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.
DecisionRow.build (cyclomatic 18) lib/features/services/presentation/dashboard_sections.dart:90— DecisionRow.build 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.
_ServiceSettingsScreenState._buildTestResult (cyclomatic 18) lib/features/settings/presentation/service_settings_screen.dart:1573— _ServiceSettingsScreenState._buildTestResult 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.
_MediaBrowseIndexState.build (cyclomatic 17) lib/core/widgets/media_browse_index.dart:202— _MediaBrowseIndexState.build 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.
ServiceOfflineState.build (cyclomatic 17) lib/core/widgets/service_offline_state.dart:164— ServiceOfflineState.build 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.
_PersonPageState.build (cyclomatic 17) lib/features/discover/presentation/person_page.dart:73— _PersonPageState.build 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.
_ManualImportReviewScreenState._matchedRows (cyclomatic 17) lib/features/import/presentation/manual_import_review_screen.dart:717— _ManualImportReviewScreenState._matchedRows 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.
MediaSeriesManage.build (cyclomatic 17) lib/features/media/presentation/media_series_manage.dart:87— MediaSeriesManage.build 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.
_ReportProblemSheetState._submit (cyclomatic 17) lib/features/media/presentation/report_problem_sheet.dart:149— _ReportProblemSheetState._submit 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.
AlbumTracks.build (cyclomatic 17) lib/features/music/presentation/artist_page.dart:1319— AlbumTracks.build 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.
_OnboardingScreenState._runTest (cyclomatic 17) lib/features/onboarding/presentation/onboarding_screen.dart:528— _OnboardingScreenState._runTest 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.
_OnboardingFieldState._build (cyclomatic 17) lib/features/onboarding/presentation/widgets/onboarding_parts.dart:1003— _OnboardingFieldState._build 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.
ProwlarrFieldInput.build (cyclomatic 17) lib/features/prowlarr/presentation/widgets/prowlarr_field_inputs.dart:136— ProwlarrFieldInput.build 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.
ServiceConnectionRow.build (cyclomatic 17) lib/features/settings/presentation/widgets/service_connection_row.dart:33— ServiceConnectionRow.build 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.
gallery.build (cyclomatic 17) tool/design_system/gallery.py:141— gallery.build 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.
StoredImage.fromJson (cyclomatic 16) lib/core/last_known/stored_image.dart:31— StoredImage.fromJson has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
SameOriginRedirectInterceptor.onResponse (cyclomatic 16) lib/core/network/redirect_guard.dart:114— SameOriginRedirectInterceptor.onResponse 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.
_EveryonesRequestsSection.build (cyclomatic 16) lib/features/activity/presentation/activity_page.dart:694— _EveryonesRequestsSection.build 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.
DownloadReadout.build (cyclomatic 16) lib/features/activity/presentation/widgets/download_parts.dart:144— DownloadReadout.build 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.
_RequestsBoardState._delete (cyclomatic 16) lib/features/activity/presentation/widgets/requests_board.dart:423— _RequestsBoardState._delete 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.
BazarrMovieDetailScreen.build (cyclomatic 16) lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:25— BazarrMovieDetailScreen.build 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.
BazarrSeriesDetailScreen.build (cyclomatic 16) lib/features/bazarr/presentation/bazarr_series_detail_screen.dart:28— BazarrSeriesDetailScreen.build 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.
_DiscoverPageState.build (cyclomatic 16) lib/features/discover/presentation/discover_page.dart:106— _DiscoverPageState.build 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.
HomeArrivedModule.build (cyclomatic 16) lib/features/home/presentation/widgets/arrived_module.dart:43— HomeArrivedModule.build 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.
ManualImportFlowNotifier._refreshSelectedFolderItems (cyclomatic 16) lib/features/import/presentation/manual_import_provider.dart:840— ManualImportFlowNotifier._refreshSelectedFolderItems 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.
_ArrBulkProfileSheetState.build (cyclomatic 16) lib/features/media/presentation/arr_bulk.dart:279— _ArrBulkProfileSheetState.build 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.
OutsideSaid.fromJson (cyclomatic 16) lib/features/outside/domain/outside_notices.dart:117— OutsideSaid.fromJson 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.
_SidebarItemState.build (cyclomatic 16) lib/features/shell/presentation/desktop/desktop_nav_rail.dart:347— _SidebarItemState.build 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.
TracearrSessionBody.build (cyclomatic 16) lib/features/tracearr/presentation/tracearr_session_sheet.dart:104— TracearrSessionBody.build 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.
_Body.build (cyclomatic 16) lib/features/tracearr/presentation/tracearr_violation_screen.dart:308— _Body.build 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.
_LineChartPainter.paint (cyclomatic 16) lib/features/truenas/presentation/widgets/charts/line_area_chart.dart:116— _LineChartPainter.paint 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.
UnraidDockerContainer._parse (cyclomatic 16) lib/features/unraid/domain/models/unraid_models.dart:619— UnraidDockerContainer._parse 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.
preview.html.show (cyclomatic 16) design/system/motion/StatusBadgeAnimated/preview.html:94— preview.html.show has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 100, 114, 118). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
bus factor 1 — one contributor carries this repository — 3 contributor(s) have commits in this repository (automation and bot accounts excluded), but the commits of a single one of them cover most of its history — 88% of the 1668 commit(s) sampled — so the number of people who actually carry it is 1. This is not the ambient state of a solo project: there ARE other contributors, and if the one who carries the repository becomes unavailable, the knowledge behind most of its history goes with them. Spread the next changes deliberately — have a second contributor review or pair on them — and write down the parts only one person can currently change.
_MediaPageState.build (cognitive 129) lib/features/media/presentation/media_page.dart:603— _MediaPageState.build has cognitive complexity 129 (threshold 15). Drivers by points: ternaries 32 (42 pts), if/else 31 (38 pts), boolean chains 24, match/switch 9 (15 pts), loops 8 (10 pts) (nesting depth added 25). 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.
RequestBottomSheet.build (cognitive 81) lib/features/discover/presentation/widgets/request_bottom_sheet.dart:65— RequestBottomSheet.build has cognitive complexity 81 (threshold 15). Drivers by points: ternaries 10 (38 pts), if/else 15 (34 pts), boolean chains 9 (nesting depth added 47). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
_ArtistPageState.build (cognitive 74) lib/features/music/presentation/artist_page.dart:316— _ArtistPageState.build has cognitive complexity 74 (threshold 15). Drivers by points: if/else 25 (42 pts), ternaries 15 (19 pts), boolean chains 9, loops 3, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
board.main (cognitive 68) tool/design_system/board.py:381— board.main has cognitive complexity 68 (threshold 15). Drivers by points: if/else 15 (30 pts), ternaries 7 (20 pts), loops 7 (11 pts), boolean chains 7 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_CalendarPageState.build (cognitive 56) lib/features/discover/presentation/calendar_page.dart:129— _CalendarPageState.build has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 11 (26 pts), loops 6 (12 pts), if/else 8 (10 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_LeadBar.build (cognitive 53) lib/features/media/presentation/media_page.dart:2502— _LeadBar.build has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (26 pts), ternaries 5 (13 pts), match/switch 4 (8 pts), boolean chains 6 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_NeedsYouSectionState.build (cognitive 51) lib/features/activity/presentation/activity_page.dart:531— _NeedsYouSectionState.build has cognitive complexity 51 (threshold 15). Drivers by points: boolean chains 18, if/else 12 (18 pts), ternaries 5 (8 pts), loops 6 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_Scope._parseTypography (cognitive 49) tool/design_tokens/generate.dart:528— _Scope._parseTypography has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25 (33 pts), boolean chains 8, ternaries 4 (6 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_Results.build (cognitive 48) lib/features/discover/presentation/discover_page.dart:386— _Results.build has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 5 (12 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MediaIdentity.of (cognitive 48) lib/features/media/presentation/media_identity.dart:126— MediaIdentity.of has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 5 (20 pts), if/else 5 (14 pts), loops 4 (7 pts), match/switch 2 (7 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CalendarEvent.spoken (cognitive 47) lib/features/discover/domain/library_calendar.dart:371— CalendarEvent.spoken has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 11 (26 pts), if/else 9 (15 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_BlockedImportReviewPageState._content (cognitive 45) lib/features/import/presentation/blocked_import_review_page.dart:249— _BlockedImportReviewPageState._content has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 8 (18 pts), if/else 9 (13 pts), loops 5 (7 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MatchSheetState._partStep (cognitive 44) lib/features/import/presentation/manual_import_fix_sheet.dart:601— _MatchSheetState._partStep has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 2 (9 pts), ternaries 1 (5 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MediaBrowserClient.getRecentlyWatched (cognitive 44) lib/features/jellyfin/data/media_browser_client.dart:868— MediaBrowserClient.getRecentlyWatched has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (9 pts), ternaries 3 (9 pts), boolean chains 3, error handling 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_SeerrIssueThreadScreenState._thread (cognitive 44) lib/features/media/presentation/seerr_issue_thread_screen.dart:206— _SeerrIssueThreadScreenState._thread has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 15 (18 pts), if/else 12 (17 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 10). 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.
_DayPanel.build (cognitive 43) lib/features/discover/presentation/calendar_page.dart:652— _DayPanel.build has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 3 (12 pts), loops 4 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MediaEpisodesGraphSheetState.build (cognitive 42) lib/features/media/presentation/media_episodes_graph.dart:291— _MediaEpisodesGraphSheetState.build has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 10 (14 pts), ternaries 3 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MediaPageState._manage (cognitive 42) lib/features/media/presentation/media_page.dart:1483— _MediaPageState._manage has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 5 (8 pts), ternaries 4 (5 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActivityDownloadRow.build (cognitive 41) lib/features/activity/presentation/widgets/activity_download_row.dart:69— ActivityDownloadRow.build has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 13, boolean chains 9, match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_Commands.build (cognitive 40) lib/features/activity/presentation/download_page.dart:503— _Commands.build has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 9 (15 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HomeDownloadsModule.build (cognitive 40) lib/features/home/presentation/widgets/downloads_module.dart:52— HomeDownloadsModule.build has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 5 (6 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SettingsService._saveInstances (cognitive 40) lib/features/settings/data/settings_service.dart:1080— SettingsService._saveInstances has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 9 (10 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gallery.markdown (cognitive 40) tool/design_system/gallery.py:62— gallery.markdown has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (12 pts), boolean chains 6, ternaries 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MediaBrowseScaffoldState.build (cognitive 39) lib/core/widgets/media_browse_scaffold.dart:1014— _MediaBrowseScaffoldState.build has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (20 pts), ternaries 8 (9 pts), boolean chains 7, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_DayCell.build (cognitive 39) lib/features/discover/presentation/widgets/calendar_band.dart:479— _DayCell.build has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 9 (19 pts), if/else 6 (15 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
_BlockedImportReviewPageState.build (cognitive 38) lib/features/import/presentation/blocked_import_review_page.dart:146— _BlockedImportReviewPageState.build has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 9 (17 pts), boolean chains 10, if/else 7 (8 pts), loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MediaEpisodeSheetState.build (cognitive 38) lib/features/media/presentation/media_episode_sheet.dart:127— _MediaEpisodeSheetState.build has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 9 (14 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MediaAddSheetState.build (cognitive 37) lib/features/media/presentation/media_add_sheet.dart:212— _MediaAddSheetState.build has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 9 (13 pts), boolean chains 4, match/switch 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_AuthorPageState.build (cognitive 36) lib/features/readarr/presentation/author_page.dart:103— _AuthorPageState.build has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 7 (12 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CatalogTitleRow.build (cognitive 35) lib/features/discover/presentation/widgets/catalog_title_row.dart:97— CatalogTitleRow.build has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 15 (23 pts), if/else 5, boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OutsideDownloadsKt.statSmall (cognitive 35) android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideDownloads.kt:85— OutsideDownloadsKt.statSmall has cognitive complexity 35 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ServiceSettingsScreenState._buildScaffold (cognitive 34) lib/features/settings/presentation/service_settings_screen.dart:1045— _ServiceSettingsScreenState._buildScaffold has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22 (24 pts), boolean chains 10 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
CalendarRow.build (cognitive 33) lib/features/discover/presentation/widgets/calendar_agenda.dart:74— CalendarRow.build has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 19 (22 pts), if/else 6 (7 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
HomeContinueWatchingModule.build (cognitive 33) lib/features/home/presentation/widgets/continue_watching_module.dart:45— HomeContinueWatchingModule.build has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 6 (8 pts), boolean chains 6, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ManualImportFlowNotifier.startBlocked (cognitive 33) lib/features/import/presentation/manual_import_provider.dart:509— ManualImportFlowNotifier.startBlocked has cognitive complexity 33 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 5 (12 pts), boolean chains 4, ternaries 3, error handling 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ProwlarrLibraryScreenState.build (cognitive 33) lib/features/prowlarr/presentation/prowlarr_library_screen.dart:252— _ProwlarrLibraryScreenState.build has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 12 (17 pts), if/else 11 (14 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_DownloadsSection.build (cognitive 32) lib/features/activity/presentation/activity_page.dart:812— _DownloadsSection.build has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 5 (6 pts), boolean chains 4, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MediaSeriesManage._automaticSearches (cognitive 32) lib/features/media/presentation/media_series_manage.dart:222— MediaSeriesManage._automaticSearches has cognitive complexity 32 (threshold 15). Drivers by points: if/else 4 (13 pts), ternaries 2 (10 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ReportProblemSheetState._submit (cognitive 32) lib/features/media/presentation/report_problem_sheet.dart:149— _ReportProblemSheetState._submit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 2 (4 pts), loops 1 (4 pts), ternaries 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
board.compose (cognitive 32) tool/design_system/board.py:323— board.compose has cognitive complexity 32 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 4 (11 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
_AddTorrentFormState.build (cognitive 31) lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart:84— _AddTorrentFormState.build has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (3 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MediaBrowseScaffoldState._perform (cognitive 30) lib/core/widgets/media_browse_scaffold.dart:795— _MediaBrowseScaffoldState._perform has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, loops 2 (4 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_RowState.build (cognitive 30) lib/features/activity/presentation/widgets/download_table.dart:424— _RowState.build has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 7 (10 pts), boolean chains 8, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
_ShellScreenState.build (cognitive 30) lib/features/shell/presentation/shell_screen.dart:210— _ShellScreenState.build has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 8, ternaries 4 (5 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_FaultCardState.build (cognitive 29) lib/features/activity/presentation/widgets/fault_card.dart:187— _FaultCardState.build has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 7 (9 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_CalendarBandState.build (cognitive 29) lib/features/discover/presentation/widgets/calendar_band.dart:109— _CalendarBandState.build has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, loops 4 (5 pts), ternaries 4 (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.
_OnboardingScreenState._save (cognitive 29) lib/features/onboarding/presentation/onboarding_screen.dart:665— _OnboardingScreenState._save has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 2 (5 pts), boolean chains 3, loops 3, error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_OnboardingWalkState._form (cognitive 29) lib/features/onboarding/presentation/widgets/onboarding_walk.dart:795— _OnboardingWalkState._form has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 8 (14 pts), if/else 12 (13 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PairPackage.fromJson (cognitive 29) lib/features/pairing/domain/pair_package.dart:227— PairPackage.fromJson has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 5 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ServiceSettingsScreenState._testConnection (cognitive 29) lib/features/settings/presentation/service_settings_screen.dart:481— _ServiceSettingsScreenState._testConnection has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6, ternaries 2 (4 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_RequestsBoardState.build (cognitive 28) lib/features/activity/presentation/widgets/requests_board.dart:241— _RequestsBoardState.build has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5 (6 pts), ternaries 3 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ManualImportReviewScreenState._buildRows (cognitive 28) lib/features/import/presentation/manual_import_review_screen.dart:445— _ManualImportReviewScreenState._buildRows has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 9, boolean chains 7, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OutsideSaid.fromJson (cognitive 28) lib/features/outside/domain/outside_notices.dart:117— OutsideSaid.fromJson has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts), ternaries 2 (6 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ServiceSettingsScreenState.initState (cognitive 28) lib/features/settings/presentation/service_settings_screen.dart:229— _ServiceSettingsScreenState.initState has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 10 (11 pts), if/else 7 (10 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
MediaSeriesManage.build (cognitive 27) lib/features/media/presentation/media_series_manage.dart:87— MediaSeriesManage.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (12 pts), loops 6 (8 pts), if/else 5 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PlexClient.lookupByExternalId (cognitive 27) lib/features/plex/data/plex_client.dart:845— PlexClient.lookupByExternalId has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ServiceMatrixCell.build (cognitive 27) lib/features/services/presentation/service_matrix.dart:723— ServiceMatrixCell.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 14, boolean chains 12, if/else 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_DesktopShellState.build (cognitive 27) lib/features/shell/presentation/desktop/desktop_shell.dart:186— _DesktopShellState.build has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 8, ternaries 8 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ActivityActions.approveRequest (cognitive 26) lib/features/activity/presentation/widgets/activity_actions.dart:191— ActivityActions.approveRequest has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CollectionTally.build (cognitive 26) lib/features/discover/presentation/widgets/collection_tally.dart:58— CollectionTally.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 6 (8 pts), loops 3, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
DownloadRow.build (cognitive 26) lib/features/home/presentation/widgets/downloads_module.dart:345— DownloadRow.build has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 10, if/else 7 (9 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
MatchedFileRow.build (cognitive 26) lib/features/import/presentation/manual_import_review_rows.dart:281— MatchedFileRow.build has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 12 (13 pts), if/else 11, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_CellRow.build (cognitive 26) lib/features/services/presentation/service_matrix.dart:1160— _CellRow.build has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 3 (7 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TrueNasWsClient.callJob (cognitive 26) lib/features/truenas/data/truenas_ws_client.dart:456— TrueNasWsClient.callJob has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 3 (7 pts), boolean chains 4, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_LineChartPainter.paint (cognitive 26) lib/features/truenas/presentation/widgets/charts/line_area_chart.dart:116— _LineChartPainter.paint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (7 pts), ternaries 2, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DockgeClient._connect (cognitive 25) lib/features/dockge/data/dockge_client.dart:306— DockgeClient._connect has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HomeComingUpModule.build (cognitive 25) lib/features/home/presentation/widgets/coming_up_module.dart:36— HomeComingUpModule.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 6, boolean chains 4, loops 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
HomeRequestsModule.build (cognitive 25) lib/features/home/presentation/widgets/requests_module.dart:49— HomeRequestsModule.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 2 (4 pts), boolean chains 3, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AlbumTracks.build (cognitive 25) lib/features/music/presentation/artist_page.dart:1319— AlbumTracks.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 4 (9 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_OnboardingScreenState.build (cognitive 25) lib/features/onboarding/presentation/onboarding_screen.dart:1110— _OnboardingScreenState.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 10 (11 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
PlexClient._resolvePlexGuid (cognitive 25) lib/features/plex/data/plex_client.dart:1002— PlexClient._resolvePlexGuid has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PlexClient.getRecentlyWatched (cognitive 25) lib/features/plex/data/plex_client.dart:1155— PlexClient.getRecentlyWatched has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (9 pts), ternaries 1 (4 pts), boolean chains 1, error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gallery.build (cognitive 25) tool/design_system/gallery.py:141— gallery.build has cognitive complexity 25 (threshold 15). Drivers by points: loops 9 (12 pts), if/else 5 (9 pts), ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ArrActivityMixin._fetchAllPages (cognitive 24) lib/core/api/base_arr_service.dart:409— ArrActivityMixin._fetchAllPages has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 3 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_RequestsBoardState._delete (cognitive 24) lib/features/activity/presentation/widgets/requests_board.dart:423— _RequestsBoardState._delete has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 6 (10 pts), error handling 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RequestFormNotifier._loadProfiles (cognitive 24) lib/features/discover/presentation/request_form_provider.dart:400— RequestFormNotifier._loadProfiles has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 4 (9 pts), boolean chains 2, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ManualImportReviewScreenState._matchedRows (cognitive 24) lib/features/import/presentation/manual_import_review_screen.dart:717— _ManualImportReviewScreenState._matchedRows has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 5 (7 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TracearrSessionBody.build (cognitive 24) lib/features/tracearr/presentation/tracearr_session_sheet.dart:104— TracearrSessionBody.build has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 pts), ternaries 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ReelCommandButtonState._run (cognitive 23) lib/core/widgets/reel_command_button.dart:137— _ReelCommandButtonState._run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (5 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_Day.build (cognitive 23) lib/features/discover/presentation/widgets/calendar_month_grid.dart:136— _Day.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 9 (10 pts), if/else 6 (8 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_SeerrIssueThreadScreenState._write (cognitive 23) lib/features/media/presentation/seerr_issue_thread_screen.dart:628— _SeerrIssueThreadScreenState._write has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), error handling 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_OnboardingScreenState.initState (cognitive 23) lib/features/onboarding/presentation/onboarding_screen.dart:224— _OnboardingScreenState.initState has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PlexTranscodeSession.reasons (cognitive 23) lib/features/plex/domain/models/plex_transcode_session.dart:241— PlexTranscodeSession.reasons has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, if/else 8, ternaries 3 (6 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
_PressableScaleState.build (cognitive 22) lib/core/widgets/pressable_scale.dart:123— _PressableScaleState.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 13, boolean chains 7, if/else 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_Heading.build (cognitive 22) lib/features/activity/presentation/activity_needs_you_page.dart:160— _Heading.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 6 (9 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_Head.build (cognitive 22) lib/features/discover/presentation/calendar_page.dart:943— _Head.build has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SearchRow.build (cognitive 22) lib/features/discover/presentation/widgets/search_row.dart:267— SearchRow.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 11 (15 pts), if/else 3, match/switch 3, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
ManualImportFlowNotifier._replacedQualities (cognitive 22) lib/features/import/presentation/manual_import_provider.dart:602— ManualImportFlowNotifier._replacedQualities has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (10 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
PairPlan.of (cognitive 22) lib/features/pairing/domain/pair_plan.dart:38— PairPlan.of has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 7 (9 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ProwlarrFieldInput.build (cognitive 22) lib/features/prowlarr/presentation/widgets/prowlarr_field_inputs.dart:136— ProwlarrFieldInput.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (11 pts), if/else 8 (9 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
SabnzbdClient._call (cognitive 22) lib/features/sabnzbd/data/sabnzbd_client.dart:93— SabnzbdClient._call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 2 (8 pts), boolean chains 1, error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SettingsService.migrateFromPlaintext (cognitive 22) lib/features/settings/data/settings_service.dart:300— SettingsService.migrateFromPlaintext has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
_RingFrame.resolve (cognitive 21) lib/core/widgets/service_ring.dart:292— _RingFrame.resolve has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActivityBlocklistPage.build (cognitive 21) lib/features/activity/presentation/activity_blocklist_page.dart:26— ActivityBlocklistPage.build has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (7 pts), loops 2 (4 pts), boolean chains 1, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ArrCalendarScreen.build (cognitive 21) lib/features/activity/presentation/arr_calendar_screen.dart:31— ArrCalendarScreen.build has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 2 (7 pts), loops 2 (6 pts), match/switch 2 (4 pts), if/else 3, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ArrTabScreenState._content (cognitive 21) lib/features/activity/presentation/arr_tab_screen.dart:204— _ArrTabScreenState._content has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, match/switch 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_Report.build (cognitive 21) lib/features/activity/presentation/widgets/import_done_card.dart:169— _Report.build has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 15, if/else 4, boolean chains 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CatalogQuery.parameters (cognitive 21) lib/features/discover/domain/catalog_query.dart:256— CatalogQuery.parameters has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, ternaries 6 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_Kinds.build (cognitive 21) lib/features/discover/presentation/calendar_page.dart:1136— _Kinds.build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (8 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RequestFormNotifier._readSeasons (cognitive 21) lib/features/discover/presentation/request_form_provider.dart:490— RequestFormNotifier._readSeasons has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (6 pts), ternaries 1 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_BlockedImportNeedYouRowState._episodeChoice (cognitive 21) lib/features/import/presentation/blocked_import_parts.dart:715— _BlockedImportNeedYouRowState._episodeChoice has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 7, boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_MusicFindLidarrState.build (cognitive 21) lib/features/music/presentation/music_find.dart:320— _MusicFindLidarrState.build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
OutsideShelf.keepPictures (cognitive 21) lib/features/outside/data/outside_shelf.dart:81— OutsideShelf.keepPictures has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (6 pts), boolean chains 2, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ProwlarrIndexerTile.build (cognitive 21) lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart:57— ProwlarrIndexerTile.build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, ternaries 7 (9 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
SettingsService._readRoster (cognitive 21) lib/features/settings/data/settings_service.dart:657— SettingsService._readRoster has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (2 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_GlanceTileState.build (cognitive 21) lib/features/shell/presentation/desktop/in_flight_glance.dart:149— _GlanceTileState.build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MediaBrowseIndexState.build (cognitive 20) lib/core/widgets/media_browse_index.dart:202— _MediaBrowseIndexState.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 3 (5 pts), boolean chains 3, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PersonShelf.of (cognitive 20) lib/features/discover/domain/person_shelf.dart:37— PersonShelf.of has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HomeArrivedModule.build (cognitive 20) lib/features/home/presentation/widgets/arrived_module.dart:43— HomeArrivedModule.build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 4 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ServerRow._reading (cognitive 20) lib/features/media/presentation/media_page.dart:2862— _ServerRow._reading has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, ternaries 3, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_OnboardingFieldState._build (cognitive 20) lib/features/onboarding/presentation/widgets/onboarding_parts.dart:1003— _OnboardingFieldState._build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 10 (14 pts), if/else 5, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
_IndexerFormState.build (cognitive 20) lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:151— _IndexerFormState.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (9 pts), boolean chains 6, if/else 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_ProviderFormState.build (cognitive 20) lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:203— _ProviderFormState.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (10 pts), if/else 5, boolean chains 4, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
_Body.build (cognitive 20) lib/features/tracearr/presentation/tracearr_violation_screen.dart:308— _Body.build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 9, boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
DownloadQueueTile.build (cognitive 19) lib/core/widgets/download_queue_tile.dart:148— DownloadQueueTile.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 4 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ServiceOfflineState.build (cognitive 19) lib/core/widgets/service_offline_state.dart:164— ServiceOfflineState.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (14 pts), boolean chains 3, if/else 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
_ActivityNeedsYouPageState.build (cognitive 19) lib/features/activity/presentation/activity_needs_you_page.dart:42— _ActivityNeedsYouPageState.build has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (6 pts), loops 3, ternaries 2 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActivitySection.build (cognitive 19) lib/features/activity/presentation/widgets/activity_section.dart:59— ActivitySection.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 4, boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_FaultRow.build (cognitive 19) lib/features/activity/presentation/widgets/fault_card.dart:403— _FaultRow.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
BazarrSeriesDetailScreen.build (cognitive 19) lib/features/bazarr/presentation/bazarr_series_detail_screen.dart:28— BazarrSeriesDetailScreen.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 5 (6 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_MediaPageState._toggleWatchlist (cognitive 19) lib/features/media/presentation/media_page.dart:476— _MediaPageState._toggleWatchlist has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (5 pts), loops 1 (2 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LidarrService.addAlbum (cognitive 19) lib/features/music/data/lidarr_service.dart:401— LidarrService.addAlbum has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MusicFindLibraryState.build (cognitive 19) lib/features/music/presentation/music_find.dart:101— _MusicFindLibraryState.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, ternaries 1 (2 pts), match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
_Outcome.build (cognitive 19) lib/features/onboarding/presentation/widgets/onboarding_walk.dart:1124— _Outcome.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 5 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
RequesterRequestRow.build (cognitive 19) lib/features/requests/presentation/widgets/requester_request_row.dart:57— RequesterRequestRow.build has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 6. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
DecisionRow.build (cognitive 19) lib/features/services/presentation/dashboard_sections.dart:90— DecisionRow.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 13, if/else 4 (5 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_ServiceMatrixCellBody.build (cognitive 19) lib/features/services/presentation/service_matrix.dart:974— _ServiceMatrixCellBody.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 13, if/else 3, boolean chains 2, match/switch 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_ServiceSettingsScreenState._deriveSiblingLabels (cognitive 19) lib/features/settings/presentation/service_settings_screen.dart:1781— _ServiceSettingsScreenState._deriveSiblingLabels has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (7 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SeerrSignInFlow.readServer (cognitive 19) lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:285— SeerrSignInFlow.readServer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts), boolean chains 1, error handling 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_TracearrViolationScreenState._write (cognitive 19) lib/features/tracearr/presentation/tracearr_violation_screen.dart:180— _TracearrViolationScreenState._write has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 2 (3 pts), boolean chains 1, error handling 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TrueNasWsClient._connect (cognitive 19) lib/features/truenas/data/truenas_ws_client.dart:360— TrueNasWsClient._connect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (6 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TrueNasPool.fromJson (cognitive 19) lib/features/truenas/domain/models/pool.dart:151— TrueNasPool.fromJson has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (2 pts), ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preview.html.show (cognitive 19) design/system/motion/StatusBadgeAnimated/preview.html:94— preview.html.show has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4 (nesting depth added 3). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 100, 114, 118). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
SameOriginRedirectInterceptor.onResponse (cognitive 18) lib/core/network/redirect_guard.dart:114— SameOriginRedirectInterceptor.onResponse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6, ternaries 3 (6 pts), boolean chains 5, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MediaDetailView._emitBody (cognitive 18) lib/core/widgets/media_detail_view.dart:308— MediaDetailView._emitBody has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_CollectionPageState.build (cognitive 18) lib/features/discover/presentation/collection_page.dart:58— _CollectionPageState.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
CalendarWeekStrip._day (cognitive 18) lib/features/discover/presentation/widgets/calendar_week_strip.dart:89— CalendarWeekStrip._day has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10 (11 pts), boolean chains 4, if/else 2, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_BlockedImportNeedYouRowState.build (cognitive 18) lib/features/import/presentation/blocked_import_parts.dart:564— _BlockedImportNeedYouRowState.build has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (8 pts), ternaries 5, boolean chains 3, if/else 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ManualImportFlowNotifier._applyTargetPreselection (cognitive 18) lib/features/import/presentation/manual_import_provider.dart:754— ManualImportFlowNotifier._applyTargetPreselection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ManualImportFlowNotifier._refreshSelectedFolderItems (cognitive 18) lib/features/import/presentation/manual_import_provider.dart:840— ManualImportFlowNotifier._refreshSelectedFolderItems has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (7 pts), boolean chains 5, if/else 3 (5 pts), error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ImportStationBar.build (cognitive 18) lib/features/import/presentation/manual_import_widgets.dart:145— ImportStationBar.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 3 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_Panel.build (cognitive 18) lib/features/media/presentation/media_copy_panel_card.dart:186— _Panel.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_MediaPageState._seerrManage (cognitive 18) lib/features/media/presentation/media_page.dart:1634— _MediaPageState._seerrManage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2, match/switch 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_SeerrIssueThreadScreenState._deleteIssue (cognitive 18) lib/features/media/presentation/seerr_issue_thread_screen.dart:762— _SeerrIssueThreadScreenState._deleteIssue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (4 pts), boolean chains 1, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_OnboardingScreenState._runTest (cognitive 18) lib/features/onboarding/presentation/onboarding_screen.dart:528— _OnboardingScreenState._runTest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 6, ternaries 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_LimitsCard.build (cognitive 18) lib/features/release_search/presentation/release_search_settings_screen.dart:567— _LimitsCard.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (13 pts), if/else 4, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ServiceSettingsScreenState._buildHeader (cognitive 18) lib/features/settings/presentation/service_settings_screen.dart:1259— _ServiceSettingsScreenState._buildHeader has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 1 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ServiceSettingsScreenState._buildTestResult (cognitive 18) lib/features/settings/presentation/service_settings_screen.dart:1573— _ServiceSettingsScreenState._buildTestResult has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 11 (14 pts), if/else 3, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
SeerrSignInFlow._checkQuickConnect (cognitive 18) lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:611— SeerrSignInFlow._checkQuickConnect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, error handling 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SseParser.add (cognitive 18) lib/features/tracearr/data/tracearr_events.dart:73— SseParser.add has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TransmissionClient.torrentsSynced (cognitive 18) lib/features/transmission/data/transmission_client.dart:511— TransmissionClient.torrentsSynced has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tokens_css.type_css (cognitive 18) tool/design_system/tokens_css.py:63— tokens_css.type_css has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_Scope._resolveUncached (cognitive 17) tool/design_tokens/generate.dart:431— _Scope._resolveUncached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StoredImage._pathUnder (cognitive 17) lib/core/last_known/stored_image.dart:102— StoredImage._pathUnder has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_RenderFade.paint (cognitive 17) lib/core/widgets/ambient_scaffold.dart:347— _RenderFade.paint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MediaBrowseScaffoldState._browseEntries (cognitive 17) lib/core/widgets/media_browse_scaffold.dart:1857— _MediaBrowseScaffoldState._browseEntries has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (11 pts), loops 2 (3 pts), if/else 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BazarrMovieDetailScreen.build (cognitive 17) lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:25— BazarrMovieDetailScreen.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 3, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
BazarrSubtitleLanguageWrap.build (cognitive 17) lib/features/bazarr/presentation/widgets/bazarr_detail_sections.dart:23— BazarrSubtitleLanguageWrap.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_PersonPageState.build (cognitive 17) lib/features/discover/presentation/person_page.dart:73— _PersonPageState.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (8 pts), if/else 5 (6 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
HomeLayout._completed (cognitive 17) lib/features/home/domain/home_layout.dart:188— HomeLayout._completed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MediaEpisodesState.build (cognitive 17) lib/features/media/presentation/media_series_sections.dart:149— _MediaEpisodesState.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_LidarrAddArtistSheetState.build (cognitive 17) lib/features/music/presentation/lidarr_add_artist_sheet.dart:182— _LidarrAddArtistSheetState.build has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, ternaries 3 (6 pts), if/else 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MusicHitRowState._monitor (cognitive 17) lib/features/music/presentation/music_hit_row.dart:73— _MusicHitRowState._monitor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NzbgetClient._call (cognitive 17) lib/features/nzbget/data/nzbget_client.dart:87— NzbgetClient._call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_PairReceiveScreenState._preview (cognitive 17) lib/features/pairing/presentation/pair_receive_screen.dart:323— _PairReceiveScreenState._preview has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (5 pts), ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TorrentSortRow.build (cognitive 17) lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart:181— TorrentSortRow.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 4 (7 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_DownloadNamer.name (cognitive 17) lib/features/services/presentation/services_queue.dart:553— _DownloadNamer.name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 1 (3 pts), loops 3, boolean chains 1, ternaries 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.
StreamNowPlayingSection._togglePause (cognitive 17) lib/features/stream/presentation/widgets/stream_now_playing_section.dart:443— StreamNowPlayingSection._togglePause has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (5 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preview.html.plan (cognitive 17) design/system/motion/ReelLine/preview.html:61— preview.html.plan has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 4, if/else 1 (2 pts), 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.
repo.services (cognitive 17) website/src/lib/repo.ts:42— repo.services has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_InteractiveSearchSheetState._handleGrab (cognitive 16) lib/core/widgets/interactive_search_sheet.dart:263— _InteractiveSearchSheetState._handleGrab has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 2, error handling 2, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MediaBrowseScaffoldState._tapAction (cognitive 16) lib/core/widgets/media_browse_scaffold.dart:746— _MediaBrowseScaffoldState._tapAction has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, loops 3, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
PageTabs.build (cognitive 16) lib/core/widgets/page_tabs.dart:68— PageTabs.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 5 (7 pts), boolean chains 1, ternaries 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.
_Readout.build (cognitive 16) lib/features/activity/presentation/activity_page.dart:343— _Readout.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (4 pts), 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.
_EveryonesRequestsSection.build (cognitive 16) lib/features/activity/presentation/activity_page.dart:694— _EveryonesRequestsSection.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (5 pts), loops 5, ternaries 4, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
BazarrService.getWantedEpisodesForSeries (cognitive 16) lib/features/bazarr/data/bazarr_service.dart:149— BazarrService.getWantedEpisodesForSeries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (6 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RequestFormNotifier._loadServers (cognitive 16) lib/features/discover/presentation/request_form_provider.dart:317— RequestFormNotifier._loadServers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (5 pts), error handling 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EmbyDialect.tokenUserAsViewer (cognitive 16) lib/features/emby/data/emby_dialect.dart:160— EmbyDialect.tokenUserAsViewer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HomeNowPlayingModule.build (cognitive 16) lib/features/home/presentation/widgets/now_playing_module.dart:40— HomeNowPlayingModule.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (5 pts), ternaries 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
_BlockedImportNeedYouRowState._followPlaced (cognitive 16) lib/features/import/presentation/blocked_import_parts.dart:462— _BlockedImportNeedYouRowState._followPlaced has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ReadyGroupHeader.build (cognitive 16) lib/features/import/presentation/manual_import_review_rows.dart:105— ReadyGroupHeader.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 4, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MediaEpisodesGraphPanel.build (cognitive 16) lib/features/media/presentation/media_episodes_graph.dart:92— MediaEpisodesGraphPanel.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_MediaPageState._requestOf (cognitive 16) lib/features/media/presentation/media_page.dart:310— _MediaPageState._requestOf has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8, if/else 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
_MediaPageState._openEpisode (cognitive 16) lib/features/media/presentation/media_page.dart:1315— _MediaPageState._openEpisode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 3, match/switch 1 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RadarrService.searchingSince (cognitive 16) lib/features/movies/data/radarr_service.dart:244— RadarrService.searchingSince has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ArtistPageState._scrollToAlbum (cognitive 16) lib/features/music/presentation/artist_page.dart:240— _ArtistPageState._scrollToAlbum has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 6, boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_LidarrAddAlbumSheetState.build (cognitive 16) lib/features/music/presentation/lidarr_add_album_sheet.dart:141— _LidarrAddAlbumSheetState.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (7 pts), boolean chains 6, if/else 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
_OnboardingFoundState.build (cognitive 16) lib/features/onboarding/presentation/widgets/onboarding_found.dart:602— _OnboardingFoundState.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 5, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_SettingsNotificationsScreenState.build (cognitive 16) lib/features/outside/presentation/settings_notifications_screen.dart:77— _SettingsNotificationsScreenState.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (7 pts), if/else 6, boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
PairReceiveNotifier._invited (cognitive 16) lib/features/pairing/data/pair_session.dart:406— PairReceiveNotifier._invited has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SettingsConnectionsScreen.build (cognitive 16) lib/features/settings/presentation/settings_connections_screen.dart:34— SettingsConnectionsScreen.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, loops 3 (6 pts), ternaries 3 (4 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SeerrSignInSteps._noticeActions (cognitive 16) lib/features/settings/presentation/widgets/seerr_sign_in_steps.dart:109— SeerrSignInSteps._noticeActions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 5, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
TracearrClient.terminate (cognitive 16) lib/features/tracearr/data/tracearr_client.dart:448— TracearrClient.terminate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, error handling 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.
TracearrClient.events (cognitive 16) lib/features/tracearr/data/tracearr_client.dart:496— TracearrClient.events has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
UnraidDockerContainer._parse (cognitive 16) lib/features/unraid/domain/models/unraid_models.dart:619— UnraidDockerContainer._parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, match/switch 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Change-coupling hub: services_provider.dart → dashboard_decision.dart, download_client_faults.dart, in_flight.dart lib/features/services/presentation/services_provider.dart— `lib/features/services/presentation/services_provider.dart` changes together with 3 other files — `lib/features/services/domain/dashboard_decision.dart`, `lib/features/services/domain/download_client_faults.dart`, `lib/features/services/domain/in_flight.dart` — none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3.
Near-duplicate member pair (60 shared lines) lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:25— lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:25-230 | lib/features/bazarr/presentation/bazarr_series_detail_screen.dart:28-221 — These two members are variants of one another: 60 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (59 shared lines) lib/features/readarr/presentation/readarr_activity_screen.dart:67— lib/features/readarr/presentation/readarr_activity_screen.dart:67-153 | lib/features/readarr/presentation/readarr_history_screen.dart:73-154 — These two members are variants of one another: 59 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Members sharing a duplicated core (8 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (8 members, 50+ identical tokens) lib/features/outside/presentation/settings_notifications_screen.dart:77— lib/features/outside/presentation/settings_notifications_screen.dart:77-208 | lib/features/pairing/presentation/pair_offer_screen.dart:148-189 | lib/features/release_search/presentation/release_search_settings_screen.dart:97-246 | lib/features/settings/presentation/requester_account_page.dart:39-126 | lib/features/settings/presentation/settings_appearance_screen.dart:18-54 | lib/features/settings/presentation/settings_connections_screen.dart:34-207 | lib/features/settings/presentation/settings_hints_screen.dart:23-71 | lib/features/settings/presentation/settings_region_screen.dart:53-148 — These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) lib/features/bazarr/presentation/bazarr_overview_screen.dart:185— lib/features/bazarr/presentation/bazarr_overview_screen.dart:185-208 | lib/features/dockge/presentation/dockge_overview_screen.dart:221-250 | lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:259-282 | lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:258-284 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:153-181 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication· Edited copy of a member (116 corresponding lines) · ×1
Edited copy of a member (116 corresponding lines) lib/features/movies/presentation/movies_screen.dart:69— lib/features/movies/presentation/movies_screen.dart:69-184 | lib/features/series/presentation/series_screen.dart:77-192 — These two members are one piece of code written twice and then edited apart: 116 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 (92 corresponding lines) · ×1
Edited copy of a member (92 corresponding lines) lib/features/nzbget/presentation/nzbget_screen.dart:59— lib/features/nzbget/presentation/nzbget_screen.dart:59-150 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:61-153 — These two members are one piece of code written twice and then edited apart: 92 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 (88 corresponding lines) · ×1
Edited copy of a member (88 corresponding lines) lib/features/truenas/presentation/system/truenas_system_config_screens.dart:149— lib/features/truenas/presentation/system/truenas_system_config_screens.dart:149-236 | lib/features/truenas/presentation/system/truenas_system_config_screens.dart:322-423 — These two members are one piece of code written twice and then edited apart: 88 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 (86 corresponding lines) · ×1
Edited copy of a member (86 corresponding lines) lib/features/bazarr/presentation/bazarr_wanted_screen.dart:293— lib/features/bazarr/presentation/bazarr_wanted_screen.dart:293-378 | lib/features/readarr/presentation/widgets/readarr_tiles.dart:71-159 — These two members are one piece of code written twice and then edited apart: 86 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 (67 corresponding lines) · ×1
Edited copy of a member (67 corresponding lines) lib/features/settings/presentation/widgets/settings_master_detail.dart:243— lib/features/settings/presentation/widgets/settings_master_detail.dart:243-309 | lib/features/truenas/presentation/truenas_console_shell.dart:320-409 — These two members are one piece of code written twice and then edited apart: 67 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) lib/features/activity/presentation/widgets/violation_rows.dart:113— lib/features/activity/presentation/widgets/violation_rows.dart:113-183 | lib/features/services/presentation/dashboard_sections.dart:588-676 — 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 (57 corresponding lines) · ×1
Edited copy of a member (57 corresponding lines) lib/features/media/presentation/media_page.dart:3344— lib/features/media/presentation/media_page.dart:3344-3408 | lib/features/media/presentation/media_series_manage.dart:584-640 — 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 copy of a member (63 corresponding lines) · ×1
Edited copy of a member (63 corresponding lines) lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:178— lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:178-243 | lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:435-497 — These two members are one piece of code written twice and then edited apart: 63 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, 46+ corresponding lines) · ×1
Edited copies of one member (3 members, 46+ corresponding lines) lib/features/movies/presentation/radarr_overview_screen.dart:232— lib/features/movies/presentation/radarr_overview_screen.dart:232-277 | lib/features/music/presentation/lidarr_overview_screen.dart:119-179 | lib/features/series/presentation/sonarr_overview_screen.dart:251-302 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 46 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 (55 corresponding lines) · ×1
Edited copy of a member (55 corresponding lines) lib/features/movies/presentation/radarr_overview_screen.dart:134— lib/features/movies/presentation/radarr_overview_screen.dart:134-188 | lib/features/series/presentation/sonarr_overview_screen.dart:139-203 — 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 copies of one member (3 members, 60+ corresponding lines) · ×1
Edited copies of one member (3 members, 60+ corresponding lines) lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:161— lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:161-228 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:253-312 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:241-305 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 60 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 (51 corresponding lines) · ×1
Edited copy of a member (51 corresponding lines) lib/core/widgets/service_record_row.dart:78— lib/core/widgets/service_record_row.dart:78-150 | lib/features/nzbget/presentation/nzbget_tab_screens.dart:189-239 — These two members are one piece of code written twice and then edited apart: 51 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, 45+ corresponding lines) · ×1
Edited copies of one member (3 members, 45+ corresponding lines) lib/features/nzbget/presentation/nzbget_screen.dart:184— lib/features/nzbget/presentation/nzbget_screen.dart:184-235 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:194-244 | lib/features/transmission/presentation/transmission_screen.dart:235-279 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 45 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, 43+ corresponding lines) · ×1
Edited copies of one member (3 members, 43+ corresponding lines) lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:97— lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:97-142 | lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:207-250 | lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:293-335 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 43 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 (37 corresponding lines) · ×1
Edited copy of a member (37 corresponding lines) lib/features/settings/presentation/widgets/seerr_account_fields.dart:164— lib/features/settings/presentation/widgets/seerr_account_fields.dart:164-200 | lib/features/tracearr/presentation/tracearr_owner_fields.dart:174-210 — 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 (52 corresponding lines) · ×1
Edited copy of a member (52 corresponding lines) lib/core/widgets/app_empty_state.dart:212— lib/core/widgets/app_empty_state.dart:212-263 | lib/features/onboarding/presentation/widgets/onboarding_walk.dart:1300-1352 — These two members are one piece of code written twice and then edited apart: 52 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, 38+ corresponding lines) · ×1
Edited copies of one member (3 members, 38+ corresponding lines) lib/features/truenas/presentation/system/truenas_system_config_screens.dart:459— lib/features/truenas/presentation/system/truenas_system_config_screens.dart:459-496 | lib/features/truenas/presentation/system/truenas_system_config_screens.dart:503-541 | lib/features/truenas/presentation/system/truenas_system_config_screens.dart:548-590 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 38 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) lib/features/tracearr/presentation/tracearr_overview_screen.dart:94— lib/features/tracearr/presentation/tracearr_overview_screen.dart:94-123 | lib/features/tracearr/presentation/tracearr_overview_screen.dart:192-234 — 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 (48 corresponding lines) · ×1
Edited copy of a member (48 corresponding lines) lib/features/qbittorrent/presentation/widgets/torrent_tile.dart:56— lib/features/qbittorrent/presentation/widgets/torrent_tile.dart:56-103 | lib/features/transmission/presentation/widgets/transmission_torrent_tile.dart:51-105 — These two members are one piece of code written twice and then edited apart: 48 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, 34+ corresponding lines) · ×1
Edited copies of one member (3 members, 34+ corresponding lines) lib/features/dockge/presentation/dockge_overview_screen.dart:266— lib/features/dockge/presentation/dockge_overview_screen.dart:266-310 | lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:206-239 | lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:158-198 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 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 (38 corresponding lines) · ×1
Edited copy of a member (38 corresponding lines) lib/features/stream/presentation/widgets/stream_session_slab.dart:48— lib/features/stream/presentation/widgets/stream_session_slab.dart:48-85 | lib/features/stream/presentation/widgets/stream_session_slab.dart:114-155 — These two members are one piece of code written twice and then edited apart: 38 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, 25+ corresponding lines) · ×1
Edited copies of one member (4 members, 25+ corresponding lines) lib/features/bazarr/presentation/bazarr_library_screen.dart:147— lib/features/bazarr/presentation/bazarr_library_screen.dart:147-174 | lib/features/bazarr/presentation/bazarr_library_screen.dart:176-200 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:161-188 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:190-214 — These 4 members are one piece of code written 4 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 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) lib/features/bazarr/domain/models/bazarr_models.dart:85— lib/features/bazarr/domain/models/bazarr_models.dart:85-106 | lib/features/bazarr/domain/models/bazarr_models.dart:138-159 | lib/features/bazarr/domain/models/bazarr_models.dart:248-276 — 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 (39 corresponding lines) · ×1
Edited copy of a member (39 corresponding lines) lib/features/discover/presentation/widgets/search_row.dart:732— lib/features/discover/presentation/widgets/search_row.dart:732-774 | lib/features/music/presentation/artist_page.dart:1106-1144 — These two members are one piece of code written twice and then edited apart: 39 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, 31+ corresponding lines) · ×1
Edited copies of one member (4 members, 31+ corresponding lines) lib/core/widgets/service_overview.dart:1559— lib/core/widgets/service_overview.dart:1559-1589 | lib/features/music/presentation/lidarr_overview_screen.dart:195-225 | lib/features/readarr/presentation/readarr_overview_screen.dart:112-154 | lib/features/transmission/presentation/transmission_overview_screen.dart:276-307 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 31 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, 19+ corresponding lines) · ×1
Edited copies of one member (3 members, 19+ corresponding lines) lib/features/media/presentation/media_page.dart:3194— lib/features/media/presentation/media_page.dart:3194-3214 | lib/features/media/presentation/media_series_manage.dart:411-429 | lib/features/media/presentation/media_series_manage.dart:431-452 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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, 21+ corresponding lines) · ×1
Edited copies of one member (3 members, 21+ corresponding lines) lib/features/truenas/presentation/shares/truenas_shares_screen.dart:188— lib/features/truenas/presentation/shares/truenas_shares_screen.dart:188-212 | lib/features/truenas/presentation/system/truenas_credentials_screen.dart:97-117 | lib/features/truenas/presentation/system/truenas_credentials_screen.dart:213-233 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 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, 28+ corresponding lines) · ×1
Edited copies of one member (3 members, 28+ corresponding lines) lib/features/activity/presentation/widgets/detail_sheets.dart:385— lib/features/activity/presentation/widgets/detail_sheets.dart:385-417 | lib/features/import/presentation/manual_import_widgets.dart:450-477 | lib/features/plex/presentation/plex_capability.dart:150-182 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 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 (16 corresponding lines) · ×1
Edited copy of a member (16 corresponding lines) lib/features/music/presentation/artist_page.dart:966— lib/features/music/presentation/artist_page.dart:966-983 | lib/features/readarr/presentation/author_page.dart:512-527 — 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 copies of one member (3 members, 16+ corresponding lines) · ×1
Edited copies of one member (3 members, 16+ corresponding lines) lib/features/media/presentation/media_add_sheet.dart:137— lib/features/media/presentation/media_add_sheet.dart:137-153 | lib/features/media/presentation/media_add_sheet.dart:177-192 | lib/features/media/presentation/media_add_sheet.dart:194-210 — 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 (3 members, 11+ corresponding lines) · ×1
Edited copies of one member (3 members, 11+ corresponding lines) lib/features/onboarding/presentation/widgets/onboarding_parts.dart:153— lib/features/onboarding/presentation/widgets/onboarding_parts.dart:153-169 | lib/features/onboarding/presentation/widgets/onboarding_parts.dart:197-207 | lib/features/onboarding/presentation/widgets/onboarding_parts.dart:284-299 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 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, 13+ corresponding lines) · ×1
Edited copies of one member (3 members, 13+ corresponding lines) lib/features/import/presentation/manual_import_provider.dart:108— lib/features/import/presentation/manual_import_provider.dart:108-120 | lib/features/import/presentation/manual_import_provider.dart:122-137 | lib/features/import/presentation/manual_import_provider.dart:139-154 — 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 (6 members, 18+ corresponding lines) · ×1
Edited copies of one member (6 members, 18+ corresponding lines) lib/features/dockge/presentation/dockge_screen.dart:26— lib/features/dockge/presentation/dockge_screen.dart:26-45 | lib/features/npm/presentation/npm_screen.dart:94-123 | lib/features/nzbget/presentation/nzbget_screen.dart:34-51 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:34-53 | lib/features/transmission/presentation/transmission_screen.dart:33-50 | lib/features/unraid/presentation/unraid_screen.dart:86-118 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 7+ corresponding lines) · ×1
Edited copies of one member (3 members, 7+ corresponding lines) lib/features/npm/data/npm_client.dart:271— lib/features/npm/data/npm_client.dart:271-280 | lib/features/npm/data/npm_client.dart:301-307 | lib/features/npm/data/npm_client.dart:324-333 — 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 (3 members, 9+ corresponding lines) · ×1
Edited copies of one member (3 members, 9+ corresponding lines) lib/features/import/domain/manual_import_models.dart:586— lib/features/import/domain/manual_import_models.dart:586-594 | lib/features/import/domain/manual_import_models.dart:612-621 | lib/features/import/domain/manual_import_models.dart:637-646 — 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 copies of one member (3 members, 8+ corresponding lines) · ×1
Edited copies of one member (3 members, 8+ corresponding lines) lib/features/prowlarr/domain/models/prowlarr_models.dart:406— lib/features/prowlarr/domain/models/prowlarr_models.dart:406-415 | lib/features/prowlarr/domain/models/prowlarr_models.dart:442-449 | lib/features/truenas/domain/models/share.dart:23-33 — These 3 members are one piece of code written 3 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 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) lib/features/import/data/manual_import_service.dart:178— lib/features/import/data/manual_import_service.dart:178-188 | lib/features/import/data/manual_import_service.dart:204-213 | lib/features/import/data/manual_import_service.dart:215-224 | lib/features/import/data/manual_import_service.dart:226-232 | lib/features/import/data/manual_import_service.dart:234-240 — 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.
Duplicated block (44 lines × 2) lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:261— lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:261-304 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:301-344 — before extracting anything, compare `lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart` and `lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:261` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:260` calls `Text` and `lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:300` 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 (30–31 lines × 2) lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:107— lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:107-136 | lib/features/bazarr/presentation/bazarr_series_detail_screen.dart:118-148 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart` and `lib/features/bazarr/presentation/bazarr_series_detail_screen.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:107` 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 (27–28 lines × 2) lib/features/nzbget/presentation/nzbget_screen.dart:74— lib/features/nzbget/presentation/nzbget_screen.dart:74-100 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:76-103 — before extracting anything, compare `lib/features/nzbget/presentation/nzbget_screen.dart` and `lib/features/sabnzbd/presentation/sabnzbd_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 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 `lib/features/nzbget/presentation/nzbget_screen.dart:74` 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 (24–26 lines × 3) lib/features/nzbget/presentation/nzbget_screen.dart:87— lib/features/nzbget/presentation/nzbget_screen.dart:87-110 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:89-113 | lib/features/transmission/presentation/transmission_screen.dart:110-135 — before extracting anything, compare `lib/features/nzbget/presentation/nzbget_screen.dart` and `lib/features/sabnzbd/presentation/sabnzbd_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 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 `lib/features/nzbget/presentation/nzbget_screen.dart:87` 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 (22–26 lines × 2) lib/features/onboarding/presentation/requester_sign_in_screen.dart:279— lib/features/onboarding/presentation/requester_sign_in_screen.dart:279-304 | lib/features/pairing/presentation/pair_receive_screen.dart:176-197 — 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 `lib/features/onboarding/presentation/requester_sign_in_screen.dart:279` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17–25 lines × 2) lib/core/widgets/service_overview.dart:1438— lib/core/widgets/service_overview.dart:1438-1454 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:250-274 — 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 `lib/core/widgets/service_overview.dart:1438` 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 (24–25 lines × 2) lib/features/activity/presentation/widgets/violation_rows.dart:146— lib/features/activity/presentation/widgets/violation_rows.dart:146-169 | lib/features/services/presentation/dashboard_sections.dart:626-650 — 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 `lib/features/services/presentation/dashboard_sections.dart:626` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12–25 lines × 2) lib/features/outside/presentation/settings_notifications_screen.dart:107— lib/features/outside/presentation/settings_notifications_screen.dart:107-118 | lib/features/release_search/presentation/release_search_settings_screen.dart:134-158 — 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 `lib/features/outside/presentation/settings_notifications_screen.dart:107` 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 (17–22 lines × 5) lib/features/bazarr/presentation/bazarr_overview_screen.dart:185— lib/features/bazarr/presentation/bazarr_overview_screen.dart:185-204 | lib/features/dockge/presentation/dockge_overview_screen.dart:221-242 | lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:259-277 | lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:258-276 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:153-169 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/bazarr/presentation/bazarr_overview_screen.dart:185` 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 (19 lines × 4) lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:174— lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:174-192 | lib/features/prowlarr/presentation/prowlarr_settings_screen.dart:116-134 | lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:252-270 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:252-270 — before extracting anything, compare `lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart` and `lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:174` 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 (18–19 lines × 3) lib/features/nzbget/presentation/nzbget_screen.dart:68— lib/features/nzbget/presentation/nzbget_screen.dart:68-85 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:70-87 | lib/features/transmission/presentation/transmission_screen.dart:84-102 — before extracting anything, compare `lib/features/nzbget/presentation/nzbget_screen.dart` and `lib/features/sabnzbd/presentation/sabnzbd_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 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 `lib/features/nzbget/presentation/nzbget_screen.dart:68` 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 (19 lines × 2) lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:294— lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:294-312 | lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:602-620 — 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 `lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:294` 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 (13–18 lines × 2) lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:79— lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:79-96 | lib/features/bazarr/presentation/bazarr_series_detail_screen.dart:97-109 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart` and `lib/features/bazarr/presentation/bazarr_series_detail_screen.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:79` 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–17 lines × 2) lib/features/npm/presentation/npm_screen.dart:906— lib/features/npm/presentation/npm_screen.dart:906-921 | lib/features/npm/presentation/npm_screen.dart:1037-1053 — 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 `lib/features/npm/presentation/npm_screen.dart:906` 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–17 lines × 2) lib/features/onboarding/presentation/widgets/onboarding_walk.dart:1172— lib/features/onboarding/presentation/widgets/onboarding_walk.dart:1172-1186 | lib/features/onboarding/presentation/widgets/onboarding_walk.dart:1304-1320 — 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 `lib/features/onboarding/presentation/widgets/onboarding_walk.dart:1172` 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 (12–16 lines × 3) lib/features/npm/presentation/npm_overview_screen.dart:257— lib/features/npm/presentation/npm_overview_screen.dart:257-268 | lib/features/npm/presentation/npm_overview_screen.dart:330-341 | lib/features/stream/presentation/stream_overview_screen.dart:400-415 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/npm/presentation/npm_overview_screen.dart:257` 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 (15–16 lines × 2) lib/features/qbittorrent/presentation/torrent_detail_screen.dart:377— lib/features/qbittorrent/presentation/torrent_detail_screen.dart:377-391 | lib/features/qbittorrent/presentation/torrent_detail_screen.dart:423-438 — 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 `lib/features/qbittorrent/presentation/torrent_detail_screen.dart:377` 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 (15 lines × 5) lib/features/npm/presentation/npm_screen.dart:644— lib/features/npm/presentation/npm_screen.dart:644-658 | lib/features/npm/presentation/npm_screen.dart:907-921 | lib/features/npm/presentation/npm_screen.dart:1038-1052 | lib/features/unraid/presentation/unraid_screen.dart:747-761 | lib/features/unraid/presentation/unraid_screen.dart:911-925 — there are 5 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/npm/presentation/npm_screen.dart:644` 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 (15 lines × 4) lib/features/truenas/presentation/datasets/truenas_dataset_detail_screen.dart:332— lib/features/truenas/presentation/datasets/truenas_dataset_detail_screen.dart:332-346 | lib/features/truenas/presentation/shares/truenas_shares_screen.dart:528-542 | lib/features/truenas/presentation/system/truenas_credentials_screen.dart:124-138 | lib/features/truenas/presentation/system/truenas_credentials_screen.dart:240-254 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/truenas/presentation/datasets/truenas_dataset_detail_screen.dart:332` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12–14 lines × 5) lib/features/bazarr/presentation/bazarr_library_screen.dart:345— lib/features/bazarr/presentation/bazarr_library_screen.dart:345-356 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:310-321 | lib/features/dockge/presentation/dockge_screen.dart:144-155 | lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart:232-243 | lib/features/readarr/presentation/widgets/readarr_tiles.dart:92-105 — before extracting anything, compare `lib/features/bazarr/presentation/bazarr_library_screen.dart` and `lib/features/bazarr/presentation/bazarr_wanted_screen.dart` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/bazarr/presentation/bazarr_library_screen.dart:345` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lib/features/bazarr/presentation/bazarr_library_screen.dart:342` calls `InkWell`, `_openEntry` and `lib/features/readarr/presentation/widgets/readarr_tiles.dart:91` 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 × 4) lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:184— lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:184-197 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:266-279 | lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:262-275 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:262-275 — before extracting anything, compare `lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart` and `lib/features/prowlarr/presentation/prowlarr_tags_screen.dart` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:184` 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–14 lines × 3) lib/core/widgets/service_overview.dart:1646— lib/core/widgets/service_overview.dart:1646-1656 | lib/features/discover/presentation/seerr_overview_screen.dart:409-419 | lib/features/stream/presentation/stream_watching.dart:478-491 — 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 `lib/core/widgets/service_overview.dart:1646` 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–14 lines × 3) lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart:231— lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart:231-242 | lib/features/prowlarr/presentation/prowlarr_settings_screen.dart:126-137 | lib/features/readarr/presentation/widgets/readarr_tiles.dart:91-104 — before extracting anything, compare `lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart` and `lib/features/readarr/presentation/widgets/readarr_tiles.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 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 `lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart:231` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lib/features/prowlarr/presentation/prowlarr_settings_screen.dart:124` calls `InkWell` and `lib/features/readarr/presentation/widgets/readarr_tiles.dart:90` 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 (13–14 lines × 2) lib/features/media/presentation/media_page.dart:3383— lib/features/media/presentation/media_page.dart:3383-3395 | lib/features/media/presentation/media_series_manage.dart:614-627 — before extracting anything, compare `lib/features/media/presentation/media_page.dart` and `lib/features/media/presentation/media_series_manage.dart` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/media/presentation/media_page.dart:3383` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13 lines × 5) lib/features/pairing/presentation/pair_offer_screen.dart:152— lib/features/pairing/presentation/pair_offer_screen.dart:152-164 | lib/features/settings/presentation/requester_account_page.dart:52-66 | lib/features/settings/presentation/settings_appearance_screen.dart:22-37 | lib/features/settings/presentation/settings_hints_screen.dart:28-40 | lib/features/settings/presentation/settings_region_screen.dart:65-77 — before extracting anything, compare `lib/features/pairing/presentation/pair_offer_screen.dart` and `lib/features/settings/presentation/settings_hints_screen.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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 `lib/features/pairing/presentation/pair_offer_screen.dart:152` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12–13 lines × 2) lib/features/media/presentation/media_report_row.dart:139— lib/features/media/presentation/media_report_row.dart:139-150 | lib/features/media/presentation/seerr_issue_thread_parts.dart:561-573 — 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 `lib/features/media/presentation/media_report_row.dart:139` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12 lines × 8) lib/features/outside/presentation/settings_notifications_screen.dart:107— lib/features/outside/presentation/settings_notifications_screen.dart:107-118 | lib/features/pairing/presentation/pair_offer_screen.dart:152-165 | lib/features/release_search/presentation/release_search_settings_screen.dart:134-157 | lib/features/settings/presentation/requester_account_page.dart:54-67 | lib/features/settings/presentation/settings_appearance_screen.dart:22-38 | lib/features/settings/presentation/settings_connections_screen.dart:54-69 | lib/features/settings/presentation/settings_hints_screen.dart:28-41 | lib/features/settings/presentation/settings_region_screen.dart:65-78 — before extracting anything, compare `lib/features/pairing/presentation/pair_offer_screen.dart` and `lib/features/settings/presentation/settings_hints_screen.dart` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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 `lib/features/outside/presentation/settings_notifications_screen.dart:107` 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 (11 lines × 4) lib/features/truenas/presentation/apps/truenas_apps_screen.dart:64— lib/features/truenas/presentation/apps/truenas_apps_screen.dart:64-74 | lib/features/truenas/presentation/datasets/truenas_datasets_screen.dart:43-53 | lib/features/truenas/presentation/storage/truenas_storage_screen.dart:41-51 | lib/features/truenas/presentation/system/truenas_services_screen.dart:50-60 — `lib/features/truenas/presentation/apps/truenas_apps_screen.dart` and `lib/features/truenas/presentation/storage/truenas_storage_screen.dart` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 37 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/truenas/presentation/apps/truenas_apps_screen.dart:64` 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 × 3) lib/features/npm/presentation/npm_screen.dart:1034— lib/features/npm/presentation/npm_screen.dart:1034-1044 | lib/features/prowlarr/presentation/prowlarr_settings_screen.dart:113-123 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:253-263 — 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 `lib/features/npm/presentation/npm_screen.dart:1034` 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 (8–11 lines × 2) lib/features/npm/presentation/npm_screen.dart:524— lib/features/npm/presentation/npm_screen.dart:524-531 | lib/features/prowlarr/presentation/widgets/prowlarr_field_inputs.dart:341-351 — 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 `lib/features/npm/presentation/npm_screen.dart:524` 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 (10 lines × 4) lib/features/npm/presentation/npm_advanced_config_screen.dart:61— lib/features/npm/presentation/npm_advanced_config_screen.dart:61-70 | lib/features/npm/presentation/npm_screen.dart:585-595 | lib/features/npm/presentation/npm_screen.dart:850-860 | lib/features/npm/presentation/npm_screen.dart:1012-1022 — there are 4 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `lib/features/npm/presentation/npm_advanced_config_screen.dart:61` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7–8 lines × 2) lib/core/widgets/floating_bottom_nav_bar.dart:476— lib/core/widgets/floating_bottom_nav_bar.dart:476-482 | lib/core/widgets/floating_nav_rail.dart:104-111 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `lib/core/widgets/floating_bottom_nav_bar.dart:475` calls `barHeightFor` and `lib/core/widgets/floating_nav_rail.dart:103` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 3) lib/features/activity/presentation/activity_needs_you_page.dart:51— lib/features/activity/presentation/activity_needs_you_page.dart:51-57 | lib/features/activity/presentation/activity_page.dart:552-558 | lib/features/home/presentation/widgets/requests_module.dart:83-89 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (4–6 lines × 3) lib/features/settings/presentation/widgets/settings_master_detail.dart:254— lib/features/settings/presentation/widgets/settings_master_detail.dart:254-259 | lib/features/shell/presentation/desktop/window_chrome.dart:890-893 | lib/features/truenas/presentation/truenas_console_shell.dart:334-339 — 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 `lib/features/settings/presentation/widgets/settings_master_detail.dart:254` 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 (25 lines × 2) lib/features/bazarr/presentation/bazarr_overview_screen.dart:129— lib/features/bazarr/presentation/bazarr_overview_screen.dart:129-153 | lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:168-192 — 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 (49–56 lines × 2) ios/Runner/AppDelegate.swift:295— ios/Runner/AppDelegate.swift:295-350 | macos/Runner/MainFlutterWindow.swift:347-395 — before extracting anything, compare `ios/Runner/AppDelegate.swift` and `macos/Runner/MainFlutterWindow.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 145 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (27 lines × 2) ios/Runner/AppDelegate.swift:57— ios/Runner/AppDelegate.swift:57-83 | macos/Runner/MainFlutterWindow.swift:89-115 — before extracting anything, compare `ios/Runner/AppDelegate.swift` and `macos/Runner/MainFlutterWindow.swift` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 145 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.
No structured logging — No logging call was found in the 1211 JavaScript/TypeScript, Dart, JVM, Swift production file(s) this check read across 10 module(s). Each was searched for its ecosystem's logging libraries (JVM: SLF4J, Log4j2, java.util.logging, Logback, kotlin-logging, scala-logging; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger; Swift: os.Logger/os_log/NSLog, swift-log, CocoaLumberjack, SwiftyBeaver, XCGLogger; Dart: package:logging, package:logger, dart:developer's log()) and for a call on a receiver named `log`/`logger` (or ending in `Logger`/`_logger`) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read — this is 'no logging found by this walk', not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose.
X14 · Bypassable address classification· IP classification is bypassable through an IPv4-in-IPv6 embedding · ×1
IP classification is bypassable through an IPv4-in-IPv6 embedding lib/core/network/local_network_target.dart:86— This function unwraps IPv4-MAPPED IPv6 (`[10] == 0xff`, line 91) and then rejects `10.0.0.0/8` on its IPv4 path — but the IPv6 decision at line 86 classifies the address as written, and IPv4 reaches IPv6 through three MORE embeddings this function never mentions: IPv4-compatible (`::a.b.c.d`), 6to4 (`2002::/16`) and NAT64 (`64:ff9b::/96`). So `::10.0.0.1`, `2002:0a00:0001::` and `64:ff9b::10.0.0.0` all name a host inside `10.0.0.0/8` — the range this same function declares non-public — and all reach the IPv6 decision un-unwrapped, taking the opposite verdict. Unwrap every embedding to its IPv4 form before classifying, or reject any IPv6 address carrying an embedded IPv4 outright.
X2 · Cancellation propagation· Async function without AbortSignal · ×1
Async function without AbortSignal: text website/scripts/indexnow.mjs:18— `text` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Duplicated predicate lib/core/widgets/media_browse_scaffold.dart:685— `!AppBreakpoints.isDesktopShell(context) && MediaQuery.sizeOf(context).width < AppBreakpoints.touchRail` appears character-identically in 2 files — lib/core/widgets/media_browse_scaffold.dart, lib/features/shell/presentation/shell_screen.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/activity/domain/download_page.dart:104— `DownloadStand.stuck || DownloadStand.failed || DownloadStand.needsImport` appears character-identically in 2 files — lib/features/activity/domain/download_page.dart, lib/features/activity/domain/download_table.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/activity/domain/everyones_requests.dart:70— `MyRequestStage.declined || MyRequestStage.didNotGoThrough` appears character-identically in 2 files — lib/features/activity/domain/everyones_requests.dart, lib/features/requests/domain/my_requests.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/discover/domain/collection_shelf.dart:105— `SeerrMediaAvailability.available || SeerrMediaAvailability.partiallyAvailable` appears character-identically in 3 files — lib/features/discover/domain/collection_shelf.dart, lib/features/discover/domain/seerr_request_gate.dart, lib/features/discover/domain/seerr_status.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/discover/domain/seerr_status.dart:119— `SeerrMediaAvailability.unknown || SeerrMediaAvailability.deleted` appears character-identically in 2 files — lib/features/discover/domain/seerr_status.dart, lib/features/discover/presentation/catalog_providers.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/core/network/write_outcome.dart:15— `ServiceFailureReason.timeout || ServiceFailureReason.serverError || ServiceFailureReason.invalidResponse || ServiceFailureReason.unknown` appears character-identically in 2 files — lib/core/network/write_outcome.dart, lib/features/transmission/presentation/transmission_actions.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/core/network/connection_failure.dart:949— `ServiceFailureReason.unauthorized || ServiceFailureReason.secretUnread` appears character-identically in 2 files — lib/core/network/connection_failure.dart, lib/features/settings/domain/connection_presentation.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/core/network/connection_failure.dart:789— `ServiceFailureReason.unreachable || ServiceFailureReason.unreachableAtBoth` appears character-identically in 3 files — lib/core/network/connection_failure.dart, lib/features/search/domain/global_search_result.dart, lib/features/settings/domain/connection_presentation.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/core/capability/audience.dart:43— `ServiceKey.jellyfin || ServiceKey.plex || ServiceKey.emby` appears character-identically in 3 files — lib/core/capability/audience.dart, lib/core/capability/role_gate.dart, lib/features/settings/domain/service_key.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/settings/data/route_knock.dart:71— `ServiceKey.radarr || ServiceKey.sonarr || ServiceKey.lidarr || ServiceKey.readarr || ServiceKey.prowlarr` appears character-identically in 2 files — lib/features/settings/data/route_knock.dart, lib/features/settings/domain/probe_identity.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/core/capability/role_gate.dart:302— `ServiceKey.seerr || ServiceKey.radarr || ServiceKey.sonarr || ServiceKey.lidarr || ServiceKey.qbittorrent || ServiceKey.transmission || Serv…` appears character-identically in 2 files — lib/core/capability/role_gate.dart, lib/features/settings/domain/service_key.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/home/presentation/edit_home_page.dart:189— `TargetPlatform.iOS || TargetPlatform.macOS` appears character-identically in 2 files — lib/features/home/presentation/edit_home_page.dart, lib/features/settings/domain/unread_secret.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/bazarr/presentation/bazarr_library_screen.dart:178— `_total != null && _items.length >= _total!` appears character-identically in 2 files — lib/features/bazarr/presentation/bazarr_library_screen.dart, lib/features/bazarr/presentation/bazarr_wanted_screen.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/core/network/redirect_guard.dart:240— `a.scheme == b.scheme && a.host == b.host && a.port == b.port` appears character-identically in 2 files — lib/core/network/redirect_guard.dart, lib/core/network/same_origin_http_client.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/activity/domain/activity_history.dart:38— `at != null && (last == null || at.isAfter(last))` appears character-identically in 2 files — lib/features/activity/domain/activity_history.dart, lib/features/home/presentation/widgets/downloads_module.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/core/widgets/ambient_scaffold.dart:361— `box is! RenderBox || !box.attached || !box.hasSize` appears character-identically in 2 files — lib/core/widgets/ambient_scaffold.dart, lib/core/widgets/service_tab_bar.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/home/data/featured.dart:80— `calendar == null || (calendar.answered.isEmpty && calendar.silent.isNotEmpty)` appears character-identically in 2 files — lib/features/home/data/featured.dart, lib/features/outside/data/outside_run.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/home/data/last_known/coming_up_last_known.dart:32— `calendar.answered.isEmpty && calendar.silent.isNotEmpty` appears character-identically in 2 files — lib/features/home/data/last_known/coming_up_last_known.dart, lib/features/home/presentation/widgets/coming_up_module.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/core/widgets/content_card.dart:480— `color != oldDelegate.color || radius != oldDelegate.radius` appears character-identically in 2 files — lib/core/widgets/content_card.dart, lib/features/media/presentation/shelf_page.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/music/presentation/artist_page.dart:330— `connection == null || !connection.isConfigured` appears character-identically in 2 files — lib/features/music/presentation/artist_page.dart, lib/features/readarr/presentation/author_page.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/activity/presentation/activity_needs_you_page.dart:53— `decision.kind == DecisionKind.pendingRequest && !answered.containsKey(decision.id)` appears character-identically in 3 files — lib/features/activity/presentation/activity_needs_you_page.dart, lib/features/activity/presentation/activity_page.dart, lib/features/home/presentation/widgets/requests_module.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/core/widgets/media_browse_index.dart:196— `defaultTargetPlatform == TargetPlatform.iOS || defaultTargetPlatform == TargetPlatform.android` appears character-identically in 2 files — lib/core/widgets/media_browse_index.dart, lib/features/stream/presentation/play_with.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/jellyfin/data/media_browser_client.dart:261— `error.response?.statusCode == 403 && error.error is! AccessGatewayAnswer` appears character-identically in 2 files — lib/features/jellyfin/data/media_browser_client.dart, lib/features/qbittorrent/data/qbittorrent_client.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/tracearr/data/tracearr_client.dart:657— `error.response?.statusCode == 404 && error.error is! AccessGatewayAnswer` appears character-identically in 2 files — lib/features/tracearr/data/tracearr_client.dart, lib/features/tracearr/presentation/tracearr_overview_provider.dart. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate lib/features/home/data/last_known/featured_last_known.dart:131— `event.day == today && (event.kind == CalendarKind.movie || event.kind == CalendarKind.episode)` appears character-identically in 2 files — lib/features/home/data/last_known/featured_last_known.dart, lib/features/home/domain/featured.dart. 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.
Silent fallback default in catch lib/core/api/base_arr_service.dart:648— `getAllCutoff` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default in catch lib/core/api/base_arr_service.dart:673— `fetchAllItems` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default in catch lib/core/api/base_arr_service.dart:884— `fetchQualityProfiles` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default in catch lib/features/jellyfin/data/media_browser_client.dart:944— `getRecentlyWatched` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default in catch lib/features/plex/data/plex_client.dart:1218— `getRecentlyWatched` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default in catch lib/features/qbittorrent/domain/models/torrent.dart:262— `trackerDomain` turns every thrown error into `''` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default in catch lib/features/release_search/presentation/release_search_headroom_provider.dart:66— `build` turns every thrown error into `{}` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default in catch lib/features/search/presentation/recent_searches_provider.dart:23— `build` turns every thrown error into `[]` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default in catch lib/features/services/presentation/kept_waiting_provider.dart:52— `build` turns every thrown error into `{}` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default in catch lib/features/settings/data/settings_service.dart:912— `_loadTrustedCertificates` turns every thrown error into `{}` — a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default on parse failure test/e2e/testlab/emby_play.py:775— `_read_state` returns `{}` when `(OSError, json.JSONDecodeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure test/e2e/testlab/forge/forge.py:251— `lidarr_tracks` returns `[]` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure test/e2e/testlab/jellyfin_play.py:857— `_read_state` returns `{}` when `(OSError, json.JSONDecodeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure test/e2e/testlab/mock/server.py:2650— `_release` returns `{}` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure test/e2e/testlab/seerr_world.py:338— `_read_state` returns `{}` when `(OSError, json.JSONDecodeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure lib/features/settings/data/settings_service.dart:375— `loadActiveInstances` answers `{}` when `FormatException` is thrown, with no log or rethrow — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default on parse failure lib/features/settings/data/settings_service.dart:410— `loadConnectionRoutes` answers `{}` when `FormatException` is thrown, with no log or rethrow — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Silent fallback default on parse failure lib/features/settings/data/settings_service.dart:693— `_readRoster` answers `[]` when `FormatException` is thrown, with no log or rethrow — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the `catch` or in the `///` doc, and the row stops firing.
Fat interface: MediaBrowserDialect (17 abstract methods) lib/features/jellyfin/data/media_browser_dialect.dart:37— `MediaBrowserDialect` declares 17 abstract methods: `service`, `basePath`, `serviceHeaders`, `interceptors`, `isThisServer`, `sessionsQuery`, `liveSessions`, `browseFields`, `users`, `credentialKind`, `tokenUserAsViewer`, `rawItem`, `resume`, `nextUp`, `search`, `virtualFolders`, `episodeSortBy`. Counted over its public methods with no body, once per name; concrete methods and `_`-private members are not counted, because no implementer that extends it is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Fat interface: StreamServerClient (21 abstract methods) lib/features/stream/domain/stream_server_client.dart:60— `StreamServerClient` declares 21 abstract methods: `probeVersion`, `verifyCredential`, `getSessions`, `stopSession`, `getLibraries`, `getLibraryItemCount`, `search`, `getLibraryPage`, `getItem`, `getSeriesKey`, `getTitleKey`, `getChildren`, `getEpisodes`, `lookupByExternalId`, `getContinueWatching`, `getNextUp`, `getRecentlyAdded`, `getRecentlyWatched`, `getViewers`, `imageFor`, `close`. Counted over its public methods with no body, once per name; concrete methods and `_`-private members are not counted, because no implementer that extends it is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
No ADRs found macos/Runner.xcodeproj/project.pbxproj: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 `macos/Runner.xcodeproj/project.pbxproj` makes this repository a deployable product (line 1).
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion pubspec.yaml:1— `(repository root)` (287755 LoC, 1858 module-visible types across 158 directories) overshoots its size bounds. 1 of 10 build unit(s) (Gradle, SwiftPM, Xcode, npm, pub) overshoot their size bounds, lowering Project Cohesion to 8.0/10. Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
GD1 · Unfinished & placeholder code· Placeholder literal left in code · ×1
Placeholder literal left in code lib/features/npm/presentation/npm_screen.dart:537— A placeholder string ("admin@example.com / changeme login. If i…") is still in shipped code — typical of generated boilerplate that was never filled in.
IC1 · Incompleteness & stubs· Member throws UnsupportedError · ×1
Member throws UnsupportedError packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart:426— `setFocusPoint`'s body only throws an UnsupportedError or an UnimplementedError that gives its reason — sometimes a deliberate refusal, often an unfinished stub. Confirm it's intentional.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No SAST .github/workflows/ci.yml:6— No static application security testing detected. For this repository's stack, add the Dart analyzer's security lints plus `semgrep --config=auto` as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling· Dependabot does not watch npm/gradle · ×1
Dependabot does not watch npm/gradle REDACTED:4— `REDACTED` schedules updates, but no `package-ecosystem` entry covers `npm`, `gradle`, 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.
No app-layer HTTPS enforcement detected — This repository runs an HTTP server that is not bound to the loopback interface alone — or binds it at an address its source does not spell out — and nothing in its Dart source secures the transport: no `HttpServer.bindSecure` or `securityContext:`, no `Strict-Transport-Security` header, no `X-Forwarded-Proto` read from a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: lib/features/pairing/data/pair_server.dart:100 — `HttpServer.bind(`.
No inbound request validation detected — No handler of this repository's Dart server answers 400, 413 or 422 (`Response.badRequest`, `HttpStatus.badRequest`, `statusCode = 400`) and no validation package (luthor, acanthis, ez_validator, json_schema, …) is imported — nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (−2.0 on this card.) The server: lib/features/pairing/data/pair_server.dart:100 — `HttpServer.bind(`.
X2 · Cancellation propagation· Not all functions that make a request accept an AbortSignal or a CancelToken · ×1
Not all functions that make a request accept an AbortSignal or a CancelToken — Only 7/27 functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http; Dio, AbortableRequest) accept an AbortSignal or a CancelToken or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a `signal` (Dart: `CancelToken? cancelToken`) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
Hand-rolled JSON/XML parsing via regex tool/design_system/lint_boards.py:33— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
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 4 file(s) — `packages/mobile_scanner/darwin/mobile_scanner/Sources/mobile_scanner/MobileScannerPlugin.swift`, `website/src/data/faq.ts`, `website/src/data/pages.ts`, `website/src/data/titles.ts` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
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 01a1e9b0-5bb9-7a0b-83ed-998cfcff0c29 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 18 · Warnings: 1219 · Recommendations: 73 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 17-11-2026 @ 13:26 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.