{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX1","name":"Captive dependencies","shortDescription":{"text":"Captive dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/AX1"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX7","name":"Slice cohesion","shortDescription":{"text":"Slice cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/AX7"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"_MediaPageState.build (cyclomatic 116): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"0513ca15614165f921ab99a3e0a87bfadef4f897c69ce7873a3a421d95c2fdd2"}},{"ruleId":"D1","level":"warning","message":{"text":"_ArtistPageState.build (cyclomatic 55): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dde856a03032e69e211b4a8824499e82be93a570e7a312dd586d7e99ab9c47"}},{"ruleId":"D1","level":"warning","message":{"text":"_LeadBar.build (cyclomatic 44): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac756a971e061405c4075bb123ddd68ecf55ac98097b3891a5204b179c0beea"}},{"ruleId":"D1","level":"warning","message":{"text":"_NeedsYouSectionState.build (cyclomatic 42): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"de678ac0401a4d649351600fa96ed44f3ca6d5c1d716a7a14eebde06c515525a"}},{"ruleId":"D1","level":"warning","message":{"text":"_Scope._parseTypography (cyclomatic 37): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_tokens/generate.dart"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a9b2aeb940fbde63b5e38ef2fed22137505a876951e84fc5be860b60ca1f03"}},{"ruleId":"D1","level":"warning","message":{"text":"board.main (cyclomatic 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_system/board.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c617a7ced2ea61317cba61cb52e5954ec40af7adedcb0933741ac73b0a26dbf7"}},{"ruleId":"D1","level":"warning","message":{"text":"_MediaBrowseScaffoldState.build (cyclomatic 35): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"571b0f957d8cfd8cdffa060df950c354d7b67be35b288a70747d0da4ca6c79be"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityDownloadRow.build (cyclomatic 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_download_row.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dc5dfee4b1ea6eb901f7ffb7a2f66d9eda1609be7d12e516152afdca96c4f0"}},{"ruleId":"D1","level":"warning","message":{"text":"CalendarEvent.spoken (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/library_calendar.dart"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"682abb441fe0ff8a1d2bdc963afa1cc79af32e53beb1b13e4705bc67df86f71f"}},{"ruleId":"D1","level":"warning","message":{"text":"_CalendarPageState.build (cyclomatic 33): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/calendar_page.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdaf6a8a7183ecc529eebbf0bc9ae83e993abb1886f3320c587d731580c95ec"}},{"ruleId":"D1","level":"warning","message":{"text":"_SeerrIssueThreadScreenState._thread (cyclomatic 33): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/seerr_issue_thread_screen.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2b67a122ce9a1c4b1a854fa3865d70eb156d7c018c055d476d756489905189"}},{"ruleId":"D1","level":"warning","message":{"text":"RequestBottomSheet.build (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/request_bottom_sheet.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36b12c4293d0a01ec089f3f1a73413ff17bf90c5b8cffcd14ebb3c281d41d0d"}},{"ruleId":"D1","level":"warning","message":{"text":"_ServiceSettingsScreenState._buildScaffold (cyclomatic 31): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f825a7734c8a38eb5306f848ca7b3374ee53acc264e03b14aa5158ad208dd36"}},{"ruleId":"D1","level":"warning","message":{"text":"_BlockedImportReviewPageState._content (cyclomatic 30): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_review_page.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb1874f3976d3f6e562acc6fa1363c2bd3b644db4fa57354ecfb1c5b56ed427"}},{"ruleId":"D1","level":"warning","message":{"text":"_MediaAddSheetState.build (cyclomatic 30): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_add_sheet.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4184fb9526e5782c29bf969b0a2c9852564cbc231ea3d8ff3c5566a2f9c0fd47"}},{"ruleId":"D1","level":"warning","message":{"text":"CalendarRow.build (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_agenda.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa907307953514295a06f0b8049cf0a6a74b32ae9ad44246ee7256337e484a88"}},{"ruleId":"D1","level":"warning","message":{"text":"_BlockedImportReviewPageState.build (cyclomatic 29): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_review_page.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f6543c5e6481bb5693e7c0ba5252bd79fd33a2a9aeb0fabbd4db39e6586d45"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogTitleRow.build (cyclomatic 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/catalog_title_row.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1166c20e979dc34ff13f8bd9530b0a8190e7047f4bd8c56a0de14ac3e003bbba"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeContinueWatchingModule.build (cyclomatic 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/continue_watching_module.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5e223a88d692210e3ec188409c4828ff5788b1b78e6f185cc9f2bb64637d0d"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeDownloadsModule.build (cyclomatic 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/downloads_module.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"51057480f00b0d8ab0c39f26284413bc1c6cda5ae59703a9a3c1402d683af970"}},{"ruleId":"D1","level":"warning","message":{"text":"_MediaEpisodesGraphSheetState.build (cyclomatic 28): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episodes_graph.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4344331b2e3a89e0d60b20f1516b5bcdc167cf945e71a78822dea3dabf736993"}},{"ruleId":"D1","level":"warning","message":{"text":"_AuthorPageState.build (cyclomatic 28): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/author_page.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6be30edbd79ba08b7b76292699b4ade4ae5753731d22df1289fb00612befb9f"}},{"ruleId":"D1","level":"warning","message":{"text":"ServiceMatrixCell.build (cyclomatic 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"800e82df61d3082725a0bc60a354118fce188c25ba00c1871a0886a5f6fcdc3d"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsService._saveInstances (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97374d47909e1169174a5721765e62be6fff3c1c75871f523db493a5be10622"}},{"ruleId":"D1","level":"warning","message":{"text":"_DesktopShellState.build (cyclomatic 27): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/desktop_shell.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"99023f9980b22c61a3a7c26d544809744817c5982ebe3dd083d8726f250330fa"}},{"ruleId":"D1","level":"warning","message":{"text":"_RowState.build (cyclomatic 26): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/download_table.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"862861d6898b006ff87b2210766f8f8c5bfab518c556732f9831f323feb5e223"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchRow.build (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/search_row.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dcbd4367e9cf62c6d8c58d3dd098287b8a93ced7d0b5210b40185bfc130952"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchedFileRow.build (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_rows.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba70ccfe464c1d810cfa7a9106d055a40f6d1b5e984174b5b6b1ddaae4ef3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"_DownloadsSection.build (cyclomatic 25): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8369df43ecd18d00bb472b04d8449a8e279a153b34b2a17ebb379fe00548c5"}},{"ruleId":"D1","level":"warning","message":{"text":"PairPackage.fromJson (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/domain/pair_package.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59a6f3484c3727d7621addbafd9d2343b533834610725ff5447113ff1e5acfd"}},{"ruleId":"D1","level":"warning","message":{"text":"_ServiceSettingsScreenState.initState (cyclomatic 25): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c12b92fb1fdf90b4f97a1593793ba9d2e479ead827c4d0716d5dff0cdf285e8"}},{"ruleId":"D1","level":"warning","message":{"text":"SeerrGrant.may (cyclomatic 24): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/seerr_grant.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bb7f50f45f9db8b7e7c9ecfd67e659d21cc07e43d80842700a328a82785396"}},{"ruleId":"D1","level":"warning","message":{"text":"_Results.build (cyclomatic 24): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/discover_page.dart"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad75c0ac49b3b77389aa94aac977a3d0cab1f46cd514a563bf69860ab4f9a56"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeComingUpModule.build (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/coming_up_module.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6566a811246d1872c96cb4907ef4f95339db446225e2255718e4b7ee66e41075"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadRow.build (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/downloads_module.dart"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"464b346081c2726bdf4444b772f7314208772b439934a924f8c50e548b9cebdf"}},{"ruleId":"D1","level":"warning","message":{"text":"_MediaPageState._manage (cyclomatic 24): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc08ac4599c20842b64787fe359804b56d4263abcf69ea7c8052e396642ab57"}},{"ruleId":"D1","level":"warning","message":{"text":"_ProwlarrLibraryScreenState.build (cyclomatic 24): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_library_screen.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ef82aa0a43d8dce1fb9e94ff960058d69a5145cbc3dda2ff4cc6df34113568"}},{"ruleId":"D1","level":"warning","message":{"text":"_ServiceMatrixCellBody.build (cyclomatic 24): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36ff7b8f6a8c3f2b8175502f639bf041af90d08735c0f49698a9aa04462a6ca"}},{"ruleId":"D1","level":"warning","message":{"text":"_CellRow.build (cyclomatic 24): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6ff557f779d9435af133c6086ed6b509e920d0e36418a049eb22e8efdb1a40"}},{"ruleId":"D1","level":"warning","message":{"text":"_ShellScreenState.build (cyclomatic 24): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/shell_screen.dart"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"41080de7f0064ba8aee18ad7db0edd0490737a67ec202489d0593628099c9da9"}},{"ruleId":"D1","level":"warning","message":{"text":"_PressableScaleState.build (cyclomatic 23): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/pressable_scale.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c48d660ab47754b9b795a5b0a26d92963a812c28cfe3f77f34bd33cd614a64"}},{"ruleId":"D1","level":"warning","message":{"text":"_FaultCardState.build (cyclomatic 23): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/fault_card.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"50afdbea2ed171903f6213a8a3763c82cdbc00453960a349ca91b27b0c1bca26"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogQuery.parameters (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/catalog_query.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e200bb021e1a8c107f2bc534a104d3839ebed0d63104612c41b26f6357296d05"}},{"ruleId":"D1","level":"warning","message":{"text":"_CalendarBandState.build (cyclomatic 23): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_band.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c400098d1ecd4a986d92019c464c9d802c7d0f49ac70a22aa35e91aadd50861"}},{"ruleId":"D1","level":"warning","message":{"text":"_BlockedImportNeedYouRowState.build (cyclomatic 23): _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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7846ebb5ee851936727967b7c6c9c8e6db841f279e1c8bef878cced4df5f669a"}},{"ruleId":"D1","level":"warning","message":{"text":"_ManualImportReviewScreenState._buildRows (cyclomatic 23): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e22d9e663cc3d4a892bc08e857276aae768a656f241e1c6cd36eb5a5f9f4825"}},{"ruleId":"D1","level":"warning","message":{"text":"_ServerRow._reading (cyclomatic 23): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98f9ff45d200f933eae58bb7fc0a0c954f93db11c232b40e070fea5667a803a"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrQueueEntry._resolve (cyclomatic 22): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/status/arr_queue_snapshot.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"218e6cae5375f1bb1d1f93ef11945862487d0c943d44e05df10b3b3a28892960"}},{"ruleId":"D1","level":"warning","message":{"text":"_MediaBrowseScaffoldState._perform (cyclomatic 22): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ce4e94e9f9cd47b883031602da87fd2f170f1196dad67ad94ffb2555e2fa94"}},{"ruleId":"D1","level":"warning","message":{"text":"_Commands.build (cyclomatic 22): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/download_page.dart"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d24ef9eb1552762fa9b9311f4fd0f7233e486099f9e9f3f95b32b7ed8f3836"}},{"ruleId":"D1","level":"warning","message":{"text":"_Report.build (cyclomatic 22): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/import_done_card.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"834c49f56b996f4a313822686626405a184740e1dfa1c6a4279103efe98a63b5"}},{"ruleId":"D1","level":"warning","message":{"text":"CollectionTally.build (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/collection_tally.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ae4f86b1a73b01be043f993a0a3ca69bae2e6ec68a0c85b72bfe88703500be"}},{"ruleId":"D1","level":"warning","message":{"text":"_MediaEpisodeSheetState.build (cyclomatic 22): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episode_sheet.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbebfc6a310d4176b4fc1c5b861b93591260f7b96a41a75e55c966647307c073"}},{"ruleId":"D1","level":"warning","message":{"text":"_MusicFindLibraryState.build (cyclomatic 22): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/music_find.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f0c39f293c26bb7df007b4e4a7f8781fe6bb5bb01cd9343a615f71e8703b7e"}},{"ruleId":"D1","level":"warning","message":{"text":"_OnboardingWalkState._form (cyclomatic 22): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"348baca173e97a7bc36c4fc83dc3971d6763e926f5739fc92cbf58920a4af0a4"}},{"ruleId":"D1","level":"warning","message":{"text":"_RequestsBoardState.build (cyclomatic 21): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/requests_board.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19842c09f41bd375ed973654b7a7b1de8e30b5d721ced8d4aecd32f87f55968"}},{"ruleId":"D1","level":"warning","message":{"text":"_Day.build (cyclomatic 21): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_month_grid.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbad7a57ff2a10cb0f58a65c3542fcce08dba94d4c7d76ae6a7a3d17554bfdf"}},{"ruleId":"D1","level":"warning","message":{"text":"PlexClient.lookupByExternalId (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d03f1decd508abcd124a0a5be7683a4af2a9dfb54cdb9ccf477a1973f839e5"}},{"ruleId":"D1","level":"warning","message":{"text":"PlexTranscodeSession.reasons (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/domain/models/plex_transcode_session.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a622f5e78e8105b55eab05167d3f4b3a8ef284867a79660dce769638dae53aaf"}},{"ruleId":"D1","level":"warning","message":{"text":"_ArrTabScreenState._content (cyclomatic 20): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/arr_tab_screen.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d82bcfc7f34e29e83c822fe10b59c470038b6faa4868ebe5803a1d24ec7fe89"}},{"ruleId":"D1","level":"warning","message":{"text":"_DayPanel.build (cyclomatic 20): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/calendar_page.dart"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"904b80f8a89fcbd978a62bc6312ccd70bac47c932596471aa6f538d7caeabed0"}},{"ruleId":"D1","level":"warning","message":{"text":"CalendarWeekStrip._day (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_week_strip.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66c0f4a3e94194e7a9956dd717ac24e920294afebbabb0c69199d8c0a3c4794"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeRequestsModule.build (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/requests_module.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fc153da37d57feccdfe970cfa633467ad2f2e03cc2a131f6aac62fba90ebae"}},{"ruleId":"D1","level":"warning","message":{"text":"ManualImportFlowNotifier.startBlocked (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5a82e7f5ff6c73fc62a4a54ea95ff0632ddbdc5d78fe10624e2ef48f9b5ae4"}},{"ruleId":"D1","level":"warning","message":{"text":"MediaBrowserClient.getRecentlyWatched (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf70e95f5edf9cba540909a734ba77ebe9013c0f64e3cddf5392ac7a51dcc0a7"}},{"ruleId":"D1","level":"warning","message":{"text":"_IndexerFormState.build (cyclomatic 20): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c3ea8805517d8940cc9c6a015dfacf681f4d8270e1455fd8b4fd56df550e0f"}},{"ruleId":"D1","level":"warning","message":{"text":"_AddTorrentFormState.build (cyclomatic 20): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d7eeee9a084fb0aed4f0556cee2ef8afe772014f81e5b510009607162c56d6"}},{"ruleId":"D1","level":"warning","message":{"text":"_ServiceSettingsScreenState._testConnection (cyclomatic 20): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bef5783f0a697131f182d1d91f9ddaa88394045a348c09ffb6975b5245a03fe"}},{"ruleId":"D1","level":"warning","message":{"text":"gallery.markdown (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_system/gallery.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e2ed903a0069b0925fb4e083bf875f28bbd595997898566a697c5c62da8c76"}},{"ruleId":"D1","level":"warning","message":{"text":"_ActivityNeedsYouPageState.build (cyclomatic 19): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_needs_you_page.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6b124aae82bfd3411921c491add9fefcc849271a32c7f4a377b17892f41502"}},{"ruleId":"D1","level":"warning","message":{"text":"DockgeClient._connect (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/data/dockge_client.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37b8a87823abbb81f45b6305c2c91d662a4b1696d29c1451455cbb9ddc30c40"}},{"ruleId":"D1","level":"warning","message":{"text":"_BlockedImportNeedYouRowState._episodeChoice (cyclomatic 19): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69ee082e04aab705ad9b11d36b632f4fe4b9c18176638612b58303cb8165858"}},{"ruleId":"D1","level":"warning","message":{"text":"MediaIdentity.of (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_identity.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aeff363e38fa877c98afe9e1a5b34b3bdddd3039ccfb283e18a3e8a86419158"}},{"ruleId":"D1","level":"warning","message":{"text":"_OnboardingScreenState.build (cyclomatic 19): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7abbacedfaec70a1a804869ad7979d3882004a084f4ddcd04b7d6326ce7515b"}},{"ruleId":"D1","level":"warning","message":{"text":"_Outcome.build (cyclomatic 19): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1ed63127a3e402f31f796a8e1c6c7a209c39502a06cc5ed03d7a866b27eee0"}},{"ruleId":"D1","level":"warning","message":{"text":"ProwlarrIndexerTile.build (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"23825822a787cad391d0eebbec92fc0df0059f75604c7203b96f7e0d625a90c2"}},{"ruleId":"D1","level":"warning","message":{"text":"_ProviderFormState.build (cyclomatic 19): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4870f665f31bc1425f329494c18b147e875189875492134ce48b29748bf5af"}},{"ruleId":"D1","level":"warning","message":{"text":"RequesterRequestRow.build (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/requests/presentation/widgets/requester_request_row.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"957959ba245ba6472595fc0a0baf66e689e52115070efbef9ff99bdc95974c15"}},{"ruleId":"D1","level":"warning","message":{"text":"_TracearrViolationScreenState._write (cyclomatic 19): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_violation_screen.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"626037cb41091aede2e7be07f208a5eb076769a485c843a9e095bc26c980a03d"}},{"ruleId":"D1","level":"warning","message":{"text":"OutsideDownloadsKt.statSmall (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideDownloads.kt"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c45dd55f83b9e5470c4fc447fe5adf36a9d7dbb344d13d8f8127b199c7e353"}},{"ruleId":"D1","level":"warning","message":{"text":"PersonShelf.of (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/person_shelf.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7af50579672afbba6b90193f027b4164209c9d8fca74373bebf321a537b96bb"}},{"ruleId":"D1","level":"warning","message":{"text":"_DayCell.build (cyclomatic 18): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_band.dart"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba9e023dd6dfe50d33ac29c7edb31aa12c48ff82c92fb0a0361e9e226c5a369"}},{"ruleId":"D1","level":"warning","message":{"text":"_MusicFindLidarrState.build (cyclomatic 18): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/music_find.dart"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2be15e5b210cda1c98bfd6dacab4472cff197b003557fc6fba049f6f503914d"}},{"ruleId":"D1","level":"warning","message":{"text":"_OnboardingScreenState._save (cyclomatic 18): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b3e7560a64eee3db3633a7e268d2fa0d2891c3281a770413ede0e7baa38c8a"}},{"ruleId":"D1","level":"warning","message":{"text":"DecisionRow.build (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/dashboard_sections.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3482ca837647b4fb0b7048d5a21ad00a29177ddde44d28475231ac589c4540"}},{"ruleId":"D1","level":"warning","message":{"text":"_ServiceSettingsScreenState._buildTestResult (cyclomatic 18): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"af31b1e6f3012f4bb6107bf9e027eb8f8d906624c407805fe8fdbb8f67f111aa"}},{"ruleId":"D1","level":"warning","message":{"text":"_MediaBrowseIndexState.build (cyclomatic 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_index.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b67b4e29a4db1b3854cf45e49e290f40dfeb624b71945f7adf1f49bc9f83f9"}},{"ruleId":"D1","level":"warning","message":{"text":"ServiceOfflineState.build (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_offline_state.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fdebaf3f3108848268c1438d28851e7c5690e43fc03f3b0c95c3be3e417d5d"}},{"ruleId":"D1","level":"warning","message":{"text":"_PersonPageState.build (cyclomatic 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/person_page.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be3bb5d80160c6c3776a1e85ec5c7690c1dbe7040073d9b031cc15e8b8ab1f9"}},{"ruleId":"D1","level":"warning","message":{"text":"_ManualImportReviewScreenState._matchedRows (cyclomatic 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5100eb1f26ad7356cbc09a0fde5e0e52638a9929e826e12b0f9c14395463c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"MediaSeriesManage.build (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_series_manage.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ec40c4a86518fa2b955192447832805a964db7dcdffd13f90a7f99ed47121f"}},{"ruleId":"D1","level":"warning","message":{"text":"_ReportProblemSheetState._submit (cyclomatic 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/report_problem_sheet.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"18161287dd1df4667bc294326c38ef81448dbc0b6272dcb0112e2d58108dabca"}},{"ruleId":"D1","level":"warning","message":{"text":"AlbumTracks.build (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d0d19d9113fee9e9ad84a6670cde145453ecef667b78a4a333a3336bcdf475"}},{"ruleId":"D1","level":"warning","message":{"text":"_OnboardingScreenState._runTest (cyclomatic 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c2191be07884f4e570a12e768ab721b83e001a7bad9d688f477dda9daef23e"}},{"ruleId":"D1","level":"warning","message":{"text":"_OnboardingFieldState._build (cyclomatic 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_parts.dart"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"929114830acfd1a3c5bb22990267ff107f8e4aa26473ebfd6389581638aaaf4a"}},{"ruleId":"D1","level":"warning","message":{"text":"ProwlarrFieldInput.build (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_field_inputs.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dbd602e30bad044a841bd7bbd020281a3a5ce68fa878329d0272ad7b48ca6e"}},{"ruleId":"D1","level":"warning","message":{"text":"ServiceConnectionRow.build (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/service_connection_row.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad14c7940a6bc0079f772b9e2f200b6ee6047345b03b819943240272dff4a2ae"}},{"ruleId":"D1","level":"warning","message":{"text":"gallery.build (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_system/gallery.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9982195a1d812a293c397b0cce5a396b4357730c9b841e008653aa8196e928f9"}},{"ruleId":"D1","level":"warning","message":{"text":"StoredImage.fromJson (cyclomatic 16): 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 \u2014 the same kind of value, with no behaviour of its own \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/last_known/stored_image.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d32ae7e6e7841ba1761fe39e9a3073431abde7c8ce394c33bcb1ab7bfd65fba"}},{"ruleId":"D1","level":"warning","message":{"text":"SameOriginRedirectInterceptor.onResponse (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/redirect_guard.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e44c2bb39ad032285b92fa94071638664874ffd7042d1c18222786991a87df5"}},{"ruleId":"D1","level":"warning","message":{"text":"_EveryonesRequestsSection.build (cyclomatic 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cdb510b7b6939e9de6e2844c7429f2fba4752a8e4aae243599a2f7a518ef09"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadReadout.build (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/download_parts.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"06547c7a42459ade3fd5d254ba9781f250019b26d9f9c08d09c485b67deb5c7d"}},{"ruleId":"D1","level":"warning","message":{"text":"_RequestsBoardState._delete (cyclomatic 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/requests_board.dart"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae50677757f4b7e9ba9f231471833769157152c011d91dd55eb48b2ce7f762eb"}},{"ruleId":"D1","level":"warning","message":{"text":"BazarrMovieDetailScreen.build (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"155c5b4ef7d4c1fd3cb99eb9af9336255797801f2ed8827da18c4c694af998a1"}},{"ruleId":"D1","level":"warning","message":{"text":"BazarrSeriesDetailScreen.build (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_series_detail_screen.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f30ce0b0a176e8dff16ff3ab77be456be0dd0bc252304a943ac14d30081e8d"}},{"ruleId":"D1","level":"warning","message":{"text":"_DiscoverPageState.build (cyclomatic 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/discover_page.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6626e00dcb7c6cf55b54b56e9c25f2c78fd3feb88a04dd4468163ef65160839"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeArrivedModule.build (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/arrived_module.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6e652a5c8828ff34a136e4efbb4069d7cef4b9a5cec63ac49b5717e9ef0986"}},{"ruleId":"D1","level":"warning","message":{"text":"ManualImportFlowNotifier._refreshSelectedFolderItems (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"245b9bf38c879898e89790d97af1f5fe17804470d1ec8d552ee0d7d003991a76"}},{"ruleId":"D1","level":"warning","message":{"text":"_ArrBulkProfileSheetState.build (cyclomatic 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/arr_bulk.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dd81b9b0bff792f62384c70b767640fc9d9dd8aaf6f0b5522266f5870a5310"}},{"ruleId":"D1","level":"warning","message":{"text":"OutsideSaid.fromJson (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/domain/outside_notices.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"373c6f8d9418636e8234caf4d458203d01602777bc7605fcf6cf9d27dbe50a5b"}},{"ruleId":"D1","level":"warning","message":{"text":"_SidebarItemState.build (cyclomatic 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/desktop_nav_rail.dart"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ec18f6c14f694b4a2d74c3e7147f5c33df73012f3f22fdd87fb2088f8708e5"}},{"ruleId":"D1","level":"warning","message":{"text":"TracearrSessionBody.build (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_session_sheet.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a15a4226d4ec4217595d6ce267dd5da7142919e69674b5d1b92785a46c2fe7b"}},{"ruleId":"D1","level":"warning","message":{"text":"_Body.build (cyclomatic 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_violation_screen.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"975459d2b98702f03151ce56e40dfda014de7cc76d26c0199eb738c3e0a918e3"}},{"ruleId":"D1","level":"warning","message":{"text":"_LineChartPainter.paint (cyclomatic 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/widgets/charts/line_area_chart.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b2ebaf35e94d12476e54325d4c3073c35ab2a267bea87335b9124724425d09"}},{"ruleId":"D1","level":"warning","message":{"text":"UnraidDockerContainer._parse (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/domain/models/unraid_models.dart"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"530367016dc30ef9faae57c5e7aaae24a1cbf5090de0afa3c6b23398ec4cf53a"}},{"ruleId":"D1","level":"warning","message":{"text":"preview.html.show (cyclomatic 16): 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/StatusBadgeAnimated/preview.html"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"45852bd63b2418496e0c35cb362441d1b7533663f90236ade6a984fe51b59365"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaPageState.build (cognitive 129): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b3bc8fa2ca5d6132a2c50f2e030ab60ba93ff05c36d13c4441047fe32651e8"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestBottomSheet.build (cognitive 81): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/request_bottom_sheet.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd34562603d63bc9821fe7cea6e17a8f5958081c7681418e94945a90dcd80a3"}},{"ruleId":"D2","level":"warning","message":{"text":"_ArtistPageState.build (cognitive 74): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2ce767f52610f83b5203b1ddd5128b7e7b4d35fde36742498c099636f6050a"}},{"ruleId":"D2","level":"warning","message":{"text":"board.main (cognitive 68): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_system/board.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bc12ee5284baa010197879bada76ee7cd7ac6579e801d70fc51a33c99df154"}},{"ruleId":"D2","level":"warning","message":{"text":"_CalendarPageState.build (cognitive 56): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/calendar_page.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d039aa658e0c67e2d22ca1129d5224c8170398561953bff5c63eaa149da8250"}},{"ruleId":"D2","level":"warning","message":{"text":"_LeadBar.build (cognitive 53): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acb1a4bac3a808c3cef212cbc115e933ee620e99cce4ac0ebad55841310c3e4"}},{"ruleId":"D2","level":"warning","message":{"text":"_NeedsYouSectionState.build (cognitive 51): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91c7a81daf0f66a27f5a950f20a58ec5f8c9a050abcce824716eb947db7ca89"}},{"ruleId":"D2","level":"warning","message":{"text":"_Scope._parseTypography (cognitive 49): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_tokens/generate.dart"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f0f06fc1a3132357499de71370543f6726c7110abc4b6b12236de2fb59c49b"}},{"ruleId":"D2","level":"warning","message":{"text":"_Results.build (cognitive 48): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/discover_page.dart"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecca37b18b7bd2897d8ee2483856c6a17e2bd7e7e6635fda882882a29c6e9ba"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaIdentity.of (cognitive 48): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_identity.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"247a0345a57504c3bcca1af879ca223c3123b427fd80b5824381c2ad27d75b92"}},{"ruleId":"D2","level":"warning","message":{"text":"CalendarEvent.spoken (cognitive 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/library_calendar.dart"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf781894c949e799d8b267b2459340decdab13e4352ca174abc51c51cba4f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"_BlockedImportReviewPageState._content (cognitive 45): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_review_page.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"063700a840c5c4764f404704755041c4a0947887fbe27197768f93cd56fa50a6"}},{"ruleId":"D2","level":"warning","message":{"text":"_MatchSheetState._partStep (cognitive 44): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_fix_sheet.dart"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdd9046ed541b336f81fa283896c8c286a60b4f658371dabc56db28c3ee5600"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaBrowserClient.getRecentlyWatched (cognitive 44): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9c61e75df562e9be13ed725cbab2be01afad9d11c6d4a65bcd683da9168851"}},{"ruleId":"D2","level":"warning","message":{"text":"_SeerrIssueThreadScreenState._thread (cognitive 44): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/seerr_issue_thread_screen.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cf50cb28d97568af14be1a54b0733618d73eca1df1622b99498c17f09822e4"}},{"ruleId":"D2","level":"warning","message":{"text":"_DayPanel.build (cognitive 43): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/calendar_page.dart"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"959abad3d8d336e872c1b1b7ae5b2baebe946045de6502985120089934cddcea"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaEpisodesGraphSheetState.build (cognitive 42): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episodes_graph.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5380c39f81f3b9ccdd69a1075c93054957501984c82ef73b1baa7bbf88b4e96f"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaPageState._manage (cognitive 42): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b10e3c7fd40a53165d0692c18a6f89c85fb97e87ac057a8aec1514ce92ec33"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityDownloadRow.build (cognitive 41): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_download_row.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca964d739bc416187d7922b27145f0840a13bfbd8ba2ff39b3f5b372aaebe422"}},{"ruleId":"D2","level":"warning","message":{"text":"_Commands.build (cognitive 40): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/download_page.dart"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd9ffe3db22c6762511716a6bfcafdfc2e6f5af70934b60c06fb3c44e9eb00b"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeDownloadsModule.build (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/downloads_module.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c287576d11ad51515371b9226919caf5063e26a83635343144df5d0f804a6009"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsService._saveInstances (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed97a41190c883ff22997c3cc6f7878cbbf9eed2ce53cf47331ca6d906ec47e4"}},{"ruleId":"D2","level":"warning","message":{"text":"gallery.markdown (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_system/gallery.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"20110967bce02868e6ebbd253df80376c2639c9f3000399338eb31c36144a96b"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaBrowseScaffoldState.build (cognitive 39): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"976343ddf829abcf09064d1b28a82ae8f4990a7ee223ddea48c96021197935ab"}},{"ruleId":"D2","level":"warning","message":{"text":"_DayCell.build (cognitive 39): _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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_band.dart"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f792fce7a21bd32c51852d173e82c2a978eaad1c2165eaa9036f149fa2daeeb"}},{"ruleId":"D2","level":"warning","message":{"text":"_BlockedImportReviewPageState.build (cognitive 38): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_review_page.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0512b68213ba1e98b24adaf99b6665a37bcea6497fb265f16f8caf278bdbb75b"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaEpisodeSheetState.build (cognitive 38): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episode_sheet.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ee09e1781c5b7e5bc9bc7e05e57640de0caaab3386765616f04eb7219fffcc"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaAddSheetState.build (cognitive 37): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_add_sheet.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ac0cda11f3966474373f60d10bf6925c4ef1f052c19997d913dcd91c1ea56f"}},{"ruleId":"D2","level":"warning","message":{"text":"_AuthorPageState.build (cognitive 36): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/author_page.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6632a82c02631129fe7b54271051d6c0b22ae0a49f288f953ac4fbbbd97d434"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogTitleRow.build (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/catalog_title_row.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1e94b9d3c07b3ef311e092d2b5ff061c06a03bd7e6e268b76af0306a95748e"}},{"ruleId":"D2","level":"warning","message":{"text":"OutsideDownloadsKt.statSmall (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideDownloads.kt"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"660ee18252c811c331b61bc9b45a00fb5743e6fe3cbc211b1453cb7f77e1a12b"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServiceSettingsScreenState._buildScaffold (cognitive 34): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8b910731f86d50054547e2eb3311aebe4d9921dfe514d93b78d890791b143e"}},{"ruleId":"D2","level":"warning","message":{"text":"CalendarRow.build (cognitive 33): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_agenda.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4352fa453a4f6aabcbe5e7dd635300119910ceb2794249db8f9d6edd17ecceae"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeContinueWatchingModule.build (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/continue_watching_module.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a132022f0480111cb4fd12e08174519beef8044211f2a821fe97194fafcd1b13"}},{"ruleId":"D2","level":"warning","message":{"text":"ManualImportFlowNotifier.startBlocked (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bba0bc8f5b39fdebfd7575d8bc2aaff3d3453f8d1c14511f7e15348ce14461"}},{"ruleId":"D2","level":"warning","message":{"text":"_ProwlarrLibraryScreenState.build (cognitive 33): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_library_screen.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"732c9b2aa51f5c0bcd31e14b24916a66c1ee9622520127b8b73445b25162b16d"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadsSection.build (cognitive 32): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"879d42c33080c549ac54cc5c85efacb640cfba10d72bfde502dc3d2ed63513b6"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaSeriesManage._automaticSearches (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_series_manage.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c8cf92324bb046e24ce2ffd4d43e400fcace3eb20c29798862184b2487adbc"}},{"ruleId":"D2","level":"warning","message":{"text":"_ReportProblemSheetState._submit (cognitive 32): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/report_problem_sheet.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7196ddb89cafd74dc6384410a46e696e8b661d389417a91faaf597948d53a2"}},{"ruleId":"D2","level":"warning","message":{"text":"board.compose (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_system/board.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f1ebf2506d1cfec26028b241a0db8199b64dae3d68fe006f7fe542582e3eed"}},{"ruleId":"D2","level":"warning","message":{"text":"_AddTorrentFormState.build (cognitive 31): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8477b73839b9e36cf77456d61ca119733cfb9e12884348377cf532c6d3d22ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaBrowseScaffoldState._perform (cognitive 30): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b37df0675b5f533bada4868136b707f18c0ccf82fc5a214105b4d7265924293"}},{"ruleId":"D2","level":"warning","message":{"text":"_RowState.build (cognitive 30): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/download_table.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca377235d04452cb2caabaa6b81e0a5d999a611dcfd4f54c67d224243a3f893"}},{"ruleId":"D2","level":"warning","message":{"text":"_ShellScreenState.build (cognitive 30): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/shell_screen.dart"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec08ddaff2819b52dc63ba4439e7ada4d0907dfd788555549dbf7de3060a51d"}},{"ruleId":"D2","level":"warning","message":{"text":"_FaultCardState.build (cognitive 29): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/fault_card.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1a01003cc9e72c5e2d044e76e48bc87ff0854f180a499225116b8741ff130f"}},{"ruleId":"D2","level":"warning","message":{"text":"_CalendarBandState.build (cognitive 29): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_band.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaab5beeb9e7f9eed8b6202eb1cef6fd5c880811c8950a2508f27dfcbcb4ea78"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnboardingScreenState._save (cognitive 29): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"0367aa366918fd5c177f187aee3c5c2ea91ace3712db43aefe15f8112fb259bc"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnboardingWalkState._form (cognitive 29): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0c8bb277ccf0157b083fbf0be52fd97bc72d909ccb00618cacc54f186e3b5c"}},{"ruleId":"D2","level":"warning","message":{"text":"PairPackage.fromJson (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/domain/pair_package.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc2780537f1175fc8133223d6a211d4df2ebb7017ff284b189eca8e9329a7a7"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServiceSettingsScreenState._testConnection (cognitive 29): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d1313242d6db4c35e98df14bf901dd1ea1714ef3b9a484fc3352bb0c3077fb"}},{"ruleId":"D2","level":"warning","message":{"text":"_RequestsBoardState.build (cognitive 28): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/requests_board.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cc4958277b74cb6fcdd3168beb211b2851de98c0f265a8c0216625a98d9403"}},{"ruleId":"D2","level":"warning","message":{"text":"_ManualImportReviewScreenState._buildRows (cognitive 28): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa57732aefc9d2840f2d1157fece6cb15959eb01b7514c015da0c8797cfd8db8"}},{"ruleId":"D2","level":"warning","message":{"text":"OutsideSaid.fromJson (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/domain/outside_notices.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9659b3ead281fe240d4a85d31a6b8118715cff4636ef7d3af9db1a2df3f31662"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServiceSettingsScreenState.initState (cognitive 28): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f505c85ff4e5b4605c24cd687be214c4c9279c2907a62a44b2d074945b015a0"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaSeriesManage.build (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_series_manage.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d725b222c3e6c0dec7130fe03193955691ca54e831dde5bace3efa58a94236da"}},{"ruleId":"D2","level":"warning","message":{"text":"PlexClient.lookupByExternalId (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d75f624c81ea8d5f4578ee8280ed20fb82fd2fee203891299eda79093b306e"}},{"ruleId":"D2","level":"warning","message":{"text":"ServiceMatrixCell.build (cognitive 27): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac15f04d2382acb7fa2e4ef9d8ac55929fd042c394fd10db15306ccd67908715"}},{"ruleId":"D2","level":"warning","message":{"text":"_DesktopShellState.build (cognitive 27): _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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/desktop_shell.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afc0da2bb0c7abda6a6033b21f6e5fa1afe6cc0f66e6b4907bdbaf67ad42d69"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityActions.approveRequest (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_actions.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"436685bd5c2e5754d8949ac7f7bd0ac0fc2a1fedcac55f0822a65d1e2e6299e6"}},{"ruleId":"D2","level":"warning","message":{"text":"CollectionTally.build (cognitive 26): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/collection_tally.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9ed7fd52986cec59ffe745dc0f2246b80b61ad2ca6322b559386d7623582f5"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadRow.build (cognitive 26): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/downloads_module.dart"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f7e33af3ab6ab50f0762a5f782e8edc8d1b3c11b43decd14d5cf4f6e928ed6"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchedFileRow.build (cognitive 26): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_rows.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9536accfe31b43be44c0c6d391739ca8ae97dd3c9390c85f06140bacd3b44825"}},{"ruleId":"D2","level":"warning","message":{"text":"_CellRow.build (cognitive 26): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c256740b7496a0bc6890b54e99b2073b949baad4c02dfa42431beb81c5b83ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"TrueNasWsClient.callJob (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/data/truenas_ws_client.dart"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc73553074bd15951d88a27207b9b466e38211d63e934a0c26e3bddfd07a6bf0"}},{"ruleId":"D2","level":"warning","message":{"text":"_LineChartPainter.paint (cognitive 26): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/widgets/charts/line_area_chart.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccefa1a1554c41a7d71b56a9e3adc3775d559b358aa91782162ded38d4ea519"}},{"ruleId":"D2","level":"warning","message":{"text":"DockgeClient._connect (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/data/dockge_client.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c41ada4380059805a440af9b4418fcfb9589b0f85d39e94c960dadc6bcfd5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeComingUpModule.build (cognitive 25): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/coming_up_module.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"702ba6c7c2e7ad9ca93f0062d0e1164cb393c746e865182853bf5b35b88827e8"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeRequestsModule.build (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/requests_module.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1815d7586f9b7d05dbcfdb627891f4fbcf642bc46ea1102dcada8b165b082e8d"}},{"ruleId":"D2","level":"warning","message":{"text":"AlbumTracks.build (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc902e90239558eb9e0d79ec40aaaa8534258be51250856627446af2622f4db"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnboardingScreenState.build (cognitive 25): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b273b7335861caf67812663c23b4005697c48b744d823f413fc2d3edfeb3f1"}},{"ruleId":"D2","level":"warning","message":{"text":"PlexClient._resolvePlexGuid (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7801e96375051f6684aa36bff083db72afe9fc95fc7493bde240304c11dda3"}},{"ruleId":"D2","level":"warning","message":{"text":"PlexClient.getRecentlyWatched (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"05102d1cb1e8f6d9307deac384033f60234ae72b73af050bcec6a35a880dff35"}},{"ruleId":"D2","level":"warning","message":{"text":"gallery.build (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_system/gallery.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7885eb07e90cb5e7ffb98d9a447020b64e7c6d31b90e031667e7fa13f45606"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrActivityMixin._fetchAllPages (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/base_arr_service.dart"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f749e2ebd06959e1ddd48e6bf3902cc2fe0269dffd32ba1ffab891772b3040"}},{"ruleId":"D2","level":"warning","message":{"text":"_RequestsBoardState._delete (cognitive 24): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/requests_board.dart"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b866f44b3133847b6f92a3ce5d6fe8b6b5d097695886e0f5ef3e437ba74ed118"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestFormNotifier._loadProfiles (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/request_form_provider.dart"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa6745a0b10451906e3d14b55d3062d0aa3695008d9bc4f71aa5a1b47530d27"}},{"ruleId":"D2","level":"warning","message":{"text":"_ManualImportReviewScreenState._matchedRows (cognitive 24): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9ebed1c117c66d4c940aaeaadb920bb168d92f08ac0fb629a36b4b5d056c27"}},{"ruleId":"D2","level":"warning","message":{"text":"TracearrSessionBody.build (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_session_sheet.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd6351316732253d93d5e45b48e3c9934a2c9e7191d5e5f3e4455a5d9261c75"}},{"ruleId":"D2","level":"warning","message":{"text":"_ReelCommandButtonState._run (cognitive 23): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/reel_command_button.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"58df53e9a06cf9199435b0205c91767f73cd945617ce27d1875e16e32704bbf4"}},{"ruleId":"D2","level":"warning","message":{"text":"_Day.build (cognitive 23): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_month_grid.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"56903d661ce5618c5fa22f57e1f09ea23a39d700c7d9a6d3ef770c2d9638f3c4"}},{"ruleId":"D2","level":"warning","message":{"text":"_SeerrIssueThreadScreenState._write (cognitive 23): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/seerr_issue_thread_screen.dart"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e306845381b78cc2145070c7094498ad66fb8a9d929757397f185daa3b71036"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnboardingScreenState.initState (cognitive 23): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c5c6059606e0f58120508f62be517994c1a270ef17b816c3fbcd22e411e016"}},{"ruleId":"D2","level":"warning","message":{"text":"PlexTranscodeSession.reasons (cognitive 23): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/domain/models/plex_transcode_session.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55db1684c458b5004b1421141272ef2a247c5396a626e97276bd5552ea0a176"}},{"ruleId":"D2","level":"warning","message":{"text":"_PressableScaleState.build (cognitive 22): _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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/pressable_scale.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"58107beb938cfb79189537bb025c255e69a04e05c4a6d865660bbdd13777f3ab"}},{"ruleId":"D2","level":"warning","message":{"text":"_Heading.build (cognitive 22): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_needs_you_page.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d29c9f9a53ada994a64f8525b788ff57dfc34d6d98609da9a3ed97575d3fede"}},{"ruleId":"D2","level":"warning","message":{"text":"_Head.build (cognitive 22): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/calendar_page.dart"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"31077321ccb701a36356c5bf0d808243f16734dfd2b8e0957caf13324de247ac"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchRow.build (cognitive 22): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/search_row.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c27c9b96ef2eddefb341a5896ca52b87e230a26205de89218a6e7d231468603"}},{"ruleId":"D2","level":"warning","message":{"text":"ManualImportFlowNotifier._replacedQualities (cognitive 22): 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 \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"866b3f689b0cf0c8ecfeefe9f398196fe4c35f44e0a4a531fcc0e396188e130a"}},{"ruleId":"D2","level":"warning","message":{"text":"PairPlan.of (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/domain/pair_plan.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bf07fb3a5177f5a30a979f6a652328bd1d3179fa7e61c56f137f1e1756c5bc"}},{"ruleId":"D2","level":"warning","message":{"text":"ProwlarrFieldInput.build (cognitive 22): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_field_inputs.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3594f947cfbf4024cfd467a5975a545c08e41687c89c0605c52d5b228a234234"}},{"ruleId":"D2","level":"warning","message":{"text":"SabnzbdClient._call (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/sabnzbd/data/sabnzbd_client.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a526ee986a6d1b62f403e8a3922d931088845e35a843935645b31d3a241a223b"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsService.migrateFromPlaintext (cognitive 22): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"628d8959d707c2b45912d3927ebec675ffe79518b69689baf8124f7ff0d39dd0"}},{"ruleId":"D2","level":"warning","message":{"text":"_RingFrame.resolve (cognitive 21): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_ring.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef9711ef3fa36752d120ae6ab2ba9127add1039c68c02b4fa03d830212e733f"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityBlocklistPage.build (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_blocklist_page.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"066e09d6f47221b3e8bef891a3d8ce619bb6507ba1bc085929aafacc64e739ef"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrCalendarScreen.build (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/arr_calendar_screen.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1926e094606a6a22b8d0df69ebf5f465652b789cdc9d1ab6371417958f0066"}},{"ruleId":"D2","level":"warning","message":{"text":"_ArrTabScreenState._content (cognitive 21): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/arr_tab_screen.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9332fd2b24264fbf254c64e00dee6ea52df956d8b93abd6b2e9e12b6caa10da"}},{"ruleId":"D2","level":"warning","message":{"text":"_Report.build (cognitive 21): _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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/import_done_card.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c463db9f200a40bd8fd4f2802b2bdf7ca9141632a2cfc19483ab2afc8393d8a4"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogQuery.parameters (cognitive 21): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/catalog_query.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2bc93f120ee31b3a14c594eb9b37b19eee1befbeb48d350cf3e280f3988d22"}},{"ruleId":"D2","level":"warning","message":{"text":"_Kinds.build (cognitive 21): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/calendar_page.dart"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"076344a07f99bf0391a8388c464597671b41327fb95f167475cbccc14b037433"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestFormNotifier._readSeasons (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/request_form_provider.dart"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a25fb7f5a6b26e32821e3520125c970a12da092784efff1ec8903b0d6a2d1e3"}},{"ruleId":"D2","level":"warning","message":{"text":"_BlockedImportNeedYouRowState._episodeChoice (cognitive 21): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c20265c954fb4e3eddd97f25f995cd5e5b1f0fdab98e6cdc99a7d710f30d1f1"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicFindLidarrState.build (cognitive 21): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/music_find.dart"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7263fb0aca1b00d41f369f6d545e18db043dcb4a0f6ca5e69fcb9388dcdfe1"}},{"ruleId":"D2","level":"warning","message":{"text":"OutsideShelf.keepPictures (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/data/outside_shelf.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ceca8da0911197582b008e80ad875ccffe79def2a10c47fdf35bd028dcf5b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"ProwlarrIndexerTile.build (cognitive 21): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4ca2aa85af2a30202c3b7d5872e555fd45d03c348483f56be3190241b983c8"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsService._readRoster (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd3fdfee5e177081b764c86a3165473aabffd4b00daa2a64c2d66298cf9c828"}},{"ruleId":"D2","level":"warning","message":{"text":"_GlanceTileState.build (cognitive 21): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/in_flight_glance.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad28b43467555ccac734942c3fc65fdfd6ca43d6a90072ac2f1d4bc3a1391b6"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaBrowseIndexState.build (cognitive 20): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_index.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"22449eb4ed2d6ca34d075cf1757b32b88f88c6981a9e982d3b10f6b4e18ce42c"}},{"ruleId":"D2","level":"warning","message":{"text":"PersonShelf.of (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/person_shelf.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"52371ef382589b832bcfd8140ed12ab0cd2887d419da25c790c0b192c9ec94c6"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeArrivedModule.build (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/arrived_module.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62bdbdda1e278de25d2f2299ee8ee487aa904a02ad89d7c8402e432a5efc460"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServerRow._reading (cognitive 20): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f99b8b878af15e6d15a4fd644244250e9f31cfaf10461310db68d0113643d08"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnboardingFieldState._build (cognitive 20): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_parts.dart"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"8799aa23d439dc524ea11c4cfb9ba05a10e36e619be0b991295c3390bdcbedee"}},{"ruleId":"D2","level":"warning","message":{"text":"_IndexerFormState.build (cognitive 20): _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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd92962c0765d21d664385ebc5830fb0b096b90fbdd6ca2c50249676f0573b3"}},{"ruleId":"D2","level":"warning","message":{"text":"_ProviderFormState.build (cognitive 20): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"490aba90f9568b9f9a798046f281fa0bc9647a5a843af84268bbb1579464d3e6"}},{"ruleId":"D2","level":"warning","message":{"text":"_Body.build (cognitive 20): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_violation_screen.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cafd52cee2431994798fb66c9f73c050162452dc3099d7c8ee59d38cb732bf"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueueTile.build (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/download_queue_tile.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef6b085a5811fb4116e26cfd67dabfc4a94f658c4acded1942afc9d34afe92d"}},{"ruleId":"D2","level":"warning","message":{"text":"ServiceOfflineState.build (cognitive 19): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_offline_state.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f9b5cd3d78b66cd1ff53e8c48356c413b900e0def988d8f2b83f73903de44b"}},{"ruleId":"D2","level":"warning","message":{"text":"_ActivityNeedsYouPageState.build (cognitive 19): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_needs_you_page.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30b9c4f9bbb8ab5234cc2e065278a3a496f9ff643753fa88d9eedeea983a7dc"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivitySection.build (cognitive 19): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_section.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0c007dc8b9844370d4f799bebae3e10f87931326c82e7d57b6b5b3de80b8f6"}},{"ruleId":"D2","level":"warning","message":{"text":"_FaultRow.build (cognitive 19): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/fault_card.dart"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c156131b30662687f1b07027d7062b4f63ddc8a8c6f811492308723c476717"}},{"ruleId":"D2","level":"warning","message":{"text":"BazarrSeriesDetailScreen.build (cognitive 19): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_series_detail_screen.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4a4b1076392031e17294a8c1cf19f56ab8c39a24dd6fbe8a25d190af9b8981"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaPageState._toggleWatchlist (cognitive 19): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"8317a34de6f4cc0fe487e293414fb9d07da4bb626f1501dfa01e36d209a38185"}},{"ruleId":"D2","level":"warning","message":{"text":"LidarrService.addAlbum (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/data/lidarr_service.dart"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2008e043254a84884ac2e8f142e639f640437d313227ec537f01e1579b7a848"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicFindLibraryState.build (cognitive 19): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/music_find.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea26fafd229369dba5566183cd4769367e2c4c7b9062e92a9facbc1c953f93e"}},{"ruleId":"D2","level":"warning","message":{"text":"_Outcome.build (cognitive 19): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"da06631226e87cc06873d15748d9f30f65a5a9b2e4ea5b518abd81993e30a069"}},{"ruleId":"D2","level":"warning","message":{"text":"RequesterRequestRow.build (cognitive 19): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/requests/presentation/widgets/requester_request_row.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f29f62e813476af55ff495b6f56b944d2601ac2a69bfcf98caf0637088428c2"}},{"ruleId":"D2","level":"warning","message":{"text":"DecisionRow.build (cognitive 19): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/dashboard_sections.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8dd60889ecf4c169bcf4a5d0ff0e9dfff2267e7043477392d7271c86d7b39c"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServiceMatrixCellBody.build (cognitive 19): _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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7662d78cdd17c7b3d5875d34e17d1637db8b6126886af5dac632e3b06846026"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServiceSettingsScreenState._deriveSiblingLabels (cognitive 19): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f489a538a60e951c18fef88b3ab68699b5d6737dd093627ff28e6f740b9b4aa"}},{"ruleId":"D2","level":"warning","message":{"text":"SeerrSignInFlow.readServer (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"979435e0834f9759c8ce88e544eb8c3269a994926e05becb744d810d95d7a5a4"}},{"ruleId":"D2","level":"warning","message":{"text":"_TracearrViolationScreenState._write (cognitive 19): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_violation_screen.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced82024c164bfb870ac4ea8b8e2664dc7aea3e79d4af25ce3648710a6392652"}},{"ruleId":"D2","level":"warning","message":{"text":"TrueNasWsClient._connect (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/data/truenas_ws_client.dart"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b7402f9793f6093e5ca15beb857e3616d2b23b37f67767865dded9e146608c"}},{"ruleId":"D2","level":"warning","message":{"text":"TrueNasPool.fromJson (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/domain/models/pool.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"639ba73d18197349dad8961fe08c942524e3958ccf11073aeb4a3c9fc990997d"}},{"ruleId":"D2","level":"warning","message":{"text":"preview.html.show (cognitive 19): 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/StatusBadgeAnimated/preview.html"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5a9dbd4d79a17eada1a9a4926441c07e9d13749de1382e8b9b2e18eabacc3f"}},{"ruleId":"D2","level":"warning","message":{"text":"SameOriginRedirectInterceptor.onResponse (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/redirect_guard.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c021d84b53326c7bf5e883468a55d11b3a4cb84b700baf3d05aefe91817544b"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaDetailView._emitBody (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_detail_view.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2007c9b8466bab7ec5d087ed7e8dadb846b89cef408875e021f2657a3972df3c"}},{"ruleId":"D2","level":"warning","message":{"text":"_CollectionPageState.build (cognitive 18): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/collection_page.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1307624e7730cb4244b3e9954ce073ae2354a1f8bed0439af0abb30cc474d5a9"}},{"ruleId":"D2","level":"warning","message":{"text":"CalendarWeekStrip._day (cognitive 18): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_week_strip.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"10905db5a7099a88454233eeca802037b01db423db752aa4a35f4fefc5978d39"}},{"ruleId":"D2","level":"warning","message":{"text":"_BlockedImportNeedYouRowState.build (cognitive 18): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5da9a9a860d2724b5f2dd6a425aa306ae4522ced66fd103693d4b55f10de6a"}},{"ruleId":"D2","level":"warning","message":{"text":"ManualImportFlowNotifier._applyTargetPreselection (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"59213bb916ac778ba0cdd571badefb1dabea6207a301d9ae62d16e7b1fbb6794"}},{"ruleId":"D2","level":"warning","message":{"text":"ManualImportFlowNotifier._refreshSelectedFolderItems (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"01478a1d5696b78edb0505f7d99044ab833d2009a0bf664aa854f4f50f24b18a"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportStationBar.build (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_widgets.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a456e1aa11f7372651ca002d46a8a1d88a674d34e827acb1fbd95b317b0890e8"}},{"ruleId":"D2","level":"warning","message":{"text":"_Panel.build (cognitive 18): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_copy_panel_card.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda5e428bc516aef9663c97467ae2db861fa3e7c4739a950f7c5be2060d200fc"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaPageState._seerrManage (cognitive 18): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a52f72b5c88a7a3b85b097bd580bb52292d6e94aed770e27986c65bd88f7e66"}},{"ruleId":"D2","level":"warning","message":{"text":"_SeerrIssueThreadScreenState._deleteIssue (cognitive 18): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/seerr_issue_thread_screen.dart"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f8ff1fbe7f1a9f5d445931786ab4974922d23bdf1ab96f61c34ddb0fcf7678"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnboardingScreenState._runTest (cognitive 18): _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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"223c70beb9be30341ad3c4ee1ad53f7f676ff91b8399b018d783c08154c5f41f"}},{"ruleId":"D2","level":"warning","message":{"text":"_LimitsCard.build (cognitive 18): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/release_search_settings_screen.dart"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15f6c35683d2a1eb99131e1d3bacbf40a846b7fd5ebc493716a9c86e7391a4c"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServiceSettingsScreenState._buildHeader (cognitive 18): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0567d2782bac62c35a8f6d18e4e53c938234d3a227aaa4c9724740870453a74"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServiceSettingsScreenState._buildTestResult (cognitive 18): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc3393af6ca6a52b5cd5bbf1acb64ec6cf40674b4ff7e89a5b24bef92d2bb36"}},{"ruleId":"D2","level":"warning","message":{"text":"SeerrSignInFlow._checkQuickConnect (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"040536e736f3a929f2adbc5337399b46049303d180416316adf379e3998a6fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"SseParser.add (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/data/tracearr_events.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29827606125dc0a5cd037b6a01bd056d0f90e413633d7d291ca32385727075b"}},{"ruleId":"D2","level":"warning","message":{"text":"TransmissionClient.torrentsSynced (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/data/transmission_client.dart"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c186d03a173dde78e1d6bb0c0841be61957a39d187a6e90952f0551ae2cac53c"}},{"ruleId":"D2","level":"warning","message":{"text":"tokens_css.type_css (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_system/tokens_css.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"af47b49c63d3912f7c10626fdc03b2600f32c709c400d8a7040f6471b45c2588"}},{"ruleId":"D2","level":"warning","message":{"text":"_Scope._resolveUncached (cognitive 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_tokens/generate.dart"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"784e25545db4fedfa8a2c43479e169a806c316c3c17f5e108696178f02912206"}},{"ruleId":"D2","level":"warning","message":{"text":"StoredImage._pathUnder (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/last_known/stored_image.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e443d8d47b48b64dd565f5f7d483cc9edd74989eb172f5a4188806e000f0ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"_RenderFade.paint (cognitive 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/ambient_scaffold.dart"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30cf6236e829db9e6381cb902da487eafa3ded5366e09274eb2511640ea57f1"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaBrowseScaffoldState._browseEntries (cognitive 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"f819c1984872fff8701e52cb41b80a56b53997c85770e40358a82ac677378ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"BazarrMovieDetailScreen.build (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af845b0c669d6a0578e802e475204303fe64b866e51246b6981018627fa9edb"}},{"ruleId":"D2","level":"warning","message":{"text":"BazarrSubtitleLanguageWrap.build (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/widgets/bazarr_detail_sections.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf915be8e781fc35773f9b66ca48f6ebc9ca3fc70e58ee116ad31d72e3a1857"}},{"ruleId":"D2","level":"warning","message":{"text":"_PersonPageState.build (cognitive 17): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/person_page.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"182a414ac845c575bf37e9c2752aebc660b87f0741a46bc6ca42dd94fca65899"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeLayout._completed (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/domain/home_layout.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63dd308e9016ec92240cfdac182abdb7337daf4ad2670de9c443ed780ab1211"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaEpisodesState.build (cognitive 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_series_sections.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"314ce0fbdd5d33fb3854b96805bc594a42e582fa29ba28a23e719172f22249d4"}},{"ruleId":"D2","level":"warning","message":{"text":"_LidarrAddArtistSheetState.build (cognitive 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_add_artist_sheet.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0cc22da449d23b5f9cb26d892ae7b71acaab6c7b199059d2adad3cb370cb41"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicHitRowState._monitor (cognitive 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/music_hit_row.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9654a9a1d857a12a59322452ec04df5225155d64d5cff7164dbdde7e94df978"}},{"ruleId":"D2","level":"warning","message":{"text":"NzbgetClient._call (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/data/nzbget_client.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac29b2b35df49746f46451b015af7126dc0abf8f1aa8f83f17e400537db07ac"}},{"ruleId":"D2","level":"warning","message":{"text":"_PairReceiveScreenState._preview (cognitive 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/presentation/pair_receive_screen.dart"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"70793969e2df96645d1db28dd6de65789a120b27f169a21e88a7e3b43e01ef69"}},{"ruleId":"D2","level":"warning","message":{"text":"TorrentSortRow.build (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"514f64198541c39c744a60bce15e479e0e377a54ec8039934721f671722edb79"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadNamer.name (cognitive 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/services_queue.dart"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e125191f9b5bca00d5fec4a6ca030e121b37a085892a050e9f9d5f9a8af681"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamNowPlayingSection._togglePause (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/widgets/stream_now_playing_section.dart"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"95be4fafb5f3e79ed185b0b08feed827ca63f06bbdbf02a29abb232191694a3f"}},{"ruleId":"D2","level":"warning","message":{"text":"preview.html.plan (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/ReelLine/preview.html"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"93823deeee2722e473e8de9efe81eed231ebc46cc43fa62ded97c7ab84645d5d"}},{"ruleId":"D2","level":"warning","message":{"text":"repo.services (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/src/lib/repo.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ad065f79c86619e830b73187290c3b92aabba774ad1f65b7c5541bb036b892"}},{"ruleId":"D2","level":"warning","message":{"text":"_InteractiveSearchSheetState._handleGrab (cognitive 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/interactive_search_sheet.dart"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa97a63eee3200d355a7e150786f22e4d2d09e08f67843215f9428bc5deb68a1"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaBrowseScaffoldState._tapAction (cognitive 16): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"19aa7875134edc3cbb594c2fdb0543cf10ab135aaa137ed221bf3dc665d15fb8"}},{"ruleId":"D2","level":"warning","message":{"text":"PageTabs.build (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/page_tabs.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e24e95aea875288659b1c26ffd20085fbac112a6b564ba290523ce79d59738"}},{"ruleId":"D2","level":"warning","message":{"text":"_Readout.build (cognitive 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee01b5f5d8ccacdb5f196d644e1577e450df84d5db96243ff9c639ffa4a11fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"_EveryonesRequestsSection.build (cognitive 16): _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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"942e6d369c364ee57084b47f6cf89f3c3605e6baa241459f892a44af0d4ff6f7"}},{"ruleId":"D2","level":"warning","message":{"text":"BazarrService.getWantedEpisodesForSeries (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/data/bazarr_service.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f483630b81470d28ba28be45d8eb9107f9ad51c533a2a221ad5063d46a40e9"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestFormNotifier._loadServers (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/request_form_provider.dart"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bb93b66473128491b33f46c34c2e7e8cbe9514d563c1b11b659e0dccec9574"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbyDialect.tokenUserAsViewer (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/emby/data/emby_dialect.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fa0584ceaa5d8cff1b468e36fceac3f9337f5a7ffe2c15aa4e478cce263cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeNowPlayingModule.build (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/now_playing_module.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e152a6050f5cf9dd87d1feeb78e48116ec2d860f64872dd65ab09e479e12354c"}},{"ruleId":"D2","level":"warning","message":{"text":"_BlockedImportNeedYouRowState._followPlaced (cognitive 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2291ea7c17695b84de29d56431ac30d9720f84fce785c55c8c0683799157c831"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadyGroupHeader.build (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_rows.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a53026aee10fa5d13cc2e1777812f46f18d890faf2cf53609e1e723e57a347"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaEpisodesGraphPanel.build (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episodes_graph.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd62a262a5db0196a826e6b2d565a8ecc37a77e703c1ce6ffa05b044edf2515b"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaPageState._requestOf (cognitive 16): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd363b32a1e2014e5d19e00fc32394b44f093f89240906788e74bd37e14bbca"}},{"ruleId":"D2","level":"warning","message":{"text":"_MediaPageState._openEpisode (cognitive 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ff17528dd891a7ef034050b7cf061b23f459652b64c11795e163fae72ad3cd"}},{"ruleId":"D2","level":"warning","message":{"text":"RadarrService.searchingSince (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/data/radarr_service.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"59315610afcd2cc9d54996711240780e2e6d27ada3bc4b85035db648c4c15b15"}},{"ruleId":"D2","level":"warning","message":{"text":"_ArtistPageState._scrollToAlbum (cognitive 16): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca294d099da3ec6355bbe644641d17d499c476982977cd1d7d54cf30caafd75"}},{"ruleId":"D2","level":"warning","message":{"text":"_LidarrAddAlbumSheetState.build (cognitive 16): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_add_album_sheet.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ae93babe71d21b1719c9d72285f01e7ca88f7d3b033bc22e10b65de3ff6f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnboardingFoundState.build (cognitive 16): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"d764b62775ddd35b50bd0fc5733746cbe510043013a1454099b2f93272a522e7"}},{"ruleId":"D2","level":"warning","message":{"text":"_SettingsNotificationsScreenState.build (cognitive 16): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/presentation/settings_notifications_screen.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c622f9717762a49356a02fdeefed25bc85be7da41dbb5989b2458e6686f60391"}},{"ruleId":"D2","level":"warning","message":{"text":"PairReceiveNotifier._invited (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/data/pair_session.dart"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d3ddd58887457623cf40623e4b9985f2790ecb185bf932c3ca5ee48316d4ad"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsConnectionsScreen.build (cognitive 16): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/settings_connections_screen.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20eee69e10d39918fa82e49c300c518826d560484a86e347125046d89445a2d"}},{"ruleId":"D2","level":"warning","message":{"text":"SeerrSignInSteps._noticeActions (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_sign_in_steps.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf3197d7acf646b82cc7d1bdd381a06ec3ca660ce6c3c6d3ae165b375fe19e8"}},{"ruleId":"D2","level":"warning","message":{"text":"TracearrClient.terminate (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/data/tracearr_client.dart"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e69e30f372d2569de9866dd7e4f13dabe8bc19d8ae2597777956dcc47695e83"}},{"ruleId":"D2","level":"warning","message":{"text":"TracearrClient.events (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/data/tracearr_client.dart"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b502daf77b51a029b8f24c583927eb71204d80d0253998e00607bf84ee4d34"}},{"ruleId":"D2","level":"warning","message":{"text":"UnraidDockerContainer._parse (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/domain/models/unraid_models.dart"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ec6e3df5a76bdee42f2abd5d6f2d32f5a51c03d57cb1bb848ca8c99d0cd593"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/media_page.dart: FileTooLong \u2014 2378 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1878 over it, 4.76\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7ecca7a7dd79dfc11c4ce537b3547e8978c11f4a6abe032348aa0b71637cea"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ServiceSettingsScreenState: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bae9220b4ab9034dbd721332bb2d7697244dc682d4d2e23a454972781e44f3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/service_settings_screen.dart: FileTooLong \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28316dbbdc20846bf28f8020503eba322f1b4408bff25102184ec9e3eb2ac0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/media_browse_scaffold.dart: FileTooLong \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fc589f9d7e58fae5dda5b51f944af6a513af0cba7b5bcc05972dd407fd1c79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ArtistPageState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9623cd3456a15b5a744f614ab1f86985f56e9f00d5e3d53701d2de252da8ec5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CalendarPageState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/calendar_page.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"df42a3004cb0ddc615252f91822e24463bac3e3026da6d411b8b022cd401d5f0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _ServiceSettingsScreenState: TooManyMethods \u2014 79 methods. The bar is 30 methods; this is 49 over it, 2.63\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a929a1df9908be136e7093a50d0ea09f3dda7f4332397dfbe02170f3255ae4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SeerrService: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.53\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_service.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a4c855e76ec35f2401d77fb529e3a94087f83e2e108dcf70a2b13b67413a4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MediaEpisodesGraphSheetState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episodes_graph.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1789e4bd6871f8c5ee85674e0619012db6c74eefda254b8bb211dabdb8a6954"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _MediaBrowseScaffoldState: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82b1d338b8e09b5657ee829b7706455d33eba334ed20609fa268bb5a88c0345"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/service_kpi_provider.dart: FileTooLong \u2014 1222 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 722 over it, 2.44\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_kpi_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa88103871e3e0bc393635be127d9bae5ffd89abec5194d35cf6f0c4d775e8c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TransmissionSessionBodyState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_tab_screens.dart"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"3922764b3be120c2891868b424c69edf3d099140f03f42207881233b0bf120e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: design_tokens/generate.dart: FileTooLong \u2014 1184 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 684 over it, 2.37\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_tokens/generate.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5397f3626fc8c93c3e228e06db4029858568b5049ac8a6122b8aa3c782898a2e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ProwlarrLibraryScreenState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_library_screen.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"151331ec591102bc94342d6812edf093a69e116fb75a0dd4cb79cf776de30340"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/theme.dart: FileTooLong \u2014 1055 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 555 over it, 2.11\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/theme.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42a559ed0ee0bd459c8638ea8059f532c77b818ee61ce91d80d91d6fde1f3b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppTheme._buildTheme: MethodTooLong \u2014 _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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/theme.dart"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"2190bcf40d9805131e59ebe59239c930bbf2a6e63810717ca9ba85c6adc8b09b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/services_queue.dart: FileTooLong \u2014 1008 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 508 over it, 2.02\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/services_queue.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fdc9b2e043bdce1e5219214744a2d49544241fc86dfc64ce9ac0767ad04a9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/service_overview.dart: FileTooLong \u2014 998 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 498 over it, 2.00\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac96b3a8bfb90298e8a192910a37c2df9c39a93380fbd71634d70ede3117fea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/library_calendar.dart: FileTooLong \u2014 998 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 498 over it, 2.00\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/library_calendar.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"778e2167db58950cf263f9d2423eada3946347af2094185f27a6f0dca0ea3199"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PlexClient: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b3118eb57aec40f686968627d62440d633037a51ff9beff407d2c0e31f11de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/artist_page.dart: FileTooLong \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dcd72dd67a9e33cd08b7e9ace86c0892f97019ff6412c6eab78fd1574c14d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AuthorPageState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/author_page.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b32326c22a65b9efd426ed165947dd3afa44c0273f4451ca9927ff80959af5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/onboarding_walk.dart: FileTooLong \u2014 967 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 467 over it, 1.93\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b4dc22eb4c78368cd5decf12bc479fb22b8d4cd479d5d9482506b9cea7f9ce"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SettingsService: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2fdddebce697b095379a40dd64c8734929e816f6657313f897c8ce03f17748"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/calendar_page.dart: FileTooLong \u2014 938 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 438 over it, 1.88\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/calendar_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4ecfe7bb01c656facfd8156f6d1d482fd2589afddd1c80734c88bf121122ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ServiceRoutes: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/service_routes.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b855569f50c22c83e7aba6d6a6686919cdc891a719e64dd37bed5e1da2460a9e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _RowState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/download_table.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c2a221fc0da8c2e882c5b400ca808b431a36ab66486da422f959b52e296350"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _MediaBrowseScaffoldState: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fefd361eefee2a53c4d641a4a4fda92784b9784f6f7c71f307fdfc7c97942e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MediaEpisodeSheetState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episode_sheet.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"71352db3bac575b15d66b5a999cde9aca3684d8e95ba4df235060400626ef701"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlexClient: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dee20d2a861c775a0481038a6ee89126c24da28ed23c84f3350349a4b7623a9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SeerrService: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_service.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc1bc060e205326b042fd3a812d405e830b5f2181f9ea8787dd5828613ab8f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/manual_import_provider.dart: FileTooLong \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49898f80ffdd81dd602e220ae56400911fdfa716751a7c3168f12f76ee03b479"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _BlockedImportReviewPageState._content: MethodTooLong \u2014 _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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_review_page.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa7f0ac7d74b5773bc55c5f7258464127593eff8420e1d5b9e2e200bc3c619c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _OnboardingScreenState: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a576c49e7a4cd94792c959f8de041388a6a9a088b0d681a51969de5d62424583"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/onboarding_found.dart: FileTooLong \u2014 860 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 360 over it, 1.72\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b310ff34e4e5aedaa9f660e19c01fd84a775c9feb345ffb28f314584dd08a646"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/settings_service.dart: FileTooLong \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68069ba96b816ef0110c6410af3e57aabf85b408bd683d6c77c2fb15d490e3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/plex_client.dart: FileTooLong \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c248063a5cda6498e9f94d0a047b31b8d12962ad418a14e6e27894ee1990466e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CalendarBandState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_band.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6721a49139b480d9b4f6fe5cda08d00fc55399b95a24a52e403be989b409233"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/blocked_import_parts.dart: FileTooLong \u2014 841 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 341 over it, 1.68\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"557eccd3b5609d5452d4feb8e0f89772112b2640c7ae590698b6e27f6f693551"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _OnboardingWalkState._form: MethodTooLong \u2014 _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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae04a3b1d372777359e99ec04af48be280bec6d6b6ebf455de18b59e113cad4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SettingsService: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2bdf09c763029b8090a22065ce5d812f0a40b8f401cabb434b2106f4324ac0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MediaBrowseScaffoldState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"762f6a0249f9683e06e8e119d255afd3c251e53889063ceceb0aa0de1f5ef224"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/manual_import_review_screen.dart: FileTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 324 over it, 1.65\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0267d49ecef55531e28beaf4edabdbaa50275a18ae68eedfda37425f6c2ee231"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/transmission_tab_screens.dart: FileTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 324 over it, 1.65\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_tab_screens.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6aef088f32e77a89c7b4fb18429e5621b421d9307753abf97470899364250c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RequestBottomSheet.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/request_bottom_sheet.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df9e3f9a690b960c37faaec437b2426c71c0e70757e393f3df6e92d39621eb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MediaBrowserClient: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2723a2945524e90e2af5750a4c95a4cd7c812ccfc0f0cbc81befda983c5912d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/seerr_service.dart: FileTooLong \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac23ca134e8f23a6f27384b233e2f4506dd764894a507b1cab782847cbd3e641"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/service_matrix.dart: FileTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 272 over it, 1.54\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"057a54a90dd804356b4824481675324c8df48525e7f1e06e4b8d2e5b63b8d3b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/activity_page.dart: FileTooLong \u2014 771 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 271 over it, 1.54\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"664dc9b858b59a7a27f2b6b3ed78080b3ccd0615f171c62a7c8f2c334a1c4a65"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DesktopShellState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/desktop_shell.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"373dde4681c4311ba759786a7c877d30ddf3bb8a64476542a411fd3d68ded1f5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MediaBrowserClient: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e444f604bb0ac6d45d911cef190ac902c31c2d29fd74f748ca20ced20212e26f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FaultCardState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/fault_card.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a1ccd42353ec968db1177972a97c9ceb9622fbe6906d0620e69ec948c84953"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SeerrIssueThreadScreenState._thread: MethodTooLong \u2014 _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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/seerr_issue_thread_screen.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d68fc10781a4d9c58d8d5085a27d35369d3234a2463de67eab80e2de791d47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/onboarding_screen.dart: FileTooLong \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0643f9d8c33f9b89e4243928fed3e3f6b6704afe0f89df499b9b156a9b6490"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SeerrSignInFlow: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8c11e0cda4a139d2b85d9bc4a0abccddac0803dc05ca2dffe5667ed1224134"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/service_verification.dart: FileTooLong \u2014 720 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 220 over it, 1.44\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/service_verification.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4f1892854377505d85c831f4697a6dc1ae909b278796f6338a051931303e72"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DockgeClient: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/data/dockge_client.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f93c179261c3e03414677b8ce56717484f97493a1708a62aab31dd253e1161"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/manual_import_fix_sheet.dart: FileTooLong \u2014 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\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_fix_sheet.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"163b911a4150814e8c96ef489799905e89b6e65fa7183489afc1850449ff3fcd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/seerr_issue_thread_screen.dart: FileTooLong \u2014 710 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: _SeerrIssueThreadScreenState (125-860). The bar is 500 significant lines; this is 210 over it, 1.42\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/seerr_issue_thread_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9190aad713d7a7305e0c202090ca5ba3548128a9f243d36f1f6861b7cc8e3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SearchRow.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/search_row.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"44100b1100e341bf9b074d02eaa5b09f09ff1baeb6ff393c6cba5e83f4dec304"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _OnboardingScreenState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3843bac691b82753d990895a51171bb31dd1bb05d29964b90c5e0f539498e0ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/activity_item_tiles.dart: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 202 over it, 1.40\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_item_tiles.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6a540f96375cc6232b46a8435e310638c35ed0548fdd2cb9b64766c3b7381f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ManualImportFlowNotifier: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edfb29cdcedc4e1bf5383625d0a4c80415c6477d90e3121a7e3f659240821a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MediaAddSheetState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_add_sheet.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f819fac93e43200f370eba715ec48c4ccf934f6bec655be2f6be5a91db67c30"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppTheme._buildTextTheme: MethodTooLong \u2014 _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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/theme.dart"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cedc11ec6e768aa79684921aed75eeab8cafefa5ab0fe0013d91348f57000c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AddTorrentFormState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b460ed15070cd9608e9f98bf93b2a728ac64b44498db8d584794310cf934450"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/npm_screen.dart: FileTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 188 over it, 1.38\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf10d83e316150d5a832d882aca460284b23bcdd905f617bb152ef422e0c00b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: desktop/window_chrome.dart: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 184 over it, 1.37\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/window_chrome.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62484ab4e623aa8c660f3e31315e62ca6160a95780529614264ca3d5ea31ee4b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _SeerrIssueThreadScreenState: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/seerr_issue_thread_screen.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1e434cc2a3ffc77042baad7e5c6a464636ed11c040f7150ac64407f86779a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProwlarrService: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/data/prowlarr_service.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"acce8bf24502da0c13adfc48958cae041fc5e6de544f8c32902bd11c1a05f040"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/discover_atrium.dart: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 165 over it, 1.33\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/discover_atrium.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec9b826b43bf2156762ced9233d833e5d3ac432d22e34ae3ea798120fc79a83"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/torrent_detail_screen.dart: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 165 over it, 1.33\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/torrent_detail_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb35cb6623ff5c9dfe842ff21c668d304bfd7cfa7365e03d42e6ad14580e393"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CollectionTally.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/collection_tally.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dbc6942ac4fed7382ecc8720486b4ccdd0294c3180fb6a0834970e8d7088cc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppTheme: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/theme.dart"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"2234bafd8864d0638c2860d81950eb65719d83d39cd1a8a139d5d0d77520e491"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ReleaseListItemState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/release_list_widgets.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a025d898e228e1f4f34ff24af521ea54845191d94761cdb6382401c18504a04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/manual_import_models.dart: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 154 over it, 1.31\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/domain/manual_import_models.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34b8683604b00ae0f56b729a6d4ca26f1c57804495f6eaa04246bdffb4df693"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/prowlarr_models.dart: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 152 over it, 1.30\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/domain/models/prowlarr_models.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e5d1c127824802b9cddeafad2615883b9e98a59fb50e49b5e0eaa75e7ff29d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/media_browser_client.dart: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: MediaBrowserClient (86-1189). The bar is 500 significant lines; this is 149 over it, 1.30\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4863cfc5e77e516c7baede2caa6f8bf8b72118bd0d01e952b688f30263a8e03b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ShellScreenState.build: MethodTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/shell_screen.dart"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"35287d7bc26b02d8c8dccbcf3857648d24ca19970c2039545985089afbcab8aa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _MatchSheetState: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_fix_sheet.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0b204b1d5cca69d397a9d9aa81bc705eee25c88a920c10ff091418289a2456"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _Scope._parseTypography: MethodTooLong \u2014 _parseTypography runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_tokens/generate.dart"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d598a180a18661a448e33851ac64e24859e60f2103dc0c1e89520e738710be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _IndexerFormState.build: MethodTooLong \u2014 build runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"89413306acfde7283b016c08f1c5c3e7ad16ad67a0f273d6221d22f8d54363c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MatchedFileRow.build: MethodTooLong \u2014 build runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_rows.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d373273d400e6291a9174ef2ffa5c533ab1d5214195c99e71b4679ed6b6ee3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FoundTile.build: MethodTooLong \u2014 build runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9c8ff6f45dd7c2cdbc12130269fc1dcdf7042b0289251bc382951830db0677"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/media_detail_view.dart: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_detail_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d3881919103022f63531857a75cc2da25944e43cc24128ee308f361cf5f408"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/featured_pager.dart: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 123 over it, 1.25\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/featured_pager.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30dcb08612aa32365dc33728a34d5236df211bf74705f31dcffab8546757d18"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/unraid_screen.dart: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 123 over it, 1.25\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/presentation/unraid_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f6965bd47f9e75bd2381db21d77837b1f2607a783497dc7e331476712b755a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _MatchSheetState: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_fix_sheet.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"33956d295d56b409aa83205be90c710c0fa5500fd5f7875c3bfc414eb7db3a71"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _Body.build: MethodTooLong \u2014 build runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_violation_screen.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"29687ee06ee0632896cc2fb041fda12bbc66ea2a852e158b9b8b5f94187ce63d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LidarrService: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/data/lidarr_service.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"45228dcc3fa46df96758052a807c4f7e40a9c0b7daf48ce7cbf44dcb3085c27e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _OnboardingScreenState: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6db30a42c14a07882a9a08aafa5fa54c75dd4381c334df9bd867229932e6cf3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SettingsModel: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/domain/settings_model.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"092f4605b9864af9c85ed6968068dee510b812d9612c6fc4b296dee4fd63ab7c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DesktopActivityRowState.build: MethodTooLong \u2014 build runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_item_tiles.dart"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22b42c9d017fc0b6581a812a1bf1c850aa58ff6a4b5766368607ef59ac4ef95"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/onboarding_parts.dart: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 98 over it, 1.20\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_parts.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6eebd7949d734aed7d833902a58fee9d0bb66f189f9944a4a7e29f8f5a1501f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network/connection_failure.dart: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/connection_failure.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91274145ea532c4322a66ac1bfe3a7b9665ea0507368391379bb10ae9b6226d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/shelf_page.dart: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/shelf_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e535b2745b8bab58d118eba3c9bdfc41b94d8c7de378ef49d62f2b455fed4a76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BazarrSeriesDetailScreen.build: MethodTooLong \u2014 build runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_series_detail_screen.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fb2ea54e02f89ac795b2c21c9345bb62a2a66ab69b295fca736a279c2dd874"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ProviderFormState.build: MethodTooLong \u2014 build runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7616af55ed62c8ee19d996bfb1a80db2ffb0f72b9717c975c503354e77fbfa50"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ManualImportReviewScreenState: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"23597700c83474972898b5c1e9273de44c178bb4233d7f8bf545766a88cf4d73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/prowlarr_library_screen.dart: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: _ProwlarrLibraryScreenState (68-609). The bar is 500 significant lines; this is 85 over it, 1.17\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_library_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f15ac0f3020c83b32cd46bc6f36ccdb65ea9dafd01bf4634e99b4026dc4556"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/report_problem_sheet.dart: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 83 over it, 1.17\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/report_problem_sheet.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e77fe1563988a1404df698d455dda7db9871be29fbf1bbd8ec9014a68ea7e6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _Report.build: MethodTooLong \u2014 build runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/import_done_card.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fbac2a27f66a1248e8cae404aa4574b68bbc2261e377cfd6df5ed1331c812f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SettingsConnectionsScreen.build: MethodTooLong \u2014 build runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/settings_connections_screen.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f572b6b70e7f43c148614fd4eafd023d78375f5c92d7bc6d31533b1eca214d35"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _NeedsYouSectionState.build: MethodTooLong \u2014 build runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa7d991d7e3b103ae676b9332578ca03864da077791e595285bafbc2ff2c2fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ServiceSettingsScreenState._buildScaffold: MethodTooLong \u2014 _buildScaffold runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"afda6e0b341749a9a065d59fb0a762f22a516477a52501e4dd3cc631a39be727"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ManualImportFlowNotifier: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e2437cfa1b44cb717cbaa8dfd347a19837230289e69ff5f82f90f8bbcf5d1d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _MediaPageState: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cc58b5e98b3d6e6f8f34f39498cd6d05bd03c084e3d71fad6deb2d6469273e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ServiceInstance: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/domain/service_instance.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ed4f77702399343f4e54f30ce4e16a268df030f92d62479d8000ebd4c8f229"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TransmissionClient: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/data/transmission_client.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e21a0210ab383b251255ff7162b07ae87edf2356190a532e0d24e6efd65ce4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HomeDownloadsModule.build: MethodTooLong \u2014 build runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/downloads_module.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"352168efa5f612202e399264323755b65c9ec885a169822c23965adc2aa2b63a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DownloadRow.build: MethodTooLong \u2014 build runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/downloads_module.dart"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf0632985d755a15509eb27889f01792e39a77fe303dc576f8fe3e09c289ea8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dashboard/truenas_dashboard_screen.dart: FileTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 64 over it, 1.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/dashboard/truenas_dashboard_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ac308076c79cd476cf8d5e0564d0d42a99921056dfa22899beb14cf918dca0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/manual_import_review_rows.dart: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 63 over it, 1.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_rows.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcdc0a878750e4f57416b74576fe7d00a2e747c658b0acd0847776b297d04f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StatusBadge.build: MethodTooLong \u2014 build runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/status_badge.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c4775752908d74b9c5b45b2da4de6bad5e25175ae4f3322ded196a5326bf74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActivityDownloadRow.build: MethodTooLong \u2014 build runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_download_row.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4eb29cbf2a8ddb86ba34783e0f69f1e958f0b8eb4d156a683ae02c9ec7f78e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BazarrMovieDetailScreen.build: MethodTooLong \u2014 build runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7240bffca69d131fd4747f3560900c9b9c02e094ee165ea0ab400a161658ac4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/search_row.dart: FileTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded), about 65% of them inside a single declaration: SearchRow (84-611). The bar is 500 significant lines; this is 59 over it, 1.12\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/search_row.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"209215bed31359425ab3a8c867eaf5854c5a362e4711ebb8e6049711777a1907"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SeerrSignInFlow: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1c3930ceaa1f1ec5144dcf356a50ae1580557405feb85840db6f0815e82f8e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DownloadQueueTile.build: MethodTooLong \u2014 build runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/download_queue_tile.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c618acb92e3e92d5dcfde020301ba9ab5c3bed81d373d884f149b6ba5848fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ManualImportReviewScreenState._buildRows: MethodTooLong \u2014 _buildRows runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"550dbb5c3974f44462f6c8218050c9ccbb5dd7c01c56653268f90cba0c973b48"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TracearrClient: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/data/tracearr_client.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51c5e8bcde940bc929df33c1d7640e8eb0d73e5bc5b349011e08808e8f908b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SeerrIssueRow.build: MethodTooLong \u2014 build runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/seerr_issue_row.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"045944bf61c088f7ed554f7f946d39409debca7423efe84388a729862d93c409"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CatalogTitleRow.build: MethodTooLong \u2014 build runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/catalog_title_row.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74bdceba8a4c7d783ef6c49e4e0219d1c766a035e9e9a585a3c65e02e35843"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MediaEpisodesGraphPanel.build: MethodTooLong \u2014 build runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episodes_graph.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03fcf7cc83125e5e0e8c3bfdf239435da9b9353189e555bf857a62130f5a8fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/media_episodes_graph.dart: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episodes_graph.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"839bfeee880722b4877fede0cfbbbf22ac39ac357408d685b22696819c92ebd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProwlarrIndexerTile.build: MethodTooLong \u2014 build runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"763e5d35632dbe2befe2b630a16f69289a5b0c82ec9a935e661803f84da944bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SidebarItemState.build: MethodTooLong \u2014 build runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/desktop_nav_rail.dart"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf52ee1533870d264da53b3c8a4cf3cfc2214c9b49951d34da1db7f13703772"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/interactive_search_sheet.dart: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/interactive_search_sheet.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e35acdbab0dacf7e65cd524fa1d45ae58b7773e107acceeea6bd241cfa865f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/media_series_manage.dart: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_series_manage.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d420ccfbe7f8fda804919259fa776d15974816c4d6ba9e11a3708ef97f0d0f16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/author_page.dart: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: _AuthorPageState (67-528). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 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 \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/author_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"708cbef285f003c94a7d21238169a351bcfe4482ee87f29fa4e024bc8b932849"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _BlockedImportNeedYouRowState.build: MethodTooLong \u2014 build runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b831b3a22cada854f65358470313b4018c72dcf9a77c3012f4b3879873f1a80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/manual_import_widgets.dart: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_widgets.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"242f898a6debb87e813399d740c46bb6c5960e7547ccc4c68c63f308a0b386f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalActivityItemTile.build: MethodTooLong \u2014 build runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_item_tiles.dart"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"467e2ca8b2316398459e3f33db331750879d6a527908dca225dfa08b38ca6277"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _Panel.build: MethodTooLong \u2014 build runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_copy_panel_card.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"698113ddb63a048cdd2e19ea6c866fcb3aa7aba526b09b9cf97779a3cb57ffb4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GlanceTileState.build: MethodTooLong \u2014 build runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/in_flight_glance.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"65da1bb653d7f553b0512abf5c33c18430f44817791baf5a6f3a72ea0ec9f15b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/release_list_widgets.dart: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 34 over it, 1.07\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/release_list_widgets.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf946484083d8566581582cd3c50eed212209604e22da7ac44782560668c853"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/media_row_view.dart: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 33 over it, 1.07\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_row_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fcad58f0a3b526ec24c89e4f3b299353c9bc59373b2622f782b72e5385b85e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/release_search_sheet.dart: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 33 over it, 1.07\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/release_search_sheet.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c640df02ed6a48c53285f9575011d6da72d6e7d2c224a702b39ca98afe8cb12b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _InfoTab.build: MethodTooLong \u2014 build runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/torrent_detail_screen.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"018b65bd5263ed024f2f06f48eb61923b6584f4bd26ca65c564c3c55581692f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/service_key.dart: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 over it, 1.05\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/domain/service_key.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe35863de6df875b86d6908a97e603c2a6078b6d1711c725d625d76dcadb499"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ReleaseToolbar.build: MethodTooLong \u2014 build runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/interactive_search_sheet.dart"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2eefb4e3f1bdcf4301472ca73f54d312d332192861b99b4edd4b121c0508d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _RequestsBoardState.build: MethodTooLong \u2014 build runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/requests_board.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba270ebff1b05a11694f1ba3c6b830b71c6c07dcb43a85533484c5af66162ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ManualImportReviewFooter.build: MethodTooLong \u2014 build runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_widgets.dart"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"676504cd3caf9194b9dbe19ad9b845bf152728cfebb87738e3fe2fec75b2e9cc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DockgeClient: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/data/dockge_client.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"82563b6dbcc4aae8445b0e7d87a32366015dab121c2d4cba5bfeaa1cf73a33a1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _OnboardingWalkState: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5a782f61e1a9b487adc756d6e19ac3c0767fbe05c686af57b6b2347b2c2652"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SonarrService: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/series/data/sonarr_service.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88a5ccf7ada4e55673e29ac02f9c4e1c73460764c06c18c56b137cf20c11591"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ApproveRequestBodyState.build: MethodTooLong \u2014 build runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/approve_request_sheet.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cce559cd7506ab1e284c33ca6221bebda50093c230502cf4c1f55a698c360e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ManualImportReviewScreenState._matchedRows: MethodTooLong \u2014 _matchedRows runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bd5c54d8a16b57a67b37908a606f1c78aa6e117e3b34e15947f0ace2c3ff2a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _Outcome.build: MethodTooLong \u2014 build runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc6382e3e8ca94bb00f9ebc9d697d35f8ef582f977cc40a47e83aa9cb713b26"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HomeComingUpModule.build: MethodTooLong \u2014 build runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/coming_up_module.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"61feb4026c78a31113094dcb89107f78d50cfbd091b9395fd8573c6141b54fb9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _BlockedImportNeedYouRowState._episodeChoice: MethodTooLong \u2014 _episodeChoice runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"25108a6491c80ba463c58597f1da3e0daa9ba129ed643076b2c91ef75e4ff3f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MediaSeriesManage.build: MethodTooLong \u2014 build runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_series_manage.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8917c4ca5ab1c144671fb91c41f54b2664e6af2dc3493c1800a19b3f9bf89b11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CellRow.build: MethodTooLong \u2014 build runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5619dfdce9a37ace243225976e81aa1fda18b6b4e21e34ec81c5f4680155a15f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ServiceRoutes: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/service_routes.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"42aca8fa95462713bd8cb7b3aa5cc5616d35915c0d99ccce047ccd2c6a5952d3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _CalendarPageState: ClassTooLong \u2014 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\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/calendar_page.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e092ce977f5775281892f30efb2f4d2b6f8cd1dca248696d119a603b5fea4ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (60 shared lines): lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:25-230 | lib/features/bazarr/presentation/bazarr_series_detail_screen.dart:28-221 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2b13e610a79e0688ba26aa88f405d7a47ff0328fdd94c962e6fa9aaa85d22e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (59 shared lines): lib/features/readarr/presentation/readarr_activity_screen.dart:67-153 | lib/features/readarr/presentation/readarr_history_screen.dart:73-154 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/readarr_activity_screen.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd48cdbb9af2ecc6e300ffef9205659783dfa7728ddcc821c92a9271ef23d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/presentation/settings_notifications_screen.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf6199b9b733b5d87af72e53b9186baff25a155a08d78510a33526ffdd6ef03"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_overview_screen.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b369d981269b5802894b4d666fb36cca76634610e23dfbe93c2fb73ecc06dfc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_advanced_config_screen.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c829199b3122cd6fb794e5d61ca31e5c206f712d4d8901adefcbe13a13e01e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/apps/truenas_apps_screen.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e479755510436454783af83c6da16d8634f35b2a88ffb878d5d541876dcce43c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/datasets/truenas_dataset_detail_screen.dart"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51f7a5136f85e531d3aa4e89c1fc8364fd2ce80ca4e624e6229dafbca3b0a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (116 corresponding lines): lib/features/movies/presentation/movies_screen.dart:69-184 | lib/features/series/presentation/series_screen.dart:77-192 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/movies_screen.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae96157f68370ad6542ebc1f5f6278990d94794f7ff6f61e69f67e53e788068c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (92 corresponding lines): lib/features/nzbget/presentation/nzbget_screen.dart:59-150 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:61-153 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_screen.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4b83f9cb5bae87724027523e9f9ded2c2f9a7e92ffabd18d962353ca3670ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (88 corresponding lines): lib/features/truenas/presentation/system/truenas_system_config_screens.dart:149-236 | lib/features/truenas/presentation/system/truenas_system_config_screens.dart:322-423 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/system/truenas_system_config_screens.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9d285b381400fd84c87534322250a157734743c5dd44f10c3c18c3674ee628"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): lib/features/movies/presentation/movies_find.dart:124-183 | lib/features/series/presentation/series_find.dart:127-193 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/movies_find.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"11464bca4852c7a189d253a0e8ba933abf53a7eba703906057cdb324fc2dda01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (86 corresponding lines): lib/features/bazarr/presentation/bazarr_wanted_screen.dart:293-378 | lib/features/readarr/presentation/widgets/readarr_tiles.dart:71-159 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_wanted_screen.dart"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf33fde471a4966337893db7cd78e60e69c025ae13c16ccf6ebd775dd2b1329"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): lib/features/settings/presentation/widgets/settings_master_detail.dart:243-309 | lib/features/truenas/presentation/truenas_console_shell.dart:320-409 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/settings_master_detail.dart"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4043b510182138d921ffe748620e4dfdadf3ad5877f1b74756f9c5279e5fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): lib/features/activity/presentation/widgets/violation_rows.dart:113-183 | lib/features/services/presentation/dashboard_sections.dart:588-676 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/violation_rows.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee1659cabe27dae7793a10794bdcd93ff6c4c3c98789187b87d0519d6613db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): lib/features/media/presentation/media_page.dart:3344-3408 | lib/features/media/presentation/media_series_manage.dart:584-640 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3344}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08d1b59ec306ac869f5fa529649fa769cf1ee4bec708e990b750dd7b0c82c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): lib/features/bazarr/presentation/bazarr_history_screen.dart:313-381 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:259-320 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_history_screen.dart"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf4d774124a26e80c2ca4b08f356632ccf20e731ee57087b2eaf34bc7aff77e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): lib/core/widgets/floating_bottom_nav_bar.dart:560-633 | lib/core/widgets/floating_nav_rail.dart:210-269 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/floating_bottom_nav_bar.dart"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18eadac60ffba92dd4891785a98102e01fd6203b763d10981ee3b078468dd33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:178-243 | lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:435-497 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b199e659f2553d0fe012fa17a52e3680bc11f8b0aa055c72fd6173ebf8ef52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): lib/features/shell/presentation/desktop/window_chrome.dart:521-569 | lib/features/shell/presentation/desktop/window_chrome.dart:589-658 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/window_chrome.dart"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec8ddc6f331cf0b09440624ef9ad06664d1a3a692b68954c79a25f48eb4dbe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): lib/features/dockge/presentation/dockge_screen.dart:128-189 | lib/features/unraid/presentation/unraid_screen.dart:891-974 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/presentation/dockge_screen.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b22abd0e36761d4f27aa2ff58e2379e3aefec8406a4116f9a8744596ba755c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 46\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/radarr_overview_screen.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb6bc94e517466adaaaf68d3ddacd7ec05870b10cf6f7f9ef4e1c8b59b4eb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): lib/features/movies/presentation/radarr_overview_screen.dart:134-188 | lib/features/series/presentation/sonarr_overview_screen.dart:139-203 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/radarr_overview_screen.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bde79453edbee4939f60886810cab7f5154424800b555f3bb899cf1cd33fe91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 60\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dc4b7773158301fd6f604d04b592ec1a6eccece4ad8f74a3d1ed8769199564"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): lib/features/movies/domain/models/radarr_movie.dart:98-137 | lib/features/series/domain/models/sonarr_series.dart:120-154 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/domain/models/radarr_movie.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c001f09901f7062455fe9c16f78694c395163a20c55237d42d1ee952503b151"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): lib/core/widgets/service_record_row.dart:78-150 | lib/features/nzbget/presentation/nzbget_tab_screens.dart:189-239 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_record_row.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdab5934f6ff9fb7364ffe39ed14006d2bc022250a47abc76ba9d69c35ebe254"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): lib/features/npm/presentation/npm_screen.dart:500-549 | lib/features/truenas/presentation/widgets/truenas_version_banner.dart:16-69 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb168d9fcd4b4384542917056e239acf8c79855b660f0fdbbbd834257bd7ade"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): lib/features/truenas/presentation/system/truenas_system_hub_screen.dart:130-174 | lib/features/truenas/presentation/truenas_hub_screen.dart:127-173 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/system/truenas_system_hub_screen.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"673ba7eab008e81471e30ab6ba7b6d2e5ae3140a990cea1eac174a9ba6148b77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:101-145 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:190-242 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"859adfbd51941489b8c2e32f1a39184053f1fbf65c6e2c6f1a504f76c5fe81b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): lib/features/bazarr/presentation/bazarr_history_screen.dart:210-254 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:166-208 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_history_screen.dart"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cd6648204876eeb43f0797641bd144f3a5b2ea21d6dd4f844e7e688d7b44d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): lib/features/tracearr/presentation/tracearr_history_screen.dart:210-251 | lib/features/tracearr/presentation/tracearr_history_screen.dart:253-287 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_history_screen.dart"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"423fec0bcd6550c5b91cc10ddb4d5adc0d1b10a84e49f448a78366abc0632ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): lib/features/music/presentation/lidarr_add_album_sheet.dart:209-259 | lib/features/readarr/presentation/author_page.dart:535-583 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_add_album_sheet.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cc2034b5f15a58b176f0e67030cbcb294e8c3a628957e0bd233c53e88cf1f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 45\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_screen.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cbe0fee28828175286c1c576e7cb88f4ecb565e86579eb7abb8db7cb80d88f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): lib/core/widgets/service_overview.dart:1697-1746 | lib/features/discover/presentation/seerr_overview_screen.dart:432-485 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb1aaa7fcdd806ed9762022ed4e45b96b888adc27afa6aeaac0e4a39620f622"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/presentation/jellyfin_tab_screens.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c244ae344542d2386511e4f840d952b932c94c3499420ae497487d408af1ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/movies_find.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5071ae70ee6cce871cac7be7053eb282664ce429aecd345426c9ab1fc95327"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 43\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"157f1714a4a0dd3fc65b7f49db8ac2ce1f536030a62ff7c7a14bcd07b5f35996"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:80-116 | lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:125-160 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_overview_screen.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae6b0d0232aaa2c71a6492817cdbac8ca55894dc5a46e918d9307379875766c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:92-127 | lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:135-170 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82ca7c54382b816731374640a409144af89094f82c87ab4851e4a9aa46e2d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): lib/features/settings/presentation/widgets/seerr_account_fields.dart:164-200 | lib/features/tracearr/presentation/tracearr_owner_fields.dart:174-210 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_account_fields.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1599518242896dab5994c832b21f3cb2d81f8e7497886dd8ae8f81676183c824"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): lib/core/widgets/app_empty_state.dart:212-263 | lib/features/onboarding/presentation/widgets/onboarding_walk.dart:1300-1352 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/app_empty_state.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e3f38397a93f5a2faeb20f06e51a0711c453b840d399c1f9949d6617d1a5e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/features/discover/data/seerr_service.dart:399-428 | lib/features/discover/data/seerr_service.dart:565-590 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_service.dart"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaea32f4cab0cb3e25b693883325ba6fd93f6135a5bebf65b75a0c529712ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lib/features/npm/presentation/npm_screen.dart:359-392 | lib/features/npm/presentation/npm_screen.dart:406-442 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"64246f2d7d16759731f5bb50efb431dfeeb76757dc43924232cc672285283a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 38\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/system/truenas_system_config_screens.dart"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a162a58ff95034fc93861153a7a71fc54e41a4fa6c4f1c1bcc577603ab74c8a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): lib/features/unraid/presentation/unraid_overview_screen.dart:107-142 | lib/features/unraid/presentation/unraid_overview_screen.dart:195-232 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/presentation/unraid_overview_screen.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"36302a7be011996b187c4215f4510ff31ad32b823b4c361a3704396d60de8108"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lib/features/discover/presentation/widgets/discover_door.dart:350-387 | lib/features/discover/presentation/widgets/discover_door.dart:397-430 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/discover_door.dart"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba39f0c460d10758dbf1ca8cb157d0b6520a3fa5f29b36249a067d4296a5cf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): lib/core/widgets/release_list_widgets.dart:695-743 | lib/core/widgets/tag_chip.dart:36-76 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/release_list_widgets.dart"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf792de2a3ca7acbc2e3ee5e2195b98348b1cae606d083ce61869a0ab08291d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/features/nzbget/presentation/nzbget_overview_screen.dart:91-132 | lib/features/nzbget/presentation/nzbget_overview_screen.dart:188-218 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_overview_screen.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9137509a0b8b31888260462e476605db7f5819ad58b032604789444509c47242"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): lib/features/truenas/presentation/shares/truenas_shares_screen.dart:458-502 | lib/features/truenas/presentation/system/truenas_credentials_screen.dart:317-359 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/shares/truenas_shares_screen.dart"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ee26676dd95d9443020615149db5116b18d65f4612a3ada9a215208d113b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lib/features/tracearr/presentation/tracearr_overview_screen.dart:94-123 | lib/features/tracearr/presentation/tracearr_overview_screen.dart:192-234 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_overview_screen.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09319054d277afaba553b464ec9dcad18adbe38df9614cdcfbc72d4e07e72ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): lib/features/import/presentation/manual_import_fix_sheet.dart:976-1016 | lib/features/media/presentation/media_parts.dart:318-362 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_fix_sheet.dart"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1d064c4ec730496badc4f9e8b90b344967eaf5fd06fdc27c00626a0b953a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): lib/features/qbittorrent/presentation/widgets/torrent_tile.dart:56-103 | lib/features/transmission/presentation/widgets/transmission_torrent_tile.dart:51-105 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/torrent_tile.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c453dfe7bcd5598ccd48df41c40b5428e2aadc05ab534b58ac408d4a576d104f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:32-68 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:86-111 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0230625dc4a1cc91dfe047654d91e06ac92d2f0b275e8fcf51304cd9a02e977c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lib/features/transmission/presentation/transmission_overview_screen.dart:78-132 | lib/features/transmission/presentation/transmission_overview_screen.dart:140-172 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_overview_screen.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb108a3f53b56bef2864fc57b5738531ea7e2020f0df2e84cc9459fcf21c7cec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/shares/truenas_shares_screen.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee2c1a17c3958be184f9eec1a709c2b6f3271840dfca957a85f9f4ef6ec1f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/features/bazarr/presentation/bazarr_detail_view_model.dart:69-99 | lib/features/bazarr/presentation/bazarr_detail_view_model.dart:101-127 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_detail_view_model.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0b57555b268900de832c16cbc2208bb720a32d525b9d2d69c62e19f2d3441f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/presentation/dockge_overview_screen.dart"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4ab892c7705e71024c81521ab9e294aed4fda95693cc4260934e73b503ea0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_overview_screen.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0681a437190c3f1f9e9a3a6beeb9e437d3c520d33b0852c9bf893daed3574bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/features/discover/presentation/widgets/search_row.dart:509-544 | lib/features/discover/presentation/widgets/search_row.dart:546-572 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/search_row.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a69144fdfbe38d0aa633162cbf9d8eca203560eb339f80867bf5e53e7294fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lib/features/unraid/presentation/unraid_screen.dart:672-703 | lib/features/unraid/presentation/unraid_screen.dart:831-865 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/presentation/unraid_screen.dart"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef38433c0de5bb226c3fed8249c4a81e5dbc03eb52a94b94efd6fb27a14b5a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): lib/features/stream/presentation/widgets/stream_session_slab.dart:48-85 | lib/features/stream/presentation/widgets/stream_session_slab.dart:114-155 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/widgets/stream_session_slab.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3280e9c3950691b81246175d42dc56168a011a5c778ef06087e466f2d7cfda15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/features/bazarr/presentation/bazarr_history_screen.dart:115-140 | lib/features/bazarr/presentation/bazarr_history_screen.dart:142-168 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_history_screen.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf6820889cfec2c15dc98dd0c6ea7d31d1f8d503f37af8966083a0a80a42be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 25\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_library_screen.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced02a3ec4cef769100fa409de0fdfcab90e0e25fb89c847a790dc2f5ec193ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/domain/models/bazarr_models.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e43bc3fe5df416b947644cc562718ec06becc2f1f9966d3efcf918e90424b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lib/features/bazarr/presentation/bazarr_history_screen.dart:176-208 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:132-164 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_history_screen.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ddb788fbfb0469d10949f5e1114eaeefbc5e607823cef3a6d659c28ca7e976"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/features/movies/presentation/radarr_overview_screen.dart:196-224 | lib/features/series/presentation/sonarr_overview_screen.dart:211-241 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/radarr_overview_screen.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"85420b53577121eda138f1f3524499379daec4985d15fccf995727bd66cd882c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/features/plex/presentation/plex_tab_screens.dart:58-83 | lib/features/plex/presentation/plex_tab_screens.dart:92-117 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/presentation/plex_tab_screens.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bc622799e5bdb06b8bba4b796c6b5ae570477d67bba173c59cee87385ff220"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/features/shell/presentation/desktop/desktop_nav_rail.dart:626-652 | lib/features/shell/presentation/desktop/desktop_nav_rail.dart:678-720 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/desktop_nav_rail.dart"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"048e8d08905dfb5f76214636d9a6c11f8ad01cac6838e53cc47b4cd446e8f334"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): lib/features/discover/presentation/widgets/search_row.dart:732-774 | lib/features/music/presentation/artist_page.dart:1106-1144 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/search_row.dart"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffb918ae956f6363caf9f646c433aa33d08240a14b2259b87f72cdbd5bf88c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/features/qbittorrent/presentation/torrent_detail_screen.dart:480-503 | lib/features/qbittorrent/presentation/torrent_detail_screen.dart:608-631 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/torrent_detail_screen.dart"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f7ef2d95bcca87e81ea9ad07975563f255dccf2fb62640f4236a104dd25737"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/features/activity/presentation/activity_page.dart:982-1013 | lib/features/home/presentation/widgets/downloads_module.dart:605-629 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e4a119389c0fdff59c8f37ace111942a64aff78dba8e7b423ae84dd1d0c3f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/features/dockge/data/dockge_client.dart:277-304 | lib/features/truenas/data/truenas_ws_client.dart:269-291 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/data/dockge_client.dart"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b47145906d9e556f9d868c45d37bb92670b3b7f6f923d274f6f5ccdbc12fc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 31\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f513730acb19f99fb181e2687c20f1511f9a50e91ec88fb1f83e762f28b38216"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/features/media/presentation/media_add_sheet.dart:406-435 | lib/features/music/presentation/lidarr_add_parts.dart:400-428 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_add_sheet.dart"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53554fd969d6911ea3053d7be2224452745a4d7fa5c1504cee8c1c4823936a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/features/music/presentation/artist_page.dart:831-848 | lib/features/readarr/presentation/author_page.dart:405-422 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b34b980b3b5326a5810d4224c9bd7b8d4eb8c53c833bbb7bc808e43f2095f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lib/features/qbittorrent/presentation/torrent_detail_screen.dart:371-398 | lib/features/qbittorrent/presentation/torrent_detail_screen.dart:412-451 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/torrent_detail_screen.dart"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"398ea6cb80d5a61f547c1abd06774039adf09bb73b1ea50c13bb0eab89551887"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/features/activity/presentation/widgets/requests_board.dart:570-594 | lib/features/activity/presentation/widgets/requests_board.dart:596-621 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/requests_board.dart"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"3749224906ad4612e9d771362e63dcdebb1561ddaa27a238567e3ff1d3dd99f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/core/widgets/service_overview.dart:1407-1428 | lib/features/npm/presentation/npm_overview_screen.dart:175-203 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc260b78170e40fda4b2c53b28ed71cd84fcc3d003f8066ba1b142b7dbe9a0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/features/unraid/presentation/unraid_screen.dart:322-340 | lib/features/unraid/presentation/unraid_screen.dart:482-502 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/presentation/unraid_screen.dart"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f4aba4e8f169e79e0ebaa4f3817ead2e78d726d026d1f48e5bf3896a083f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:370-401 | lib/features/transmission/presentation/transmission_overview_screen.dart:207-237 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b81fccbb8a7cf9fc1d5c57fdb17eef704365ac632a583655a3a4c680bdc6a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/features/bazarr/domain/models/bazarr_models.dart:578-592 | lib/features/bazarr/domain/models/bazarr_models.dart:594-608 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/domain/models/bazarr_models.dart"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"689e1af23f86df10fcb1de756d23216a7667e99dc97e03de8c399e33f35a59e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/features/discover/presentation/widgets/search_row.dart:677-703 | lib/features/media/presentation/media_parts.dart:505-534 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/search_row.dart"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0fcfc74b133ae5ceb717bb888e802a577a7f55cbfd17615e4ef487541f543b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/core/widgets/content_card.dart:161-192 | lib/features/media/presentation/shelf_page.dart:529-553 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/content_card.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4cb7a93c7a3d83bf8bf57bc14d00812dc9397e085584eaddcf0f2c116a5b79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/features/npm/presentation/npm_screen.dart:455-481 | lib/features/unraid/presentation/unraid_screen.dart:641-664 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce89f68d232f8893975810e8f3c5dbbc20c624fd76fdf3f594f5f81bd3bf8ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/features/pairing/presentation/pair_receive_screen.dart:454-480 | lib/features/settings/presentation/service_settings_screen.dart:2828-2854 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/presentation/pair_receive_screen.dart"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"068c24f2117759e8a244a65a14d71f2e60ff563a811a2665a987df5df2f6d1c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/features/qbittorrent/presentation/widgets/torrent_edit_dialogs.dart:120-144 | lib/features/transmission/presentation/transmission_tab_screens.dart:1113-1137 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/torrent_edit_dialogs.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6551f1f5caa90b2abaac10a133351ebbdc01dba0b3b38e768c91e23c11a8636d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lib/features/transmission/presentation/transmission_screen.dart:329-357 | lib/features/transmission/presentation/transmission_tab_screens.dart:374-401 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_screen.dart"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbd6aa8313e37dd1fc43e927b3f2451c0cc4ae9e01aafbc99f547d4ef3de51c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/features/discover/presentation/seerr_overview_screen.dart:401-424 | lib/features/home/presentation/widgets/arrived_module.dart:205-228 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/seerr_overview_screen.dart"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb607081867b7a39a0fd06689c22b3f098eaed1d55179edece5f1bebd6e5a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): lib/features/home/presentation/widgets/home_module_parts.dart:22-56 | lib/features/media/presentation/media_manage_parts.dart:135-172 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/home_module_parts.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d627249bfab65e753d13f7d2472e129d1b4c568ad8201df5c68bd11487d7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/features/onboarding/presentation/widgets/onboarding_found.dart:1026-1047 | lib/features/onboarding/presentation/widgets/onboarding_walk.dart:205-231 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"909177a37dc64fc507b78a32e55d0715521757ef42c379b0bcc1c53c9593dda8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/core/widgets/service_overview.dart:1438-1458 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:250-282 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"8050b3eccfa09d1f77d8287bfdfa2eb8dc5b327efc970f24bcd097f1bc738b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e488ad189b5f0a39562ae062f1e835512f0509d478e4378de03bac8ea05749"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/features/music/presentation/artist_page.dart:754-777 | lib/features/readarr/presentation/author_page.dart:358-381 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e270a387f6239651a5a8ca7db171e9835aa037714b1b11ec6efbf422650df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/shares/truenas_shares_screen.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2892220485654d6015c0122ec39496c04060932d7434f358f1685a8ec3ebcd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): ios/CupolaWidgets/OutsideDownloads.swift:70-84 | ios/CupolaWidgets/OutsideRequests.swift:63-78 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/CupolaWidgets/OutsideDownloads.swift"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d465a4c71be8c53b306584be1d5bf62566937f810c9790d6fe872483ec5e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/features/home/presentation/widgets/set_up_next_module.dart:254-276 | lib/features/media/presentation/media_episodes_graph.dart:749-769 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/set_up_next_module.dart"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa2b28fb680496cb25abec79ae0b8c400814e8c16e0ed6473a0e540e89534b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/features/music/presentation/artist_page.dart:812-829 | lib/features/readarr/presentation/author_page.dart:383-403 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb01b5838c99d67a7bfde455e50a8590fe2467dec8a07173faa63cbc767ce88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:118-136 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:168-186 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b1fbe771a4c2d02b9213434c35083a1142f9379f28c90174392a8305bdeb94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/features/bazarr/presentation/bazarr_wanted_screen.dart:425-451 | lib/features/pairing/presentation/pair_scan_screen.dart:163-197 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_wanted_screen.dart"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"614fbcc476132f784d892239899e0c3c6fb7f43d37bbd77f95c2f96886fb9e11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/features/onboarding/presentation/widgets/onboarding_found.dart:1062-1084 | lib/features/requests/presentation/requests_screen.dart:324-349 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32900211d09d7585ad66026c9a59ed56dbc36ff8321b5f7040dc4064311f643"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:138-149 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:188-201 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eae8df8a645c53e1722361fabf4561ad412351c9d1a9906230b3fd12ee44060"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lib/core/widgets/fault_note.dart:41-76 | lib/features/release_search/presentation/release_search_settings_screen.dart:390-423 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/fault_note.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a129474a521a32223bcdefc82b499529c346e11a0b22e10494c3d1796049b4fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/features/discover/presentation/calendar_page.dart:1031-1058 | lib/features/media/presentation/media_parts.dart:466-489 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/calendar_page.dart"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a252a22e04bf592a939a31feaeee19806fe17d7e15ee90f54442cdf6b6410da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): ios/Runner/AppDelegate.swift:192-217 | macos/Runner/MainFlutterWindow.swift:243-261 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e4776583145aa4c625d287699d773ec7e493dcca68078c01ae9bdd93dda406"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/features/import/presentation/manual_import_review_screen.dart:1025-1059 | lib/features/import/presentation/manual_import_review_screen.dart:1068-1093 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3bf3812cff690d471fa9d076ac10c4e67471b761a9a4de4aed756107f1cb5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/features/prowlarr/presentation/prowlarr_stats_screen.dart:162-187 | lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:407-427 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_stats_screen.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6ef86bb3b251115b530972fd0c0b42440fcaaa1d67b9703d3d1fb7953ac97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): 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 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideComingUp.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f66c9d6469866c53020cfc726d8bad8b24ff27f8577dc6965fbca20709900a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): ios/CupolaWidgets/OutsideComingUp.swift:74-87 | ios/CupolaWidgets/OutsideRequests.swift:80-92 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/CupolaWidgets/OutsideComingUp.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefa0500b864bd1eaac98d8f8af51bf10f76e9d35d4a59543de631da746cd358"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/features/discover/domain/models/seerr_issue.dart:95-110 | lib/features/discover/domain/models/seerr_issue.dart:437-451 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/models/seerr_issue.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"319346a60decdaa54ff4444754e5b3c8ad691e44e0e0c743f08d727d83270d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/features/npm/domain/models/npm_models.dart:371-382 | lib/features/qbittorrent/domain/models/rss.dart:57-70 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/domain/models/npm_models.dart"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d953311140b63bdf88a0dcf5081a369b48d7b95a3a3e9ac4afc7cc10543a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/features/nzbget/presentation/nzbget_screen.dart:352-375 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:404-427 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_screen.dart"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52cffe1366b042b72ed3e11e8adbb2e7cfb5d92adc8d97fd6c96955de893f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:123-147 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:158-187 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b793ad72d4460ca6303605adb7a80ef0e8d4b203ed4821868b3d0e8ca0ac71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/features/truenas/presentation/apps/truenas_apps_screen.dart:178-205 | lib/features/truenas/presentation/storage/truenas_pool_detail_screen.dart:236-258 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/apps/truenas_apps_screen.dart"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b3522a0c2930fb8710540abc1ed35e5af915c93a1ae4122d27b22a9c87766a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/detail_sheets.dart"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3f3fcb24e5212a315d09d1e39318fe04d620b7c1582a5be12ff1a429f5eac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/features/release_search/presentation/release_search_sheet.dart:318-346 | lib/features/release_search/presentation/release_search_sheet.dart:806-825 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/release_search_sheet.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c08b7461577fd4ef42f8b7d6e8074127e36ff0207437d105881698631b1e10a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/features/tracearr/presentation/tracearr_history_screen.dart:289-312 | lib/features/tracearr/presentation/tracearr_history_screen.dart:314-331 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_history_screen.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c93543b5610338d3f8058025b96d5a025260f3773555403c5497088ac336ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): ios/Runner/AppDelegate.swift:135-156 | macos/Runner/MainFlutterWindow.swift:186-206 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7508c33d4cd2c06b38d542d8b148a992f1a62c330df28ae94552a996a8545b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): ios/Runner/AppDelegate.swift:233-257 | macos/Runner/MainFlutterWindow.swift:272-295 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c93fd0f885e81d6465f78c5e58ec0776b61fa953bfe06dcc502ac7093d236b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/features/music/presentation/artist_page.dart:966-983 | lib/features/readarr/presentation/author_page.dart:512-527 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"539b02acb5f3a989a0e1036896a7765da9994a0014a9788ba677f5f8213066a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/features/transmission/presentation/transmission_tab_screens.dart:838-857 | lib/features/transmission/presentation/transmission_tab_screens.dart:859-875 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_tab_screens.dart"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98962b48248e195b4a7f1055b92636643115d6f5f145a18770863c46aecd885"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/features/home/presentation/widgets/downloads_module.dart:637-655 | lib/features/import/presentation/manual_import_progress_screen.dart:259-289 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/downloads_module.dart"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d4e0acf98ad24ef3b003dd6fa1a62dc22aee9d82c0aa5858194e2a22d00459"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/features/import/presentation/manual_import_provider.dart:1051-1064 | lib/features/import/presentation/manual_import_provider.dart:1066-1079 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2137867be1b85c1768a651f54bf881b6f5509dd578b2c730e5519a48da7b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/features/prowlarr/presentation/prowlarr_history_screen.dart:75-99 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:101-124 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_history_screen.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"111480a9cc6a2234c9e32e85bdff04fff6c8ff13edaf4b5105879ff789885a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_tab_screens.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"10080659dd01af2b09c348a27c480f99739837dc8425f4a750b4c5cf3bfb8c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/tag_chip.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6469e8d8426e368c352bc684628bb46ea7dea3783cb807f63a11c6d8b4d19024"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/features/home/presentation/edit_home_page.dart:249-268 | lib/features/media/presentation/shelf_page.dart:833-849 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/edit_home_page.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eae56d133a0c9046ee060947595e95c39d3a062f9a256594e61c815a9d2c3e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/features/settings/presentation/widgets/seerr_sign_in_steps.dart:268-284 | lib/features/tracearr/presentation/tracearr_owner_fields.dart:264-283 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_sign_in_steps.dart"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de9e6acefaffe2a5b068dfb162831859b0130db4506060b6dc1e5bf2fc7e85b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/features/settings/presentation/widgets/settings_summary_cards.dart:412-438 | lib/features/settings/presentation/widgets/settings_summary_cards.dart:445-471 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/settings_summary_cards.dart"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a22a4a89671c1247f223a83c38b9ca8b1fce6e0bf3e6bde60e5022961c9ce77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lib/features/stream/presentation/stream_libraries_screen.dart:69-100 | lib/features/stream/presentation/stream_overview_screen.dart:96-140 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_libraries_screen.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4ae639912763fc5e6470b3a6a70209241da38719b365fb5873bcdf47620dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_add_artist_sheet.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fe769d813ec966262651ec576c77afbc26201fcf1644ce0c9c059325c2fb99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/features/jellyfin/domain/models/jellyfin_models.dart:101-113 | lib/features/transmission/domain/models/transmission_models.dart:454-468 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/domain/models/jellyfin_models.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c76cb90ad97db7593068904dd2fa08ab15f0bd75b943453fac055fb6a18327d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_add_sheet.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dab04b91aae882eababc983739dcc0edbe01c4b8d09e07a136b802a580e9a65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/domain/models/prowlarr_models.dart"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb492ab8ac018cb825262056d4de6e96ad417b8ec3c69c8b3228a789d1550a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/features/qbittorrent/data/qbittorrent_service.dart:49-62 | lib/features/qbittorrent/data/qbittorrent_service.dart:64-77 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/data/qbittorrent_service.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45bb99c241fc259d981c9f3e89f70e5d5e22710934a7e0a6927f3e2c7158d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:118-130 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:132-156 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_tags_screen.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1320390c749c433d9623ad44366cce0f439c1fe2535b16a222bcc46536f2abe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): 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 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/matthwlabs/cupola/outside/OutsideComingUp.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1500550ecf426d68a8e50418dafeba3c8e1ba7d1dc2b3eb6c9de3ff7dc1fc27e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/features/discover/presentation/widgets/approve_request_sheet.dart:304-321 | lib/features/discover/presentation/widgets/approve_request_sheet.dart:323-337 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/approve_request_sheet.dart"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a91c7e7f9a3973f4e766c397791f64f4c743cd3a3a7a8ed50485840a495f4e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/features/pairing/presentation/pair_offer_screen.dart:316-336 | lib/features/pairing/presentation/pair_offer_screen.dart:338-361 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/presentation/pair_offer_screen.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bc500322cf0f41749a89f4cbb28a5230bb984d9f855cf00393996640ebd4a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/features/requests/presentation/widgets/request_answer_controls.dart:276-297 | lib/features/requests/presentation/widgets/request_answer_controls.dart:299-317 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/requests/presentation/widgets/request_answer_controls.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d76875e1d55ab84267728c0427e0f2119471841feb45fb5503f15b063cd186"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/core/widgets/service_overview.dart:818-837 | lib/features/music/presentation/lidarr_add_parts.dart:361-383 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"53db955d1829d20e357836f46f1e63c45496611570a4b33a007b1ef65de8f295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/features/music/presentation/lidarr_overview_screen.dart:62-88 | lib/features/readarr/presentation/readarr_overview_screen.dart:45-72 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_overview_screen.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98b69ea287647c549d704a74c0a73146b5c77b3c1349c508c0477247d2cd688"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_overview_screen.dart"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"068a1babb02d33b02359a8e33b466cf208e28fd29574ae8da25409de3b892c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_parts.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f8d1fab8e944bce6aed03619f8d80059ecf7ef60729fc414b469f506c394e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/features/discover/presentation/widgets/calendar_agenda.dart:435-444 | lib/features/stream/presentation/widgets/stream_now_playing_section.dart:670-680 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_agenda.dart"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"036ce2a2a5889ed371f810b49668859523e414a9ac2af25245a3e023ba9f1034"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/features/unraid/data/unraid_client.dart:374-382 | lib/features/unraid/data/unraid_client.dart:400-407 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/data/unraid_client.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f62fc4ef1fd808d1743b6f69be164d2589e6a2e8cc8ee8840bf2d1af523c1ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/features/tracearr/domain/models/tracearr_server.dart:50-59 | lib/features/tracearr/domain/models/tracearr_server.dart:126-134 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/domain/models/tracearr_server.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c1a96ff54d8208889635f7928ad87ad07250c77692ba009fb764bd6760e40c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5901dab53165759e5592d64064b374d715439f166363e622435a7f0cd1dd11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/detail_sheets.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c3846b2c892ba3b58c42f9c1f04fc6e1e47821846859fcf7341826df35b85f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 18\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/presentation/dockge_screen.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"21687f6d3a63f582d657f58735d49d1204c6c5a708179197f496bb7a57d0ea8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/core/theme.dart:824-844 | lib/core/theme.dart:1022-1040 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/theme.dart"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe58846f918eb03c2a1f78fff45672409b218909c4cbebd2a017a20678f2df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/features/discover/presentation/discover_atrium.dart:241-257 | lib/features/discover/presentation/discover_atrium.dart:1038-1051 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/discover_atrium.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a857db62a40003b5aef57fe3f2d4c9d750a450f69f34d68809ed5e55ff42b251"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/data/npm_client.dart"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b3eae08e85c3f58ceafaa2f84761950a03cb4217b4f1dd1c8e4195ef79cd4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/features/bazarr/presentation/widgets/bazarr_detail_sections.dart:143-154 | lib/features/discover/presentation/catalog_page.dart:486-503 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/widgets/bazarr_detail_sections.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7121d73cda476082dc2dcc6a5a961bd1efa02df48725bdbf3b9451f110abec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/features/discover/domain/models/discover_detail_model.dart:14-20 | lib/features/discover/domain/models/discover_detail_model.dart:241-250 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/models/discover_detail_model.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7021278e76befaa2a1dc823bd9bb5c8bd289855db050420f88760a3bb51726c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/features/discover/presentation/discover_atrium.dart:665-681 | lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart:491-505 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/discover_atrium.dart"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"99de5da3508ab2fda6e047b8c63ea2d6038998c1a67733608d9b8e502251ab1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/features/activity/presentation/widgets/download_parts.dart:301-310 | lib/features/home/presentation/widgets/home_module_parts.dart:156-170 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/download_parts.dart"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0188454ce698ddf832ba64afd108020e12f8ed090dce7f52c821a690264f4e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36761acf9b6f0ecdcc84511be03f4f8ca4bac25de4791d1f04f4689bc889be2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/features/discover/data/seerr_service.dart:329-337 | lib/features/discover/data/seerr_service.dart:800-811 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_service.dart"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03b1c3791f1f7e4e36085503c7b459b696fd55a1cce19bc0ff60233e2aa04d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/domain/manual_import_models.dart"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6148950162263991464a163ae0c80f5e7c8a7650d91ea973eb8b6908cc16a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/domain/models/prowlarr_models.dart"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc668a35c3caca137b541f39c493e94af402017e062a8b433fd2df30e4866d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): 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 \u2014 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/data/manual_import_service.dart"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e063550fd0d3f3e74b24f69c7a8eebc09657a827c2150decfed8ac339fd8935d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/features/tracearr/data/tracearr_client.dart:83-92 | lib/features/tracearr/data/tracearr_client.dart:125-132 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/data/tracearr_client.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff697377c27066ba2adc464473bf1a96c3e4d63d08b19492e687a70e211eaf18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/features/media/presentation/media_page.dart:3216-3227 | lib/features/media/presentation/media_series_manage.dart:454-463 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3216}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cdcbdc7c422dc3879bb51e5ecb553cb5bc99a2447042360dd5bda3d5d60ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/features/npm/presentation/npm_screen.dart:296-305 | lib/features/npm/presentation/npm_screen.dart:307-316 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4f66f08fce082980bc5370e0ee190f110a5e5e38509502a85dbeeb312f6d89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/features/activity/presentation/widgets/requests_board.dart:552-564 | lib/features/tracearr/presentation/tracearr_history_screen.dart:196-208 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/requests_board.dart"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd77242ecc15d197e22c915794572a2b6d7ea4627a0b3c5dfb2fa4d1e965691"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/core/network/observed_transport.dart:194-210 | lib/demo/world/fake_socket.dart:91-102 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/observed_transport.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4aca83378ea72714b0aac6afdf1cbd92e3329d6682973abf7d97c71e799ca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/features/media/presentation/seerr_issue_thread_parts.dart:113-122 | lib/features/music/presentation/music_find.dart:269-279 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/seerr_issue_thread_parts.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd886a53a64bcf7e43430e0909dbbef8661636b59c283dd6d877ff2c30887b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/features/onboarding/presentation/widgets/onboarding_found.dart:556-562 | lib/features/settings/presentation/widgets/connection_access_fields.dart:555-560 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba001bd68abb1c379fbbb56e6ab2cbc1bdce31d8eb16c5f6407802b678e0f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/features/tracearr/data/tracearr_client.dart:341-354 | lib/features/tracearr/data/tracearr_client.dart:372-382 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/data/tracearr_client.dart"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d98c4e0b4353fa924dd8adf628783d717b4c5a48013b5c2dae6450fa3800c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/features/settings/presentation/widgets/requester_settings_rows.dart:145-155 | lib/features/settings/presentation/widgets/settings_app_rows.dart:118-127 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/requester_settings_rows.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac335c26e46a0bd880834aabd6959d0dcd79a5768cb3b2c1b0cf980d07ab2fe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/features/prowlarr/presentation/prowlarr_library_screen.dart:800-808 | lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:370-378 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_library_screen.dart"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c141d035edca2721280f5f9e63bb5fb3fc13b09cb36614c108aacd8e064c902"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/features/truenas/domain/models/share.dart:58-64 | lib/features/dockge/domain/models/dockge_stack.dart:109-114 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/domain/models/share.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"916c3bbcd78d84dfebfbe6d96279688a4e7779c9fc0e80d751fa676d5e8f9e4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/features/prowlarr/presentation/prowlarr_library_screen.dart:122-129 | lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:65-72 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_library_screen.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51b2629a98dc96778166095ea1e0c5a15d799b19f6a4f0e308d79c08e20ce23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/features/truenas/domain/models/share.dart:96-103 | lib/features/import/domain/manual_import_models.dart:720-726 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/domain/models/share.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8852cd10e706db674d4e2a3890d325bbd3afde3ae789493162c7b9eaef4ebaec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/features/settings/data/operator_adds_via_provider.dart:16-27 | lib/features/settings/data/stream_player_provider.dart:39-49 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/operator_adds_via_provider.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"211493853f3c6960a1cb0f305cd3da03d42150d4946d5521dcca2ce42a695d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/features/discover/presentation/seerr_sign_in_notice.dart:293-300 | lib/features/tracearr/presentation/tracearr_owner_notice.dart:180-187 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/seerr_sign_in_notice.dart"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0be499ace5fcdf822fd051fe36e4287c112606664859c8e25b80ad4ccb6b09b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/features/tracearr/data/tracearr_owner_accounts.dart:203-209 | lib/features/tracearr/presentation/tracearr_owner_sign_in_flow.dart:107-113 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/data/tracearr_owner_accounts.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbf68b2d3cc2002b0266ed17d775da4b2594ddce8628d2a55bc1dfe258ae2e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/features/pairing/presentation/pair_offer_screen.dart:82-89 | lib/features/settings/presentation/widgets/invite_sheet.dart:106-114 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/presentation/pair_offer_screen.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f2aa76ddcd3b2b58c98a3e626776d0d82108f61e75b4d8c92a7410ca9b1776"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:558-563 | lib/features/tracearr/presentation/tracearr_owner_sign_in_flow.dart:293-298 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcfdcacd0e29432112e729ee83587deb55868a55ac937ab7f242642d9137b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:778-786 | lib/features/tracearr/presentation/tracearr_owner_sign_in_flow.dart:364-372 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9830f2af31533dee5c7a57069ccaccd82ceaf41a3eab78194b34651ed4db9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/features/music/domain/models/lidarr_artist.dart:100-112 | lib/features/series/domain/models/sonarr_series.dart:156-167 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/domain/models/lidarr_artist.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21f962d7a4fbac66409e732f06412da0b56b952411786739aad532db3552508"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): ios/Runner/AppDelegate.swift:291-293 | macos/Runner/MainFlutterWindow.swift:343-345 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf023a6aea61d1285cb3b5a0fb3803a27455252252c48f299fe06ac24d5ee437"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/features/jellyfin/data/media_browser_client.dart:664-666 | lib/features/plex/data/plex_client.dart:805-807 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03dcce9f51806fb72a5648f2044afa93ba1e6395c2b83f67dd4332d9c5b7a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/core/network/redirect_guard.dart:239-240 | lib/core/network/same_origin_http_client.dart:124-125 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/redirect_guard.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"58edb530ca3150d0e561f1ec10d9f84a800c27d2eb7aaa226fbcf4a658f5a8a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/core/utils/route_utils.dart:59-66 | lib/features/pairing/presentation/pair_offer_screen.dart:68-74 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/route_utils.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da9b15f3c6e7e309cdb29a49848df1f4cc27d0664cc1f73773c991241f1cb0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): ios/Runner/AppDelegate.swift:371-374 | macos/Runner/MainFlutterWindow.swift:414-417 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b43df548e863170034ebef7815106689aef62e3130b0d4769cbba8d37c569c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/features/dockge/domain/models/dockge_stack.dart:23-28 | lib/features/transmission/domain/models/transmission_models.dart:25-30 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/domain/models/dockge_stack.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc2bb9479684bf58a7d3939daebcf1bdb125200bf2d4b9855025e54b81dde31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/features/truenas/data/credentials_api.dart:14-18 | lib/features/truenas/data/system_api.dart:28-32 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/data/credentials_api.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"74995836c8a52ac759f64629ae2e780b6e576159955e4546a314bc6f7de3fa4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/features/truenas/data/dataset_api.dart:37-38 | lib/features/truenas/data/sharing_api.dart:15-16 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/data/dataset_api.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a396273004bcae74110c75c7d25931240d07e8ea007c0f9abb076e4a7537ed6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:261-304 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:301-344 \u2014 before extracting anything, compare \u0060lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart\u0060 and \u0060lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:261\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:260\u0060 calls \u0060Text\u0060 and \u0060lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:300\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cd61d13dd36aff42ca30961ce019a9deeae1518edf8bd9b619a805dc4a573c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:107-136 | lib/features/bazarr/presentation/bazarr_series_detail_screen.dart:118-148 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart\u0060 and \u0060lib/features/bazarr/presentation/bazarr_series_detail_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:107\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd845afc632bab6382f8c5ce5c453243d81d17ffa123a1acdcb0d2580be1a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): lib/features/nzbget/presentation/nzbget_screen.dart:74-100 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:76-103 \u2014 before extracting anything, compare \u0060lib/features/nzbget/presentation/nzbget_screen.dart\u0060 and \u0060lib/features/sabnzbd/presentation/sabnzbd_screen.dart\u0060 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 \u0060lib/features/nzbget/presentation/nzbget_screen.dart:74\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_screen.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f13b24cd09ad7761c191c2d8af187f9c33edf6d33be38921cf85317fa43e3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 3): 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 \u2014 before extracting anything, compare \u0060lib/features/nzbget/presentation/nzbget_screen.dart\u0060 and \u0060lib/features/sabnzbd/presentation/sabnzbd_screen.dart\u0060 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 \u0060lib/features/nzbget/presentation/nzbget_screen.dart:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_screen.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3210d9707d6ca7b13ee2011e1582ddf76344ea04e8822a6d2e915c1f0e3c2463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201326 lines \u00D7 2): lib/features/onboarding/presentation/requester_sign_in_screen.dart:279-304 | lib/features/pairing/presentation/pair_receive_screen.dart:176-197 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/onboarding/presentation/requester_sign_in_screen.dart:279\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/requester_sign_in_screen.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"016d49a1dbbb6efa146f8dd6f5cf1c41b6ac97b0fa38b43833ddb382efddfd04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201325 lines \u00D7 2): lib/core/widgets/service_overview.dart:1438-1454 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:250-274 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/core/widgets/service_overview.dart:1438\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47559e3466adfb1cf3a7d5fb99836388695a8f9518357191a8eedbd80fc72dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): lib/features/activity/presentation/widgets/violation_rows.dart:146-169 | lib/features/services/presentation/dashboard_sections.dart:626-650 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/services/presentation/dashboard_sections.dart:626\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/violation_rows.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"761a96bf0e20c0ad726b09404b7e7a98429426653346cfb3a5cd2f97b4393f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201325 lines \u00D7 2): lib/features/outside/presentation/settings_notifications_screen.dart:107-118 | lib/features/release_search/presentation/release_search_settings_screen.dart:134-158 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/outside/presentation/settings_notifications_screen.dart:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/presentation/settings_notifications_screen.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc51fc869e67b00eb5b47e04ad76e5264e1ef5d6120fd98f60b1e9c424db7d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_history_screen.dart:185-208 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:141-164 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_history_screen.dart\u0060 and \u0060lib/features/prowlarr/presentation/prowlarr_history_screen.dart\u0060 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 \u0060lib/features/bazarr/presentation/bazarr_history_screen.dart:185\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_history_screen.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc125b3fb4201f47dc1b6d40e3300996d391b5b9d7b02e3911ffbf3a2302b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:156-179 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:209-232 \u2014 before extracting anything, compare \u0060lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart\u0060 and \u0060lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:156\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6fbecc2946409953028974c4a7fdaf8ab9b1fb3e603bbd06e9629621549e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): lib/features/readarr/presentation/readarr_activity_screen.dart:67-90 | lib/features/readarr/presentation/readarr_history_screen.dart:73-96 \u2014 before extracting anything, compare \u0060lib/features/readarr/presentation/readarr_activity_screen.dart\u0060 and \u0060lib/features/readarr/presentation/readarr_history_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/readarr/presentation/readarr_activity_screen.dart:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/readarr_activity_screen.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"19621aee480c8f888d415efbc0d7418dcb1535521ebe7109cb9a4169a3b75260"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): lib/core/widgets/service_overview.dart:1407-1424 | lib/features/npm/presentation/npm_overview_screen.dart:175-197 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/core/widgets/service_overview.dart:1407\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c50dbeab0ba5a8e3cc82fe74f3dda2de222197ae860e3878e8d015cb26c4786"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:206-228 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:290-312 \u2014 before extracting anything, compare \u0060lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart\u0060 and \u0060lib/features/prowlarr/presentation/prowlarr_tags_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:206\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9c251b5a574f132653147091d288234da6ea2ec6709b0301fdb0bdfe6e0110"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:409-431 | lib/features/unraid/presentation/unraid_overview_screen.dart:327-344 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea69fedd5fd03809bfb8837079fea3679672dbfbbb398d0d99a84b29bc7739f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): lib/features/readarr/presentation/readarr_activity_screen.dart:93-115 | lib/features/readarr/presentation/readarr_history_screen.dart:99-121 \u2014 before extracting anything, compare \u0060lib/features/readarr/presentation/readarr_activity_screen.dart\u0060 and \u0060lib/features/readarr/presentation/readarr_history_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/readarr/presentation/readarr_activity_screen.dart:93\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/readarr_activity_screen.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82cb29ec848b67d1c52c343ced39c0784b732689e0c2e89861a3360e2195ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 5): 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 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/bazarr/presentation/bazarr_overview_screen.dart:185\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_overview_screen.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7d08c7c8a846f3401e8d96419ce24f4c536c67938a45752da4bf461b5a1f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart:90-110 | lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart:185-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad1260334488660648f165c4086ab1f591825294bd1c8afc96d10f3bf3e4c4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): 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 \u2014 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 \u2014 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 \u0060lib/features/jellyfin/presentation/jellyfin_tab_screens.dart:56\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/presentation/jellyfin_tab_screens.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e626558c3347af99f03a4100cf6e5882eaf1ad26bb11d7ca3006b307c36da26c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): 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 \u2014 there are 3 copies across 2 file(s) \u2014 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 \u0060lib/features/npm/presentation/npm_screen.dart:643\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36604aa2ec35eb45d4bf5ddf1e3c6cedea9ee73b11cf20ce83285b39811088c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): 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 \u2014 before extracting anything, compare \u0060lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart\u0060 and \u0060lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:174\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"394cb7af9169206ff4342f0bc35e41288f7ac4ba3ae62370a432e72e417242b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): 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 \u2014 before extracting anything, compare \u0060lib/features/nzbget/presentation/nzbget_screen.dart\u0060 and \u0060lib/features/sabnzbd/presentation/sabnzbd_screen.dart\u0060 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 \u0060lib/features/nzbget/presentation/nzbget_screen.dart:68\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_screen.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f565610a5c9f63982b3da22fdcbb52918d9b86feb4b6366e2fb1e336ada6395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:294-312 | lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:602-620 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:294\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c867cc6caa873896f01504a18f4c6342103bdb84632256d394fd5a418fedc8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:79-96 | lib/features/bazarr/presentation/bazarr_series_detail_screen.dart:97-109 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart\u0060 and \u0060lib/features/bazarr/presentation/bazarr_series_detail_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:79\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b54cb4fd3646ac394de8e116d5ebbfeaa62b5d7ea888bc5de2293321d6abbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): lib/features/home/presentation/widgets/continue_watching_module.dart:396-413 | lib/features/home/presentation/widgets/ready_to_watch_module.dart:200-216 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/home/presentation/widgets/continue_watching_module.dart:396\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/continue_watching_module.dart"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"837320321612965ff7132b67e3977da2932433ecc0d34b69d2f8da89c10c1401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): lib/features/jellyfin/data/media_browser_client.dart:705-722 | lib/features/plex/data/plex_client.dart:845-861 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/jellyfin/data/media_browser_client.dart:705\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"072bfc495fb189b6943fd5ceec8da13131bd7522c7ae571a709acb6b01339054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/features/music/presentation/lidarr_add_album_sheet.dart:315-332 | lib/features/music/presentation/lidarr_add_artist_sheet.dart:360-377 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/music/presentation/lidarr_add_album_sheet.dart:315\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_add_album_sheet.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"545bb71b558c56d8c613fe35742bd91225528cdb3e339be4775e288659c91849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/features/nzbget/presentation/nzbget_screen.dart:191-208 | lib/features/sabnzbd/presentation/sabnzbd_screen.dart:201-218 \u2014 before extracting anything, compare \u0060lib/features/nzbget/presentation/nzbget_screen.dart\u0060 and \u0060lib/features/sabnzbd/presentation/sabnzbd_screen.dart\u0060 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 \u0060lib/features/nzbget/presentation/nzbget_screen.dart:191\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_screen.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d5325059414c03b78c8b2aabe3b65fe0c7e1a6dc91ea276a274714138069af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:348-365 | lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:506-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:348\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"141a1cabd510abe0aea2c42e9f058d15b0f75e1c45cc26c0a6543204f98e5c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): lib/features/npm/presentation/npm_screen.dart:906-921 | lib/features/npm/presentation/npm_screen.dart:1037-1053 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/npm/presentation/npm_screen.dart:906\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8edee1155c8478cc1de54c716ea93ef9c7ca6741eaaf851fe02eddcb3680fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): lib/features/onboarding/presentation/widgets/onboarding_walk.dart:1172-1186 | lib/features/onboarding/presentation/widgets/onboarding_walk.dart:1304-1320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/onboarding/presentation/widgets/onboarding_walk.dart:1172\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"27026072859930f2ae7436732760fa5daa8ac0120d9cad7dba407f1432b4822e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:345-361 | lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart:152-168 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:345\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa7b911ac904adc3e823b1214dbfc41c52c4c4b4415762a19829fdf937cb5f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:217-233 | lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart:592-608 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart:217\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0c56a32c1b77deab75c926557868ecfabbea21b64cc1042628975589699d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/features/truenas/presentation/system/truenas_system_config_screens.dart:510-526 | lib/features/truenas/presentation/system/truenas_system_config_screens.dart:555-571 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/truenas/presentation/system/truenas_system_config_screens.dart:510\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/features/truenas/presentation/system/truenas_system_config_screens.dart:527\u0060 calls \u0060Icon\u0060, \u0060SizedBox\u0060 and \u0060lib/features/truenas/presentation/system/truenas_system_config_screens.dart:572\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/system/truenas_system_config_screens.dart"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbf59bf61b8d727fcc8dc0c525fbd753de48f1633a38feea2eabfbb5688974b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 3): 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 \u2014 there are 3 copies across 2 file(s) \u2014 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 \u0060lib/features/npm/presentation/npm_overview_screen.dart:257\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_overview_screen.dart"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"496a81a956386056472d10c8680cd433cc2e667191e5f6d8841cab85d0925117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): lib/features/activity/presentation/activity_page.dart:605-618 | lib/features/activity/presentation/activity_page.dart:638-653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/activity/presentation/activity_page.dart:605\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9de6003add9f336c5b623efee51d1c04aeaada758eeaa3e6f3ba3ae5feee3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_history_screen.dart:228-243 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:184-199 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_history_screen.dart\u0060 and \u0060lib/features/prowlarr/presentation/prowlarr_history_screen.dart\u0060 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 \u0060lib/features/bazarr/presentation/bazarr_history_screen.dart:228\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_history_screen.dart"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"df91e4271e907afe00062d19d0c3a1005f2ec0fd5b38236282bc3fbc881a7002"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_history_screen.dart:285-300 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:236-251 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_history_screen.dart\u0060 and \u0060lib/features/prowlarr/presentation/prowlarr_history_screen.dart\u0060 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 \u0060lib/features/bazarr/presentation/bazarr_history_screen.dart:285\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_history_screen.dart"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa5a6bb0b123030424fab9316642ff3bd34ebde329f77d7eaea0e61e147ae73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:47-62 | lib/features/bazarr/presentation/bazarr_series_detail_screen.dart:52-67 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart\u0060 and \u0060lib/features/bazarr/presentation/bazarr_series_detail_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart:47\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d681018ea46fb7680103927fdd3f8938547be7dc35583c77d3a1facbf0b7850f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): lib/features/music/presentation/lidarr_overview_screen.dart:212-225 | lib/features/readarr/presentation/readarr_overview_screen.dart:139-154 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/music/presentation/lidarr_overview_screen.dart:212\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_overview_screen.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5f10ab0436ecd450f4bee70920b4648e6fa6cdc39d9302714f165cc44c1afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart:141-156 | lib/features/prowlarr/presentation/widgets/prowlarr_tag_selector.dart:152-167 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart:141\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"84857eed4d1293ebd437763d55abbf17616219d16ea0e37d9a0e40db0d5e9d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): lib/features/qbittorrent/presentation/torrent_detail_screen.dart:377-391 | lib/features/qbittorrent/presentation/torrent_detail_screen.dart:423-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/qbittorrent/presentation/torrent_detail_screen.dart:377\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/torrent_detail_screen.dart"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"77704885306637f25e42f0c86bd43f3aba2f7d846ade2cdc8f7e891bcf3a5786"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): 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 \u2014 there are 5 copies across 2 file(s) \u2014 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 \u0060lib/features/npm/presentation/npm_screen.dart:644\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6c56cbe4d2386c7ad488051e707184e5103b71d7e95489a50ce4ab6ca91d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): 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 \u2014 there are 4 copies across 3 file(s) \u2014 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 \u0060lib/features/truenas/presentation/datasets/truenas_dataset_detail_screen.dart:332\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/datasets/truenas_dataset_detail_screen.dart"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d357926bc6f1242f6fb10598e397166996454f45d4bcfaa1f348cdf65bf37b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_library_screen.dart:347-361 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:312-326 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart\u0060 and \u0060lib/features/bazarr/presentation/bazarr_wanted_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart:347\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_library_screen.dart"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"046a6f9a42e526918d64c63dbe56ae3c065d72beaac0096768d1fb4e7ca4aff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): lib/features/home/presentation/widgets/continue_watching_module.dart:250-262 | lib/features/home/presentation/widgets/now_playing_module.dart:190-204 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/home/presentation/widgets/continue_watching_module.dart:250\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/continue_watching_module.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6da5f137c854e61d3dbfded098251392d3ad85553909517fab97f26707fdfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/features/nzbget/presentation/nzbget_screen.dart:281-295 | lib/features/transmission/presentation/transmission_screen.dart:329-343 \u2014 before extracting anything, compare \u0060lib/features/nzbget/presentation/nzbget_screen.dart\u0060 and \u0060lib/features/transmission/presentation/transmission_screen.dart\u0060 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 \u0060lib/features/nzbget/presentation/nzbget_screen.dart:281\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_screen.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f3af9b3206ce6a3d2a41cb10467bad7c9767e575ac9f949055fee6bc4316c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/features/pairing/presentation/pair_offer_screen.dart:151-164 | lib/features/settings/presentation/settings_hints_screen.dart:26-40 \u2014 before extracting anything, compare \u0060lib/features/pairing/presentation/pair_offer_screen.dart\u0060 and \u0060lib/features/settings/presentation/settings_hints_screen.dart\u0060 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 \u0060lib/features/pairing/presentation/pair_offer_screen.dart:151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/presentation/pair_offer_screen.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fb76a493c9c3b557cdd540599ac8aae83e668715fd1b33ceab6bfe589fa924"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart:605-618 | lib/features/readarr/presentation/widgets/readarr_tiles.dart:142-156 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart:605\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0237f56f33c54e1a97ea689b22eba8daeaef5440ac94cd4c41e61edd348d116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:187-200 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:196-210 \u2014 before extracting anything, compare \u0060lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart\u0060 and \u0060lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:187\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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 \u0060child\u0060 to \u0060schemaAsync.when( data: (definitions\u0060 in one and \u0060schemaAsync.when( data: (implementations\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5545fa56d250524de0f376870319790ed81d8531e1a448a1193c652abb770fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/features/truenas/presentation/dashboard/truenas_dashboard_screen.dart:401-414 | lib/features/truenas/presentation/storage/truenas_pool_detail_screen.dart:96-110 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/truenas/presentation/dashboard/truenas_dashboard_screen.dart:401\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/dashboard/truenas_dashboard_screen.dart"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d74484dffe000b9ad7103537c362dbb6f0aa2a3840f4a4c8aa29658c151f75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): lib/features/truenas/presentation/system/truenas_system_config_screens.dart:469-481 | lib/features/truenas/presentation/system/truenas_system_config_screens.dart:560-574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/truenas/presentation/system/truenas_system_config_screens.dart:469\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/system/truenas_system_config_screens.dart"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a612173cfe12c35960c508a87f9069fe6c35b7049048ea025f951a6a391a36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 5): 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 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart\u0060 and \u0060lib/features/bazarr/presentation/bazarr_wanted_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart:345\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart:342\u0060 calls \u0060InkWell\u0060, \u0060_openEntry\u0060 and \u0060lib/features/readarr/presentation/widgets/readarr_tiles.dart:91\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_library_screen.dart"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8266dadc62552e581ffe49d329e437517a171090b84a08a353c10e284367a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): 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 \u2014 before extracting anything, compare \u0060lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart\u0060 and \u0060lib/features/prowlarr/presentation/prowlarr_tags_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:184\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"684d1feace742746428680853ff69992450f3bfb243f2fba13d0f5d2c761935f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 3): 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 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/core/widgets/service_overview.dart:1646\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef49a70e146dafe7fef391a6adf79e3cd0e5ae4823f487fd37a933b08ab29e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): 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 \u2014 before extracting anything, compare \u0060lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart\u0060 and \u0060lib/features/readarr/presentation/widgets/readarr_tiles.dart\u0060 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 \u0060lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart:231\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/features/prowlarr/presentation/prowlarr_settings_screen.dart:124\u0060 calls \u0060InkWell\u0060 and \u0060lib/features/readarr/presentation/widgets/readarr_tiles.dart:90\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"746d26b97c770bbcf68fb543b58e253a6453d6253fb60e84fe790157d09b8937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/features/media/presentation/media_page.dart:3179-3192 | lib/features/media/presentation/media_series_manage.dart:396-409 \u2014 before extracting anything, compare \u0060lib/features/media/presentation/media_page.dart\u0060 and \u0060lib/features/media/presentation/media_series_manage.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/features/media/presentation/media_series_manage.dart:392\u0060 calls \u0060read\u0060, \u0060sonarrServiceForProvider\u0060 and \u0060lib/features/media/presentation/media_page.dart:3177\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3179}}}],"partialFingerprints":{"codehealthFindingId/v1":"29febd605dbdf36ef55c897cc63f056546b38ed6c912bec40ecc9bbd47dd396a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/features/media/presentation/media_page.dart:3194-3207 | lib/features/media/presentation/media_series_manage.dart:411-424 \u2014 before extracting anything, compare \u0060lib/features/media/presentation/media_page.dart\u0060 and \u0060lib/features/media/presentation/media_series_manage.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/media/presentation/media_page.dart:3194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e89166b1e49b2cfd295de9d1a75cd4f20c2a14a7feefda3fa1378011df449e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/features/media/presentation/media_page.dart:3383-3395 | lib/features/media/presentation/media_series_manage.dart:614-627 \u2014 before extracting anything, compare \u0060lib/features/media/presentation/media_page.dart\u0060 and \u0060lib/features/media/presentation/media_series_manage.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/media/presentation/media_page.dart:3383\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3383}}}],"partialFingerprints":{"codehealthFindingId/v1":"161c9af332ee6b67d32d6df1f1764768c1c788989ea97bce3c5a12b8a9d6085b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/features/nzbget/presentation/nzbget_overview_screen.dart:119-132 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:229-242 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/nzbget/presentation/nzbget_overview_screen.dart:119\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_overview_screen.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12ebe7cd3c5393dab783a8f64d3559a7a79a0cce9994d67393f8ea6ae902fb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/features/readarr/data/readarr_service.dart:74-87 | lib/features/series/data/sonarr_service.dart:136-149 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/data/readarr_service.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9303200a5903bb5b3ab192309489e65346d5d2637cc45d66cd11b603f473f74e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/features/truenas/presentation/apps/truenas_apps_screen.dart:60-73 | lib/features/truenas/presentation/storage/truenas_storage_screen.dart:37-50 \u2014 \u0060lib/features/truenas/presentation/apps/truenas_apps_screen.dart\u0060 and \u0060lib/features/truenas/presentation/storage/truenas_storage_screen.dart\u0060 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 \u2014 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 \u0060lib/features/truenas/presentation/apps/truenas_apps_screen.dart:60\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/apps/truenas_apps_screen.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f9e7d322aba6bae35b4cdc5815f31dfad91df4cfed744944ddb793caefb0b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/features/truenas/presentation/shares/truenas_shares_screen.dart:458-471 | lib/features/truenas/presentation/system/truenas_credentials_screen.dart:317-330 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/truenas/presentation/shares/truenas_shares_screen.dart:458\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/shares/truenas_shares_screen.dart"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"185f173b74428dbd98076f22aba3d6b2278e1ba5c47c3e74aaf4754b51dfe4c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): 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 \u2014 before extracting anything, compare \u0060lib/features/pairing/presentation/pair_offer_screen.dart\u0060 and \u0060lib/features/settings/presentation/settings_hints_screen.dart\u0060 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 \u0060lib/features/pairing/presentation/pair_offer_screen.dart:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/presentation/pair_offer_screen.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"84964f2ec70beefc07685a940e132303654299ffdf85855606a3efca86a9a8b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/core/widgets/floating_bottom_nav_bar.dart:594-606 | lib/core/widgets/floating_nav_rail.dart:234-246 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/core/widgets/floating_bottom_nav_bar.dart:594\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/floating_bottom_nav_bar.dart"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef63226ac475237249bdce783915bf7424f1c9219ac43699123f61de529ef298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/core/widgets/settings_switch_row.dart:54-66 | lib/features/release_search/presentation/release_search_settings_screen.dart:684-696 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/core/widgets/settings_switch_row.dart:54\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/core/widgets/settings_switch_row.dart:67\u0060 calls \u0060ExcludeSemantics\u0060 and \u0060lib/features/release_search/presentation/release_search_settings_screen.dart:697\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/settings_switch_row.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51dc0505538d51b943e8d5c7e53d2884b8a3696c8a3384fc9f17255e5edf16f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/activity/presentation/widgets/activity_history_row.dart:90-102 | lib/features/media/presentation/media_page.dart:2916-2930 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/activity/presentation/widgets/activity_history_row.dart:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_history_row.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbbe7b619aac1d7046535d23204f8110f8e490b84f0209e8b699d9497131d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_library_screen.dart:162-174 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:176-188 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart\u0060 and \u0060lib/features/bazarr/presentation/bazarr_wanted_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart:162\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_library_screen.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb7f43fdb383b74a2b93f3e530d90d2758b7479764fc496a315f31eac8a9a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_library_screen.dart:188-200 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:202-214 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart\u0060 and \u0060lib/features/bazarr/presentation/bazarr_wanted_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart:188\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_library_screen.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6395a75fe773c1aa04f76639b74677055b9dd63a35d9dc016c67faaa9c72e152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/home/presentation/widgets/your_requests_module.dart:150-162 | lib/features/requests/presentation/requests_screen.dart:375-387 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/home/presentation/widgets/your_requests_module.dart:150\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/your_requests_module.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ba2b95b525823b558bd3b40eccf8e221855ead194160e81dcb4f41457d27a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/media/presentation/arr_bulk.dart:352-364 | lib/features/music/presentation/lidarr_add_parts.dart:369-381 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/media/presentation/arr_bulk.dart:352\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/arr_bulk.dart"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce5de33908d4dc185745786d464dbbb46c4026ecb5cf32a16e7991051f14061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/media/presentation/media_episodes_graph.dart:749-761 | lib/features/media/presentation/shelf_page.dart:619-631 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/media/presentation/media_episodes_graph.dart:749\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episodes_graph.dart"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00717c887ddafd804c70d4e3eaedc3cf46a785ea670fbcfd16def34f8fe8b87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/features/media/presentation/media_report_row.dart:139-150 | lib/features/media/presentation/seerr_issue_thread_parts.dart:561-573 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/media/presentation/media_report_row.dart:139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_report_row.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b547699aab3dab7474cc013f03af228a7ab8188158589a9aeb1fe41260d2faf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/movies/presentation/movies_find.dart:161-173 | lib/features/series/presentation/series_find.dart:171-183 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/movies/presentation/movies_find.dart:161\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/movies_find.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10bcbd5c33ba16a7c3c116f7dc3cffa81fc4e2cb3244b719e883227a427445b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/music/presentation/artist_page.dart:836-848 | lib/features/readarr/presentation/author_page.dart:410-422 \u2014 before extracting anything, compare \u0060lib/features/music/presentation/artist_page.dart\u0060 and \u0060lib/features/readarr/presentation/author_page.dart\u0060 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 \u0060lib/features/music/presentation/artist_page.dart:836\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"20259f7a17dc0c96d444e3434c11ac250ecc5392a54b44c732334284dc909fd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/music/presentation/lidarr_add_album_sheet.dart:301-313 | lib/features/music/presentation/lidarr_add_artist_sheet.dart:346-358 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/music/presentation/lidarr_add_album_sheet.dart:301\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_add_album_sheet.dart"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c58683210a31c0db4007608ae5c63ce5207045cb07c76bee3dad8e39835bf29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/npm/presentation/npm_screen.dart:557-569 | lib/features/npm/presentation/npm_screen.dart:995-1007 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/npm/presentation/npm_screen.dart:557\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f173976d3246f41b60c85a8dbce80fd456bf037386b88418e03f766d29b19aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:36-48 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:31-43 \u2014 before extracting anything, compare \u0060lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart\u0060 and \u0060lib/features/prowlarr/presentation/prowlarr_tags_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:36\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b368d27e99b74ad11ab6ab21f90bca8239102d1d935d68c673b44fdf40923fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/prowlarr/presentation/prowlarr_library_screen.dart:822-834 | lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:332-344 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/prowlarr/presentation/prowlarr_library_screen.dart:822\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_library_screen.dart"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd62f3e579ffd160cbff38e2a3a994ca8384d118eab6da984e3074cce5bb23d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/transmission/presentation/transmission_screen.dart:148-160 | lib/features/transmission/presentation/transmission_screen.dart:176-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/transmission/presentation/transmission_screen.dart:148\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_screen.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8484ee5f01d68957deeb1cde12f05b7ac26bb773dac67fcc5af50dae7a6419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/truenas/presentation/shares/truenas_shares_screen.dart:163-175 | lib/features/truenas/presentation/shares/truenas_shares_screen.dart:295-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/truenas/presentation/shares/truenas_shares_screen.dart:163\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/features/truenas/presentation/shares/truenas_shares_screen.dart:162\u0060 calls \u0060TrueNasFormField\u0060 and \u0060lib/features/truenas/presentation/shares/truenas_shares_screen.dart:295\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/shares/truenas_shares_screen.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd565b1e2baa57539ae820237b5f139ffe95d59fb989cccb76e962440b76fbc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 8): 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 \u2014 before extracting anything, compare \u0060lib/features/pairing/presentation/pair_offer_screen.dart\u0060 and \u0060lib/features/settings/presentation/settings_hints_screen.dart\u0060 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 \u0060lib/features/outside/presentation/settings_notifications_screen.dart:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/presentation/settings_notifications_screen.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3782638ffbb147b827229b7b0821a55af0ddb0d1465d5d64b366dffa31dcdf8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): 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 \u2014 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 \u2014 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 \u0060lib/features/npm/presentation/npm_screen.dart:584\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"336fa08c0589fdb194848e6f769a632db9a462456c7017fe2023e046f3407677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): 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 \u2014 \u0060lib/features/truenas/presentation/apps/truenas_apps_screen.dart\u0060 and \u0060lib/features/truenas/presentation/storage/truenas_storage_screen.dart\u0060 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 \u2014 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 \u0060lib/features/truenas/presentation/apps/truenas_apps_screen.dart:62\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/apps/truenas_apps_screen.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6692b4a2face88098ffe90da9b42887583436f37713e67e077290129fefd117c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): lib/features/activity/presentation/widgets/violation_rows.dart:118-127 | lib/features/services/presentation/dashboard_sections.dart:594-605 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/activity/presentation/widgets/violation_rows.dart:118\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/violation_rows.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"088dd13e2328a731b5483c406c72b866b80382fb748a9ad9b5035c935313beb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_library_screen.dart:264-275 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:256-266 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart\u0060 and \u0060lib/features/bazarr/presentation/bazarr_wanted_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart:264\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_library_screen.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa668628495d5b69de8bce54882574a5d09f9054e5a59112e990cf5f65b282c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/discover/data/seerr_service.dart:411-422 | lib/features/discover/data/seerr_service.dart:573-584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/discover/data/seerr_service.dart:411\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_service.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cad91c119070a8af82dba444ffef91780f7c33dd42671c04810109f08d15e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): lib/features/discover/presentation/seerr_overview_screen.dart:138-149 | lib/features/discover/presentation/seerr_overview_screen.dart:309-318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/discover/presentation/seerr_overview_screen.dart:138\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/seerr_overview_screen.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf56a4d9a51e89432f55d36730b58f2d7c296669a7fcbb447e295a830df023b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/home/presentation/widgets/continue_watching_module.dart:294-305 | lib/features/home/presentation/widgets/now_playing_module.dart:173-184 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/home/presentation/widgets/continue_watching_module.dart:294\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/continue_watching_module.dart"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"08088294da086d8bf39aebb7f308b1458ed443571bc83ae1ae299c7f8c25839b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/features/home/presentation/widgets/set_up_next_module.dart:265-276 | lib/features/media/presentation/shelf_page.dart:631-641 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/home/presentation/widgets/set_up_next_module.dart:265\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/set_up_next_module.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"449e409ad79c193a89ecaaf151b515a78c1824df273f910161038296e25b6806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/features/media/presentation/media_page.dart:3246-3256 | lib/features/media/presentation/media_series_manage.dart:519-530 \u2014 before extracting anything, compare \u0060lib/features/media/presentation/media_page.dart\u0060 and \u0060lib/features/media/presentation/media_series_manage.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/media/presentation/media_page.dart:3246\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3246}}}],"partialFingerprints":{"codehealthFindingId/v1":"432641a4d5eb2ea7a551d6a56f467b8670f05667278fe996455e1bea04dd3cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/movies/presentation/movies_find.dart:76-87 | lib/features/series/presentation/series_find.dart:79-90 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/movies/presentation/movies_find.dart:76\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/movies_find.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf9685c52374ab6eb5e9d94727600e8af7ad74f9bd439d74c60b122a0424cd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/features/music/presentation/artist_page.dart:321-332 | lib/features/readarr/presentation/author_page.dart:108-118 \u2014 before extracting anything, compare \u0060lib/features/music/presentation/artist_page.dart\u0060 and \u0060lib/features/readarr/presentation/author_page.dart\u0060 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 \u0060lib/features/music/presentation/artist_page.dart:321\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2015b0e0bc6526596d7451b07d33a501c89ae5997948139f8d390f990ef0080e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/music/presentation/artist_page.dart:674-685 | lib/features/readarr/presentation/author_page.dart:330-341 \u2014 before extracting anything, compare \u0060lib/features/music/presentation/artist_page.dart\u0060 and \u0060lib/features/readarr/presentation/author_page.dart\u0060 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 \u0060lib/features/music/presentation/artist_page.dart:674\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"096f8c16a865d6e45925ffc8dc13bb1879f52ee11e6a1acdf39a0bc8c17f3c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/music/presentation/music_find.dart:101-112 | lib/features/music/presentation/music_find.dart:320-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/music/presentation/music_find.dart:101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/features/music/presentation/music_find.dart:113\u0060 calls \u0060watchMusicReach\u0060 and \u0060lib/features/music/presentation/music_find.dart:332\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/music_find.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"01274f47c5fbee549bebf3197f50ea783e32342d10fb6ae753887011b4d98118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/npm/presentation/npm_advanced_config_screen.dart:62-73 | lib/features/npm/presentation/npm_screen.dart:587-598 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/npm/presentation/npm_advanced_config_screen.dart:62\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_advanced_config_screen.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7841c891513ca9d9bc2727e9feb019b4b7807b047554ce57194ab589f6b65b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/npm/presentation/npm_screen.dart:378-389 | lib/features/npm/presentation/npm_screen.dart:428-439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/npm/presentation/npm_screen.dart:378\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b293a4480b439b93b5ab7c7cbe250a0c8c44eb1a436121d44c1f0a7039001742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/nzbget/presentation/nzbget_overview_screen.dart:207-218 | lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart:134-145 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/nzbget/presentation/nzbget_overview_screen.dart:207\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_overview_screen.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fa067d9934935b30f39ae103b1dda58c71ccaa22be1625a4e51376e6552bc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/onboarding/presentation/widgets/onboarding_found.dart:1030-1041 | lib/features/onboarding/presentation/widgets/onboarding_walk.dart:213-224 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/onboarding/presentation/widgets/onboarding_found.dart:1030\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c4dbdfb0fbcfe8fddc5feb1337a2332005ceaece1edb318a13018f2c3a7db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart:116-127 | lib/features/readarr/presentation/widgets/readarr_tiles.dart:122-133 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart:116\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8676446638cccbbd64503f0f3d5808b1e10c0e5a1a1e63ee23f688c1674aa844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/readarr/presentation/readarr_activity_screen.dart:131-142 | lib/features/readarr/presentation/readarr_history_screen.dart:133-145 \u2014 before extracting anything, compare \u0060lib/features/readarr/presentation/readarr_activity_screen.dart\u0060 and \u0060lib/features/readarr/presentation/readarr_history_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/readarr/presentation/readarr_activity_screen.dart:131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/readarr_activity_screen.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3296817860546ff21935b71b5874d5b6ddbbfe1134127f6f07eaa25b904db1a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/transmission/presentation/transmission_screen.dart:162-173 | lib/features/transmission/presentation/transmission_screen.dart:190-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/transmission/presentation/transmission_screen.dart:162\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_screen.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4786d15f92596ec100569efff36aabbd08af35b5d70cb9a8c26b786017ad7a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/truenas/presentation/shares/truenas_shares_screen.dart:150-161 | lib/features/truenas/presentation/shares/truenas_shares_screen.dart:284-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/truenas/presentation/shares/truenas_shares_screen.dart:150\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/features/truenas/presentation/shares/truenas_shares_screen.dart:162\u0060 calls \u0060TrueNasFormField\u0060 and \u0060lib/features/truenas/presentation/shares/truenas_shares_screen.dart:296\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/shares/truenas_shares_screen.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b884b909324dfbcc70ae26659f8476f4beac459a8a3996ba52476af6af8c9da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): lib/features/truenas/presentation/system/truenas_system_config_screens.dart:92-101 | lib/features/truenas/presentation/system/truenas_system_config_screens.dart:161-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/truenas/presentation/system/truenas_system_config_screens.dart:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/system/truenas_system_config_screens.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"99265bf0e179225b75ed030769925befb8b70b1f31963e2df52a17504766cfbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/features/truenas/presentation/system/truenas_system_config_screens.dart:279-291 | lib/features/truenas/presentation/virt/truenas_virt_detail_screen.dart:175-186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/truenas/presentation/system/truenas_system_config_screens.dart:279\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/system/truenas_system_config_screens.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e2aaf74fed0c9075f12915a5da8a28695763a542fa577381b7ff95b8c6fc85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): 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 \u2014 \u0060lib/features/truenas/presentation/apps/truenas_apps_screen.dart\u0060 and \u0060lib/features/truenas/presentation/storage/truenas_storage_screen.dart\u0060 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 \u2014 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 \u0060lib/features/truenas/presentation/apps/truenas_apps_screen.dart:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/apps/truenas_apps_screen.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98ec3eea5d1b8b7fd067e4bf44047948d50050fa0033c68eec861585c015ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): 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 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/npm/presentation/npm_screen.dart:1034\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67f9a27b71b8f39d214762444b70e743a753fd477f6d3a86bc72dd13614fd5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/core/widgets/service_overview.dart:1516-1528 | lib/core/widgets/service_overview.dart:1568-1578 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/core/widgets/service_overview.dart:1516\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"8140fe67a533cdc1e402dc9f9ca8174da71623e50d9f3bc260d4da614d121dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/features/activity/presentation/widgets/activity_download_row.dart:149-159 | lib/features/activity/presentation/widgets/download_table.dart:459-469 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/activity/presentation/widgets/activity_download_row.dart:149\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_download_row.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4ba1cf1d23037b3c10727da1b65c847c22f5a1b06bd4faeba753bdb6cbdb95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/features/bazarr/domain/models/bazarr_models.dart:582-592 | lib/features/bazarr/domain/models/bazarr_models.dart:598-608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/bazarr/domain/models/bazarr_models.dart:582\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/domain/models/bazarr_models.dart"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"1770f791a647da167a08bfd6cc2b462a72473721638ced59d4127640893436ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): lib/features/home/presentation/home_screen.dart:359-368 | lib/features/settings/presentation/requester_account_page.dart:206-216 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/settings/presentation/requester_account_page.dart:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/home_screen.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fb97a31cc9b706456b46efa5e44b213c3cffee29bdddb1dec86e54ed37d1fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/features/home/presentation/widgets/continue_watching_module.dart:71-82 | lib/features/home/presentation/widgets/requests_module.dart:72-82 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/home/presentation/widgets/continue_watching_module.dart:71\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/continue_watching_module.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"13abe1253676ca49aee46bc995b295c51b1332bbba05b1f03bbb6b007b6201a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/features/home/presentation/widgets/downloads_module.dart:424-434 | lib/features/services/presentation/dashboard_sections.dart:603-613 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/home/presentation/widgets/downloads_module.dart:424\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/downloads_module.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f39dbd70b7d12a95d09b08085fff7442b03fcf7d411c39cfed19e4518d5af34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/features/import/presentation/manual_import_provider.dart:123-133 | lib/features/import/presentation/manual_import_provider.dart:140-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/import/presentation/manual_import_provider.dart:123\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"384b34ad72e68977045db1a1a26c34034d642793f835de89dc84ae8fb5b6f4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/features/music/presentation/artist_page.dart:411-421 | lib/features/readarr/presentation/author_page.dart:168-178 \u2014 before extracting anything, compare \u0060lib/features/music/presentation/artist_page.dart\u0060 and \u0060lib/features/readarr/presentation/author_page.dart\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e11aa4040b07473f0eb5e4f2b5fdb15edcc67b7117d1bfb02610b511882996e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): lib/features/npm/presentation/npm_screen.dart:524-531 | lib/features/prowlarr/presentation/widgets/prowlarr_field_inputs.dart:341-351 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/npm/presentation/npm_screen.dart:524\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"657047329a965c763239ca1cbbdf09a22ba1de25f294e58212200967d01cb515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/features/nzbget/presentation/nzbget_screen.dart:295-305 | lib/features/transmission/presentation/transmission_screen.dart:347-357 \u2014 before extracting anything, compare \u0060lib/features/nzbget/presentation/nzbget_screen.dart\u0060 and \u0060lib/features/transmission/presentation/transmission_screen.dart\u0060 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 \u0060lib/features/nzbget/presentation/nzbget_screen.dart:295\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_screen.dart"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ca25724f84309e466d8c9ccc6f1b4410939711f42e127715dd5a10fdce4f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:314-323 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:265-275 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:314\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca5b8dd9c6af8f2144f7ff3d38c86b1cb5a4232393a9d7a7218df2626b14573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/features/prowlarr/presentation/prowlarr_library_screen.dart:436-446 | lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart:118-128 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/prowlarr/presentation/prowlarr_library_screen.dart:436\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_library_screen.dart"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b2fd14a8ad93c825453a563b2beb9645200b1ce6b527588d324adf4dbd8cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/features/unraid/presentation/unraid_screen.dart:689-699 | lib/features/unraid/presentation/unraid_screen.dart:850-861 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/unraid/presentation/unraid_screen.dart:689\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/presentation/unraid_screen.dart"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f43b18f6ad13f46248d523f5dc97eb755b19c5335d14edf01b17fcbe58cfdde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): 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 \u2014 there are 4 copies across 2 file(s) \u2014 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 \u0060lib/features/npm/presentation/npm_advanced_config_screen.dart:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_advanced_config_screen.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4419a2d772371595d01f96da0703c2f0df7ab681eef1e8c76d4bdb7d0d1d7a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): 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 \u2014 before extracting anything, compare \u0060lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart\u0060 and \u0060lib/features/readarr/presentation/widgets/readarr_tiles.dart\u0060 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 \u0060lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart:260\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c3094110393cdeefe2004f0bf86a889f153ef864631eefe55159dd48a95394"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): 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 \u2014 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 \u2014 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 \u0060lib/features/unraid/presentation/unraid_screen.dart:328\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/presentation/unraid_screen.dart"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbb4dfcd118f3c3be23b2918ab371211ecbb93c9fca60d37c9597c4e8cbc645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/core/widgets/content_card.dart:174-183 | lib/core/widgets/media_poster_card.dart:99-108 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/content_card.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11fa532d4995e52b2d9abc552994ca1bb530c59a39864b4f8f03609b9cd3e00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/core/widgets/service_overview.dart:262-271 | lib/features/home/presentation/widgets/home_module_frame.dart:211-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/core/widgets/service_overview.dart:262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e716f5c897e44573879a7398ff74841a9f4e2745059bec437e7cb7349de52656"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): lib/core/widgets/service_overview.dart:1292-1299 | lib/core/widgets/service_overview.dart:1356-1365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/core/widgets/service_overview.dart:1292\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_overview.dart"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e8903703d27b43f9d2da55fdadef9deff02227e1b1e59e801ed35e93c1f61c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): lib/features/activity/presentation/activity_needs_you_page.dart:51-58 | lib/features/activity/presentation/activity_page.dart:552-561 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_needs_you_page.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"397036cbada93882236d1e31643255813af185d079a51c8d626c7053f64d009f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_wanted_screen.dart:338-347 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart:277-286 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/bazarr/presentation/bazarr_wanted_screen.dart:338\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_wanted_screen.dart"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f989376bb68de254c4febb5e955db3fc514cda3b1f632b5f7518661cca231b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/features/discover/presentation/widgets/calendar_agenda.dart:360-370 | lib/features/media/presentation/media_parts.dart:98-107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/discover/presentation/widgets/calendar_agenda.dart:360\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_agenda.dart"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f78ca5b06f5d44e9f69ca5fe553e88b54aead66755a1e858bbfd52554dc60d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lib/features/discover/presentation/widgets/discover_door.dart:375-384 | lib/features/discover/presentation/widgets/discover_door.dart:420-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/discover/presentation/widgets/discover_door.dart:375\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/discover_door.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa2ae33c060c94379bb70bada33d5821af539f9444784b5dee997d6752fac12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/features/media/presentation/media_add_sheet.dart:333-342 | lib/features/music/presentation/lidarr_add_artist_sheet.dart:202-211 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/media/presentation/media_add_sheet.dart:333\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/features/music/presentation/lidarr_add_artist_sheet.dart:200\u0060 calls \u0060_Header\u0060, \u0060SizedBox\u0060 and \u0060lib/features/media/presentation/media_add_sheet.dart:332\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_add_sheet.dart"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d753f693bebbe9611f2cee8a3b812388763749e4ac0b9e54eb49d7c8a2b4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/features/media/presentation/media_copy_panel_card.dart:194-203 | lib/features/media/presentation/media_decision_card.dart:67-76 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/media/presentation/media_copy_panel_card.dart:194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_copy_panel_card.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44dcd51fdd3fe0039bc1a209b061514e866cedf3c01fbb4bf4abb3f874c7bbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/features/music/presentation/artist_page.dart:813-822 | lib/features/readarr/presentation/author_page.dart:386-396 \u2014 before extracting anything, compare \u0060lib/features/music/presentation/artist_page.dart\u0060 and \u0060lib/features/readarr/presentation/author_page.dart\u0060 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 \u0060lib/features/music/presentation/artist_page.dart:813\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5ad7caaadb94ccc5973b471de6a986aaf727a136d6c0fd580f2a0d8a6b4d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/features/prowlarr/domain/models/prowlarr_models.dart:264-273 | lib/features/prowlarr/domain/models/prowlarr_models.dart:796-805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/domain/models/prowlarr_models.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fbf82f330a5315af912a69626fca308db8bdf5ee724f08f7d530e983558fc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:81-90 | lib/features/prowlarr/presentation/prowlarr_tags_screen.dart:101-110 \u2014 before extracting anything, compare \u0060lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart\u0060 and \u0060lib/features/prowlarr/presentation/prowlarr_tags_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b0039541ad05831b1cc8510cf64538bfe6c4f12bac3edc6de6d8e3049fc506"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/features/qbittorrent/data/qbittorrent_service.dart:50-59 | lib/features/qbittorrent/data/qbittorrent_service.dart:65-74 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/data/qbittorrent_service.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb13746e2e8989174ba77888f770122a5be03ef2eded259c5093f6bc758486e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/features/dockge/presentation/dockge_screen.dart:61-69 | lib/features/npm/presentation/npm_screen.dart:221-229 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/dockge/presentation/dockge_screen.dart:61\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/presentation/dockge_screen.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31a844b26338a88c5977ad23adfa0d1873e1379b047ae2770173b8b66df661c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/features/import/presentation/manual_import_progress_screen.dart:303-311 | lib/features/import/presentation/manual_import_review_rows.dart:717-725 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060lib/features/import/presentation/manual_import_progress_screen.dart:303\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_progress_screen.dart"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbf8c475dde89d8509bdaf4f8bf856bb8febcca17898e9dfd9d40905f158a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/features/movies/presentation/movies_screen.dart:145-153 | lib/features/series/presentation/series_screen.dart:148-156 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/movies/presentation/movies_screen.dart:145\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/movies_screen.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fe37eeec14cca36548363153cd06230c1bda34b407537c4759c28ed57a2e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/features/qbittorrent/presentation/torrent_detail_screen.dart:490-498 | lib/features/qbittorrent/presentation/torrent_detail_screen.dart:618-626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/qbittorrent/presentation/torrent_detail_screen.dart:490\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/torrent_detail_screen.dart"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"2addead93c6baab1624e3787a7c493f7af05a1baf10cf5535525f1d442e7ad90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart:122-130 | lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart:173-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart:122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c96f9aef774f4b8c9026fc43fd176cc9dfe64c06cbaa6bb531b31c2959f284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): lib/core/widgets/floating_bottom_nav_bar.dart:476-482 | lib/core/widgets/floating_nav_rail.dart:104-111 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/core/widgets/floating_bottom_nav_bar.dart:475\u0060 calls \u0060barHeightFor\u0060 and \u0060lib/core/widgets/floating_nav_rail.dart:103\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/floating_bottom_nav_bar.dart"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde712548acc53b0ce5740a1a0492ed7b076270c3d812c3a37a52b6c729f7167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/features/activity/presentation/activity_page.dart:996-1005 | lib/features/home/presentation/widgets/downloads_module.dart:617-624 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/activity/presentation/activity_page.dart:996\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f90ec00b4994eb00d3b022202b4598d25faecfda0f5ba9f01d99a4f2974d86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/features/activity/presentation/widgets/activity_download_row.dart:335-342 | lib/features/discover/presentation/widgets/search_row.dart:844-851 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_download_row.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c5af201955e0a3b8b2504ab2890db22e9f95c242fa2010f2187869275dbc98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/features/activity/presentation/widgets/stuck_download_card.dart:101-110 | lib/features/home/presentation/widgets/downloads_module.dart:547-554 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/activity/presentation/widgets/stuck_download_card.dart:101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/stuck_download_card.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"47295802a6f1cf68bb83465948b32d6e3e56250abc43486e03d82df7447a235c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/features/discover/presentation/seerr_overview_screen.dart:145-153 | lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:104-111 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/discover/presentation/seerr_overview_screen.dart:145\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/seerr_overview_screen.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b9c9799ee188927b1ad4992b2c36df8c46d740e60f4a7d7d6f1f9304f2f856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/features/media/presentation/media_page.dart:3304-3311 | lib/features/media/presentation/media_series_manage.dart:676-683 \u2014 before extracting anything, compare \u0060lib/features/media/presentation/media_page.dart\u0060 and \u0060lib/features/media/presentation/media_series_manage.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/media/presentation/media_page.dart:3304\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e275559daa793a12eb518b79dbacf8c2f883080c570e4578552ed45bc8d7a32d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/features/media/presentation/media_parts.dart:276-283 | lib/features/media/presentation/media_parts.dart:328-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/media/presentation/media_parts.dart:276\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_parts.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"06af8963b070c0fbd5b7f11c3f136fffd70f74aeb06cdf5ab35676ccc8fe04b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/features/npm/presentation/npm_overview_screen.dart:189-197 | lib/features/qbittorrent/presentation/qbittorrent_overview_screen.dart:172-179 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/npm/presentation/npm_overview_screen.dart:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_overview_screen.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8014215c2ba62927ca0a105ef9d59954f9c5d71a895549a2a0af47dc93bc7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/features/transmission/presentation/transmission_overview_screen.dart:151-160 | lib/features/transmission/presentation/transmission_overview_screen.dart:291-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/features/transmission/presentation/transmission_overview_screen.dart:151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_overview_screen.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5241d25c80ddf1a99ede9dc08426f1bc7dea95d3810c6d32943456190af2772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): 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 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_needs_you_page.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b922ef7276521b450a50d40b8467cd1736c4d4b71e800bea4a52fd12b6c047f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/features/bazarr/domain/models/bazarr_models.dart:86-92 | lib/features/bazarr/domain/models/bazarr_models.dart:139-145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/domain/models/bazarr_models.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a562d09ff293f4680665aac43ef94d2cd45537bf4ea24bb2166fa71ff76d184a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:143-149 | lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart:195-201 \u2014 before extracting anything, compare \u0060lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart\u0060 and \u0060lib/features/prowlarr/presentation/widgets/prowlarr_provider_form_sheet.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart:143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab3460d54eeb897763ca1bbd6fcc967acb83750f641627673f61f57bebc8c9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/features/prowlarr/domain/models/prowlarr_models.dart:256-261 | lib/features/prowlarr/domain/models/prowlarr_models.dart:792-797 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/domain/models/prowlarr_models.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1142e79e6199bbb3f0f95635932f74d3b204a7f095496697a610e29ac433157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): 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 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060lib/features/settings/presentation/widgets/settings_master_detail.dart:254\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/settings_master_detail.dart"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df466c738d6b31cc65e627854edb9b9db297e754c5e634a67f3cfcc5c3475dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/features/bazarr/domain/models/bazarr_models.dart:96-100 | lib/features/bazarr/domain/models/bazarr_models.dart:149-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/domain/models/bazarr_models.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c92001ff49939599dab3aae8b61ce3340afc7a4390e1703d59d2f9c72427e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/features/truenas/domain/models/data_protection.dart:75-79 | lib/features/truenas/domain/models/data_protection.dart:81-85 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/domain/models/data_protection.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a38a1fc4b4ca24ff0f923fd1368b7ff8ab226d15c2eb472518dfd6dd55115c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_overview_screen.dart:129-153 | lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:168-192 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_overview_screen.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b14439a16d33129659173eb417375e5d4bbfaf9533574cf57edfd2b23852b0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/core/models/media_preview.dart:85-90 | lib/features/music/domain/models/lidarr_album.dart:46-52 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/models/media_preview.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5578c9b88195386a58d32893e8e2caa5e9e2bc354c5521e1ad7ab654e806a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/core/widgets/brief_failure_line.dart:39-46 | lib/core/widgets/not_configured_placeholder.dart:143-150 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/brief_failure_line.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aebd5b1d81449e5e91b215e8eaa68765efc3f0a6c1ff44bf1f5ed3782bf0b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_history_screen.dart:170-174 | lib/features/prowlarr/presentation/prowlarr_history_screen.dart:126-130 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_history_screen.dart\u0060 and \u0060lib/features/prowlarr/presentation/prowlarr_history_screen.dart\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_history_screen.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa9da858256c524adaf617f56fc525160554a34e5c0584f735a8e2026806c31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_library_screen.dart:137-142 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:151-156 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart\u0060 and \u0060lib/features/bazarr/presentation/bazarr_wanted_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_library_screen.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e738469bef4ffb96d067c66b784a9e98ff5c64795876e738df4a3d7681746636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/features/bazarr/presentation/bazarr_library_screen.dart:202-209 | lib/features/bazarr/presentation/bazarr_wanted_screen.dart:216-223 \u2014 before extracting anything, compare \u0060lib/features/bazarr/presentation/bazarr_library_screen.dart\u0060 and \u0060lib/features/bazarr/presentation/bazarr_wanted_screen.dart\u0060 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_library_screen.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b3b6e8e19281a81b03abf76b55aae03bce60738af7c507e1e587dfc3e360dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/features/jellyfin/data/media_browser_client.dart:668-673 | lib/features/plex/data/plex_client.dart:809-814 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b43002254ac5f2be2a34290f01bbcd1173a209addf2f5ecbca498f25b1df82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): 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 \u2014 before extracting anything, compare \u0060lib/features/music/presentation/artist_page.dart\u0060 and \u0060lib/features/readarr/presentation/author_page.dart\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"570d776c7569ad40f2a6185aaddae07392a58cf115739f3996248f5eab5b4783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/features/readarr/presentation/readarr_activity_screen.dart:44-52 | lib/features/readarr/presentation/readarr_history_screen.dart:33-41 \u2014 before extracting anything, compare \u0060lib/features/readarr/presentation/readarr_activity_screen.dart\u0060 and \u0060lib/features/readarr/presentation/readarr_history_screen.dart\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/readarr_activity_screen.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd4f74ad50f84dae5da86ed164e996b50e8ff493d075379c81f9f8951b24e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): 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 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/collection_page.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"477c8ebb028f7f8951e852cb0c9392db39a7493a3ed376deaf537dee7dfbe07d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/features/pairing/presentation/pair_code.dart:62-68 | lib/features/release_search/presentation/release_search_sheet.dart:386-392 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/presentation/pair_code.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7212829c51bc89dcfd545773e3eacda1a5400997653fddbc4c678a6acc1856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/features/prowlarr/presentation/prowlarr_overview_screen.dart:47-59 | lib/features/unraid/presentation/unraid_overview_screen.dart:71-86 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_overview_screen.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea994781c7028703a27777854660fc786ec8a351ecac26b2a36a73fbd2497c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart:766-776 | lib/features/tracearr/presentation/tracearr_owner_sign_in_flow.dart:352-362 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"2796b7fedcdda5eee158a136a74fd98a32ae2130d85d5fc7b2b76b30cbcfdd7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/features/truenas/data/apps_api.dart:11-16 | lib/features/truenas/data/dataset_api.dart:27-32 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/data/apps_api.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"808066c21d1b69311b6e7a0ca71ce8ecf2def238658ba9a0c408868503689b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49\u201356 lines \u00D7 2): ios/Runner/AppDelegate.swift:295-350 | macos/Runner/MainFlutterWindow.swift:347-395 \u2014 before extracting anything, compare \u0060ios/Runner/AppDelegate.swift\u0060 and \u0060macos/Runner/MainFlutterWindow.swift\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ed1cf98697f3c63daf2fafaeae6e2c9db73647ee5e4614dfea644be1342679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): ios/Runner/AppDelegate.swift:57-83 | macos/Runner/MainFlutterWindow.swift:89-115 \u2014 before extracting anything, compare \u0060ios/Runner/AppDelegate.swift\u0060 and \u0060macos/Runner/MainFlutterWindow.swift\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"42052c98dcc9143321bdf6ea3fb9a1cc8836e181191a1c80760a168ed55b0a25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): ios/Runner/AppDelegate.swift:237-257 | macos/Runner/MainFlutterWindow.swift:275-295 \u2014 before extracting anything, compare \u0060ios/Runner/AppDelegate.swift\u0060 and \u0060macos/Runner/MainFlutterWindow.swift\u0060 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 \u0060ios/Runner/AppDelegate.swift:237\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b776f71864cfdb0bec77a3dc179725e5bf57afa5899fad9a3e196e06b222aeef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): ios/Runner/AppDelegate.swift:135-151 | macos/Runner/MainFlutterWindow.swift:186-202 \u2014 before extracting anything, compare \u0060ios/Runner/AppDelegate.swift\u0060 and \u0060macos/Runner/MainFlutterWindow.swift\u0060 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 \u0060ios/Runner/AppDelegate.swift:135\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87ecde42743847512f6a91fbaa35df7b2caa61065a5b955fd4131b0b80128eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): ios/Runner/AppDelegate.swift:192-204 | macos/Runner/MainFlutterWindow.swift:243-255 \u2014 before extracting anything, compare \u0060ios/Runner/AppDelegate.swift\u0060 and \u0060macos/Runner/MainFlutterWindow.swift\u0060 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 \u0060ios/Runner/AppDelegate.swift:192\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"586f9a7c67dbf358aaee646d9edd146668ccf5551dd53b959116f2754358019c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ios/Runner/AppDelegate.swift:353-363 | macos/Runner/MainFlutterWindow.swift:398-408 \u2014 before extracting anything, compare \u0060ios/Runner/AppDelegate.swift\u0060 and \u0060macos/Runner/MainFlutterWindow.swift\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc687d3b201f6a807c1de4608c3cc944b5d635f5b3aa3dc622ab5656c626ef79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/demo/world/fakes/arr_fakes.dart:399-406 | lib/demo/world/fakes/arr_fakes.dart:907-911 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/arr_fakes.dart"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d369730cfa4ab8e40d4a7f12823bcde77eaec6d8ef9640dd3677049ddfd9cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/demo/world/fakes/client_fakes.dart:310-313 | lib/demo/world/fakes/infra_fakes.dart:400-403 \u2014 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 \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/client_fakes.dart"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfee13dca6c3dfff80834a48b1da2a1375369f6d819ac1ca6d77064680ef87b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/demo/world/fakes/media_fakes.dart:2003-2014 | lib/demo/world/fakes/media_fakes.dart:2378-2388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/demo/world/fakes/media_fakes.dart:2003\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/media_fakes.dart"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df5393fc14f21a25bb74a37617ac61b4fa4e6c1eaf6d10e577a72d8c6c5bdf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/demo/world/fakes/arr_fakes.dart:737-747 | lib/demo/world/fakes/arr_fakes.dart:1304-1314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/demo/world/fakes/arr_fakes.dart:737\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/arr_fakes.dart"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35f3c03a0fb609cf1c302f0597b87fc87286b799912c4ac15c664ac69d833e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/demo/world/fakes/arr_fakes.dart:594-603 | lib/demo/world/fakes/arr_fakes.dart:1204-1213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/demo/world/fakes/arr_fakes.dart:594\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/arr_fakes.dart"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e72b83a4d9563b3310b78538e99e2a575c7d605b17af7800dae05a4eb77a47c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lib/demo/world/fakes/arr_fakes.dart:2161-2170 | lib/demo/world/fakes/arr_fakes.dart:2550-2558 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/demo/world/fakes/arr_fakes.dart:2161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/arr_fakes.dart"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ec92d365188828622e32cb7fbdb95d588feebb4399e55753ee0dc648a808da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/demo/world/fakes/arr_fakes.dart:2824-2832 | lib/demo/world/fakes/arr_fakes.dart:2845-2853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/demo/world/fakes/arr_fakes.dart:2824\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/arr_fakes.dart"},"region":{"startLine":2824}}}],"partialFingerprints":{"codehealthFindingId/v1":"45176135b30f1e6f17fa3f527c3e58932f815d83faa493497e12fdf039884fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/demo/world/fakes/arr_fakes.dart:638-645 | lib/demo/world/fakes/arr_fakes.dart:1224-1231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/demo/world/fakes/arr_fakes.dart:638\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/arr_fakes.dart"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c69b6c899034e41720f5dbe1ae4824bbd48005165704b55cd0f53e50ae557d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/demo/world/fakes/media_fakes.dart:960-966 | lib/demo/world/fakes/media_fakes.dart:1131-1137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/media_fakes.dart"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57e708249fa32c226b0eef0c6a67cc30cd29d2b405bc9d62fd1a4b5a5b8f48d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/demo/world/fakes/arr_fakes.dart:583-590 | lib/demo/world/fakes/arr_fakes.dart:1195-1200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/demo/world/fakes/arr_fakes.dart:583\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/arr_fakes.dart"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7417bff0ce8a3f422a7d0968cb7c294ccc352c3a830da55787316193e0196c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/demo/world/fakes/arr_fakes.dart:1368-1373 | lib/demo/world/fakes/arr_fakes.dart:2181-2188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060lib/demo/world/fakes/arr_fakes.dart:1368\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/arr_fakes.dart"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62d7ad40e277bd4ab503f4197c11e0a5821662057e1bb40136197daed4f9d0e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EmbyDialect (LCOM4 17): EmbyDialect\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/emby/data/emby_dialect.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e599c6dd41a3a97c6510eb69b402eef4f389c3c1011555b731106dab321d686a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LidarrService (LCOM4 15): LidarrService\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/data/lidarr_service.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0380596732ca7a9d780b8dce28dc5bcb4c854c1f55b03bf50d1f637debb7052b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SidePaneSlotRoute (LCOM4 14): SidePaneSlotRoute\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/side_pane_route.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a732555c8229b5660b016a12f0a5250be21e52959e06c76854458ff1fb3610fe"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _FakeResponse (LCOM4 11): _FakeResponse\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/profile_network.dart"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"281cb98d5b2208b2315997fa3edbf1ab56b60999126999918b15ade7a4a9a163"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ReadarrService (LCOM4 11): ReadarrService\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/data/readarr_service.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dc10a2f8d27202d6cedf76465efffa1fe4fb118c19fc17746687b31438d832"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SonarrService (LCOM4 9): SonarrService\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/series/data/sonarr_service.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2478be8c177188815a34511329c8a84f5d7366353a1095a56a610028d524b7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ManualImportFlowNotifier (LCOM4 8): ManualImportFlowNotifier\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6485f79323a6342a7561f2f52ffaf58fda60ca06bec6fefbfda1db9dcbdb6cff"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _FakeRequest (LCOM4 7): _FakeRequest\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/profile_network.dart"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2f52e6450b97ba852cc0d63e133aacb00eb204745be3dfa4994623e25e4723"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ManualImportFlowState (LCOM4 7): ManualImportFlowState\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc8587be992b664c56b77e70012fb21d74fcc58f79dcf5edef004e08ec22e06"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RadarrService (LCOM4 7): RadarrService\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/data/radarr_service.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f3df6707809e984b9f3640be9c95d3ad9ab6434f8721046bc28477e3a5a2ab"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ArrLife (LCOM4 6): ArrLife\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/arr_life.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6001bbf10af2fe8d959a6e71775c6b347281a08134af9c1dbcce1a50379646"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _RenderFade (LCOM4 5): _RenderFade\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/ambient_scaffold.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde75c30342225e8bc4ed939b8bb2b700a63b6efae79fc8ca0c8fe7a309e05df"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _RenderScrim (LCOM4 5): _RenderScrim\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/glass_app_bar.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"faed2abc8a6609c4882f730e97a808333587fc66fd44f07f3d187c83a181b80d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DiscoverDetailViewModel (LCOM4 5): DiscoverDetailViewModel\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/discover_detail_view_model.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ea5572382dd6325bd473cc6997515fab8efb772eebf049cdb6c875df426466"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RequestFormNotifier (LCOM4 5): RequestFormNotifier\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/request_form_provider.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0befc78adba272f66fbd284cf9e3c8dce7f205f9aca17ab8e39718d2d98b7f27"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RenderBesideOrBelow (LCOM4 4): RenderBesideOrBelow\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/beside_or_below.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb79681d213f019765c432c81015f800f9b73e3d493cd0e1eadd2ac1ad43c7c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WebSocketLink (LCOM4 4): WebSocketLink\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fake_socket.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9032d35bf790fdf130aedbbb838b1c6e58ed8d1029dcbf19ed90e2a9cf0593b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _FakeHeaders (LCOM4 4): _FakeHeaders\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/profile_network.dart"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5569f1f55813f5ecc81d24662c03acbe6446fd2112206a996fc953912f5c082"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ActivityFeed (LCOM4 4): ActivityFeed\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_provider.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a23460f62b7058ec93119d779775d247a2f7365f29d01eccecb511fa632812b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BazarrProviderStatus (LCOM4 4): BazarrProviderStatus\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/domain/models/bazarr_models.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a305f668c959b4de38e7700c0eddc33e91d4c36345752d3c99c65d69920bcc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StackLights (LCOM4 4): StackLights\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/domain/stack_lights.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"56315089c8a4df5e0ec229a18b8c96af2c5034a752aba19611a5473cb05d2fa7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RenderBalancedColumns (LCOM4 4): RenderBalancedColumns\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/balanced_columns.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d91d406c30ff12f71acaa5e94f3fd7155a1d05063a7a20009e503dc0072e33e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _SeerrIssueThreadScreenState (LCOM4 4): _SeerrIssueThreadScreenState\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/seerr_issue_thread_screen.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c476a8265faf1aa7fb08d3ff2e933f8681573322408a1d0a81bd13b2e72082aa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OutsideShelf (LCOM4 4): OutsideShelf\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/data/outside_shelf.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"312dac1ddc88e7192861a42eeb674cec3c063f1e285513309107a094e183d1ae"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Torrent (LCOM4 4): Torrent\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/domain/models/torrent.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb061c05afcb0f7b7b612ca63b5495398294a7fea1558e38d30231dd7e6d134a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GlobalSearchServiceResults (LCOM4 4): GlobalSearchServiceResults\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/search/domain/global_search_result.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34abb1f063be8e6688a7d57e512ab6a8a117dba8a83137b9638c443a67027a5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ArrAddFormNotifier (LCOM4 4): ArrAddFormNotifier\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/search/presentation/arr_add_form_provider.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"797cdf5df538febbad7acb1e62a5b2753a4882cac90f5b44874c1adbac402221"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _ServiceSettingsScreenState (LCOM4 4): _ServiceSettingsScreenState\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0196241ff7c8146d076d5ea12ca878edf1fff273cda172d84d9df3eff93e3d2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UnraidException (LCOM4 4): UnraidException\u0027s 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 \u2014 your repository\u0027s 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 \u2014 and which would otherwise dominate this list \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/data/unraid_client.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c30fb62c18c9e233a344e237a2efd5686237b8dc47e00f4e79ea5bdae3dc8f"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf5b5e6b5d6a73a4b624cee14e3bf6b45b84f8d5fa2467e179d8d739c9c2a7b0"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/media/presentation/media_page.dart: 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 \u2014 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 \u2014 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/media/presentation/media_page.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"9159ae0d4bf5ff743ddb3cffac136449a97cebee4bb6c340bbccb8acf6e58e2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/demo/world/fakes/media_fakes.dart: 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 \u2014 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 \u2014 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/demo/world/fakes/media_fakes.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/media_fakes.dart"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd92d47d5e401bd679d11ce54ca7a83e68f8236280658fa88792b54560b69d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/demo/world/fakes/arr_fakes.dart: 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 \u2014 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 \u2014 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/demo/world/fakes/arr_fakes.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/arr_fakes.dart"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eaf386e022391a8a8426f23567e82d9934f2d6f4fc5814182b9c5d589ac0f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/settings/presentation/service_settings_screen.dart: 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 \u2014 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/settings/presentation/service_settings_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/service_settings_screen.dart"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71ded8b5dfbf9369f01031851531e4d5a189ee23b1660afbaa7e15199a1c298"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/widgets/media_browse_scaffold.dart: 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 \u2014 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/media_browse_scaffold.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fbe59f763188a57fda0c4dae382af05d8601b127a317de5fd7bffbda3406dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/services/presentation/dashboard_sections.dart: 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 \u2014 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/services/presentation/dashboard_sections.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/dashboard_sections.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1689751d6705c8666c0f79dd7e9fba34c362af125a562025adc71d41949480df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/services/presentation/service_matrix.dart: 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 \u2014 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/services/presentation/service_matrix.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"7087ed063a843c3f84c8e8c29f09af5204ec5b4127b92513b75d37a507574e5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/activity/presentation/activity_page.dart: 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 \u2014 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 \u2014 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/activity_page.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_page.dart"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"09771030192a98da2cb4a3fc9e0474e7e412e66df48c0f607022014dce6b3f36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/shell/presentation/shell_screen.dart: 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 \u2014 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 \u2014 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/shell/presentation/shell_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/shell_screen.dart"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56fac9941d182ef06845fcbc52b54c947ce209f0fa01e5abcbd82665a32ea44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/onboarding/presentation/widgets/onboarding_walk.dart: 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 \u2014 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/onboarding/presentation/widgets/onboarding_walk.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"80605407c70ffd7a70a5405ecc3498b36921e124ad8bc95dddf1ff670c9152ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/plex/data/plex_client.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/plex/data/plex_client.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef9cc3937d0fd5c9c38579b67989e9304875cac70cb378d6a9f5998a8f931c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/onboarding/presentation/onboarding_screen.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/onboarding/presentation/onboarding_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3edcf5557e7411433cb47b7a1ceaf74ba78df50f6cd76ebe6a952be7a56eba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/settings/data/settings_service.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/settings/data/settings_service.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"401caa731d88fe2aad11a5f88c7d2c89dad5c3654c2b42dcfa954ed1b3db73e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/onboarding/presentation/widgets/onboarding_parts.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/onboarding/presentation/widgets/onboarding_parts.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_parts.dart"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d7b7f28bcf476a89c8ec515577abfd4ced50dd72df9a0aecfff5e9fc790135"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/discover/presentation/discover_page.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/discover_page.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/discover_page.dart"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a7629dfba2d046741784dc76654415c561f682f0122ddacdaaa9f3ad96e1a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/shell/presentation/desktop/desktop_shell.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/shell/presentation/desktop/desktop_shell.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/desktop_shell.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39aba18a7e6d57bea451ad30f87eda71c19896beb023317910fba46b6523f74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/music/presentation/artist_page.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/music/presentation/artist_page.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc58356938f27883f6a5f5d14c446b3d9539525b141591e92015bfbb4720c0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/discover/presentation/calendar_page.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/calendar_page.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/calendar_page.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fee1b95cca3537983b1c2d82030bfcfa31737148eced218f75946e5a67ccb17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/widgets/service_offline_state.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/service_offline_state.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_offline_state.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bf28cb16ede1635449b1245182db188211d6562a2be82b4b80e80e9e5cfb92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/demo/world/profile_network.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/demo/world/profile_network.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/profile_network.dart"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31029f0222be5bc3a423c7289c395268573e0d7d3069f69a5aba4b2d67400e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/discover/presentation/widgets/request_bottom_sheet.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/widgets/request_bottom_sheet.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/request_bottom_sheet.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d18bf293219231bd18bdd23ca46459c42cb9a0db7ee5d9058add6df85c79c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/discover/domain/library_calendar.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/domain/library_calendar.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/library_calendar.dart"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dc8fc2102ae10ae37ee7c7678a9cb86187d0721b38af61626b9a391bab8434"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/prowlarr/presentation/prowlarr_library_screen.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/prowlarr/presentation/prowlarr_library_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_library_screen.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b812549ebc6a81f9fe5b466673981ca74a15fa9dafcf5b2b8ae5e41ca883700"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/home/presentation/widgets/downloads_module.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/home/presentation/widgets/downloads_module.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/downloads_module.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc0e3bc786f8e16bd35dc048673bf59976911e5a2c61c51fc2dfae56d0541e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/demo/world/fakes/client_fakes.dart: 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/demo/world/fakes/client_fakes.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/client_fakes.dart"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"831ce0f07a9130e3a542e605f474e40d5f2bb5023c9ef07434662edcf1f6bb68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/import/presentation/manual_import_review_screen.dart: lib/features/import/presentation/manual_import_review_screen.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _ManualImportReviewScreenState._buildRows at line 445. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/import/presentation/manual_import_review_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5195b558d3f7c5fe17ba365532c8830907b488b99b129c8be7564b20b40add"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart: lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _AddTorrentFormState.build at line 84. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/add_torrent_button.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b878aa8eb4dd1bcbac2fddfd28715b41f61f192188182441dc1e4a12dcb92d31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/import/presentation/manual_import_review_rows.dart: lib/features/import/presentation/manual_import_review_rows.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in MatchedFileRow.build at line 281. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/import/presentation/manual_import_review_rows.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_rows.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2629a352a7e72de24e1b0dfea0b37067de24434dec2aa4da9447f3ef57adf2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/home/presentation/widgets/continue_watching_module.dart: lib/features/home/presentation/widgets/continue_watching_module.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in HomeContinueWatchingModule.build at line 45. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/home/presentation/widgets/continue_watching_module.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/continue_watching_module.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd03de41d3a19e1cf0020c454da9b57c83b74232b8d3804564ae6b6f6dd556c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/shell/presentation/desktop/desktop_nav_rail.dart: lib/features/shell/presentation/desktop/desktop_nav_rail.dart changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _SidebarItemState.build at line 347. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/shell/presentation/desktop/desktop_nav_rail.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/desktop_nav_rail.dart"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"174a3390977677c25f38c6d84244375a4a7213c9fdcf3e9108d6424b9d452fc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/discover/presentation/widgets/calendar_agenda.dart: lib/features/discover/presentation/widgets/calendar_agenda.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in CalendarRow.build at line 74. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/widgets/calendar_agenda.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_agenda.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa53360f4bf0a5ac926154393e4f7c3947ff711212ced390fc13b8f4e84411b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/dockge/data/dockge_client.dart: lib/features/dockge/data/dockge_client.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DockgeClient._connect at line 306. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/dockge/data/dockge_client.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/data/dockge_client.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e488ba56cc85f12589eab430e2d879e71bb3424d32aecee87457cd9f8ea440"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/activity/presentation/widgets/activity_download_row.dart: lib/features/activity/presentation/widgets/activity_download_row.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ActivityDownloadRow.build at line 69. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/widgets/activity_download_row.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_download_row.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c958275f54a0771acfd2731af817e092300de255ed7e430d50bea68093f64e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/discover/presentation/widgets/search_row.dart: lib/features/discover/presentation/widgets/search_row.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in SearchRow.build at line 267. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/widgets/search_row.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/search_row.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdf29f70b203eb13868e9caed8347809bb44dec22b7094372272d8c185ba420"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/unraid/domain/models/unraid_models.dart: lib/features/unraid/domain/models/unraid_models.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in UnraidDockerContainer._parse at line 619. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/unraid/domain/models/unraid_models.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/domain/models/unraid_models.dart"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fae980571da3d48b69c021d969ffac4f85dfa6340844e5811bd469a0cdcdeac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart: lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in BazarrMovieDetailScreen.build at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_movie_detail_screen.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a388467828862e4acc2f8440ce4b9af7d59da5893c140d4112b144880936df31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/widgets/pressable_scale.dart: lib/core/widgets/pressable_scale.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _PressableScaleState.build at line 123. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/pressable_scale.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/pressable_scale.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f146a6a5c6208b4c8e7c548272da186039427639cf0223e4621e799b5a257b30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/discover/presentation/widgets/catalog_title_row.dart: lib/features/discover/presentation/widgets/catalog_title_row.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in CatalogTitleRow.build at line 97. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/widgets/catalog_title_row.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/catalog_title_row.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67e9ba1f087da16b49aaee7388724ccd1879426cd575629c160c4342a56e986"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/network/redirect_guard.dart: lib/core/network/redirect_guard.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SameOriginRedirectInterceptor.onResponse at line 114. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/network/redirect_guard.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/redirect_guard.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66ae2304b898d65e1d0219e4625e925139889e17477941a29b95c1dc098f476"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/bazarr/presentation/bazarr_series_detail_screen.dart: lib/features/bazarr/presentation/bazarr_series_detail_screen.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in BazarrSeriesDetailScreen.build at line 28. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/bazarr/presentation/bazarr_series_detail_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_series_detail_screen.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3271f07c34c127998a168700b6f60e44f7e8fbb66cc4449b34c16b2937194a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/import/presentation/manual_import_provider.dart: lib/features/import/presentation/manual_import_provider.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ManualImportFlowNotifier.startBlocked at line 509. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/import/presentation/manual_import_provider.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a01951dec407b31466dfcbdffc2ae100e38ebf434d7f951545663c4739db1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/demo/world/fakes/infra_fakes.dart: lib/demo/world/fakes/infra_fakes.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in DockgePeer.onText at line 285. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/demo/world/fakes/infra_fakes.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/demo/world/fakes/infra_fakes.dart"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad9d96618df08a8362fe98dd193e0fbe746e4102d85e7242e4245b84db69e9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/media/presentation/media_identity.dart: lib/features/media/presentation/media_identity.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in MediaIdentity.of at line 126. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/media/presentation/media_identity.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_identity.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1714fece40569726c12d07bf2e746d97f5cbe5abb7f345bc09943fec87a9de2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/settings/presentation/widgets/service_connection_row.dart: lib/features/settings/presentation/widgets/service_connection_row.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ServiceConnectionRow.build at line 33. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/settings/presentation/widgets/service_connection_row.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/service_connection_row.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50990be1b5b3100f2a824860b98b75584a996323803185310a9bfbf92490580"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/activity/presentation/arr_tab_screen.dart: lib/features/activity/presentation/arr_tab_screen.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _ArrTabScreenState._content at line 204. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/arr_tab_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/arr_tab_screen.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd6f77564e5fbb9f312cbbce8e2ae08ba3884a88556665e66006df2a53d9f8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/media/presentation/media_add_sheet.dart: lib/features/media/presentation/media_add_sheet.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in _MediaAddSheetState.build at line 212. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/media/presentation/media_add_sheet.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_add_sheet.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"35edd555448debfc00ab54f0eda75229d5f803b7f2c3453ba988e20f9b6627d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/media/presentation/media_episodes_graph.dart: lib/features/media/presentation/media_episodes_graph.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in _MediaEpisodesGraphSheetState.build at line 291. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/media/presentation/media_episodes_graph.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episodes_graph.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10f1d74aef33a899d07928ec4767f9cf376c7107cd6daeb6b2a73dd670bbea1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/readarr/presentation/author_page.dart: lib/features/readarr/presentation/author_page.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in _AuthorPageState.build at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/readarr/presentation/author_page.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/author_page.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"19208ebbf0c6c542ec0f57bf5729044ab5297d813deb3fa6a631500eb713e1b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart: lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ProwlarrIndexerTile.build at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_tile.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"443ff0e49b1f4d43d187852e3169726664fd49715a38b22e661dadc1bf1d6b94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/media/presentation/media_episode_sheet.dart: lib/features/media/presentation/media_episode_sheet.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _MediaEpisodeSheetState.build at line 127. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/media/presentation/media_episode_sheet.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episode_sheet.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b364f160f1d3317d66e6badb868a4ab46fea2df6ff2d20038fa256bb3d2ecf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/import/presentation/blocked_import_review_page.dart: lib/features/import/presentation/blocked_import_review_page.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in _BlockedImportReviewPageState.build at line 146. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/import/presentation/blocked_import_review_page.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_review_page.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a137d8cdee8ab7a4cc131f39b154024a73913ff0ef02c96c58c3351269b003"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/import/presentation/blocked_import_parts.dart: lib/features/import/presentation/blocked_import_parts.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _BlockedImportNeedYouRowState.build at line 564. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/import/presentation/blocked_import_parts.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e88851cb2be076ab75f9a824e19492d7d9acf7a61c3f3a5394caee1d31ab7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/activity/presentation/activity_needs_you_page.dart: lib/features/activity/presentation/activity_needs_you_page.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _ActivityNeedsYouPageState.build at line 42. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/activity_needs_you_page.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_needs_you_page.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5629444c12d0d0624f645869ce537505c743238e2fa2cec8ae1a9980fafdc84d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/discover/presentation/widgets/collection_tally.dart: lib/features/discover/presentation/widgets/collection_tally.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in CollectionTally.build at line 58. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/widgets/collection_tally.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/collection_tally.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02a439db481f9b92010fa971acc293bda4d36fd545ae5090ccfd12dcb7c8dc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/media/presentation/media_series_manage.dart: lib/features/media/presentation/media_series_manage.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in MediaSeriesManage.build at line 87. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/media/presentation/media_series_manage.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_series_manage.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc8aeeb10255b8bddaac1ca69c21905184d08009d5707844d73ebe180b6ec71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart: lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _IndexerFormState.build at line 151. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_indexer_form_sheet.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f00fe885ea18b0808a2f75fb6bdd618201f3c4ee697bf2e20aab4145e42438"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/activity/presentation/widgets/fault_card.dart: lib/features/activity/presentation/widgets/fault_card.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _FaultCardState.build at line 187. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/widgets/fault_card.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/fault_card.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"de054a672f615ac24d3c11df5d89f8b3da9109d7b23dd4abe9c2842202c782c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tool/design_system/gallery.py: tool/design_system/gallery.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in gallery.build at line 141. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- tool/design_system/gallery.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_system/gallery.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a1088c217cb9fde4b06a133de52507f28cb78ccb5471718ce3e8b32c828255"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/home/presentation/widgets/coming_up_module.dart: lib/features/home/presentation/widgets/coming_up_module.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in HomeComingUpModule.build at line 36. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/home/presentation/widgets/coming_up_module.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/coming_up_module.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbde1a22c4fcc0397a4287b83f9f3392ff181742aa9577d8f81a90709dac46e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/discover/presentation/widgets/calendar_band.dart: lib/features/discover/presentation/widgets/calendar_band.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _CalendarBandState.build at line 109. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/widgets/calendar_band.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_band.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abeda4b6dee9742f16a9f77046cc3a885031c77e196f6320b26abca70f6747f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/activity/presentation/widgets/requests_board.dart: lib/features/activity/presentation/widgets/requests_board.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in _RequestsBoardState.build at line 241. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/widgets/requests_board.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/requests_board.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d166d3c7dd957698b7be4232a787fe9f0b03a646a4aaf0c8b4267f3af5676407"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/home/presentation/widgets/requests_module.dart: lib/features/home/presentation/widgets/requests_module.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in HomeRequestsModule.build at line 49. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/home/presentation/widgets/requests_module.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/requests_module.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bb36c844af5a8e3b7b46ab3e24041a87f0f15724fc7cb40971a9fa85c66c3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/discover/presentation/widgets/calendar_week_strip.dart: lib/features/discover/presentation/widgets/calendar_week_strip.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in CalendarWeekStrip._day at line 89. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/widgets/calendar_week_strip.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_week_strip.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0962dc14adb9692d0b95806a903910f082ed02131992757bbfc9d7d2106b6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/pairing/domain/pair_package.dart: lib/features/pairing/domain/pair_package.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in PairPackage.fromJson at line 227. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/pairing/domain/pair_package.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/domain/pair_package.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"feac7192d1fc7c91662b83ce953743440e893f6f234fdc7ee7514c88fcb76d0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/tracearr/presentation/tracearr_session_sheet.dart: lib/features/tracearr/presentation/tracearr_session_sheet.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TracearrSessionBody.build at line 104. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/tracearr/presentation/tracearr_session_sheet.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_session_sheet.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"931daf37b1c6138d0d34aaec7155f2056dcb2e5be0d9dc91fa1a48da026beae5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/home/presentation/widgets/arrived_module.dart: lib/features/home/presentation/widgets/arrived_module.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in HomeArrivedModule.build at line 43. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/home/presentation/widgets/arrived_module.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/arrived_module.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5263ef68e94083c4f32f7128c05e25f80e756c7169d3d935d24f69dd83d7fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/activity/presentation/widgets/download_parts.dart: lib/features/activity/presentation/widgets/download_parts.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DownloadReadout.build at line 144. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/widgets/download_parts.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/download_parts.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5797a32c680ca5754bc78736a8ffb90a70550e02e84b680b53e1ce52daca883"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/discover/presentation/widgets/calendar_month_grid.dart: lib/features/discover/presentation/widgets/calendar_month_grid.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in _Day.build at line 136. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/widgets/calendar_month_grid.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/calendar_month_grid.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d627a6f8881ec0db39202abfc0fec0fe70e2e3b4bf891c82d65862eef35b16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/plex/domain/models/plex_transcode_session.dart: lib/features/plex/domain/models/plex_transcode_session.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in PlexTranscodeSession.reasons at line 241. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/plex/domain/models/plex_transcode_session.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/domain/models/plex_transcode_session.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fe1a71554ddc3cf71a029b909d56cec17c0a283834604600f142bb804dec67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/features/media/presentation/report_problem_sheet.dart: lib/features/media/presentation/report_problem_sheet.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _ReportProblemSheetState._submit at line 149. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/media/presentation/report_problem_sheet.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/report_problem_sheet.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98e630a527da958297d4b76bcc5b812636f2d2c70f5acba19d45f8307dcd5de"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/nzbget/presentation/nzbget_screen.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(clients): under the stale band, the rail\u0027s rates read a dash\u201D; \u201Cfix(clients): a download queue that stopped coming back says how old it is\u201D; \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/nzbget/presentation/nzbget_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_screen.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4728ffbba3b56d89d744fc44a54a464063d784b49dbe6893b59874eb8beb2415"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/activity/presentation/widgets/activity_item_tiles.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(activity): a decision on a request is the operator\u0027s, named as the gate says\u201D; \u201Cfix(activity): a wanted date reads Tue 29 Sep, not 2026-09-29\u201D; \u201Cfix(tone): the green scheme role is a tone, and names state no status\u201D; \u201Cfix(activity): a protocol and a date are plain chips, not a status tone\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/widgets/activity_item_tiles.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_item_tiles.dart"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00a01a67db7c276908f00b3539e5b93587917e18d0e018fc9dc201a492ec8b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/sabnzbd/presentation/sabnzbd_screen.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(clients): under the stale band, the rail\u0027s rates read a dash\u201D; \u201Cfix(clients): a download queue that stopped coming back says how old it is\u201D; \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/sabnzbd/presentation/sabnzbd_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/sabnzbd/presentation/sabnzbd_screen.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bba964e0336c2262d6c270990124dd4659dd93f8ea38de438aedce631c6bb4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/network/connection_failure.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(qbittorrent): a 401 at sign-in is a refused address, not a wrong password\u201D; \u201Cfix(testlab): isolate the seeded app and harden the lab\u0027s control paths\u201D; \u201Cfix(connections): a port that never spoke https is named, whatever its handshake did\u201D; \u201Cfix(connections): https on an http port says so, and a certificate stays to be trusted\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/network/connection_failure.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/connection_failure.dart"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4fa525f86bb72e5cc144fda90c05b64c62a52d9d88b450f2e623aa1e6a5586"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/settings/data/service_verification.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(qbittorrent): a 401 at sign-in is a refused address, not a wrong password\u201D; \u201Cfix(connections): a port that never spoke https is named, whatever its handshake did\u201D; \u201Cfix(connections): https on an http port says so, and a certificate stays to be trusted\u201D; \u201Cfix(connections): at home is decided by a local address, and a row names its connection\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/settings/data/service_verification.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/service_verification.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b70c598575022ce90cef08984578d27d8dd8f67c3900df0e0fd61c18f7539d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/npm/presentation/npm_screen.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(npm): route the advanced block, skip loopback upstreams, one host row\u201D; \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/npm/presentation/npm_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96dc523bbe2b83f86393e0bff4599c5e3f0b543bda58e819bbeda9bd6e35208"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/status/lexicon.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(sonarr): an episode with no air date is neither aired nor Missing\u201D; \u201Cfix(words): a paused playback reads Paused, and Bazarr counts its wanted once\u201D; \u201Cfix(requester): the line says when the server stopped answering, or no time\u201D; \u201Cfix(copy): the app writes American English\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/status/lexicon.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/status/lexicon.dart"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"865245a2037bddae530c23ada586748c9fb08b4cc84b472a2634343f9a8139d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/transmission/presentation/transmission_screen.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(clients): under the stale band, the rail\u0027s rates read a dash\u201D; \u201Cfix(clients): a download queue that stopped coming back says how old it is\u201D; \u201Cfix(services): the six services as the lab found them\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/transmission/presentation/transmission_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_screen.dart"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ad4afb80be9570938768dca750a2731ae375811f50cb0d17d434aab98d1e0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/shell/presentation/desktop/inspector_pane.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(activity): the desktop inspector reads its queue and history again while open\u201D; \u201Cfix(desktop): the inspector does not say nothing downloads beside a stuck torrent\u201D; \u201Cfix(desktop): the inspector\u0027s header buttons keep the pointer floor\u201D; \u201Cfix(design): spacing and radius in the shell chrome sit on the scale\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/shell/presentation/desktop/inspector_pane.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/inspector_pane.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c72e6c92b7a11cbc09de23aeb8b6fdc9f7215ed5e68d4e9610695e927055570"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/activity/presentation/activity_provider.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(activity): Stuck waits for the client\u0027s own thirty minutes\u201D; \u201Cfix(activity): a decision on a request is the operator\u0027s, named as the gate says\u201D; \u201Cfix(activity): a download is matched to its movie or episode the same way as on home\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/activity_provider.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_provider.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa5d4684c5f64903d7ee20da67c1d8a4491216ab5829f59bbffdec50b56ee69"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/qbittorrent/presentation/torrent_detail_screen.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(qbittorrent): a torrent\u0027s page keeps its frame while loading, failed or gone\u201D; \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(chrome): every top bar is the glass bar\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/qbittorrent/presentation/torrent_detail_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/torrent_detail_screen.dart"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe753f45968896828418208dc43ca7ee1f12dc2e472639b498dbaafcc5e960a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/services/domain/dashboard_decision.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(needs-you): a failed download is the arr\u0027s, and a held release says when it goes\u201D; \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(home): Needs you says connections that failed alike once\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/services/domain/dashboard_decision.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/domain/dashboard_decision.dart"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9694deb39d8a76199d6e728f7c1556b04c136360b7cf2f2b51e1496a423c31"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/unraid/presentation/unraid_screen.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(unraid): containers and figures on Unraid 7.2 and later, with CPU and memory\u201D; \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/unraid/presentation/unraid_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/presentation/unraid_screen.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"356f68e5ff291c9eefb8f20435992a353bb469370be844ec877d4ad6547ccb53"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/services/presentation/service_all_screens.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(chrome): every top bar is the glass bar\u201D; \u201Cfix(copy): the app writes American English\u201D; \u201Cfix(copy): the app says \u0022Could not\u0022, never \u0022Couldn\u0027t\u0022\u201D; \u201Cfix(seerr): Resolve on an issue goes through the role gate\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/services/presentation/service_all_screens.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_all_screens.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bca61efd722b55ad597d38d6b3ff215579f0ac66d4bb3542fbcc5713e2cd1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/app_error_state.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(failure-lines): one beside-or-under layout, and no sentence cut at 200%\u201D; \u201Cfix(failure): a household member reads one line with its time, never a cause\u201D; \u201Cfix(network): a read caught by a settings change reads again, never an outage\u201D; \u201Cfix(ui): a web page answering for a service reads the same everywhere, as the wrong address\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/app_error_state.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/app_error_state.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5947db9b06c2580f5a2c66031fcb4f5ea86f030963fbec941c2cc8608aa3989"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/settings/domain/connection_presentation.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(qbittorrent): a 401 at sign-in is a refused address, not a wrong password\u201D; \u201Cfix(security): close credential replay and pairing trust gaps\u201D; \u201Cfix(connections): a port that never spoke https is named, whatever its handshake did\u201D; \u201Cfix(connections): https on an http port says so, and a certificate stays to be trusted\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/settings/domain/connection_presentation.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/domain/connection_presentation.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"03632e5423d7b91272565c1099fdc234eeda58f25e827fee13584aea69ad32e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/download_queue_tile.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(clients): a stale row says it is not updating, and draws no rates\u201D; \u201Cfix(clients): a download queue that stopped coming back says how old it is\u201D; \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/download_queue_tile.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/download_queue_tile.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"49709960167925cc67f5eac113358529ff04b53450f5ad7b708df3a1253bdf1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/theme.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(theme): a switch that is off can be seen, and the demo has something to hide\u201D; \u201Cfix(theme): a transparent app bar takes the room\u0027s status bar too\u201D; \u201Cfix(buttons): a page\u0027s primary is button-l, 52 at radius 16, as the brand book draws it\u201D; \u201Cfix(focus): the keyboard\u0027s place is a ring, 2pt outside the control\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/theme.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/theme.dart"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a8ce7a740d7062a3aef8e720efcee62071448caf579391b4ab1fd69e448594"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/series/presentation/series_screen.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(posters): a tile with no artwork shows what it is, not a movie clapper\u201D; \u201Cfix(copy): a search hint is the field\u0027s own words, with no ellipsis\u201D; \u201Cfix(arrs): a pasted token re-keys a library grid\u0027s posters at once\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/series/presentation/series_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/series/presentation/series_screen.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ceb18f4c7224c22e531bad0a14b3b6b04676b7df8255933865071d069bb57f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/shell/presentation/desktop/window_chrome.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(icons): every Symbols glyph comes from the family a release build draws\u201D; \u201Cfix(desktop): the window strip leaves a media server\u0027s tab to its header\u201D; \u201Cfix(copy): the app writes American English\u201D; \u201Cfix(tone): the Close hover and the info chips wear the room\u0027s own tone\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/shell/presentation/desktop/window_chrome.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/window_chrome.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d3edc42aebbdf59b68ebfa8bf0486fa33b9ab57fc953b986f3a8b2a725f329"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/jellyfin/presentation/jellyfin_tab_screens.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(stream): what the real servers showed, and a library that is the library\u201D; \u201Cfix(stream): a media server visit stays on the connection it opened on\u201D; \u201Cfix(stream): Jellyfin and Plex pages are read per connection, and Home no longer moves the lens\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/jellyfin/presentation/jellyfin_tab_screens.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/presentation/jellyfin_tab_screens.dart"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"460bd9317911b7e2ea012e3c8ad9e8c6e59429dd367014b7090530ccc65c7e58"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/import/presentation/manual_import_widgets.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(spacing): every gap is a step of the scale\u201D; \u201Cfix(buttons): a page\u0027s primary is button-l, 52 at radius 16, as the brand book draws it\u201D; \u201Cfix(copy): a search hint is the field\u0027s own words, with no ellipsis\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/import/presentation/manual_import_widgets.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_widgets.dart"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"231eb8efae8c5f57ee271084e28dec110d1ba9083d224ea53f846af1780505dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/dockge/presentation/dockge_stack_detail_screen.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(actions): Dockge, NPM and client actions finish after their page is gone\u201D; \u201Cfix(copy): a failed action says \u0022Could not\u0022, never \u0022Failed to\u0022\u201D; \u201Cfix(dockge): the terminal\u0027s text is the plate\u0027s ink in both themes\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/dockge/presentation/dockge_stack_detail_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/presentation/dockge_stack_detail_screen.dart"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce33bcc19824e0be634d7b1ed6e22e5ddcc2daa1df495be8e8213fe36e68a1c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/fault_band.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(health): a server reached that never replied has timed out\u201D; \u201Cfix(clients): a failed probe is a band over the last read, an empty queue one line\u201D; \u201Cfix(failure-lines): one beside-or-under layout, and no sentence cut at 200%\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/fault_band.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/fault_band.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b36a8d1fe769a31eef7ebc7a7274671e21af36f12f9065012f7b25e044b5e4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/release_search/domain/release_search_job.dart: 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\u0027s 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 \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(copy): the app writes American English\u201D; \u201Cfix(format): one duration formatter, in the brand book\u0027s units\u201D; \u201Cfix(search): a search that stopped with no verdict says so one way\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/release_search/domain/release_search_job.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/domain/release_search_job.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0faf37213fe755b5cbf10111fc86feaf2b5e951febb86a074747fa1ad96349e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/services/domain/download_client_faults.dart: lib/features/services/domain/download_client_faults.dart changed 13 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is InFlightReading.== at line 68), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D; \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(usenet): a queue the disk stopped reads Disk full in its room too\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/services/domain/download_client_faults.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/domain/download_client_faults.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"152df6f4af8329c163d17357a8c3a2e861026ba1ae25c8950c71758f14f85f39"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/discover/presentation/seerr_admin_screens.dart: lib/features/discover/presentation/seerr_admin_screens.dart changed 20 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is _SeerrIssuesScreenState.build at line 38), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(seerr): Review lands on the open issues, and Your reports holds only hers\u201D; \u201Cfix(seerr): name issue rows from their titles\u201D; \u201Cfix(stream): what the real servers showed, and a library that is the library\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/seerr_admin_screens.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/seerr_admin_screens.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ef4af127b96e95d7b4cdff39b8dffb241675e8ec25f397020f1c86fb39763c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/services/presentation/widgets/instance_lens_badge.dart: lib/features/services/presentation/widgets/instance_lens_badge.dart changed 16 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is _LensOptions._reachabilityOf at line 267), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(stack): a connection saved without its key is not counted as silent\u201D; \u201Cfix(stream): a media server visit stays on the connection it opened on\u201D; \u201Cfix(seerr): a signed-out Seerr reads signed out wherever it read not set up\u201D; \u201Cfix(lens): a connection behind a gateway reads its name in the lens sheet too\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/services/presentation/widgets/instance_lens_badge.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/widgets/instance_lens_badge.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec97d751e1ed7471b2db00c7b89c231df480e7c48c8154dddc2b6f7c2cb8d85"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/inline_error_retry.dart: lib/core/widgets/inline_error_retry.dart changed 14 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is InlineErrorRetry._full at line 137), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(overview): a section that fails says so in one line, under its header\u201D; \u201Cfix(failure-lines): one beside-or-under layout, and no sentence cut at 200%\u201D; \u201Cfix(failure): a household member reads one line with its time, never a cause\u201D; \u201Cfix(search): a stopped lane offers what its cause allows, not always Retry\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/inline_error_retry.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/inline_error_retry.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d59e6cef147b62996cb64173d59e8a39fef058d528d4893ae93e63a764a8821"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/discover/presentation/request_form_provider.dart: lib/features/discover/presentation/request_form_provider.dart changed 13 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is RequestFormNotifier._submitFailure at line 619), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(discover): a request that was made reaches the lists that show requests\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(requests): a series\u0027 request names the seasons it asks for\u201D; \u201Cfix(discover): a request from an account sends the title, never a profile\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/request_form_provider.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/request_form_provider.dart"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"410dad273af6641f6ae3a6044ff469614ad1a416c782133b4ef8ae49d4c1b73e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/movies/presentation/movies_screen.dart: lib/features/movies/presentation/movies_screen.dart changed 19 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is MoviesScreen.build at line 69), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(copy): a search hint is the field\u0027s own words, with no ellipsis\u201D; \u201Cfix(arrs): a pasted token re-keys a library grid\u0027s posters at once\u201D; \u201Cfix(arrs): a library grid keys its artwork on the connection it shows\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/movies/presentation/movies_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/movies_screen.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04d29ef33dc2eef167376c48203f7f906d500112875b6c1c1fe7200bb65d0bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/dockge/presentation/dockge_screen.dart: lib/features/dockge/presentation/dockge_screen.dart changed 17 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is _StackQuickActions._confirmThenRun at line 261), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(stream): what the real servers showed, and a library that is the library\u201D; \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(readout): a pull asks Bazarr\u0027s providers and Dockge\u0027s probe again\u201D; \u201Cfix(services): the six services as the lab found them\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/dockge/presentation/dockge_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/presentation/dockge_screen.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffadee04809064728ef486fee620d9e02f19e8c3f495df634518d8132f8bc83b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/settings/presentation/widgets/settings_summary_cards.dart: lib/features/settings/presentation/widgets/settings_summary_cards.dart changed 17 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is _BackgroundSearchSummaryCard.build at line 331), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(settings): answering counts what the Stack counts\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(settings): the colour note says where the colour comes from\u201D; \u201Cfix(copy): the app writes American English\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/settings/presentation/widgets/settings_summary_cards.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/settings_summary_cards.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f0beeb0159edf211d08208b5ee37312b66df1f672143bf8301d8d0b63452b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/release_search/presentation/release_search_settings_screen.dart: lib/features/release_search/presentation/release_search_settings_screen.dart changed 17 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is _LimitsCard.build at line 567), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(icons): upgrade Flutter and verify release font subsets\u201D; \u201Cfix(security): close credential replay and pairing trust gaps\u201D; \u201Cfix(copy): the app says \u0022Could not\u0022, never \u0022Couldn\u0027t\u0022\u201D; \u201Cfix(format): a no-break space joins a figure to its unit symbol\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/release_search/presentation/release_search_settings_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/release_search_settings_screen.dart"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6efcf372737fadbdf9abc4cb9515f65810e6be08c48a8c11d02e171bde19e58"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/search/domain/global_search_result.dart: lib/features/search/domain/global_search_result.dart changed 17 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is GlobalSearchServiceResults.fault at line 221), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(search): the requester searches Requests, and reads no service\u0027s name\u201D; \u201Cfix(search): a stopped lane states its cause once, in its card\u201D; \u201Cfix(search): a stopped lane offers what its cause allows, not always Retry\u201D; \u201Cfix(search): a lane\u0027s fault reads as one sentence, its cause in words\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/search/domain/global_search_result.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/search/domain/global_search_result.dart"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e26e6ce6e51ad1a7441b6a51137b81027d816964a9c21f331496733ebc3f4c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/plex/presentation/plex_tab_screens.dart: lib/features/plex/presentation/plex_tab_screens.dart changed 16 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is _PlaylistRow.build at line 255), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(stream): what the real servers showed, and a library that is the library\u201D; \u201Cfix(stream): a media server visit stays on the connection it opened on\u201D; \u201Cfix(stream): Jellyfin and Plex pages are read per connection, and Home no longer moves the lens\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/plex/presentation/plex_tab_screens.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/presentation/plex_tab_screens.dart"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"62944ffb3ce975119cc3b66e496b83cf8d5038754c56829d989c9a4c78c568cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/transmission/presentation/transmission_actions.dart: lib/features/transmission/presentation/transmission_actions.dart changed 16 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is TransmissionAddReport.from at line 86), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(qbittorrent): a 401 at sign-in is a refused address, not a wrong password\u201D; \u201Cfix(actions): Dockge, NPM and client actions finish after their page is gone\u201D; \u201Cfix(connections): a port that never spoke https is named, whatever its handshake did\u201D; \u201Cfix(connections): https on an http port says so, and a certificate stays to be trusted\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/transmission/presentation/transmission_actions.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_actions.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7867f3103eb3230858226bf60d2e2486280fef0aba3ec7ef87db28d1ea8e838"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/service_kpi_peek.dart: lib/core/widgets/service_kpi_peek.dart changed 16 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ServiceKpiPeek.build at line 69), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(polish): the KPI rail holds its figures, Readarr\u0027s empty shelf, Proxy Manager\u201D; \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(errors): a service nobody set up is a type, not a phrase\u201D; \u201Cfix(ui): a gateway is named wherever its failure is put into words\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/service_kpi_peek.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/service_kpi_peek.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8739306bcbcbfe89be6a7e03e79cc5a5a8b31a24fd16dc2608fbc01ad12f7ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart: lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart changed 16 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is _InfoCard.build at line 290), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(chrome): every top bar is the glass bar\u201D; \u201Cfix(format): one duration formatter, in the brand book\u0027s units\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(ui): every inline failure names the service whose read failed\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_indexer_detail_screen.dart"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ed4276a217b7330bd3327294a04a183923577dfcf46f203c581d70c77178e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/stream/presentation/stream_libraries_screen.dart: lib/features/stream/presentation/stream_libraries_screen.dart changed 16 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is _LibrariesBody.build at line 117), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(stream): what the real servers showed, and a library that is the library\u201D; \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(stream): a media server visit stays on the connection it opened on\u201D; \u201Cfix(services): the six services as the lab found them\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/stream/presentation/stream_libraries_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_libraries_screen.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd009156ec7643334884f08a212c5f5e8b6650dbbde381b635fe44f9ed06724"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/stream/presentation/stream_library_screen.dart: lib/features/stream/presentation/stream_library_screen.dart changed 15 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is _StreamLibraryScreenState._fetchPage at line 156), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(stream): what the real servers showed, and a library that is the library\u201D; \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(stream): a media server visit stays on the connection it opened on\u201D; \u201Cfix(stream): Jellyfin and Plex pages are read per connection, and Home no longer moves the lens\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/stream/presentation/stream_library_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_library_screen.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94c4f3e342d4812e3bdc17412f7c98694116f51c060c703320e16d52e9ffd46"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/shell/presentation/desktop/command_deck.dart: lib/features/shell/presentation/desktop/command_deck.dart changed 15 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is _EntryRow.build at line 282), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(onboarding): a field draws one well, its keyboard comes back on a tap, and no port is offered beside a proxied name\u201D; \u201Cfix(design): spacing and radius in the shell chrome sit on the scale\u201D; \u201Cfix(type): figures leave the mono face, and a guard lists what stays\u201D; \u201Cfix(home): a stack with nothing to ask counts no answering\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/shell/presentation/desktop/command_deck.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/command_deck.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0b48004ac1645313211ba4a4c4e9d50a466b5af024463dc13f88b6c1bc164a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/interactive_search_sheet.dart: lib/core/widgets/interactive_search_sheet.dart changed 14 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is _InteractiveSearchSheetState._handleGrab at line 263), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(rooms): bars cover what passes under them, slabs stay paper by day\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(failure): a failure state that knows its service passes it\u201D; \u201Cfix(ui): a failure toast takes the failure\u0027s tone, red only when nothing answered\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/interactive_search_sheet.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/interactive_search_sheet.dart"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"07eb69364fa7661eff2a7c440d4ef51a9c32accbbae667c4358a2a49809dfdec"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/transmission/presentation/transmission_tab_screens.dart: lib/features/transmission/presentation/transmission_tab_screens.dart changed 14 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is _TransmissionLabelsScreenState._labelsBody at line 82), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(clients): qBittorrent RSS and Transmission settings headers sit on the page inset\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(copy): the app writes American English\u201D; \u201Cfix(services): qBittorrent RSS and the SABnzbd, NZBGet and Transmission tabs start below the tab bar\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/transmission/presentation/transmission_tab_screens.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_tab_screens.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6333e4764a832148f465316692440ac0f2bac145d04e1f1e7f938b31ccd2908d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/bazarr/presentation/bazarr_wanted_screen.dart: lib/features/bazarr/presentation/bazarr_wanted_screen.dart changed 14 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is _BazarrWantedTabState.build at line 225), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(chrome): every top bar is the glass bar\u201D; \u201Cfix(bazarr): Wanted, Series, Movies, History and Providers start below the tab bar\u201D; \u201Cfix(copy): an episode reads S2 E4 everywhere, and a test holds it\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/bazarr/presentation/bazarr_wanted_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_wanted_screen.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4fcd05e05db6f81a749f454fa4d2d323b1881763c4c81137f53ec2f3a49a4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/async_value_widget.dart: lib/core/widgets/async_value_widget.dart changed 13 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is AsyncValueWidget.build at line 262), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(downloads): a qBittorrent row read before the failure says how old it is\u201D; \u201Cfix(errors): a service nobody set up is a type, not a phrase\u201D; \u201Cfix(overview): a section that fails says so in one line, under its header\u201D; \u201Cfix(widgets): a reload keeps the readout on screen until the new answer\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/async_value_widget.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/async_value_widget.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc23c8f1a075bcca47371d4d5303ee41957efbf8a58f98d23b2bd410028a7318"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/release_list_widgets.dart: lib/core/widgets/release_list_widgets.dart changed 13 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is _ReleaseListItemState.build at line 93), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(a11y): a release row speaks one sentence, and Grab stays its own control\u201D; \u201Cfix(copy): a copy says Copied, whatever it copied\u201D; \u201Cfix(ui): keep red for unreachable and irreversible, not for refusals\u201D; \u201Cfix(ui): walk accent and status ink against the ground it sits on\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/release_list_widgets.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/release_list_widgets.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"871b4b4e315f9c72276dd5ca47141ddc7aecaa8d573c3c7408142d9702b12e42"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/sabnzbd/presentation/sabnzbd_overview_provider.dart: lib/features/sabnzbd/presentation/sabnzbd_overview_provider.dart changed 12 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is SabnzbdQueueRow.isFault at line 316), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(usenet): a stop says what stopped it\u201D; \u201Cfix(providers): SABnzbd\u0027s day of history and a Dockge stack fail once\u201D; \u201Cfix(activity): a stale Usenet row keeps its state before its age\u201D; \u201Cfix(format): one duration formatter, in the brand book\u0027s units\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/sabnzbd/presentation/sabnzbd_overview_provider.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/sabnzbd/presentation/sabnzbd_overview_provider.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1905efce002fd76c32b14d86ebc09ba088913407cc1dff4ca55b7f7812b8a34c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/qbittorrent/domain/models/torrent.dart: lib/features/qbittorrent/domain/models/torrent.dart changed 9 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is TorrentState.fromString at line 59), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(qbittorrent): checkingResumeData is a check, not an unknown state\u201D; \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D; \u201Cfix(qbittorrent): files on their way to a folder read Moving files\u201D; \u201Cfix(activity): a magnet still fetching its file list says so, not that nobody has it\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/qbittorrent/domain/models/torrent.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/domain/models/torrent.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20a47a0913b346d218f637bab89e6579888abf159d76a05f74adf103e6d7ab7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart: lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart changed 14 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is _HistoryTodaySection.build at line 190), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(stream): what the real servers showed, and a library that is the library\u201D; \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/sabnzbd/presentation/sabnzbd_overview_screen.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cfd88399605ee72e0610e081940c9d1f615178490ff86f8be7aa65c609e492"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/truenas/data/truenas_ws_client.dart: lib/features/truenas/data/truenas_ws_client.dart changed 14 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is TrueNasWsClient.callJob at line 456), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(truenas): verify a suspect socket with a ping after a network change\u201D; \u201Cfix(security): close credential replay and pairing trust gaps\u201D; \u201Cfix(truenas): a call that timed out releases the socket for the idle close\u201D; \u201Cfix(network): a read caught by a settings change reads again, never an outage\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/truenas/data/truenas_ws_client.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/data/truenas_ws_client.dart"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ccb5ee373819bd013dc92e15b724d4cf9decb4e96ec39d095631c0bbb2c67e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/readarr/presentation/widgets/readarr_tiles.dart: lib/features/readarr/presentation/widgets/readarr_tiles.dart changed 14 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is ReadarrHistoryTile.build at line 71), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(readarr): the history row sits on the spacing scale\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(format): a no-break space joins a figure to its unit symbol\u201D; \u201Cfix(ui): let the eyebrow be the only uppercase voice\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/readarr/presentation/widgets/readarr_tiles.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/widgets/readarr_tiles.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e95a2a5b20801a8c4fe36f936c5d78e1fd9d9c373d9a8d519d85e06d02e1a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/status_badge.dart: lib/core/widgets/status_badge.dart changed 14 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is StatusBadge.build at line 96), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(discover): at a large reading size a poster\u0027s title and its word stay whole\u201D; \u201Cfix(badge): a compact badge is the plate with its tone on the glyph, never a tone fill\u201D; \u201Cfix(badges): a label wider than its place wraps inside the badge\u201D; \u201Cfix(format): one formatter for percentages, glued, and 100% is a claim\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/status_badge.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/status_badge.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"19779419bf46c075f761c2ac1afab14eb52824996bc90c102d43a13306d49164"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/nzbget/presentation/nzbget_overview_provider.dart: lib/features/nzbget/presentation/nzbget_overview_provider.dart changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is NzbgetQueueSection.subtitle at line 243), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(usenet): a queue the disk stopped reads Disk full in its room too\u201D; \u201Cfix(format): one duration formatter, in the brand book\u0027s units\u201D; \u201Cfix(format): a no-break space joins a figure to its unit symbol\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/nzbget/presentation/nzbget_overview_provider.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_overview_provider.dart"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3196cc73b5b014a5d7cc158075b5a4b12e3118d8c4e5e2a9866232dbd3e6e3b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/not_configured_placeholder.dart: lib/core/widgets/not_configured_placeholder.dart changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is NotConfiguredPlaceholder._resolved at line 58), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D; \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(errors): a service nobody set up is a type, not a phrase\u201D; \u201Cfix(startup): a start that cannot read its secrets says so instead of a black window\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/not_configured_placeholder.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/not_configured_placeholder.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"912f32d310c4150ec1e5d030c60e2b4637da39b1813e4b8eb2d639f0cffad43b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/import/presentation/manual_import_locate_screen.dart: lib/features/import/presentation/manual_import_locate_screen.dart changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is _RootFolderChip.build at line 264), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D; \u201Cfix(ui): walk accent and status ink against the ground it sits on\u201D; \u201Cfix(ui): hold every role under the weight ceiling\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/import/presentation/manual_import_locate_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_locate_screen.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"16651817ada94a17d3d5fc189536dac13a89edeb7988af84726f9ed0daf9fe9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart: lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is ProwlarrAppProfilesScreen._edit at line 98), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(chrome): every top bar is the glass bar\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_app_profiles_screen.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"302fbd001c804216659a381d081ac8a5e417ac2c8e4f5c3059840c0d1ccf3858"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/qbittorrent/presentation/widgets/torrent_selection_bar.dart: lib/features/qbittorrent/presentation/widgets/torrent_selection_bar.dart changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is TorrentSelectionBar.build at line 15), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D; \u201Cfix(actions): menus name their subject and failures name the action\u201D; \u201Cfix(copy): a failed action says \u0022Could not\u0022, never \u0022Failed to\u0022\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/qbittorrent/presentation/widgets/torrent_selection_bar.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/torrent_selection_bar.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f98d2d98859106df96bc1d46c57d2e1f60e49e2cc2059e9133e23cf3dec12b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/shell/domain/stack_health.dart: lib/features/shell/domain/stack_health.dart changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is StackHealth.qualifiers at line 131), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(stack): one title, and an age that keeps time\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(health): a server reached that never replied has timed out\u201D; \u201Cfix(home): a stack with nothing to ask counts no answering\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/shell/domain/stack_health.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/domain/stack_health.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0ca7b71420596229e8a02a24cb592ddae82c0cf5e932c93746df344f81b223"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/utils/url_utils.dart: lib/core/utils/url_utils.dart changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is UrlUtils.offersDefaultPort at line 279), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(security): close credential replay and pairing trust gaps\u201D; \u201Cfix(onboarding): Connect keeps its first field in view\u201D; \u201Cfix(onboarding): a field draws one well, its keyboard comes back on a tap, and no port is offered beside a proxied name\u201D; \u201Cfix(network): one answer to whether a host is on the local network\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/utils/url_utils.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/url_utils.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"65851587f475bf3a4857cd31f1bca611927355d4541655397dfbd146aeede892"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart: lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is _SabnzbdHistoryRow.build at line 153), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(sabnzbd): a full page of history says it is the latest twenty\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(services): qBittorrent RSS and the SABnzbd, NZBGet and Transmission tabs start below the tab bar\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/sabnzbd/presentation/sabnzbd_tab_screens.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"06248f09ae4f55bb229b43634a999afc0d7c5701f830389130ebaa15b0b86258"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart: lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is _ProviderRow.build at line 203), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(chrome): every top bar is the glass bar\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_provider_list_screen.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"47001126c42ca79483e2e3b0fa92fb6a188709b98b696f969e3f1ac620330ac4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/prowlarr/presentation/prowlarr_history_screen.dart: lib/features/prowlarr/presentation/prowlarr_history_screen.dart changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _ProwlarrHistoryScreenState._body at line 166), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(prowlarr): Indexers, History and Stats start below the tab bar\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(ui): every inline failure names the service whose read failed\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/prowlarr/presentation/prowlarr_history_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_history_screen.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84a0a1df06987f2580f6c8308ac370a9a96bdee239f12e4606acbd79744d259"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/media_child_list.dart: lib/core/widgets/media_child_list.dart changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is MediaChildTile.build at line 112), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(a11y): a percentage is spoken as words, 62 percent\u201D; \u201Cfix(format): one formatter for percentages, glued, and 100% is a claim\u201D; \u201Cfix(series): an episode in the download queue reads downloading, not missing\u201D; \u201Cfix(copy): an episode reads S2 E4 everywhere, and a test holds it\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/media_child_list.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_child_list.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf1c51794f53bf3446db5299e6badfcfc0e0c4a996dde97ce477fa7b19e94fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/qbittorrent/presentation/qbittorrent_overview_provider.dart: lib/features/qbittorrent/presentation/qbittorrent_overview_provider.dart changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is QbittorrentTransferRow.tone at line 362), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(qbittorrent): files on their way to a folder read Moving files\u201D; \u201Cfix(format): a no-break space joins a figure to its unit symbol\u201D; \u201Cfix(format): one formatter for percentages, glued, and 100% is a claim\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/qbittorrent/presentation/qbittorrent_overview_provider.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/qbittorrent_overview_provider.dart"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d8b0c8ef8d50c61e6d8d914fba6c85b060e7af24c61c5755a1ce9bfac1fcc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart: lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is _FeedRow.build at line 178), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(clients): qBittorrent RSS and Transmission settings headers sit on the page inset\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(services): qBittorrent RSS and the SABnzbd, NZBGet and Transmission tabs start below the tab bar\u201D; \u201Cfix(ui): every inline failure names the service whose read failed\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/qbittorrent_rss_screen.dart"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef868144025729be54ee1a14f11d0e2076ea317bf70177ce617a2eb0a0ead6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/utils/snack_bar_helper.dart: lib/core/utils/snack_bar_helper.dart changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is SnackBarHelper._demote at line 22), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(actions): a failed write that can still go through carries Retry\u201D; \u201Cfix(copy): a blocked cross-service toast ends with a full stop\u201D; \u201Cfix(copy): the app says \u0022Could not\u0022, never \u0022Couldn\u0027t\u0022\u201D; \u201Cfix(ui): a failure toast keeps its plate and carries the tone on its glyph\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/utils/snack_bar_helper.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/snack_bar_helper.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec3703cb398ff187b39e9a98a9e41428b18a6886a6041827f83b97a4314909a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/release_search/presentation/widgets/search_headroom_card.dart: lib/features/release_search/presentation/widgets/search_headroom_card.dart changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _SearchHeadroomCardState._verdict at line 202), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(connections): at home is decided by a local address, and a row names its connection\u201D; \u201Cfix(format): one duration formatter, in the brand book\u0027s units\u201D; \u201Cfix(ui): a failure toast takes the failure\u0027s tone, red only when nothing answered\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/release_search/presentation/widgets/search_headroom_card.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/widgets/search_headroom_card.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0035992871858c135a73c78ac1248c11b358e28a8b45c1b6196465dc3213c73"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/discover/presentation/seerr_sign_in_notice.dart: lib/features/discover/presentation/seerr_sign_in_notice.dart changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is SeerrSignInNotice.ofSignIn at line 129), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(connections): a port that never spoke https is named, whatever its handshake did\u201D; \u201Cfix(connections): https on an http port says so, and a certificate stays to be trusted\u201D; \u201Cfix(settings): signing in to Seerr says a declined certificate is a choice, and a secure connection that did not open is the address to check\u201D; \u201Cfix(settings): an ended session reads in the requester\u0027s words in the account form\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/seerr_sign_in_notice.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/seerr_sign_in_notice.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6324b88758199f85e137f4ffceafeef5095482b91836a27c231f7dfd03bb1281"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/app_dialog.dart: lib/core/widgets/app_dialog.dart changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is _TypedConfirmDialogState.build at line 443), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(stream): what the real servers showed, and a library that is the library\u201D; \u201Cfix(dialogs): a confirmation shows the whole name it is about\u201D; \u201Cfix(dialog): an option\u0027s subtitle is the secondary ink\u201D; \u201Cfix(ui): confirm every destructive action in one neutral dialog that names what goes\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/app_dialog.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/app_dialog.dart"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"114bc55d2d80f0c7d40d357770a03244ae8b53096060729870ab8c4195d5ace1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/transmission/presentation/transmission_overview_screen.dart: lib/features/transmission/presentation/transmission_overview_screen.dart changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is _LabelsSection.build at line 140), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D; \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(overview): a section that fails says so in one line, under its header\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/transmission/presentation/transmission_overview_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_overview_screen.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"58380ed8964c18229cddc6ee5612f5633c1f8984c4a87543588edb8594df3280"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/sabnzbd/data/sabnzbd_client.dart: lib/features/sabnzbd/data/sabnzbd_client.dart changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is SabnzbdClient._call at line 93), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(sabnzbd): a queue or history read answered by something else fails instead of reading empty\u201D; \u201Cfix(network): an access gateway in front of a service is named, with the credential it wants\u201D; \u201Cfix(services): the probe checks that the service it reached is the one configured\u201D; \u201Cfix(dashboard): show a refused key as an amber fault, never as a dark service\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/sabnzbd/data/sabnzbd_client.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/sabnzbd/data/sabnzbd_client.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba6f3275568fde610d5b3945a6a1979c726c0c3a97f3ab502899363c60500c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/file_info_section.dart: lib/core/widgets/file_info_section.dart changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is FileInfoSection.build at line 107), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(series): the folder section says Library path once, and its path leads\u201D; \u201Cfix(ui): the File card leads with its file, and a folder reads as a path\u201D; \u201Cfix(series): the folder section is labelled as the folder, not as files\u201D; \u201Cfix(movies): the File section names the file, not the folder it sits in\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/file_info_section.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/file_info_section.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1138d46c7542e7353f71c7f90820157fda3694d1b3a2ab07f4568fe7eb8d822a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/app_bottom_sheet.dart: lib/core/widgets/app_bottom_sheet.dart changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is AppBottomSheet.build at line 184), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(import): no scan of the server\u0027s top folder, samples out of the sweeps, truer causes, ink in sheets\u201D; \u201Cfix(sheet): AppBottomSheet is the brand book\u0027s sheet: raised, 30, shadow.sheet\u201D; \u201Cfix(ui): walk accent and status ink against the ground it sits on\u201D; \u201Cfix(ui): give every control a finger reaches a 44pt target\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/app_bottom_sheet.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/app_bottom_sheet.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"28824ca4847e5ed75e1a357c8467cca97b7498c1a848ba38d4d6ea2b28955b70"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/release_search/presentation/release_search_sheet.dart: lib/features/release_search/presentation/release_search_sheet.dart changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _ReleaseSearchSheetState.build at line 243), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): the app writes American English\u201D; \u201Cfix(search): a search that stopped with no verdict says so one way\u201D; \u201Cfix(release-search): a search and its notification name the connection it runs on\u201D; \u201Cfix: adopt iOS scene lifecycle\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/release_search/presentation/release_search_sheet.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/release_search_sheet.dart"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93f78a23176821e599986291ccd2a1a937c1a886c64e4f524bd8212fe0adba0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/qbittorrent/data/qbittorrent_client.dart: lib/features/qbittorrent/data/qbittorrent_client.dart changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is QbittorrentClient.QbittorrentClient at line 122), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(qbittorrent): a 401 at sign-in is a refused address, not a wrong password\u201D; \u201Cfix(qbittorrent): an upload refused with 403 is sent again whole\u201D; \u201Cfix(qbittorrent): a refused sign-in is held for its connection, across launches\u201D; \u201Cfix(network): an access gateway in front of a service is named, with the credential it wants\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/qbittorrent/data/qbittorrent_client.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/data/qbittorrent_client.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa2183e00cc374f67c9d35c15895d8a93e9e0e80af12c116f4d913fa35d2b65"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/bazarr/presentation/bazarr_history_screen.dart: lib/features/bazarr/presentation/bazarr_history_screen.dart changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is _BazarrHistoryScreenState._loadMore at line 142), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(bazarr): Wanted, Series, Movies, History and Providers start below the tab bar\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(ui): a partial read says what arrived in amber, not \u0022did not answer\u0022\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/bazarr/presentation/bazarr_history_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_history_screen.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"254490ece4ff400e2828991da36d6ab5fc0d24a6cdc470dce1991d04661426ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/truenas/presentation/widgets/truenas_async_body.dart: lib/features/truenas/presentation/widgets/truenas_async_body.dart changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is TrueNasAsyncBody.build at line 104), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(errors): a service nobody set up is a type, not a phrase\u201D; \u201Cfix(ui): a fault\u0027s remedy wears the amber fill, and Retry beside silence is a ghost\u201D; \u201Cfix(truenas): a certificate or a timeout reads as a fault, never as silence\u201D; \u201Cfix(truenas): an http:// address offers \u0022Change the address\u0022, not \u0022Open Settings\u0022\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/truenas/presentation/widgets/truenas_async_body.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/widgets/truenas_async_body.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed42d74b845d4132f02501ecb7b40b8434820509d498418707ad013ff1fd697"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/truenas/presentation/truenas_console_shell.dart: lib/features/truenas/presentation/truenas_console_shell.dart changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is TrueNasConsoleShell._isSelected at line 184), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(spacing): every gap is a step of the scale\u201D; \u201Cfix(ui): write labels in sentence case with the house middot\u201D; \u201Cfix(ui): hold every role under the weight ceiling\u201D; \u201Cfix: adopt iOS scene lifecycle\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/truenas/presentation/truenas_console_shell.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/truenas_console_shell.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"180407452f66176806686b6daadcb6dbbca5fa7e495c67c6efecbcda8c71d536"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/bazarr/presentation/bazarr_library_screen.dart: lib/features/bazarr/presentation/bazarr_library_screen.dart changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is _BazarrLibraryTabState.build at line 211), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(chrome): every top bar is the glass bar\u201D; \u201Cfix(bazarr): Wanted, Series, Movies, History and Providers start below the tab bar\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/bazarr/presentation/bazarr_library_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_library_screen.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef2919828ea3dc6307fd589a927069866ff8041aff37f0b6750d90424c87c32"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/discover/domain/models/seerr_request.dart: lib/features/discover/domain/models/seerr_request.dart changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is SeerrMediaAvailability.fromCode at line 60), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(seerr): a request\u0027s pill reads the request, the media only past approval\u201D; \u201Cfix(seerr): approving a request names the server it goes to\u201D; \u201Cfix(seerr): a 4K copy reads its own state beside the HD one\u201D; \u201Cfix(discover): a Seerr code reads in its server\u0027s numbering, blocklisted included\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/domain/models/seerr_request.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/models/seerr_request.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37bd4011f7bc0f70639c4e2267cda393eb063970bd9b2ec707ef946f0d2fe11"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/prowlarr/presentation/prowlarr_tags_screen.dart: lib/features/prowlarr/presentation/prowlarr_tags_screen.dart changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ProwlarrTagsScreen._rename at line 132), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(chrome): every top bar is the glass bar\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D; \u201Cfix(ui): confirm every destructive action in one neutral dialog that names what goes\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/prowlarr/presentation/prowlarr_tags_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/prowlarr_tags_screen.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffab61e0db4841072b7a68977ad020e0edc37920e46dd85e475e499af18eb1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/activity/presentation/arr_calendar_screen.dart: lib/features/activity/presentation/arr_calendar_screen.dart changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is ArrCalendarScreen.build at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): an episode reads S2 E4 everywhere, and a test holds it\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(radarr): Coming up names a film\u0027s dates in the calendar\u0027s words\u201D; \u201Cfix(radarr): Coming up puts a release on the day it spells\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/arr_calendar_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/arr_calendar_screen.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15f83afeee2be35d70b7bebb3c7b4b8a80d0405cdd14771608341d4e6505341"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/qbittorrent/presentation/widgets/torrent_tile.dart: lib/features/qbittorrent/presentation/widgets/torrent_tile.dart changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is TorrentTile.build at line 56), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(downloads): a qBittorrent row read before the failure says how old it is\u201D; \u201Cfix(qbittorrent): files on their way to a folder read Moving files\u201D; \u201Cfix(tone): queued is blue in every queue, the torrent clients included\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/qbittorrent/presentation/widgets/torrent_tile.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/torrent_tile.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1fa02055dbd41f34f307eb9f60e33b02e4a1592b63120e6c83b8b3c2247634"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/services/domain/source_coverage.dart: lib/features/services/domain/source_coverage.dart changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is SourceCoverage.merge at line 133), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(services): equal faults are one sentence\u201D; \u201Cfix(ui): a gateway is named wherever its failure is put into words\u201D; \u201Cfix(home): a history page that came back full is counted as a floor\u201D; \u201Cfix(home): needs a decision, in flight and recently added count every connection\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/services/domain/source_coverage.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/domain/source_coverage.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"827aad4ba9f100de1c69b7556e44018d621dfaeb329102bde98434cc90ce8fa6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart: lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is TorrentSortRow.build at line 181), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(spacing): every gap is a step of the scale\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D; \u201Cfix(ui): walk accent and status ink against the ground it sits on\u201D; \u201Cfix(ui): hold every role under the weight ceiling\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/torrent_list_controls.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d09f7d395dbb207133ba8c05fab60e9de4fcf798857d2dd6db1cb05df73d58"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/activity/presentation/widgets/detail_sheets.dart: lib/features/activity/presentation/widgets/detail_sheets.dart changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is DetailSheets._show at line 87), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(activity): a History row dates an instant on the device\u0027s day\u201D; \u201Cfix(copy): an episode reads S2 E4 everywhere, and a test holds it\u201D; \u201Cfix(ui): paint every status in its own arm of the tone rule\u201D; \u201Cfix(ui): write labels in sentence case with the house middot\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/widgets/detail_sheets.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/detail_sheets.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d661e3561ed14370e6ada60e261c173800f04fec4ecb3d014e229639bf7e42"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/status/media_status.dart: lib/core/status/media_status.dart changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is MediaStatusInfo.label at line 252), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(tone): \u0022Not requested\u0022 rests in neutral, and no status wears the ink\u201D; \u201Cfix(a11y): a percentage is spoken as words, 62 percent\u201D; \u201Cfix(format): one formatter for percentages, glued, and 100% is a claim\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/status/media_status.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/status/media_status.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac20ad2a8802e6e522f81b9fc4f883428bbd087f7a87388918ac62a7ecc22a27"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart: lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is _AddIndexerBodyState._matches at line 80), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D; \u201Cfix(ui): let the eyebrow be the only uppercase voice\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_add_indexer_sheet.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed51af9f7fbc740466a07a69b5140814963b0f10b32218a021594f236ac5e1c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/transmission/presentation/transmission_overview_provider.dart: lib/features/transmission/presentation/transmission_overview_provider.dart changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is TransmissionLabelTally.== at line 148), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(transmission): a ratio of -2 reads infinity, not a dash\u201D; \u201Cfix(format): a no-break space joins a figure to its unit symbol\u201D; \u201Cfix(ui): a size reads one decimal, in the units the services use\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/transmission/presentation/transmission_overview_provider.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_overview_provider.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d8e84ee3c80ca351a7ad3bf538168dbe6988fd01b95b6664a15de8949f4e41"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/stream/presentation/widgets/jellyfin_viewer_picker.dart: lib/features/stream/presentation/widgets/jellyfin_viewer_picker.dart changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is JellyfinViewerPicker.build at line 61), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(errors): a service nobody set up is a type, not a phrase\u201D; \u201Cfix(type): drop the uppercase voice for sentence-case labels\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D; \u201Cfix(ui): write labels in sentence case with the house middot\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/stream/presentation/widgets/jellyfin_viewer_picker.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/widgets/jellyfin_viewer_picker.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d90e49b0dd2e3b15834740fdfd44af6abc3bdfe39ed0f895fedda8b846c872"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/settings/presentation/widgets/donation_sheet.dart: lib/features/settings/presentation/widgets/donation_sheet.dart changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is _DonationSheetState._handlePurchaseUpdate at line 92), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(android): ship without Play Billing\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D; \u201Cfix(ui): paint every status in its own arm of the tone rule\u201D; \u201Cfix(ui): write labels in sentence case with the house middot\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/settings/presentation/widgets/donation_sheet.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/donation_sheet.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2fdcd6edfaede79275c11af22a3922276f979f3d52f6ec13d249a09a18c011"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/header_action_row.dart: lib/core/widgets/header_action_row.dart changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is HeaderActionRow._ringed at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(focus): the detail band\u0027s controls wear the focus ring too\u201D; \u201Cfix(buttons): a page\u0027s primary is button-l, 52 at radius 16, as the brand book draws it\u201D; \u201Cfix(tone): the green scheme role is a tone, and names state no status\u201D; \u201Cfix(ui): keep buttons at the pointer floor on the desktop\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/header_action_row.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/header_action_row.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b43c84118d9faa7cc62719f27a76baca06974f7b9f2b33c79ae83b9dcdaa052"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/app_card.dart: lib/core/widgets/app_card.dart changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is AppCard.build at line 245), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(import): file names are MachineNames and a silenced row keeps the copy action\u201D; \u201Cfix(settings): between rows of choices the hairline starts under their words\u201D; \u201Cfix(card): AppCard is the brand book\u0027s slab: 26, its hairline, lifted on paper\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/app_card.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/app_card.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"794c94a0906ad18f75301aece645e3b4ceac364bbaaef9afd297206c805bfa4d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/truenas/presentation/system/truenas_system_config_screens.dart: lib/features/truenas/presentation/system/truenas_system_config_screens.dart changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is TrueNasNetworkScreen.build at line 243), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(truenas): section headers sit on the page inset, not at twice it\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(ui): write labels in sentence case with the house middot\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/truenas/presentation/system/truenas_system_config_screens.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/system/truenas_system_config_screens.dart"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f53adde233caf59616f7c3644d91bf754531dab877ddce3d211f360db5d0448"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/bazarr/presentation/widgets/bazarr_detail_sections.dart: lib/features/bazarr/presentation/widgets/bazarr_detail_sections.dart changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is BazarrSubtitleLanguageWrap.build at line 23), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(copy): an episode reads S2 E4 everywhere, and a test holds it\u201D; \u201Cfix(arrs): a server that did not answer is said once per page, not per section\u201D; \u201Cfix(bazarr): show the subtitles already on disk on the movie page\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/bazarr/presentation/widgets/bazarr_detail_sections.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/widgets/bazarr_detail_sections.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d752e7dfcfe8002975016ec9575db296430934b53476e4485a686c09c9453c47"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/nzbget/presentation/nzbget_tab_screens.dart: lib/features/nzbget/presentation/nzbget_tab_screens.dart changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _HistoryRow.build at line 91), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(services): qBittorrent RSS and the SABnzbd, NZBGet and Transmission tabs start below the tab bar\u201D; \u201Cfix(format): a no-break space joins a figure to its unit symbol\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/nzbget/presentation/nzbget_tab_screens.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_tab_screens.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5223502437679ec5de70a892f2b45800c0633a5a6fe1ac01253b7ee6730cd467"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/bazarr/presentation/bazarr_overview_provider.dart: lib/features/bazarr/presentation/bazarr_overview_provider.dart changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is BazarrOverviewRow.spoken at line 57), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(bazarr): the readout reads fail without waiting out the backoff\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix: a title and its episode code are set apart by a dot\u201D; \u201Cfix(copy): an episode reads S2 E4 everywhere, and a test holds it\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/bazarr/presentation/bazarr_overview_provider.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_overview_provider.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"869a81b009165d7bb01263f226836a686f3f5864042635652b1b2b0ec9296152"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/settings/presentation/widgets/cert_trust_content.dart: lib/features/settings/presentation/widgets/cert_trust_content.dart changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is CertTrustContent.build at line 79), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(certificates): dates a person reads, and no :443\u201D; \u201Cfix(copy): the app writes American English\u201D; \u201Cfix(ui): paint every status in its own arm of the tone rule\u201D; \u201Cfix(ui): lower the type weight ladder and centre onboarding beside the ring\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/settings/presentation/widgets/cert_trust_content.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/cert_trust_content.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2760f24c9afe68b8935be7bf5a08072150d7926c4477170d0887971d185aebb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/onboarding/presentation/widgets/onboarding_found.dart: lib/features/onboarding/presentation/widgets/onboarding_found.dart changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is _FoundTile.build at line 847), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(connections): a port that never spoke https is named, whatever its handshake did\u201D; \u201Cfix(connections): https on an http port says so, and a certificate stays to be trusted\u201D; \u201Cfix(onboarding): a found row\u0027s remedy names the connection it acts on\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/onboarding/presentation/widgets/onboarding_found.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"d869bdd5a59d53080f465400c1c554d9ccc924954cb088e07a5145b006d14164"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/release_search/data/release_search_notifications.dart: lib/features/release_search/data/release_search_notifications.dart changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is ReleaseSearchNotifications.permissionGranted at line 194), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(release-search): a search and its notification name the connection it runs on\u201D; \u201Cfix(android): give notifications a real small icon\u201D; \u201Cfix: adopt iOS scene lifecycle\u201D; \u201Cfix(release-search): make the notification\u0027s promise land\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/release_search/data/release_search_notifications.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/data/release_search_notifications.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"990f98ad6acebbd0a342f73775ecc12cde097530197ad27bc4945d50c38f5935"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/release_search/presentation/release_search_jobs_provider.dart: lib/features/release_search/presentation/release_search_jobs_provider.dart changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is ReleaseSearchJobsNotifier.refreshWindows at line 309), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): the app writes American English\u201D; \u201Cfix(search): a release search turned away by a gateway names the service\u201D; \u201Cfix: adopt iOS scene lifecycle\u201D; \u201Cfix(release-search): a search belongs to a connection, not to a service\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/release_search/presentation/release_search_jobs_provider.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/release_search_jobs_provider.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e1f4ae3629e7feddbf59ddba9f78876f11ddb03cfe1d83588198e220662eb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/readarr/presentation/readarr_activity_screen.dart: lib/features/readarr/presentation/readarr_activity_screen.dart changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is _ReadarrActivityScreenState.build at line 67), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(readarr): Activity and History follow the connection the lens is on\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(readarr): Queue, Wanted and History start below the tab bar\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/readarr/presentation/readarr_activity_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/readarr_activity_screen.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0421952feef1986c428e4259a72f1abc4263ad51988ba7d55a142cfcabdb11"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/release_search/presentation/widgets/release_search_job_card.dart: lib/features/release_search/presentation/widgets/release_search_job_card.dart changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is ReleaseSearchJobCard._subtitle at line 127), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(release-search): a failed search\u0027s rail is red only for silence\u201D; \u201Cfix(search): a search that stopped with no verdict says so one way\u201D; \u201Cfix(release-search): a search and its notification name the connection it runs on\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/release_search/presentation/widgets/release_search_job_card.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/widgets/release_search_job_card.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7544d3393252c854d2e2528e3a409b1f4af58e1ce81120afabbc339c4378be"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/truenas/presentation/system/truenas_power_card.dart: lib/features/truenas/presentation/system/truenas_power_card.dart changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is TrueNasPowerCard._confirmThenFire at line 136), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(ui): confirm every destructive action in one neutral dialog that names what goes\u201D; \u201Cfix(ui): paint every status in its own arm of the tone rule\u201D; \u201Cfix(ui): lower the type weight ladder and centre onboarding beside the ring\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/truenas/presentation/system/truenas_power_card.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/system/truenas_power_card.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"921135a28a8cc5507d950ff0f64c8b10c21de01b32780268cb9c4bb731bd896f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/unraid/presentation/unraid_overview_provider.dart: lib/features/unraid/presentation/unraid_overview_provider.dart changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is UnraidArrayDigest.headline at line 351), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(unraid): containers and figures on Unraid 7.2 and later, with CPU and memory\u201D; \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(unraid): the array is its parity and cache drives too, and an empty slot is no fault\u201D; \u201Cfix(format): a no-break space joins a figure to its unit symbol\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/unraid/presentation/unraid_overview_provider.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/presentation/unraid_overview_provider.dart"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8add2f105cb69e635fb46666ab04a2707fe9843c536789a9b9a43c6fa3a3c47"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart: lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is _EpisodeListTile.build at line 223), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(tone): the green scheme role is a tone, and names state no status\u201D; \u201Cfix(copy): an episode reads S2 E4 everywhere, and a test holds it\u201D; \u201Cfix(ui): write labels in sentence case with the house middot\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cd4b250978a3e2820dfda6bd14d83c84851309204d793896b6bec9d468794d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/home/domain/stack_lights.dart: lib/features/home/domain/stack_lights.dart changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is StackLights.line at line 132), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(home): the Stack counts the faults its lights show\u201D; \u201Cfix(health): a server reached that never replied has timed out\u201D; \u201Cfix(services): a Stack band does not call a service clean while Needs you holds a fault on it\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/home/domain/stack_lights.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/domain/stack_lights.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"333c565e0d7d261b29909822dc2aa944d73d7f950f52eafcf74aaa07913100df"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/models/service_kpi.dart: lib/core/models/service_kpi.dart changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is ServiceKpi.semanticLabel at line 115), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(dockge): a stopped stack is neutral, never a fault\u201D; \u201Cfix(dashboard): a \u00D7N card counts a film both libraries hold once\u201D; \u201Cfix(queue): a queue the walk could not finish reads as a floor everywhere\u201D; \u201Cfix(tone): backlog is neutral, a fault is amber, red is silence\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/models/service_kpi.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/models/service_kpi.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad069ec0e1c8e345fcb5bac36405efca9130016944d979b9a9fe14270083653"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/npm/data/npm_upstream_probe.dart: lib/features/npm/data/npm_upstream_probe.dart changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is NpmUpstreamProbe._loopback at line 166), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(demo): NPM\u0027s upstream probe asks the world, not the wire\u201D; \u201Cfix(npm): route the advanced block, skip loopback upstreams, one host row\u201D; \u201Cfix(copy): the NPM coverage line fits one row: \u00228 of 23 enabled checked from this device\u0022\u201D; \u201Cfix(npm): a forward target this device could not reach is said as that, never as down\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/npm/data/npm_upstream_probe.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/data/npm_upstream_probe.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cf49a835549e36af6cef75bfc7c7428496ead218f251ca935b0d8d860c2c6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/home/presentation/widgets/home_header.dart: lib/features/home/presentation/widgets/home_header.dart changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _HealthDot.build at line 158), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(health): a server reached that never replied has timed out\u201D; \u201Cfix(home): the month and the health under the day wrap as one sentence\u201D; \u201Cfix(home): the month line keeps its height where it carries no health\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/home/presentation/widgets/home_header.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/home_header.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c26b3d96251f1efadafc89ea5d15a3f25716e94dcd586aaa0400acedee5694"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart: lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is SeerrSignInFlow.readServer at line 285), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(security): close the gaps left in the remediation\u201D; \u201Cfix(security): close credential replay and pairing trust gaps\u201D; \u201Cfix(connections): a port that never spoke https is named, whatever its handshake did\u201D; \u201Cfix(settings): signing in to Seerr says a declined certificate is a choice, and a secure connection that did not open is the address to check\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_sign_in_flow.dart"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04db203958a3253b67f2194f14b929f14c5be1a8db5cb8eb5d3571608da8ad9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/cross_service_action.dart: lib/core/widgets/cross_service_action.dart changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is CapabilityGatedAction.build at line 556), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D; \u201Cfix(copy): a blocked cross-service toast ends with a full stop\u201D; \u201Cfix(discover): a title\u0027s page shows the requester only what is hers\u201D; \u201Cfix(setup): every \u0022Set up X\u0022 opens that service\u0027s own setup form\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/cross_service_action.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/cross_service_action.dart"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bad0d634ff2652bab22aba4d38edf3bea906292bb8a05eed6cf26e336ec2ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/nzbget/domain/models/nzbget_models.dart: lib/features/nzbget/domain/models/nzbget_models.dart changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is NzbgetGroup._droneParameter at line 217), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(format): one formatter for percentages, glued, and 100% is a claim\u201D; \u201Cfix(home): nzbget raises its faults instead of reading as downloading\u201D; \u201Cfix(nzbget): join jobs to the arr queue by their drone id and read the Lo/Hi download rate\u201D; \u201Cfix(clients): silence from a daemon is not an answer of zero\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/nzbget/domain/models/nzbget_models.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/domain/models/nzbget_models.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"083c104525bfef2ae9a0c1e6464e1f6a67024645f90f150847c625aac665154e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/truenas/presentation/system/truenas_diagnostics_screen.dart: lib/features/truenas/presentation/system/truenas_diagnostics_screen.dart changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is _TrueNasDiagnosticsScreenState._run at line 59), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): the app writes American English\u201D; \u201Cfix(ui): give every control a finger reaches a 44pt target\u201D; \u201Cfix(ui): lower the type weight ladder and centre onboarding beside the ring\u201D; \u201Cfix: adopt iOS scene lifecycle\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/truenas/presentation/system/truenas_diagnostics_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/system/truenas_diagnostics_screen.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f124bae44231bf825151ca5c5cecbcf70e0e475315f5010e1b43c29bbbe4d96"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/discover/domain/seerr_arr_server.dart: lib/features/discover/domain/seerr_arr_server.dart changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is SeerrArrServer.reaches at line 99), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(seerr): a server Seerr names by container is matched to its connection\u201D; \u201Cfix(seerr): a connection named inside a sentence reads Radarr 4K, not Radarr \u00B7 4K\u201D; \u201Cfix(seerr): a server Cupola has no connection to is said in plain words\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/domain/seerr_arr_server.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/seerr_arr_server.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9f696c4a4741c710ea0ba6a6a56e7880f824d0262dcb717d9ee834797182d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/npm/presentation/npm_overview_provider.dart: lib/features/npm/presentation/npm_overview_provider.dart changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is NpmCertificateRow.icon at line 530), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(copy): the NPM coverage line fits one row: \u00228 of 23 enabled checked from this device\u0022\u201D; \u201Cfix(npm): a forward target this device could not reach is said as that, never as down\u201D; \u201Cfix(refresh): re-ask the sources a refresh or retry depends on\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/npm/presentation/npm_overview_provider.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_overview_provider.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1641e3fb8f44bcc80231304e8322bf73f4bc896962e44a6591d4cfdc40f79ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/transmission/domain/models/transmission_models.dart: lib/features/transmission/domain/models/transmission_models.dart changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is TransmissionTorrent.warning at line 214), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(services): the six services as the lab found them\u201D; \u201Cfix(transmission): a ratio of -2 reads infinity, not a dash\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D; \u201Cfix(clients): silence from a daemon is not an answer of zero\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/transmission/domain/models/transmission_models.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/domain/models/transmission_models.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf50b74e72a0f9efe436d662348c159ebfe6aba2ff60dc6da66560e8000f5d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/activity/domain/activity_readout.dart: lib/features/activity/domain/activity_readout.dart changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ActivityReadoutPart.== at line 28), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(dates): a day is a day on the night the clocks change\u201D; \u201Cfix(activity): a readout no source could answer is a dash, not Nothing moving\u201D; \u201Cfix(activity): the readout says the speed, whose figure and unit a no-break space holds\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/domain/activity_readout.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/domain/activity_readout.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f9c63ff9f5d9b5bd723c592c4687eab046fa0843fb71322bb33a298aa6ffb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/media_detail_figure_plate.dart: lib/core/widgets/media_detail_figure_plate.dart changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is MediaDetailFigurePlate.build at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(type): drop the uppercase voice for sentence-case labels\u201D; \u201Cfix(ui): write labels in sentence case with the house middot\u201D; \u201Cfix(ui): hold every role under the weight ceiling\u201D; \u201Cfix(ui): lower the type weight ladder and centre onboarding beside the ring\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/media_detail_figure_plate.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_detail_figure_plate.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c5f41af554ca48e56c313fa8d86cb3d3962bd8d865258517d4e786fadd3dd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/shell/presentation/portal_coach_mark.dart: lib/features/shell/presentation/portal_coach_mark.dart changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is _PortalCoachMarkState.build at line 35), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(portal): the coach mark\u0027s hint wraps inside the mark at 200%\u201D; \u201Cfix(motion): skip the coach-mark bounce under a screen reader too\u201D; \u201Cfix(motion): honour Reduce Motion in the coach mark, correct the docs\u201D; \u201Cfix(ui): hold every role under the weight ceiling\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/shell/presentation/portal_coach_mark.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/portal_coach_mark.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd6bfd8056185f5bfe847e5840ae41c24c9936033c93d454b2f9255f13ffaeb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/activity/presentation/widgets/stuck_download_card.dart: lib/features/activity/presentation/widgets/stuck_download_card.dart changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is _StuckDownloadCardState.build at line 66), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(activity): a stuck card says the time once and the route once\u201D; \u201Cfix(home): a stuck download offers on the Home what Needs you offers\u201D; \u201Cfix(activity): a stopped download stays where it can be resumed, on the four clients\u201D; \u201Cfix(import): the Review reads a real Sonarr: a new series, a season pack, what went in\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/activity/presentation/widgets/stuck_download_card.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/stuck_download_card.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dd276dadd3d403bf57200e521206dacede36641c86d5a99ff52c90e1dd2922"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/settings/data/route_probe.dart: lib/features/settings/data/route_probe.dart changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is RouteProbe._onUnreached at line 176), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(settings): route probe knocks settle their wait instead of the cap\u201D; \u201Cfix(network): leaving home with the app open, a read never says the server did not answer\u201D; \u201Cfix(settings): a change of network with the app open asks the connections again\u201D; \u201Cfix(settings): the away recheck runs behind the polling gate\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/settings/data/route_probe.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/route_probe.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d44e36ff3378c7abea6677ea6189824c0c1341f8728670c7f6b7f6d8ad82e8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/requests/domain/my_requests.dart: lib/features/requests/domain/my_requests.dart changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is MyRequest.detail at line 171), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(security): close credential replay and pairing trust gaps\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(dates): a request\u0027s day is said in one voice\u201D; \u201Cfix(dates): a day is a day on the night the clocks change\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/requests/domain/my_requests.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/requests/domain/my_requests.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77c04aceb1134f20754a5383f20f2204448470c9a422c8bafbf009b8df5e31d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/discover/presentation/widgets/discover_videos_button.dart: lib/features/discover/presentation/widgets/discover_videos_button.dart changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is DiscoverVideosButton.build at line 25), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(focus): the detail band\u0027s controls wear the focus ring too\u201D; \u201Cfix(icons): the last baseline Material glyphs are the rounded ones\u201D; \u201Cfix(ui): write labels in sentence case with the house middot\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/presentation/widgets/discover_videos_button.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/discover_videos_button.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d4cc022e25418b78d62a3f0f48cc422f175c68bde88396da3aee071287668c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/tracearr/presentation/tracearr_overview_screen.dart: lib/features/tracearr/presentation/tracearr_overview_screen.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is _ViolationsSection.build at line 276), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(stream): what the real servers showed, and a library that is the library\u201D; \u201Cfix(tracearr): what the whole screens showed once drawn\u201D; \u201Cfix(tracearr): a silent stream falls back, and what a rule saw is read as Tracearr writes it\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/tracearr/presentation/tracearr_overview_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_overview_screen.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cde53c507aabcc5ad920199214a189add234b56235157e3fe9a56aa2704dcec"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/onboarding/presentation/requester_sign_in_screen.dart: lib/features/onboarding/presentation/requester_sign_in_screen.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _RequesterSignInScreenState.initState at line 131), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(security): close the remaining review decisions\u201D; \u201Cfix(security): close the gaps left in the remediation\u201D; \u201Cfix(security): close credential replay and pairing trust gaps\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/onboarding/presentation/requester_sign_in_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/requester_sign_in_screen.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"71efa5ce40f6bdc037c15390b991197edcb1d148dda2efb6978b3910e2352d1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/media/presentation/media_decision_card.dart: lib/features/media/presentation/media_decision_card.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is MediaDecisionCard.build at line 49), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(rooms): Overviews hold still, pages pass under the bar, groups are paper by day\u201D; \u201Cfix(copy): a wrapped line never starts with the dot, and MB/s stays whole\u201D; \u201Cfix(dates): the rows about a request or a person say their day\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/media/presentation/media_decision_card.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_decision_card.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d34701c71ce37c343090a33430ea94bbf45c884581fb2158588285c8cc5d92"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/readarr/presentation/readarr_history_screen.dart: lib/features/readarr/presentation/readarr_history_screen.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is _ReadarrHistoryScreenState.build at line 73), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(readarr): Activity and History follow the connection the lens is on\u201D; \u201Cfix(readarr): Queue, Wanted and History start below the tab bar\u201D; \u201Cfix(ui): a full-page failure names the service its caller knows\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/readarr/presentation/readarr_history_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/readarr_history_screen.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35d3a33b9382d9c8dbe24b8f98bf4952f98ea1bb5a145d5628e8c5cc2eafabf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/transmission/presentation/widgets/transmission_torrent_tile.dart: lib/features/transmission/presentation/widgets/transmission_torrent_tile.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is TransmissionTorrentTile.build at line 51), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(transmission): a moving torrent\u0027s row says how long the rest will take\u201D; \u201Cfix(downloads): a Transmission row read before the failure says how old it is\u201D; \u201Cfix(format): one formatter for percentages, glued, and 100% is a claim\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/transmission/presentation/widgets/transmission_torrent_tile.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/widgets/transmission_torrent_tile.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa64460bb900d532aef81b9aa46d703d1430cd9594bcc02ae36097ffff58f6b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/capability_banner.dart: lib/core/widgets/capability_banner.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is CapabilityBannerSlot.build at line 216), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D; \u201Cfix(capability): the banner stacks its action by the role it draws\u201D; \u201Cfix(ui): give every control a finger reaches a 44pt target\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/capability_banner.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/capability_banner.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"87eb6278be9380f8d3ea77ad6e260cc7baa6ad5279430e3af81688db7660e3e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/media_detail_placeholder_view.dart: lib/core/widgets/media_detail_placeholder_view.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is MediaDetailPlaceholderView.build at line 81), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(errors): a service nobody set up is a type, not a phrase\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D; \u201Cfix(copy): one word per state, across the app\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/media_detail_placeholder_view.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_detail_placeholder_view.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80dbb493ffdc4faacf5061acafa56a3d8d4e589d5c0a0876e0b9de0dab1d751"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/widgets/connection_badge.dart: lib/core/widgets/connection_badge.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is ConnectionBadge.build at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(design): spacing and radius in the shell chrome sit on the scale\u201D; \u201Cfix(type): drop the uppercase voice for sentence-case labels\u201D; \u201Cfix(ui): walk accent and status ink against the ground it sits on\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/core/widgets/connection_badge.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/connection_badge.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0348ffb6d1321656f273ded595f672098dc9e2d9ee3a66045047a8458e52aeb6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart: lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is _CategoryPickerState.build at line 66), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D; \u201Cfix(ui): lower the type weight ladder and centre onboarding beside the ring\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_category_picker.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8fd4d70b7d12c00ca033f92cd3be08c46c3af1521edd3d06b4d0538b5253ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart: lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is ProwlarrDownloadClientField.build at line 32), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(ui): a full-page failure names the service its caller knows\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D; \u201Cfix(ui): lower the type weight ladder and centre onboarding beside the ring\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/prowlarr/presentation/widgets/prowlarr_provider_pickers.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33d7a52be4d15f1eb7773b47ade1637aceb9ca862d4953c167b37f2114a77dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/tracearr/presentation/tracearr_history_screen.dart: lib/features/tracearr/presentation/tracearr_history_screen.dart changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is TracearrHistoryScreen.build at line 48), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(stream): what the real servers showed, and a library that is the library\u201D; \u201Cfix(tracearr): what the whole screens showed once drawn\u201D; \u201Cfix(tracearr): a silent stream falls back, and what a rule saw is read as Tracearr writes it\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/tracearr/presentation/tracearr_history_screen.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/presentation/tracearr_history_screen.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d6f132257c2de5a0b18a83b7bad5be7c4c06108955a28716c0cc809670f16e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/qbittorrent/presentation/widgets/qbittorrent_actions_bar.dart: lib/features/qbittorrent/presentation/widgets/qbittorrent_actions_bar.dart changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is QbittorrentOverflowMenu._handle at line 59), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(clients): Stop follows Stopped, queues say Queue, Set up X comes back\u201D; \u201Cfix(actions): menus name their subject and failures name the action\u201D; \u201Cfix(copy): every screen says a state in the lexicon\u0027s one word\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/qbittorrent/presentation/widgets/qbittorrent_actions_bar.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/presentation/widgets/qbittorrent_actions_bar.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5952b5a7389d528d517223361fe182cb22758773147393721d77ba37eeb900"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/discover/domain/seerr_request_gate.dart: lib/features/discover/domain/seerr_request_gate.dart changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is SeerrRequestCopies.standardOpen at line 46), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(seerr): a title on disk in HD can still be requested in 4K\u201D; \u201Cfix(seerr): a 4K request goes to the 4K server and says it is 4K\u201D; \u201Cfix(discover): a Seerr code reads in its server\u0027s numbering, blocklisted included\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/discover/domain/seerr_request_gate.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/seerr_request_gate.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36c3c70b5aae6dc345db052b7c01be3f75c72861976cb14262b2be44d0f1168"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/features/pairing/domain/pair_plan.dart: lib/features/pairing/domain/pair_plan.dart changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is PairPlan.of at line 38), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(security): close the remaining review decisions\u201D; \u201Cfix(security): close credential replay and pairing trust gaps\u201D; \u201Cfix(pairing): a copy fills a connection left with no address instead of adding a second one behind it\u201D. 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 \u0060git log --since=\u00272026-08-19 14:17:35 \u002B01:00\u0027 --until=\u00272026-11-17 14:17:35 \u002B01:00\u0027 --full-history --no-merges -- lib/features/pairing/domain/pair_plan.dart\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/domain/pair_plan.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdedd0effab3f7e80d82e08f1e540d248d5c4ab58f3a8487fad137d6b6e7b49a"}},{"ruleId":"D16","level":"warning","message":{"text":"bus factor 1 \u2014 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 \u2014 88% of the 1668 commit(s) sampled \u2014 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 \u2014 have a second contributor review or pair on them \u2014 and write down the parts only one person can currently change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a99f114ab4dfee37ae0bf0665b44c7468d85b809d361949e2b6258101fa1e5a2"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 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 (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 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 \u0060docs/adr/\u0060. ADRs are expected here because \u0060macos/Runner.xcodeproj/project.pbxproj\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macos/Runner.xcodeproj/project.pbxproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f0bd4325cb484fa699f9766497db05ed665b24b57923e0afe7629a5ed95be7"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pubspec.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9fee3010c053c10733ebad6b156234032ce361c46f8c03bb63f2bdc3c8adbd"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"795e1872b4f74106d9a952c76f4741dc6a57d7d01f66af30538cb23f275f101e"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aeec9ffd69e9b6c653b2514e27a1f8759db03ba16873bfdce85f0b2bccaddd1b"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be7de90553fb571830afae7b8f3b90b4b61431d94193bd0e49d726e1b144aa92"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3c02ef0a6d1f5caf099d5402296c8931dd1badc5128cca45bfc812915b35952"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-653","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: movies_screen.dart, music_screen.dart, series_screen.dart: 3 files \u2014 \u0060lib/features/movies/presentation/movies_screen.dart\u0060, \u0060lib/features/music/presentation/music_screen.dart\u0060, \u0060lib/features/series/presentation/series_screen.dart\u0060 \u2014 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\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/movies_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43a8e20e1115d882d491c335dd1e464b528f7eb48715aa88e07b9a2e3cf407f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: services_provider.dart \u2192 dashboard_decision.dart, download_client_faults.dart, in_flight.dart: \u0060lib/features/services/presentation/services_provider.dart\u0060 changes together with 3 other files \u2014 \u0060lib/features/services/domain/dashboard_decision.dart\u0060, \u0060lib/features/services/domain/download_client_faults.dart\u0060, \u0060lib/features/services/domain/in_flight.dart\u0060 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/services_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14df1d99012c694f40dcaa6806049e3bc02218963c32edb2e5a1b04dee6c0eb"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: radarr_service.dart, lidarr_service.dart, sonarr_service.dart: 3 files \u2014 \u0060lib/features/movies/data/radarr_service.dart\u0060, \u0060lib/features/music/data/lidarr_service.dart\u0060, \u0060lib/features/series/data/sonarr_service.dart\u0060 \u2014 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\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/data/radarr_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"138630a587c967004dbd9eec9ec5b53a528139e4778c67b78dec9df008b90b3f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lidarr_overview_screen.dart \u2194 sonarr_overview_screen.dart: \u0060lib/features/music/presentation/lidarr_overview_screen.dart\u0060 and \u0060lib/features/series/presentation/sonarr_overview_screen.dart\u0060 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 \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u0060cb0ca8ad\u0060 fix(overview): Sonarr and Lidarr keep the Needs attention count throu\u2026; \u00603c054904\u0060 refactor(overview): share the arr Overviews\u0027 rows, history section, p\u2026; \u0060a07fc4af\u0060 refactor(overview): one page for the shell of fourteen Overviews \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_overview_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d37c120bdab962ecb5f6082c647b109cda4432e148f1e1b2b028bc36e498914"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: sabnzbd_screen.dart \u2194 transmission_screen.dart: \u0060lib/features/sabnzbd/presentation/sabnzbd_screen.dart\u0060 and \u0060lib/features/transmission/presentation/transmission_screen.dart\u0060 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 \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u00605743f039\u0060 refactor(clients): read a download client\u0027s queue page once, and draw\u2026; \u006046c948b9\u0060 fix(clients): under the stale band, the rail\u0027s rates read a dash; \u00609859322d\u0060 fix(clients): a download queue that stopped coming back says how old \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/sabnzbd/presentation/sabnzbd_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8e69b7ea4c39da2168a5c05680a6a64577bd3c87104e74f534d4247c168750"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: nzbget_screen.dart \u2194 transmission_screen.dart: \u0060lib/features/nzbget/presentation/nzbget_screen.dart\u0060 and \u0060lib/features/transmission/presentation/transmission_screen.dart\u0060 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 \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u00605743f039\u0060 refactor(clients): read a download client\u0027s queue page once, and draw\u2026; \u006046c948b9\u0060 fix(clients): under the stale band, the rail\u0027s rates read a dash; \u00609859322d\u0060 fix(clients): a download queue that stopped coming back says how old \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4835ccd11e497b7897c0961d95a27a73271d3bac951fb9ffb31e1cf8943b4a2c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: radarr_overview_provider.dart, lidarr_overview_provider.dart, sonarr_overview_provider.dart: 3 files \u2014 \u0060lib/features/movies/presentation/radarr_overview_provider.dart\u0060, \u0060lib/features/music/presentation/lidarr_overview_provider.dart\u0060, \u0060lib/features/series/presentation/sonarr_overview_provider.dart\u0060 \u2014 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\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/radarr_overview_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13626bb0742991ea0ab7075c400801ed896fa48a71f8436f45654846cd76fe8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: jellyfin_client.dart \u2194 plex_client.dart: \u0060lib/features/jellyfin/data/jellyfin_client.dart\u0060 and \u0060lib/features/plex/data/plex_client.dart\u0060 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 \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u00608a0c5a51\u0060 refactor(stream): remove the refresh write and the unchecked external\u2026; \u006014e66fc9\u0060 feat(stream): a media server reads the page key of a series; \u00603d241db7\u0060 chore: drop three readers that could say the wrong thing, none of the\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/jellyfin_client.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bcdb3188b412ee5acb5efd082097e724defd7c67418594cf7bb13cfb75d0d5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: radarr_overview_screen.dart \u2194 sonarr_overview_screen.dart: \u0060lib/features/movies/presentation/radarr_overview_screen.dart\u0060 and \u0060lib/features/series/presentation/sonarr_overview_screen.dart\u0060 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 \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u00603c054904\u0060 refactor(overview): share the arr Overviews\u0027 rows, history section, p\u2026; \u0060a07fc4af\u0060 refactor(overview): one page for the shell of fourteen Overviews; \u006001cfba48\u0060 feat(settings): only at home is said once, and its remedy opens the a\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/movies/presentation/radarr_overview_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68070ff4869ff2e4d441eab596a0d542dfec77cad682055bda06f5c3bcd52b03"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: npm_screen.dart \u2194 unraid_screen.dart: \u0060lib/features/npm/presentation/npm_screen.dart\u0060 and \u0060lib/features/unraid/presentation/unraid_screen.dart\u0060 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 \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u0060d8ddf2b5\u0060 fix(services): a Retry on a client\u0027s page asks the server again; \u0060f50cb2e2\u0060 feat(status): a band over a silent service says since when; \u0060ad0d4089\u0060 fix(clients): a failed probe is a band over the last read, an empty q\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bc87623f29ac0201539029c2e25c6bbafe0f0c3fcaa474755dca48364b07f1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: service_verification.dart, connection_presentation.dart, transmission_actions.dart: 3 files \u2014 \u0060lib/features/settings/data/service_verification.dart\u0060, \u0060lib/features/settings/domain/connection_presentation.dart\u0060, \u0060lib/features/transmission/presentation/transmission_actions.dart\u0060 \u2014 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\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/service_verification.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97500092581fb0067d915946f5d9583db5131852c85da3d378b4ef77b35aebd5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: in_flight.dart \u2194 dashboard_sections.dart: \u0060lib/features/services/domain/in_flight.dart\u0060 and \u0060lib/features/services/presentation/dashboard_sections.dart\u0060 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 \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u00604e9466e0\u0060 feat(home): the Home of modules, arranged by each person; \u0060947c5434\u0060 fix(home): a download paused on purpose is backlog on every client; \u006058c91a98\u0060 fix(home): needs a decision, in flight and recently added count every\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/domain/in_flight.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ecce08ccbe760ecda745e1fcf0aeb07695a477d0b6b0886fd047db66a4ac53"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"error","message":{"text":"\u003Csvg role=\u0022img\u0022\u003E without an accessible name: An svg presented as an image needs a name \u2014 add a \u003Ctitle\u003E child or an aria-label/aria-labelledby."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/ServiceRingMotion/preview.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3606369c9e2528a58d4fed02b43a20b7aaa41ad9e6b6f7f02ad8b8c56c302d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: 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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/ReelLine/preview.html"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff6de26d38742f287b89db480ebf4e269d0724f13955ae9d601968db6926529"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/DetailHeroCollapse/preview.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c791ca4db6d3bb00a914e59a99b8a1d2090feb353f7afd060ce17f77bb4b3ece"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/MotionTokens/preview.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f717aec4391db1e79b5f9aa0df0d8e8aa9309feca5fbe66a195bdc965d69530b"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/NavPillTransition/preview.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0919a8919bb694def20b183809449303dc04f1a3688d31b8c451eb90fabcf22"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/PosterFlight/preview.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0f24d29a37c87c229173238817db03db32624b06e4f431020ca7eee5f27766"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/PressableScale/preview.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"051d91352593f5b524ad914ca444a36fa2b71f0edd55b0c51061a236a73034cb"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/ReelLine/preview.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"109157ddc4e0810f431e1ca4c20d07bc79361a018cc023cb1ef7dc5daa669fbb"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/ServicePortalPhysics/preview.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e29fb1240e14041f0250f956251baa24655f2d0cb2e2ff813a4026d2aeb558"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/ServiceRingMotion/preview.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"639425e9aec1f993dac5004525c9cd7ccf1e12bb64d329e26bf3b24bed79aa3d"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/ShimmerSweep/preview.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7f15affa4b189bc5691331bf907d16c8a97e1616d331924c7241a180839bfd"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/StatusBadgeAnimated/preview.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f473c51f5b28d8fbc3f3041237ebca654d923d2e8cf96672e8b4a289ce3c47cb"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cp-nav-item with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/ServicePortalPhysics/preview.html"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"703588572f3fefc70c9b4009917b1b7541c2fef42d01b1be820a0d79fffb2ed6"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cp-nav-item with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/ServicePortalPhysics/preview.html"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7205c09129747a0b9739ff01de1e070631c74c3cec3cc3e055e7fd2bd54b0522"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cp-nav-item with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/ServicePortalPhysics/preview.html"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fd6f6485c134dc8846ecbd03854c99b9311120998bbbf5f58a729f66037774"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .cp-nav-item with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/ServicePortalPhysics/preview.html"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e49312b70b50057c92825b3199af9cf6ff9d2d23bef00c1874055e6cfbde278"}},{"ruleId":"AC5","level":"error","message":{"text":"aria-hidden hides a focusable element: aria-hidden=\u0022true\u0022 here hides the subtree from assistive tech, but a focusable descendant stays in the tab order \u2014 a keyboard user can land on a control screen readers can\u0027t see. Add inert, take the descendants out of the tab order (tabindex=\u0022-1\u0022), or drop aria-hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/PosterFlight/preview.html"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b9fe61dd4bfa957f87faa00444a8d4ddd36117db2ce756b17364c6b6aa830f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.cp-service-ring-motion-svg .is-hit:focus-visible\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/motion.css"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4192ce29f7ea3d95447f7db095a010e1731c6d71387d2cd3ab57ae43fcf835b7"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.cp-motion-switch-track::after\u0060 moves (\u0060transition: transform 200ms cubic-bezier(0.215, 0.61, 0.355, 1), background-color 200ms linear\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/motion.css"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"34aa0a397287aea15fcff04b01133753561bf887f9dc1583d3a3d455ea013f4e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.cp-shimmer-sweep-block::after\u0060 moves (\u0060animation: cp-shimmer-sweep-v 1600ms cubic-bezier(0.445, 0.05, 0.55, 0.95) infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/motion.css"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7929e5321681f4af3b10fc8a491b2840b154f7621e5cd92512ce94544f37b905"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.cp-nav-pill-transition-ind\u0060 moves (\u0060transition: 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)\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/motion.css"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6d8ee18c610a169d12b3aa7f4824f52fa2685b9dac1a272a307936ab4de376"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.cp-service-portal-physics-coach\u0060 moves (\u0060transition: transform calc(320ms * var(--k)) cubic-bezier(0.2, 0.8, 0.2, 1), opacity calc(320ms * var(--k)) linear\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"design/system/motion/motion.css"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc9ea8c420577d5818872e57daef2d447121cd9eede8432569b94cabb2d910b"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider releaseSearchReachResolverProvider captures autoDispose releaseSearchReachProvider: \u0060releaseSearchReachResolverProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(releaseSearchReachProvider\u2026)\u0060, which is declared auto-dispose (lib/features/release_search/presentation/release_search_entry.dart:61). Read in build, \u0060releaseSearchReachProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060releaseSearchReachResolverProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060releaseSearchReachProvider\u0060 keepAlive too, make \u0060releaseSearchReachResolverProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/release_search_entry.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f23795c1712e5e30ca3ff9cd2a5c9aff558722fe76a49cc7a4235031c54a12"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider releaseSearchRunnerProvider captures autoDispose releaseSearchTransportProvider: \u0060releaseSearchRunnerProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(releaseSearchTransportProvider\u2026)\u0060, which is declared auto-dispose (lib/features/release_search/presentation/release_search_entry.dart:159). Read in build, \u0060releaseSearchTransportProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060releaseSearchRunnerProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060releaseSearchTransportProvider\u0060 keepAlive too, make \u0060releaseSearchRunnerProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/release_search_entry.dart"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7b11239952d1874640117fb8bcc2c216b51439767fa75db010b95e3ccc9c6e"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider bestMissingProvider captures autoDispose seerrNumberingProvider: \u0060bestMissingProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(seerrNumberingProvider\u2026)\u0060, 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 \u0060seerrNumberingProvider\u0060 is never disposed \u2014 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 \u0060seerrNumberingProvider\u0060 keepAlive too, make \u0060bestMissingProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/catalog_providers.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"962bb9bcf1d0860f45e8ba3a2d2c574599c75ff03064c322e37eb6eac2acf431"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider catalogHideOwnedProvider captures autoDispose seerrServerFactsProvider: \u0060catalogHideOwnedProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(seerrServerFactsProvider\u2026)\u0060, 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 \u0060seerrServerFactsProvider\u0060 is never disposed \u2014 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 \u0060seerrServerFactsProvider\u0060 keepAlive too, make \u0060catalogHideOwnedProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/catalog_providers.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d148975d7ccc03f7ce1897eb66aadeac41d49ab519308b50fd579f23d7d49e7"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider atriumShelfKeeperProvider captures autoDispose seerrNumberingProvider: \u0060atriumShelfKeeperProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(seerrNumberingProvider\u2026)\u0060, 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 \u0060seerrNumberingProvider\u0060 is never disposed \u2014 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 \u0060seerrNumberingProvider\u0060 keepAlive too, make \u0060atriumShelfKeeperProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/catalog_providers.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"61365ca543b3f1ff47c75887fa6f123035a91f41ac6825ee8137b53512963b0b"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider completeTheCollectionProvider captures autoDispose seerrNumberingProvider: \u0060completeTheCollectionProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(seerrNumberingProvider\u2026)\u0060, 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 \u0060seerrNumberingProvider\u0060 is never disposed \u2014 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 \u0060seerrNumberingProvider\u0060 keepAlive too, make \u0060completeTheCollectionProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/library_shelves_provider.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"53006da8570cdb60aa322f44ecec0d070cea91dd04428fa5168ddeab4d264a3d"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider completeTheCollectionProvider captures autoDispose collectionDetailProvider: \u0060completeTheCollectionProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(collectionDetailProvider\u2026)\u0060, 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 \u0060collectionDetailProvider\u0060 is never disposed \u2014 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 \u0060collectionDetailProvider\u0060 keepAlive too, make \u0060completeTheCollectionProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/library_shelves_provider.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bd22ee2045291424994b1e574fd93dbf997300f7844c722c4fe8fe75b448ac"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: MediaBrowserDialect (17 abstract methods): \u0060MediaBrowserDialect\u0060 declares 17 abstract methods: \u0060service\u0060, \u0060basePath\u0060, \u0060serviceHeaders\u0060, \u0060interceptors\u0060, \u0060isThisServer\u0060, \u0060sessionsQuery\u0060, \u0060liveSessions\u0060, \u0060browseFields\u0060, \u0060users\u0060, \u0060credentialKind\u0060, \u0060tokenUserAsViewer\u0060, \u0060rawItem\u0060, \u0060resume\u0060, \u0060nextUp\u0060, \u0060search\u0060, \u0060virtualFolders\u0060, \u0060episodeSortBy\u0060. Counted over its public methods with no body, once per name; concrete methods and \u0060_\u0060-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\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_dialect.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0291fded14a3c801386f0a01caf303b43673a9563c67fd8144b7fc69f138a3"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: StreamServerClient (21 abstract methods): \u0060StreamServerClient\u0060 declares 21 abstract methods: \u0060probeVersion\u0060, \u0060verifyCredential\u0060, \u0060getSessions\u0060, \u0060stopSession\u0060, \u0060getLibraries\u0060, \u0060getLibraryItemCount\u0060, \u0060search\u0060, \u0060getLibraryPage\u0060, \u0060getItem\u0060, \u0060getSeriesKey\u0060, \u0060getTitleKey\u0060, \u0060getChildren\u0060, \u0060getEpisodes\u0060, \u0060lookupByExternalId\u0060, \u0060getContinueWatching\u0060, \u0060getNextUp\u0060, \u0060getRecentlyAdded\u0060, \u0060getRecentlyWatched\u0060, \u0060getViewers\u0060, \u0060imageFor\u0060, \u0060close\u0060. Counted over its public methods with no body, once per name; concrete methods and \u0060_\u0060-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\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/domain/stream_server_client.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57eb9f865c50cda0674cee311f430c1fcd07514ee1d091731ee75fa318d2746"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 settings: \u0060ActivityServiceResult\u0060 (slice \u0027activity\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_provider.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd2374bc724ef741710fea141cd9419e02cca0917b3d516001aadd3e074270b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 services: \u0060ActivityFeed\u0060 (slice \u0027activity\u0027) depends on \u0060SourceCoverage\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_provider.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4024a94cc80a056aa626d01fb8751ebedade2a26baee25b1bfdc5431856e3452"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 settings: \u0060GlobalActivityItem\u0060 (slice \u0027activity\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_provider.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9bc1f7b999806a5dd0c22f53f20c506e9880caec44362ea1b1115d3a752f01"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 settings: \u0060ArrCalendarScreen\u0060 (slice \u0027activity\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/arr_calendar_screen.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3023e701b3b0b494b4b22077d1e4ec0a5ab3d912a8876bfab27b281168ec95c5"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 services: \u0060_Commands\u0060 (slice \u0027activity\u0027) depends on \u0060ServiceQueueItem\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/download_page.dart"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a33aa6bdf0a618863d840e4c7a4b757501efab43fa8739745290e50e03c472f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 services: \u0060ActivityDownloadRow\u0060 (slice \u0027activity\u0027) depends on \u0060ServiceQueueItem\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_download_row.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"883539502bd01fcfefda8f7741166a6cdc9dcb1dff6a78de5fb1821c56e2f7f9"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 services: \u0060ActivityHistoryRow\u0060 (slice \u0027activity\u0027) depends on \u0060ArrHistoryEntry\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_history_row.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfcc099d79697cc7d856899058c48cad11dfc9773481366f7288c67ed7a63b0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 services: \u0060DecisionFaultCard\u0060 (slice \u0027activity\u0027) depends on \u0060DashboardDecision\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/decision_fault_card.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6661a346e1e7ec6d15dd4d0ecfb7110bc81f03884fdd06c7814a20dcc77d8c85"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 services: \u0060_Row\u0060 (slice \u0027activity\u0027) depends on \u0060ServiceQueueItem\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/download_table.dart"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c86b7884a857c4b03cd068a95a685131407cd0c61b51981fb49a3e0b49a754"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 requests: \u0060EveryoneRequestRow\u0060 (slice \u0027activity\u0027) depends on \u0060MyRequest\u0060 from slice \u0027requests\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/everyone_request_row.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"512d404fca56c1ce7559136a02631dde27661daa0f51f3adeb98565c32db536e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 services: \u0060ReportedProblemsCard\u0060 (slice \u0027activity\u0027) depends on \u0060DashboardDecision\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/reported_problems_card.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"68baa7e78e1749275a7cbac7de05167ed8d348fe9932e35a4b93a8126e609e4c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 services: \u0060_IssueLine\u0060 (slice \u0027activity\u0027) depends on \u0060DashboardDecision\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/reported_problems_card.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8db50a43650f075f594f6df3b1aacec7ed0828a468ec007fea05b9ea90210a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 series: \u0060SonarrWantedHierarchy\u0060 (slice \u0027activity\u0027) depends on \u0060SonarrService\u0060 from slice \u0027series\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"421a585ae36acdc7212683d46087fcade6af93a716e996abf8a7b29e1a054d79"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 series: \u0060_SeriesExpansionTile\u0060 (slice \u0027activity\u0027) depends on \u0060SonarrService\u0060 from slice \u0027series\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fb6dbed732a8eb09c0adc874922c0b9c870809ddb66d80cc9d5ba3e1a4dfbf"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 series: \u0060_SeasonExpansionTile\u0060 (slice \u0027activity\u0027) depends on \u0060SonarrService\u0060 from slice \u0027series\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9034813432c3c58b224592e8fecd74109954d6c7edf940a4de839a8f6e0825c7"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 series: \u0060_EpisodeListTile\u0060 (slice \u0027activity\u0027) depends on \u0060SonarrService\u0060 from slice \u0027series\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/sonarr_wanted_hierarchy.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2cce26830920e3e6410d7826a062a52b52149e263d766553fc6de83f0b5968"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 services: \u0060StorageAlertCard\u0060 (slice \u0027activity\u0027) depends on \u0060DashboardDecision\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/storage_alert_card.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5aa5cd9fe32daa3268cc9c21049bca7ccab2a3c70ef3f9674025a40ff67c4a0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: activity \u2192 services: \u0060ViolationDecisionRow\u0060 (slice \u0027activity\u0027) depends on \u0060DashboardDecision\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/violation_rows.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"338ce4908623cca7161399db1f49fbe05ec6e4843c7d63ebe2fadd759f712cf3"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 settings: \u0060CalendarKind\u0060 (slice \u0027discover\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/library_calendar.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f291e03f7ea59d8e983cb009f40fdb0b4a6f7661473e68847963664c21c63345"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 media: \u0060CalendarMediaTarget\u0060 (slice \u0027discover\u0027) depends on \u0060MediaKey\u0060 from slice \u0027media\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/library_calendar.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9955c612724a854a4dc1e2a785064aad7783e2def53ce215eb0c5331fae3d4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 settings: \u0060CalendarShelfTarget\u0060 (slice \u0027discover\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/library_calendar.dart"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"141ad9ff3ba5dfef49fc94bf6cd8627fab5e823e656f1a907f3700bf0b469db4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 settings: \u0060CalendarReading\u0060 (slice \u0027discover\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/library_calendar.dart"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"64582c63e4784558b4442863835985238a93ee92b5d34ba75f055f1bd28e83b0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 settings: \u0060SeerrArrServer\u0060 (slice \u0027discover\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/seerr_arr_server.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"089db160f67860ce395f03afb27d796080822ecce222f149246659877301b71b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 settings: \u0060SeerrApproveTarget\u0060 (slice \u0027discover\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/seerr_arr_server.dart"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d07c044b36b082fbd9944b09f120c13d79dae698a29b89d92f5421fdaa63387"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 settings: \u0060SeerrInvite\u0060 (slice \u0027discover\u0027) depends on \u0060ConnectionAccess\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/seerr_invite.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c70a1064667a997b7a30fa1c1e55422e7c55018167974c18e421a7dd2e14d3b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 settings: \u0060SeerrBoundCopy\u0060 (slice \u0027discover\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/seerr_media_copy.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3891fd6b9ea7e73a27dc89587fbd1812a80956e95796822ccb9e1c96785b6b57"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 search: \u0060_TitleRow\u0060 (slice \u0027discover\u0027) depends on \u0060SearchTitle\u0060 from slice \u0027search\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/discover_page.dart"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d443cdcb3bc7d951816b1f15a88c5be0fb0f1d5767b78fab0801a281a50f7be"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 search: \u0060_SilentSource\u0060 (slice \u0027discover\u0027) depends on \u0060GlobalSearchServiceResults\u0060 from slice \u0027search\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/discover_page.dart"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf67a6dac071031372dc80255fbc4fb345f923c460af7f2d51ddd85111ecf9cf"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 music: \u0060_AlbumRow\u0060 (slice \u0027discover\u0027) depends on \u0060LidarrAlbum\u0060 from slice \u0027music\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/more_from_your_artists_page.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0addbc74f49df3b7e0080e83e6fc70b22b1f7245299fe08166110ee9909013c4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: discover \u2192 settings: \u0060SearchRowSetUp\u0060 (slice \u0027discover\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/widgets/search_row.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"101ee881cdb39b576a668504806d7a75033467c4bdbe111b0003c4ca1474d715"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: home \u2192 services: \u0060FeaturedArrival\u0060 (slice \u0027home\u0027) depends on \u0060ArrHistoryEntry\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/domain/featured.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7459dc38985cf248802b1d2f74def7655705345526aa23583ed4579f86d909"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: home \u2192 settings: \u0060StoragePool\u0060 (slice \u0027home\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/domain/storage.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"561f2bb7a928a20b2a6731280eef122c34fa6368d4fd44b202e1876ce62fbaee"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: home \u2192 services: \u0060ArrivedCard\u0060 (slice \u0027home\u0027) depends on \u0060ArrHistoryEntry\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/arrived_module.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"5069c7c6bec37fa130d323771f72c55ccf53b945a86c07b246916e6ade2a3303"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: home \u2192 settings: \u0060_WhoAreYou\u0060 (slice \u0027home\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/continue_watching_module.dart"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"00abec25b037bfd6296ffd5d71e2ec3ed7d12b0f12155941c3976996f1706942"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: home \u2192 services: \u0060DownloadRow\u0060 (slice \u0027home\u0027) depends on \u0060ServiceQueueItem\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/downloads_module.dart"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d585cd10887f9305398f1d5eec4a6919e52945ebe9109be0429f777164c057d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: home \u2192 services: \u0060_StuckRemedy\u0060 (slice \u0027home\u0027) depends on \u0060ServiceQueueItem\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/downloads_module.dart"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0aa457fd7cb01fe5d7c02fe0411bf7ce820cf9c96d8917793b875019cccd901"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: home \u2192 shell: \u0060_HealthDot\u0060 (slice \u0027home\u0027) depends on \u0060StackHealth\u0060 from slice \u0027shell\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/home_header.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd95b0e36106319d77bf595e1d84db2aaca849e614fe71e13b2476f489d51ce8"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: home \u2192 services: \u0060HomeCoverageNote\u0060 (slice \u0027home\u0027) depends on \u0060SourceCoverage\u0060 from slice \u0027services\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/home_module_parts.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d337e4d5771601470d0eeefbd2ae717f5ecdc238d32b13a3dcdcbf4ff6f28e8"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: home \u2192 stream: \u0060NowPlayingRow\u0060 (slice \u0027home\u0027) depends on \u0060StreamActivityRow\u0060 from slice \u0027stream\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/now_playing_module.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f29c659e53b4ceb1061bce71a9d145de9c35494abc64fdc1904e3a667a5c03"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: home \u2192 stream: \u0060_PersonDisc\u0060 (slice \u0027home\u0027) depends on \u0060StreamActivityRow\u0060 from slice \u0027stream\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/now_playing_module.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8f494f3c77851410d3254f2a64113b6fd994f9a79f9ea7520a319f76bc1b78"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: home \u2192 requests: \u0060_AlsoReady\u0060 (slice \u0027home\u0027) depends on \u0060MyRequest\u0060 from slice \u0027requests\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/ready_to_watch_module.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"678624a0020d5b0f9478121300608f27ed709a7b820639ca9541956ea4deaf42"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060ManualImportService\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/data/manual_import_service.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ae0ccd91c0b6d8c4f58bcbbca5aa870f99a37f84f45122fa18b92fe711583e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060BlockedImportWhy\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7228fc925f62e1ca4c8a7fe93acdf1b1c74021acfdd6ddf7b7ffaf02a66f79d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060BlockedImportClearGroup\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"299804540dd388d651b897a59d6963cd347c5389b586bd459eb902886b232195"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_ClearRow\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8339e3c62b090c5287e757890c43bf0eb0649ffd7e7bce3fdee9ce29187288"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060BlockedImportNeedYouRow\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_parts.dart"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"5528410b0807880a55109912fe685d70a02b3e6ce79121ac3f91c6c7526d0fc4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060BlockedImportReviewPage\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_review_page.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2221ba7081d98bf95f0b3407b930f1a7c4c43b9396d5430c2f034b29502ef33"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_MatchSheet\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_fix_sheet.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cfd0ac03b63cde94a4e1ce7bf12684587176d492b775a1376e63f2ec198f57"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060ManualImportLocateScreen\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_locate_screen.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8020eaefa12bfe12012a81fe9958ccbac1dee1a1b19280a5011d134d633e8c87"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_LocateBody\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_locate_screen.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc03d1681dd8c335353c7c775c7d06b27841fd21596ea91ca3a5ce90cb6fa521"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_RootFolderRail\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_locate_screen.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8166399a3bf0d5a9d483b4470b81918fd53704bf6589779ebedd0be085c3ff68"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_RootFolderChip\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_locate_screen.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6592426d1c4a31f195aa8b8a4a17d6b24453aef9d607a9066a39d14acbce816d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_LastFolderShortcut\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_locate_screen.dart"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aefc841ac45cfaa3c6a9c7c2b396f140af0e02de2298c8e16e437a66bd4fdc2"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_PathField\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_locate_screen.dart"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"62559e68cb0aabdabeea88486cf00aae93251d05f4e78fffa37e34f2ef90bc56"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_DirectoryCard\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_locate_screen.dart"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ada57abab2c9627f331f95129c2357f52a02dbdbe4184ed93c5377e4f35b8a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_DirectoryRow\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_locate_screen.dart"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbcea64741ac749d0bec645f0c293ea55c5acb15dde95749aab53751ae29617"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060ManualImportProgressScreen\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_progress_screen.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9f0a006a80c1f3b96d379d5cb31f0eba61dc4be8d7a630bd2daef04703cec5"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_CommandCard\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_progress_screen.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"799b9f179dbdf6d3a9264db0ff77a09cfb3f1a20187c5b7caa4c3872e606c79b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_SubmittedFileRow\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_progress_screen.dart"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c64d341ecc55115455392c019f62fc9bce4d706a594f1a28ae123c1dd50055"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_TrackButtons\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_progress_screen.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdf0b68fcd4a252d7b753055c09fc6de0ff1283e888256619852b670080ddd4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060ReadyGroupHeader\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_rows.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeafe4393b4a7a860e30051cff7812c9c70d17327355a5318f493a38b94f91f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060MatchedFileRow\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_rows.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c1583cafa10ce7073165d9d26d800809fb946804c73f4a60abfac4fc7a096b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060AttentionFileRow\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_rows.dart"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e8e947c8f16d07d94a7afefda26e86388930db61407d4950051237b10a5e96"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060OtherFileRow\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_rows.dart"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"3879439be16797a561f3cc43c768995dae5b2ef3c31477694d575bcae1a75934"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060InFlightFileRow\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_rows.dart"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1757f53d9384529f3024ec5032b1c27f34c8ef66f8bdd1f8727c393144fca5"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060ManualImportReviewScreen\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6de35bdd3e1bb99f9605a04edf5df9730fc5be9b56183c308514d158eff67ba"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_FilterField\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1ea41c269df762421b2145595310d7f6e296f012995fcd971cf7e8cff39171"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_LastImportBanner\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7150258c445426f20a3cac92319482938e3d07b882fa74f79d9e829b0bc8d2"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_ScanningState\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1f461f557afa11da4b93de38d531201db69ee9ca785d310538a9fc29fdfdb8"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_ScannedFolderLine\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_review_screen.dart"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bf12c9589f08cccfd8b954bb95914a111af627dd314774d0dc68f4c0fe533b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060ManualImportFrame\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_widgets.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d754eafebaa58b3b8c0a9a161addbf0bca1e3d353e16234cbca1f45e6d8dc7e9"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060ImportStationBar\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_widgets.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fba39b8e5b520f3ce3ea49857906728a7bb3ae942e7f0877953360745039225"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060ImportBreadcrumb\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_widgets.dart"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea130134277602628688a8dea7f6666876029eb517b4c10cf89ea6c6b8b3a8b5"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060ImportPrimaryButton\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_widgets.dart"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"65670b159c3e8f8c97358ba496c2e801f8111f7f14c06956abad5d95e6737816"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060ManualImportReviewFooter\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_widgets.dart"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"20351df6e33589afd296db6ac447f2034ae46e124c8605b1d929fd6fb9813c6e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: import \u2192 settings: \u0060_ImportModeMenu\u0060 (slice \u0027import\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_widgets.dart"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a95fbe86bf9c50ebbc2a11d1816fd152c87ddf595a53bec6a52433400796416"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: jellyfin \u2192 settings: \u0060JellyfinAdminPlaceholder\u0060 (slice \u0027jellyfin\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/presentation/jellyfin_admin_placeholder.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"016e9b4ef6a97454bcf7c96af3c97b34dce20f2620775304696a0ad1f6488ab4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: jellyfin \u2192 settings: \u0060JellyfinUsersScreen\u0060 (slice \u0027jellyfin\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/presentation/jellyfin_tab_screens.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d00ee25a7043df0a8af40f8072573fc83e76082e74bcd3d3299540f110c9ce"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: jellyfin \u2192 settings: \u0060JellyfinDevicesScreen\u0060 (slice \u0027jellyfin\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/presentation/jellyfin_tab_screens.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4474f0feedbd96a6868a9ce2ce808ceed55bd59d446b87976148be906b47d2b1"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: jellyfin \u2192 settings: \u0060JellyfinTasksScreen\u0060 (slice \u0027jellyfin\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/presentation/jellyfin_tab_screens.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ed91280c52b681282b86c551541894b5597f3e91dc8936f9a105698cc79c60"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: jellyfin \u2192 settings: \u0060JellyfinActivityScreen\u0060 (slice \u0027jellyfin\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/presentation/jellyfin_tab_screens.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e3f0d65d1c21428ba2330337e88068f3bb596b9ed7daf75305c9331b730b2b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: jellyfin \u2192 settings: \u0060_JellyfinActivityBody\u0060 (slice \u0027jellyfin\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/presentation/jellyfin_tab_screens.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b64f398e1014b5a25899afad1fbcadfe3c293430f09859355446932946ad3f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: jellyfin \u2192 settings: \u0060_UserRow\u0060 (slice \u0027jellyfin\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/presentation/jellyfin_tab_screens.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0ef1adf270035db231d271e18b818e0f15745fa4cf53c92a0bcb1310f4fa0c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: jellyfin \u2192 settings: \u0060MediaBrowserProviders\u0060 (slice \u0027jellyfin\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/presentation/media_browser_providers.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a805b2e660e56c76d76e7fdbdddb80a1c7de4063046c909a64b7376b6e57c56a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 stream: \u0060MediaStreamCopy\u0060 (slice \u0027media\u0027) depends on \u0060StreamLookupOutcome\u0060 from slice \u0027stream\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_copies.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9af07c97361a2445f833b92fa4a1f9e9028170d3016def01a5802dfa4461198"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaLeadPlay\u0060 (slice \u0027media\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_lead.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfad674aac991bd00da45bc75411e79899ab61850690683aecd1fbf6c8f29938"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaLeadAdd\u0060 (slice \u0027media\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_lead.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fb21036d0a40ad0e8c37e25349b035e0c5bbd83611966ced45be348cb6c673"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaLeadRequest\u0060 (slice \u0027media\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_lead.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cfaf9bf73655a8533f4895a9f479904ef3e8245d819ef25b22cd001f21e0f3"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaLeadCopy\u0060 (slice \u0027media\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_lead.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d449d62eede2a3a4ba4c2171de5cc1590df824db908018cffc4175dcad66c397"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaReportSource\u0060 (slice \u0027media\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_report.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"083c824d92c17017e6161b5ecff92a404aad4732d90ed71b58adc19099a35153"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaConnectionRow\u0060 (slice \u0027media\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_rows.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca4352c7f10ecf771e5f48d45641f8f3747445d8fe5a84a28b811939155b892"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaThroughSeerrRow\u0060 (slice \u0027media\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_rows.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"33279f1ca358b4e3dca221ac46e747e07b995c94f6b26874c8e2cde0aea14793"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaServerThroughSeerrRow\u0060 (slice \u0027media\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_rows.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1165589b8e6049829ebb1567b7a56fca506635425009c7465be28069c9a43a5"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaNotSetUpRow\u0060 (slice \u0027media\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_rows.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd57bb2fc76e98079c427986c91b864f4e8300cad51cd95d3b4d666629a4fab"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060ArrBulkKind\u0060 (slice \u0027media\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/arr_bulk.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb12684117abc05a9607ed6a52c9cf5671a7df27cb2760819a937185f9d389d5"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060ArrTitleOpener\u0060 (slice \u0027media\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/arr_title_opener.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5a61c89def35df0c86ee685378abebbfc9757ab36935edbfe3160e4b230f41"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 release_search: \u0060IssueFile\u0060 (slice \u0027media\u0027) depends on \u0060ReleaseSearchTarget\u0060 from slice \u0027release_search\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/issue_files_provider.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4baef80a5a3dc3a9e1282edd6a545990fdc8cd56789255ef20f608b7044a25"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaAddSheet\u0060 (slice \u0027media\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_add_sheet.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ac3a62daf1c1a23f12f548d11fd3dc61d54504a3aaf9bb9c3b04fab8bae0c4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060_MediaAddSheetState\u0060 (slice \u0027media\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_add_sheet.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c978baaa54d6fadb785157fdccde9f95b42914ac01ab17963e0d1dbdc7c72d4d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 search: \u0060_Refusal\u0060 (slice \u0027media\u0027) depends on \u0060ArrAddFormState\u0060 from slice \u0027search\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_add_sheet.dart"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4d32751dfd8238f03fd4f3191d14f2c995bc7f337ce27d5ad53d6637b85e4a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaCopyPanelCard\u0060 (slice \u0027media\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_copy_panel_card.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f787ce8d30b72de9f94eceb5d15e229ebc0e92d776e05f1db1a0de8b409667"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 stream: \u0060_ServerCard\u0060 (slice \u0027media\u0027) depends on \u0060StreamItem\u0060 from slice \u0027stream\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_episode_sheet.dart"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61f5f9be59d9cb1fab01feaf69967f53ed7a94f6d8baad934a194c0fbe86952"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 discover: \u0060MediaWatchProviders\u0060 (slice \u0027media\u0027) depends on \u0060WatchProviderRegion\u0060 from slice \u0027discover\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_facts_sections.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8421febbe031e5cd0d66dcdb4cdbd688cc898062642bb83106a38ec13febac6"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaFindLibraryBody\u0060 (slice \u0027media\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_find_bodies.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb5c2d805ebdcdf5cb3b294dec9de843c745a902b7a244bda98ace19b2363cc"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060MediaFindLookupBody\u0060 (slice \u0027media\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_find_bodies.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71a5225d274775d6b802ead2c57851dcccfa91e67861224547b242a43c89609"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 discover: \u0060_CollectionBand\u0060 (slice \u0027media\u0027) depends on \u0060CollectionInfo\u0060 from slice \u0027discover\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"43500186f7f2dd7a3dd70554695b40dc180a102753785bbf14395521795049c9"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060_Files\u0060 (slice \u0027media\u0027) depends on \u0060SettingsModel\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3075}}}],"partialFingerprints":{"codehealthFindingId/v1":"888a060e79ed19b1644b6c739f7a67eab04b3d9a819f39d2aa071c1ab829d7e1"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060_CopyControls\u0060 (slice \u0027media\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce41740dc0c14897c941587a160e06f62e6a165b4c372bf532169445325ead0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060_Subtitles\u0060 (slice \u0027media\u0027) depends on \u0060SettingsModel\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3290}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b50539f2143e5fb41120232b27b186527aa023cb41345def3080cb3eecf34a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 settings: \u0060_History\u0060 (slice \u0027media\u0027) depends on \u0060SettingsModel\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f155e6dcc207568fa2bd216454f80a644cc8b9c83f9c2a8493294c7d282e30"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 discover: \u0060_OwnReportRow\u0060 (slice \u0027media\u0027) depends on \u0060SeerrIssue\u0060 from slice \u0027discover\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_report_row.dart"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4872ddb07346d5268506dc76e6e3c8dbb148e84cc0a22d1db0458ee294054e8"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 discover: \u0060_OperatorIssueRow\u0060 (slice \u0027media\u0027) depends on \u0060SeerrIssue\u0060 from slice \u0027discover\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_report_row.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bebfcebfb3c0d43c32e5dfeb8f733da45a2926332398f3209b8fd9c476f503"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 tracearr: \u0060_WatcherRow\u0060 (slice \u0027media\u0027) depends on \u0060TracearrWatchedPerson\u0060 from slice \u0027tracearr\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_watched_by.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6b4659bacdac699fefb4015e179e59d9ba01f6bc89e40588d6de359801fe23"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: media \u2192 discover: \u0060_TypeRow\u0060 (slice \u0027media\u0027) depends on \u0060SeerrIssueType\u0060 from slice \u0027discover\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/report_problem_sheet.dart"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"6811887be460100dae803d1895750f244bf45eb0deab4d645f6d9ed5950f6de6"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: music \u2192 settings: \u0060LidarrAddAlbumSheet\u0060 (slice \u0027music\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_add_album_sheet.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ab885e5684fdb3ef963869febdbbb396fc8bef13c65139b13cdfbb5170bf36"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: music \u2192 settings: \u0060_LidarrAddArtistSheetState\u0060 (slice \u0027music\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_add_artist_sheet.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e738b534d6dc59808369dc0b536cd682eccd10ce3db8c5420e1dd3666e35a707"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_OnboardingScreenState\u0060 (slice \u0027onboarding\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/onboarding_screen.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78c83560508e997f97c3c96a1b9f81a8ee51dcff72e2a195a401633659bf3e0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_RequesterSignInScreenState\u0060 (slice \u0027onboarding\u0027) depends on \u0060SeerrSignInFlow\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/requester_sign_in_screen.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1844a760816b83a73bb8a936858d5efe2ae4038010fec2ffdbab1c22a7d20b5b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060FoundConnection\u0060 (slice \u0027onboarding\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae338feb9574586ab3b7ee1c6f28326e06b5b5d4ca7dbac3c36dd67c0d9baa5d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060OnboardingFound\u0060 (slice \u0027onboarding\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c762c73945faa60a1e2ea44e70a270f8d75929344c86000cd98670d62da87c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_FoundRow\u0060 (slice \u0027onboarding\u0027) depends on \u0060ConnectionCandidate\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08c3922f70847d2b3bb44be8cd4722930a8b1f22b0e4efd52e686f251f62e4d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_SourceFailure\u0060 (slice \u0027onboarding\u0027) depends on \u0060FailurePresentation\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"441343614ec36d36eae06bc9e9c87c647429eb6fbb44bfac58dd129ab005980f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_FoundList\u0060 (slice \u0027onboarding\u0027) depends on \u0060SettingsModel\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"db07dbb0ec03f789b7913df5fc3af63c0daacf467cce5585c8d3db8649382b43"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_FoundTile\u0060 (slice \u0027onboarding\u0027) depends on \u0060SettingsModel\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3373a9fb9ccddc0b159aa25b6297d09ab18838007101b606fb8f1c12e51295"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_Glyph\u0060 (slice \u0027onboarding\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"a786329b10a922f888aec1ddebb7931ca25223eb34e1c9a66b8d9c61dbbe58f5"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_CertificateBlock\u0060 (slice \u0027onboarding\u0027) depends on \u0060SettingsModel\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cc57c63bcfe59eb175df2b01678a2f3786d9eea9415b1049fbd83e5a37e06a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060OnboardingWalkSubject\u0060 (slice \u0027onboarding\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ac6aca6d4c699776e4ac0eecef26e96793b99a5f22e236ef371f63b8e48064"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_ServiceGlyph\u0060 (slice \u0027onboarding\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d3057f4c83ec92ba8b8e29d3d3e472ebfdc7ca9f3786f91b7720d6025b4d43"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060OnboardingAway\u0060 (slice \u0027onboarding\u0027) depends on \u0060ConnectionAccessController\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5eb45567e27e539d32f8514ce2ec447b5e94f2de00349c08cd01db86943ca7"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060OnboardingWalk\u0060 (slice \u0027onboarding\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"932247b0e4813cd5a9c958fc38ac0d42bacdd41d3364e6c9c5ed6415235238c0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_Outcome\u0060 (slice \u0027onboarding\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adbfd3044860588bfafc057e675f90a395fe9a0167201776e411040039aa33c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_UseHttps\u0060 (slice \u0027onboarding\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"268c253a4597840ea5a061d90f2da8ea315c46ebc993907db8bc46b507a6124f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: onboarding \u2192 settings: \u0060_CertificateCard\u0060 (slice \u0027onboarding\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_walk.dart"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c54bfdae47781517eaa8107b623097e53143338e2ac13e22e092db2b80aeda"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: pairing \u2192 settings: \u0060_ConnectionRow\u0060 (slice \u0027pairing\u0027) depends on \u0060ServiceInstance\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/pairing/presentation/pair_receive_screen.dart"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a682b2acb5cb5809a499a57bdd251a38f97003f80739924e04d18e1f37d8ea"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: qbittorrent \u2192 settings: \u0060SecureQbittorrentRefusalStore\u0060 (slice \u0027qbittorrent\u0027) depends on \u0060SecureSettingsStore\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/data/qbittorrent_refusal_store.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9371ad2bc972b00f7600afc67c94312c8a121cada863d7736d7412675136729f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: release_search \u2192 settings: \u0060ReleaseSearchTarget\u0060 (slice \u0027release_search\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/domain/release_search_target.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef7b72575a44883409b73d267c8b18e5f6df6112a846e276125ccba2aac3fd4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: release_search \u2192 settings: \u0060SearchHeadroomCard\u0060 (slice \u0027release_search\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/widgets/search_headroom_card.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"506354575f17efa68081d587924c7148da8625006d923aea89c91f63fa2618b8"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: requests \u2192 discover: \u0060MyRequest\u0060 (slice \u0027requests\u0027) depends on \u0060SeerrRequest\u0060 from slice \u0027discover\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/requests/domain/my_requests.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"513360ce5c29827faa278bc651add3d83977c427a391a5cb4e7bc053fc3f8b5a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: requests \u2192 activity: \u0060_AnswerRing\u0060 (slice \u0027requests\u0027) depends on \u0060RequestAnswerPhase\u0060 from slice \u0027activity\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/requests/presentation/widgets/request_answer_controls.dart"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8339bc8b9c9943757c5801df2071db232d4331b5dac8076b90a3d0d6c248e35"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: requests \u2192 discover: \u0060_ReportRow\u0060 (slice \u0027requests\u0027) depends on \u0060SeerrIssue\u0060 from slice \u0027discover\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/requests/presentation/widgets/your_reports_section.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab101e05c303883442e1ef0a2d8114e99fb76c6408c54b841947bad71f0ff318"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: search \u2192 movies: \u0060RadarrAddRequest\u0060 (slice \u0027search\u0027) depends on \u0060RadarrMovie\u0060 from slice \u0027movies\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/search/domain/arr_add_request.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbacdc8b15c7e34ab3982a0b344805c2af48c49260b71da76c03ba294627e35"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: search \u2192 series: \u0060SonarrAddRequest\u0060 (slice \u0027search\u0027) depends on \u0060SonarrSeries\u0060 from slice \u0027series\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/search/domain/arr_add_request.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff50d27fac90a8e260380db05156fca54d303e1197791ee4f24cdebd8c449b3"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: search \u2192 settings: \u0060GlobalSearchResult\u0060 (slice \u0027search\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/search/domain/global_search_result.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2778d2395c92be1482daca5dbe9b78b425a75d848fd9ea8331dfc8c01fc10af0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: search \u2192 series: \u0060ArrAddFormState\u0060 (slice \u0027search\u0027) depends on \u0060SonarrMonitor\u0060 from slice \u0027series\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/search/presentation/arr_add_form_provider.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4428f9f1694492986b10b3eba2f90f37371759454b2c3b03a0486747867413c5"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: search \u2192 music: \u0060DiscoverMusicFound\u0060 (slice \u0027search\u0027) depends on \u0060MusicHeld\u0060 from slice \u0027music\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/search/presentation/discover_music_provider.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d08dc3c3706b255906657e7ff9a8d8ab712c3795426b8282a1183798575472"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060DashboardDecision\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/domain/dashboard_decision.dart"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"648178405222d72263d81c3f2a7c2e35bbe597421a033c1aaef13bbfd6bbc1cd"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060ServiceSummary\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/domain/service_summary.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1474efea8cf082f98200e937b4c9042abdb0ee17d22a36d8bd3110e5489bb7e4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060CoverageSource\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/domain/source_coverage.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"568759c3f88b415445ff1c02121f957f162bc60fb56ec6620018e3a2e017efbc"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060ConnectionInView\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/connection_in_view.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"373dbde3452f93c7b1219811f80a0e15c59f3b6f2a659275fb946b4858a37b8e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060ConnectionInViewScope\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/connection_in_view.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a212699ead7b61dc201b1add9e5a9a2b8070bd213051473f3867360bf8dc829"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 activity: \u0060ServiceAllRequestsScreen\u0060 (slice \u0027services\u0027) depends on \u0060RequestFilters\u0060 from slice \u0027activity\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_all_screens.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d4fae2a8a54239e2ed6fd66da3afab40c15eda924387add92d482ef43b7188"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060ServiceHomeScreen\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_home_screen.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"90553a5f427ca0c517d06e4ed2a0be55dbe670c8ca0e9d63ea24911adda763a2"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060_ServiceDashboardAppBar\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_home_screen.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c646053462ccc2ddf45cc6e603b0e7dc96bc49e196e1d48f37182420f0aa3fbe"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060_DomainBand\u0060 (slice \u0027services\u0027) depends on \u0060ServiceDomain\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb178a9d552778b569d91093f3f8855544cb4e6ea20230f9e819ccbf3fcf7cc"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060ServiceMatrixCell\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db0e9641324bb0e9c8104742a74fc6babcb730f47dfc72680701381cdfb4fd3"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060_NotSetUpCell\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd59cfacf7c9f8284b9266a1cb4b93bf766bc45c327a183db4ca7903c1a8ace"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060_ServiceMatrixCellBody\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8d5aecff1e110bf968ecf7432c25d37db07f450fa46356b27fafd209ae5c5c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060_CellRow\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f642f320311a5917e85246aea6d421b60e17f7cf72e46b8f8f9e8dc2e57238a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060_CellIdentity\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_matrix.dart"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03cb3cc9d8e1adb358d341d4854c44f58c381d19509b32e7907abd22bade089"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060ServiceTabScaffold\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_tab_scaffold.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe8addc637677cf07320251a97d6ea0b8203e9f9e4b231c20142fab072a14d9"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060ArrHistoryEntry\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/services_history.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7182f4349d24e8c69703323e73487fa342b6d17c7668efa8ec0752835eb93c5"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060ServiceQueueItem\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/services_queue.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a28395cb948614298db1282a3fcf12261ef1937cf5cfd706a2523e24cc7fe06"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 shell: \u0060_HealthStrip\u0060 (slice \u0027services\u0027) depends on \u0060StackHealth\u0060 from slice \u0027shell\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/stack_screen.dart"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd6b46aa67d772608a5fb3b497ca561e55c0d29ef199865d5e0f36de48b815a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060InstanceLensBadge\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/widgets/instance_lens_badge.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c64f749247872d9b5d6d56435e2960f9fa1819da7afbb61fc14c5bacd640fc"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: services \u2192 settings: \u0060_LensOptions\u0060 (slice \u0027services\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/widgets/instance_lens_badge.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fb19431b8b8c9b04227adf100c89d672c0faa8431fb4497bc7c0ab000e8ee2"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 discover: \u0060_AccountHeader\u0060 (slice \u0027settings\u0027) depends on \u0060SeerrAccountSignIn\u0060 from slice \u0027discover\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/requester_account_page.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"77377a1414b51cb343891a5d9b6bb8169131b6c17801d2bcf8eefcb2ec92d8c9"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 discover: \u0060SeerrSignInNoticeLine\u0060 (slice \u0027settings\u0027) depends on \u0060SeerrSignInNotice\u0060 from slice \u0027discover\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/seerr_sign_in_steps.dart"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6858067eff82633b22c945e160893f12b4bd807ebf8363523607912d4a531b1a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: shell \u2192 settings: \u0060DesktopShell\u0060 (slice \u0027shell\u0027) depends on \u0060NavTab\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/shell/presentation/desktop/desktop_shell.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"868dcfc2820c656db3387647e844775d52f61c29414217832aee582cdf5244db"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060StreamActivityRow\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/domain/stream_activity_row.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5a2916f6f1adcf494219cb16d5e9385dae7e2e7849faeb3963673257efc041"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060StreamItemScreen\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_item_screen.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"16832a78d9c0865f1814264142734abb91334827839723ac8ed33140cdbe4523"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_Body\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_item_screen.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e125694a0dadcf93cbcf2f7061d08da0c4a8d1dc491a39eac176e1ee82ce86b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_HandoffButton\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_item_screen.dart"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45f2c224e2c8111739d08a67efbdbb414d52dd955029b448385a72eba666c4f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_Children\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_item_screen.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fd6261ee8dde43546775e09402c5ca6f1900687fb9bfc0a03362acc2cbb026"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060StreamLibrariesScreen\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_libraries_screen.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3be8fc6c6c2ef8e772d72cf41fc4e21254c8a82e00b782ed3c2fcdc41462b4a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_LibrariesBody\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_libraries_screen.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"601f8f56ce1f434db91c3942c0d3e6eca0bbdb6476c01ec5468fd3732fc603f6"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_LibrariesSection\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_libraries_screen.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0b417bc15d8ae016bacee825dbd195d29de205592d155976d2f9b079fafd00"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_LibraryRow\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_libraries_screen.dart"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1759d416549a9a5db9eb6db6ee9d26480380490326b4c5c8c6a6c0fef7d00a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060StreamLibraryScreen\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_library_screen.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bb6bab6791bf2cd33934522a8b14d1c83fe65f941434c7eb3e9fda1eb7d13b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_LibraryGrid\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_library_screen.dart"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bb598e3c4d8fb67a25e52fc9d023c5b1f13c3e1cad93b2dea3a7ff68ecac18"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_NeedsViewer\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_library_screen.dart"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"db084913a86d1e4b4b14d9a42743f34e0fd4a9e283bf93dbf9f731b0218ef6ff"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060StreamOverviewScreen\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_overview_screen.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"687d99ad845ad15b713c1936b87fb0fff08ec116c9d440bfe01a9db378450a75"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_OverviewBody\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_overview_screen.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4939c4d042c0858ef905f85b8acc63d4f6e8ce7f9e0ea59f9c650b1d79a545b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_LibrariesSection\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_overview_screen.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3fbd6ec36822653911b1a9ceac67082d13ba45977804a27ce9e4cb3f050473"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 plex: \u0060_ServerRows\u0060 (slice \u0027stream\u0027) depends on \u0060PlexServerCapabilities\u0060 from slice \u0027plex\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_overview_screen.dart"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"83747aa2490082c73b47e901873da6dfb7341ab0eff29234db4a508dc368d7c7"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060StreamWatchingSection\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_watching.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c1398ebb8ab914d50da45bb3fa8d1cd24bf09c2b1a954b3f823d335a7cd912"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_ViewerQuestion\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_watching.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dff0f09e3ff703c6b49d646303b54833526498c871d337c353ce4cf1b7ca05"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_PosterGrid\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_watching.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"552add493a75a41736bb3499bb40ca9189e496e674d513973bc1c3283bd1406c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_Poster\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_watching.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"7006348af934403946144c9d28d2ca564e49fbb14ab75e63c2c2916915ae98b3"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060StreamWatchingRail\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_watching.dart"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07a7a0462d0c3663c909cfb77eac9899647135997cb501db75c6387f857ec59"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_Rail\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_watching.dart"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"1974a44e5d8cd51690a694e4dc383beed642e2bb5b0842b1352eda8ab7c6433e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060_RailTile\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_watching.dart"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7f6dd996b49f648ab2707b606bc9fb3a4ce0618f456b8c20e14fec221d1dbd"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060JellyfinViewerPicker\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/widgets/jellyfin_viewer_picker.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f10c6c78d3e1e6d8b9e89a6ee5bc0bc927409c8cee4fbc18564d29950fe451"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060StreamNowPlayingSection\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/widgets/stream_now_playing_section.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"79319abfe2b7c00dfacb8b1588058467ceff9268947c6976157af7cdfa592c8a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: stream \u2192 settings: \u0060StreamPosterTile\u0060 (slice \u0027stream\u0027) depends on \u0060ServiceKey\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/widgets/stream_poster_tile.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab3211dadc0cfa1142879aabbe6abf3da8f00d2e69e26e79bc146726c03efa5"}},{"ruleId":"GD1","level":"note","message":{"text":"Placeholder literal left in code: A placeholder string (\[e-mail redacted] / changeme login. If i\u2026\u0022) is still in shipped code \u2014 typical of generated boilerplate that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_screen.dart"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"13eb3cd53eeff2c2d693f585f2a5722f7f14debd7b3832b7508a073fb5d08688"}},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060setFocusPoint\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6681d84d06e37541d0b72a41f3e62980ca3421fe49b9d6f597530a54823e49"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"warning","message":{"text":"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\u0027s 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\u0027s log()) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add the Dart analyzer\u0027s security lints plus \u0060semgrep --config=auto\u0060 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\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm/gradle: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, \u0060gradle\u0060, which this tree depends on \u2014 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 \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3061b3f1b45c496891c98b9bb3cea3326c21d73f556bbc5811a08320341e68a8"}},{"ruleId":"S1","level":"error","message":{"text":"TLS certificate validation disabled: \u0060onBadCertificate\u0060 returning \u0060true\u0060 is set on a TLS client, so every peer certificate is accepted \u2014 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 \u2014 the connection is encrypted to the attacker, not to the intended host. Remove the callback so \u0060dart:io\u0060 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 \u0060SecurityContext\u0060 (\u0060setTrustedCertificatesBytes\u0060) and pass it as \u0060HttpClient(context: \u2026)\u0060 / \u0060SecureSocket.connect(\u2026, context: \u2026)\u0060, which keeps the chain and hostname checks on. A callback that must exist should compare the presented certificate with a pinned fingerprint, never return \u0060true\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/cert_trust.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b74da0e3a365dea8fde865ef0b1fd29bbd3f4fd173f8cc72b05b11edb33332"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository runs an HTTP server that is not bound to the loopback interface alone \u2014 or binds it at an address its source does not spell out \u2014 and nothing in its Dart source secures the transport: no \u0060HttpServer.bindSecure\u0060 or \u0060securityContext:\u0060, no \u0060Strict-Transport-Security\u0060 header, no \u0060X-Forwarded-Proto\u0060 read from a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: lib/features/pairing/data/pair_server.dart:100 \u2014 \u0060HttpServer.bind(\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"No inbound request validation detected: No handler of this repository\u0027s Dart server answers 400, 413 or 422 (\u0060Response.badRequest\u0060, \u0060HttpStatus.badRequest\u0060, \u0060statusCode = 400\u0060) and no validation package (luthor, acanthis, ez_validator, json_schema, \u2026) is imported \u2014 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. (\u22122.0 on this card.) The server: lib/features/pairing/data/pair_server.dart:100 \u2014 \u0060HttpServer.bind(\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0ffa303f3c9cef4b4c2cf028a78ce2f3c83f6078f80716eea7362fad047265eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!AppBreakpoints.isDesktopShell(context) \u0026\u0026 MediaQuery.sizeOf(context).width \u003C AppBreakpoints.touchRail\u0060 appears character-identically in 2 files \u2014 lib/core/widgets/media_browse_scaffold.dart, lib/features/shell/presentation/shell_screen.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_scaffold.dart"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb0d9df21dd27a00f182b897a920e3f66eef3cb4cc0990a7cd58a5be44b2fbf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060DownloadStand.stuck || DownloadStand.failed || DownloadStand.needsImport\u0060 appears character-identically in 2 files \u2014 lib/features/activity/domain/download_page.dart, lib/features/activity/domain/download_table.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/domain/download_page.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a9632d43a77e077dc6abd25ebd93c0e1ab4a49cf4cbb39095f07857d24e87e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060MyRequestStage.declined || MyRequestStage.didNotGoThrough\u0060 appears character-identically in 2 files \u2014 lib/features/activity/domain/everyones_requests.dart, lib/features/requests/domain/my_requests.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/domain/everyones_requests.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa5ea6713b729177b184518d2fafc9a5e79a37aaf483640493e758205a85d06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060SeerrMediaAvailability.available || SeerrMediaAvailability.partiallyAvailable\u0060 appears character-identically in 3 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/collection_shelf.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7108cad11867136e504da47ae1a6c1d5c020836624feb010d8f24c20cd6af0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060SeerrMediaAvailability.unknown || SeerrMediaAvailability.deleted\u0060 appears character-identically in 2 files \u2014 lib/features/discover/domain/seerr_status.dart, lib/features/discover/presentation/catalog_providers.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/seerr_status.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f72ed6b5b2b2ca4f248790e8695da555b5f2957a664de93b60b2efcd82ae22f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ServiceFailureReason.timeout || ServiceFailureReason.serverError || ServiceFailureReason.invalidResponse || ServiceFailureReason.unknown\u0060 appears character-identically in 2 files \u2014 lib/core/network/write_outcome.dart, lib/features/transmission/presentation/transmission_actions.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/write_outcome.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7463880f01cd6904f3df0139d7e0926aa7e517407335aa9456d22eb2a13f2009"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ServiceFailureReason.unauthorized || ServiceFailureReason.secretUnread\u0060 appears character-identically in 2 files \u2014 lib/core/network/connection_failure.dart, lib/features/settings/domain/connection_presentation.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/connection_failure.dart"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe316b2b6be70243f7431c9dc5312089ede1cef14f5fa50b345ce29c927820f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ServiceFailureReason.unreachable || ServiceFailureReason.unreachableAtBoth\u0060 appears character-identically in 3 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/connection_failure.dart"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e9ddc12537bdb24131ba97d0054d06ce7fbac5d4977dc894bf7f5112730fba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ServiceKey.jellyfin || ServiceKey.plex || ServiceKey.emby\u0060 appears character-identically in 3 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/capability/audience.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98896a10acf7c2cfe7eb709db5b9655c15ccef68ca5b47478f9703ec4f1e83b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ServiceKey.radarr || ServiceKey.sonarr || ServiceKey.lidarr || ServiceKey.readarr || ServiceKey.prowlarr\u0060 appears character-identically in 2 files \u2014 lib/features/settings/data/route_knock.dart, lib/features/settings/domain/probe_identity.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/route_knock.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4116358c3a5272e0e11c170634d855b79620a5e25af23851a2b00ab5b8af28bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ServiceKey.seerr || ServiceKey.radarr || ServiceKey.sonarr || ServiceKey.lidarr || ServiceKey.qbittorrent || ServiceKey.transmission || Serv\u2026\u0060 appears character-identically in 2 files \u2014 lib/core/capability/role_gate.dart, lib/features/settings/domain/service_key.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/capability/role_gate.dart"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be6ce31672f167b1c2fcec72fc6a806b1ecc327d1bba2292d32e93e2c42aaaf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060TargetPlatform.iOS || TargetPlatform.macOS\u0060 appears character-identically in 2 files \u2014 lib/features/home/presentation/edit_home_page.dart, lib/features/settings/domain/unread_secret.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/edit_home_page.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d519bcd4da842abcb8f6a6bb5a3d33ae79f61f106c5046706af69b2f75e97c1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_total != null \u0026\u0026 _items.length \u003E= _total!\u0060 appears character-identically in 2 files \u2014 lib/features/bazarr/presentation/bazarr_library_screen.dart, lib/features/bazarr/presentation/bazarr_wanted_screen.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/bazarr/presentation/bazarr_library_screen.dart"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef3823c43e4436a863f93d856dcb18a0ac732d75fef095f8ab8134b2f45c5c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.scheme == b.scheme \u0026\u0026 a.host == b.host \u0026\u0026 a.port == b.port\u0060 appears character-identically in 2 files \u2014 lib/core/network/redirect_guard.dart, lib/core/network/same_origin_http_client.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/redirect_guard.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbd2bb9c0ba69883a322bd2de45b5890f4237c200617485c47ce856616e9537"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060at != null \u0026\u0026 (last == null || at.isAfter(last))\u0060 appears character-identically in 2 files \u2014 lib/features/activity/domain/activity_history.dart, lib/features/home/presentation/widgets/downloads_module.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/domain/activity_history.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"881a6b5e8f319a8a8a60a29e54ef529d99d809ff74c43199b4f5759189e01a6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060box is! RenderBox || !box.attached || !box.hasSize\u0060 appears character-identically in 2 files \u2014 lib/core/widgets/ambient_scaffold.dart, lib/core/widgets/service_tab_bar.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/ambient_scaffold.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f99526406e3cc6a922ff58c1a81d049ae63e89e36f8b1a5847adf7a90643cb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060calendar == null || (calendar.answered.isEmpty \u0026\u0026 calendar.silent.isNotEmpty)\u0060 appears character-identically in 2 files \u2014 lib/features/home/data/featured.dart, lib/features/outside/data/outside_run.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/data/featured.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea75a9bfe9afa883d4af40dbfd66beb62f1bcbfddf4a929fa7eb450b2f17434"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060calendar.answered.isEmpty \u0026\u0026 calendar.silent.isNotEmpty\u0060 appears character-identically in 2 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/data/last_known/coming_up_last_known.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"935c66ff3114c2299a6f6a7d0d67e4e5652fbcc4a71ce09f9737febca59ac676"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060color != oldDelegate.color || radius != oldDelegate.radius\u0060 appears character-identically in 2 files \u2014 lib/core/widgets/content_card.dart, lib/features/media/presentation/shelf_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/content_card.dart"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"10749bdc0aa9f394780fc12bfdc4a3ebd7c2153fbf58985dc4c48d81bd48d35f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060connection == null || !connection.isConfigured\u0060 appears character-identically in 2 files \u2014 lib/features/music/presentation/artist_page.dart, lib/features/readarr/presentation/author_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"11dba9f54d9f2b74b55b4e7d40ea12768da68ad10fd9769a2e7d4182964b35ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060decision.kind == DecisionKind.pendingRequest \u0026\u0026 !answered.containsKey(decision.id)\u0060 appears character-identically in 3 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_needs_you_page.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dc93cf8004eef85924663ec07db62ecc6d235806afa7cd6297ea7308140602"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060defaultTargetPlatform == TargetPlatform.iOS || defaultTargetPlatform == TargetPlatform.android\u0060 appears character-identically in 2 files \u2014 lib/core/widgets/media_browse_index.dart, lib/features/stream/presentation/play_with.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_browse_index.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"269600fceed44dc724a097fa2c430240d761df2b8f5734bdf97619f3ef9090fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.response?.statusCode == 403 \u0026\u0026 error.error is! AccessGatewayAnswer\u0060 appears character-identically in 2 files \u2014 lib/features/jellyfin/data/media_browser_client.dart, lib/features/qbittorrent/data/qbittorrent_client.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"016e66fa71788a6397123fca2b3e20be84d6d111936f258b69bc5edd49633045"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.response?.statusCode == 404 \u0026\u0026 error.error is! AccessGatewayAnswer\u0060 appears character-identically in 2 files \u2014 lib/features/tracearr/data/tracearr_client.dart, lib/features/tracearr/presentation/tracearr_overview_provider.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/data/tracearr_client.dart"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbd5a098635c96ec89de3f20da89fafe51bdd8e75aa7f17cf7c2aa336410014"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.day == today \u0026\u0026 (event.kind == CalendarKind.movie || event.kind == CalendarKind.episode)\u0060 appears character-identically in 2 files \u2014 lib/features/home/data/last_known/featured_last_known.dart, lib/features/home/domain/featured.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/data/last_known/featured_last_known.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc92ecae5d5542139d45306cf717f199c3abc5c366ec14c20be7a262d843672a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060folder == null || quality == null || metadata == null\u0060 appears character-identically in 2 files \u2014 lib/features/music/presentation/lidarr_add_album_sheet.dart, lib/features/music/presentation/lidarr_add_artist_sheet.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/lidarr_add_album_sheet.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf642d54a44fe547aeecf01e318e338af05c640f746f7b9a93cdc5ec1497cfb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasArrRecord(item) \u0026\u0026 item.fault == null\u0060 appears character-identically in 2 files \u2014 lib/features/activity/presentation/download_page.dart, lib/features/activity/presentation/widgets/download_table.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/download_page.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6589144a3439ad32c941284a65c43e1de0bb68ea6fecdb7860b63c9233251f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host.startsWith(\u0027[\u0027) \u0026\u0026 host.endsWith(\u0027]\u0027)\u0060 appears character-identically in 2 files \u2014 lib/features/discover/domain/seerr_known_arr.dart, lib/features/npm/data/npm_upstream_probe.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/seerr_known_arr.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18f9f5f4f682ad90fd3b3298e5dc9b4ec6f4cf62d815f0d4a57b5b950a8617d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060instance.away == null \u0026\u0026 instance.isConfigured \u0026\u0026 ref.watch(awayFromHomeProvider)\u0060 appears character-identically in 2 files \u2014 lib/features/services/presentation/services_probe.dart, lib/features/settings/data/service_verification.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/services_probe.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f005c58d7b2fd1c3eee9d4a70ce776f5fab1c2f2ec8d4da47021a97ebe87f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060instance.isConfigured || instance.isSignedOut\u0060 appears character-identically in 5 files \u2014 lib/core/capability/role_gate_provider.dart, lib/features/services/presentation/widgets/instance_lens_badge.dart, lib/features/settings/data/service_verification.dart, lib/features/settings/domain/settings_model.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/capability/role_gate_provider.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4bc4eaebc3e67df2d8faec428acf1d0f5dc10574a7f3f3f19cd2e36011c694"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060instanceId != null \u0026\u0026 instanceId.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/features/import/presentation/manual_import_routes.dart, lib/features/settings/data/settings_provider.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_routes.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cab9acbb9f56c066c816d44fdcc1dfb6d19aae8a9637c271a9e03fdf97dd0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060instanceId.isEmpty || instanceId == activeId\u0060 appears character-identically in 4 files \u2014 lib/features/dockge/presentation/dockge_provider.dart, lib/features/qbittorrent/presentation/qbittorrent_provider.dart, lib/features/settings/data/connection_providers.dart, lib/features/truenas/presentation/truenas_provider.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/dockge/presentation/dockge_provider.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c369d23bfb903dca14dd156f980e85f7278a4d1dfed86536c2b106c59b8515f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060instanceId.isEmpty || instanceId == lens\u0060 appears character-identically in 9 files \u2014 lib/features/discover/data/seerr_service.dart, lib/features/discover/presentation/discover_provider.dart, lib/features/jellyfin/presentation/media_browser_providers.dart, lib/features/movies/presentation/movies_provider.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_service.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"366d8e002be1c372bc13736c879cde71e4f159c93657b9ffb90f98eadff44a62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item is String \u0026\u0026 item.trim().isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/features/music/domain/models/lidarr_album.dart, lib/features/tracearr/domain/models/tracearr_json.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/domain/models/lidarr_album.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1065f83f147eed2ace15683f34593d358b2c4c6631c071ec1899beb3bb860936"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.instanceId.isEmpty || key.instanceId == lens\u0060 appears character-identically in 3 files \u2014 lib/features/services/presentation/service_kpi_provider.dart, lib/features/stream/presentation/stream_activity_provider.dart, lib/features/stream/presentation/stream_connection_provider.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_kpi_provider.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51374ad0f84a84b41c05600a024158277cf47dc7f7b9236ebd8018ce89600c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == ReleaseSearchFailureKind.gatewayTimeout || kind == ReleaseSearchFailureKind.cloudflareCap\u0060 appears character-identically in 2 files \u2014 lib/features/release_search/domain/release_search_job.dart, lib/features/release_search/presentation/release_search_entry.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/domain/release_search_job.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e867eca643f942121560d9fda90ce4d28a1ca4970e747575147755513c739f48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060month \u003C 1 || month \u003E 12 || day \u003C 1 || day \u003E 31\u0060 appears character-identically in 2 files \u2014 lib/core/utils/arr_model_helpers.dart, lib/features/home/data/last_known/calendar_event_codec.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/arr_model_helpers.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d2bb217733f536b89ab13a81393794b334f93df627a42ef872fc3d7d615108"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mounted \u0026\u0026 await showCertTrustDialog( context, origin: origin, probe: probe, previousFingerprint: previousFingerprint, invitedFingerprint: i\u2026\u0060 appears character-identically in 2 files \u2014 lib/features/onboarding/presentation/requester_sign_in_screen.dart, lib/features/settings/presentation/widgets/seerr_account_fields.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/requester_sign_in_screen.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96d7f130d76763856e9acfecf9d99d18c6c09716e2ce69c9f22221f9fe8a660"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060picked == null || picked.value == current || !mounted\u0060 appears character-identically in 2 files \u2014 lib/features/media/presentation/media_page.dart, lib/features/media/presentation/media_series_manage.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3205}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fcd56ae3643e27db5246095b336e058635ff6d9d1d0f443e752d6a7753100a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profiles.length \u003E 1 \u0026\u0026 profileId != null\u0060 appears character-identically in 2 files \u2014 lib/features/media/presentation/media_page.dart, lib/features/media/presentation/media_series_manage.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":3250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb0dd98a1d161b7caf821d0cb2dd25ee69291dcca1058e4c598e065909be2e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reason != null \u0026\u0026 failureDidNotAnswer(reason)\u0060 appears character-identically in 2 files \u2014 lib/features/activity/presentation/activity_provider.dart, lib/features/discover/presentation/request_form_provider.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_provider.dart"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf716f9c78a4849214a9813eb4510ea50b5eaf579ba7e73d4cb0c8df638494c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060release != null \u0026\u0026 release.isNotEmpty \u0026\u0026 release != item.title\u0060 appears character-identically in 4 files \u2014 lib/features/activity/domain/download_page.dart, lib/features/activity/presentation/widgets/activity_download_row.dart, lib/features/activity/presentation/widgets/download_table.dart, lib/features/home/presentation/widgets/downloads_module.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/domain/download_page.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"416bad636cd1c395250462f40a4d211199489154a895330133d3746f3b46c94e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060releaseDate != null \u0026\u0026 releaseDate!.length \u003E= 4\u0060 appears character-identically in 2 files \u2014 lib/core/models/media_preview.dart, lib/features/music/domain/models/lidarr_album.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/models/media_preview.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"112c9eeb665e9a253f91279441191a0198af4fd8fc587e236804753c72b53fe5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060season.seasonNumber \u003E 0 \u0026\u0026 season.episodeCount \u003E 0\u0060 appears character-identically in 3 files \u2014 lib/features/discover/domain/seerr_request_gate.dart, lib/features/discover/presentation/request_form_provider.dart, lib/features/media/presentation/media_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/domain/seerr_request_gate.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9319b934c91b44e3ef5fef31782f81f05dac13af6f23dce8079a0a96c6e85e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060service == ServiceKey.jellyfin || service == ServiceKey.emby\u0060 appears character-identically in 2 files \u2014 lib/features/services/presentation/services_probe.dart, lib/features/settings/data/service_verification.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/services_probe.dart"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d561b6db04c94ae8cd0a86534fe2b411d7914768d073a0d08f1c3a0b2271364"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060service.librariesNeedAdministrator \u0026\u0026 ref.watch( mediaBrowserProvidersOf(service).lacksAdministratorFor(instanceId), )\u0060 appears character-identically in 2 files \u2014 lib/features/stream/presentation/stream_libraries_screen.dart, lib/features/stream/presentation/stream_overview_screen.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/stream_libraries_screen.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d2b86e4c7b6f368bf911df93b6aac684a144412f3b647bbcd50ff5f5713564"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start.startsWith(\u0027\u003C!doctype html\u0027) || start.startsWith(\u0027\u003Chtml\u0027)\u0060 appears character-identically in 2 files \u2014 lib/core/network/answer_guard.dart, lib/core/network/connection_failure.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/answer_guard.dart"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8b9e1db7026859358195c9c5e9153a8bbb8cd537c38ec9162735a82621e764"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.error != null \u0026\u0026 state.items.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/features/import/presentation/blocked_import_review_page.dart, lib/features/import/presentation/manual_import_review_screen.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/blocked_import_review_page.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a918b26fa9194f30a472315ab17a9d4006369ccc008d7e1b56aa68847cc31917"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status.tone == StatusTone.warning || status.hasWarning\u0060 appears character-identically in 2 files \u2014 lib/features/media/domain/media_row_view.dart, lib/features/media/domain/media_series.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_row_view.dart"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be48772e40c4d1eef4b39e2d2e654930e9ba0fc50cfb8a166227943cf9d59e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target != null \u0026\u0026 await launchUrl(target, mode: LaunchMode.externalApplication)\u0060 appears character-identically in 2 files \u2014 lib/features/music/presentation/artist_page.dart, lib/features/readarr/presentation/author_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/music/presentation/artist_page.dart"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abcbf682afa08acea49a49aeb154140fae3e70129a69337a3d9dbd38bd5a42d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060title != null \u0026\u0026 title!.trim().isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/core/widgets/media_detail_poster_row.dart, lib/core/widgets/media_detail_view.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/media_detail_poster_row.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e08f3b84a9ebf8dfdbb524ea89e8749653dfcbe2afb5e62f599eb85c8ce66bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060total == null || total \u003E page.records.length\u0060 appears character-identically in 2 files \u2014 lib/features/series/presentation/sonarr_overview_provider.dart, lib/features/services/presentation/services_history.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/series/presentation/sonarr_overview_provider.dart"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c4e96578b071ff8602394bacb83263bcc2abb9722c67baa31666e81d56898a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type.contains(\u0027text/html\u0027) || type.contains(\u0027xhtml\u0027)\u0060 appears character-identically in 2 files \u2014 lib/core/network/answer_guard.dart, lib/core/network/connection_failure.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/answer_guard.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a117ec3f2536d560d9d734e606cb7c15326a6f850e86de1fdd1d0c9503f58ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060used == null || total == null || total \u003C= 0\u0060 appears character-identically in 2 files \u2014 lib/features/home/domain/storage.dart, lib/features/unraid/presentation/unraid_overview_provider.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/domain/storage.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec8c22b0cafacd0c19973f729b73f71f5dfdafd9eaa7e774290a98b7cd5a008"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is String \u0026\u0026 value.trim().isNotEmpty\u0060 appears character-identically in 3 files \u2014 lib/core/models/arr_media_file.dart, lib/features/discover/data/seerr_auth_service.dart, lib/features/discover/domain/seerr_server_facts.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/models/arr_media_file.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ec1c108bf82b5f154bee63deb8beab02ded7ad15e18af5991d29669ba2069b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060word.length \u003E 1 \u0026\u0026 word == word.toUpperCase()\u0060 appears character-identically in 2 files \u2014 lib/core/utils/string_utils.dart, lib/features/jellyfin/domain/models/jellyfin_transcode_reason.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/string_utils.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a63c08ba42efa1a683525fd180e04e6753f37e954a344b355c38efa43fa0df"}},{"ruleId":"X14","level":"warning","message":{"text":"IP classification is bypassable through an IPv4-in-IPv6 embedding: This function unwraps IPv4-MAPPED IPv6 (\u0060[10] == 0xff\u0060, line 91) and then rejects \u006010.0.0.0/8\u0060 on its IPv4 path \u2014 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 (\u0060::a.b.c.d\u0060), 6to4 (\u00602002::/16\u0060) and NAT64 (\u006064:ff9b::/96\u0060). So \u0060::10.0.0.1\u0060, \u00602002:0a00:0001::\u0060 and \u006064:ff9b::10.0.0.0\u0060 all name a host inside \u006010.0.0.0/8\u0060 \u2014 the range this same function declares non-public \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/local_network_target.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69bb03b8ac5010902b767ffc3ddd181798ee11e72424a4d466cce9c5b560abd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060TrueNasDataset.fromJson\u0060 is public and takes \u0060Map\u003CString, dynamic\u003E json\u0060 from its caller, and it calls itself at line 74 (\u0060TrueNasDataset.fromJson\u0060) with a piece of \u0060json\u0060 \u2014 and nowhere in \u0060TrueNasDataset.fromJson\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060TrueNasDataset.fromJson\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/domain/models/dataset.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"defeb4f6a1d25a5266ef60336c84b759abce1c4e2a77e969b82ee9456113ac4b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060qbittorrentRssFeedsFromJson\u0060 is public, takes a document from its caller (line 79) and hands it to \u0060visit\u0060, which calls itself at line 108 (\u0060visit\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060visit\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/domain/models/rss.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5e6ef3ecb4752776357cd061e3e82f70f7f4e96eccc42dab57f95663aaba97"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060sonarrCutoffResolution\u0060 is public, takes a document from its caller (line 537) and hands it to \u0060resolution\u0060, which calls itself at line 548 (\u0060resolution\u0060) with a piece of \u0060item\u0060 \u2014 and nowhere in \u0060resolution\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060resolution\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/domain/media_series.dart"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"534ae55f37192a06344acdff0c45c76f920f15dfadc6b9163f9e564fbee99754"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060formatActivityValue\u0060 is public and takes \u0060dynamic value\u0060 from its caller, and it calls itself at line 231 (\u0060formatActivityValue\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060formatActivityValue\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060formatActivityValue\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_formatters.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf99be891d43474daccf583dc819299d2a4370e90d5cb64d0f8503f3cb497e16"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060unwrapFailure\u0060 is public and takes \u0060Object ? error\u0060 from its caller, and it calls itself at line 534 (\u0060unwrapFailure\u0060) with a piece of \u0060error\u0060 \u2014 and nowhere in \u0060unwrapFailure\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060unwrapFailure\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/connection_failure.dart"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d0c9976503c6ed11f66ab6aba060c00139cb60ccaca9d22dedae28805c0c2d"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned disposable field is never released: \u0060MobileScannerWeb\u0060 carries a disposal duty \u2014 it declares its own release \u2014 and it creates \u0060_barcodesController\u0060 itself (line 51, \u0060StreamController.broadcast\u0060), which makes that instance its own. Nothing in the class releases it \u2014 no \u0060_barcodesController.close()\u0060, no tear-off of it, on any path \u2014 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, \u0060StreamController.broadcast\u0060 outlives the object that made it \u2014 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: \u0060_barcodesController.close();\u0060 in \u0060dispose()\u0060 before \u0060super.dispose()\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ced7b92c1cbe47791a06b85e34c488152f9f795acd9acada3c0862b73e91f9"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned disposable field is never released: \u0060MobileScannerWeb\u0060 carries a disposal duty \u2014 it declares its own release \u2014 and it creates \u0060_settingsController\u0060 itself (line 66, \u0060StreamController.broadcast\u0060), which makes that instance its own. Nothing in the class releases it \u2014 no \u0060_settingsController.close()\u0060, no tear-off of it, on any path \u2014 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, \u0060StreamController.broadcast\u0060 outlives the object that made it \u2014 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: \u0060_settingsController.close();\u0060 in \u0060dispose()\u0060 before \u0060super.dispose()\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3c2ea74cca0c6c1131fd5b44356fce1afe4fade1c37085547556a3c7b3583a"}},{"ruleId":"X2","level":"note","message":{"text":"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 \u2014 a page navigated away from, a cancelled request, a shutdown, an expired deadline. Take a \u0060signal\u0060 (Dart: \u0060CancelToken? cancelToken\u0060) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"58893b4b96551e6a8ae7457b477d9307a5fc435a272548ec26cd8e1d7f1da89f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: text: \u0060text\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/scripts/indexnow.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a78b2846927893e2c38a346331d5c8f2497e7a8f4b7373d7c41513c40bd9a9"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: _query: \u0060_query\u0060 calls \u0060_dio.post(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/unraid/data/unraid_client.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dd2d8893cf308ddece14c80cfabd58216403e72d4fe962a2e9c4433d1f0c46"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: _call: \u0060_call\u0060 calls \u0060_dio.post(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/data/transmission_client.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ea443b0797aef90679ef341838ae9d16733bf3a195404304c3c9007236853e"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: checkPlex: \u0060checkPlex\u0060 calls \u0060dio.post(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/data/tracearr_owner_client.dart"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"306d5db75564a0211a0f4db409f69663070fe9b2d9f0c478c51483b397a44a96"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: _knockOnce: \u0060_knockOnce\u0060 calls \u0060dio.get(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/route_knock.dart"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"58df225444d7ceb2196eb75ddb471eb68957de64fe062b7ca3d83153de62bc23"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: _call: \u0060_call\u0060 calls \u0060_dio.get(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/sabnzbd/data/sabnzbd_client.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8e319e95da279d53866e53a441987a5991e99ead0965b6a5368ee319dac32d"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: qbittorrentCredentialMark: \u0060qbittorrentCredentialMark\u0060 calls \u0060_dio.fetch(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/data/qbittorrent_client.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a59b47fa3e7e05304fe1c0ea72337340b466b18ac349641b7bec696c169705"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: _doAuthenticate: \u0060_doAuthenticate\u0060 calls \u0060_dio.post(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/data/qbittorrent_client.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"230b121cfcec12953dcb5a092605a5420b9be7bcd79e0ce83ccdd836ad3df41b"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: getVersion: \u0060getVersion\u0060 calls \u0060_dio.get(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/data/qbittorrent_client.dart"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fd1fc6010e60700c656a4afbf0898ce95ab45e23f11c5be6d8e4c8ad66aa3f"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: post: \u0060post\u0060 calls \u0060_dio.post(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/data/qbittorrent_client.dart"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c469d83754b25d53aa433070bbbb1c8b7c00119e231b5212eeabc74244ff84"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: _call: \u0060_call\u0060 calls \u0060_dio.post(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/data/nzbget_client.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94dce07c868f47719b6b1786f58b909a1ce3db5904924cfe0caedea1dd32926"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: _login: \u0060_login\u0060 calls \u0060_dio.post(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/data/npm_client.dart"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"250a326c3c4076ed83aa57100f1771bfe88ce3b53b07c53ad11eb12e99b837ae"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: _request: \u0060_request\u0060 calls \u0060_dio.request(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/data/npm_client.dart"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"4feec9cb761e81a255d37c2c57dd2b995b6b13e6d816b26f35966147be6f6eab"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: createPin: \u0060createPin\u0060 calls \u0060_dio.post(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/plex_tv_client.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5256c6fc4b364abe733760b2c2a0589d583eded3a2ef8f9ab247beedbf9573"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: authTokenOf: \u0060authTokenOf\u0060 calls \u0060_dio.get(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/plex_tv_client.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c1f1faa381478322b6553c0893986fd05fd96b860dfac8b914124c807a4d17"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: _askWhoAmI: \u0060_askWhoAmI\u0060 calls \u0060_dio.get(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_session.dart"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f439c764d7f079342e967f7c256a12529e02ff4e8bcef934cfd60c2f1d484969"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: gatewayAtUpgrade: \u0060gatewayAtUpgrade\u0060 calls \u0060dio.get(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/upgrade_gateway.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9602873acc1e148d2b573f345bb57ec719bce6ca11e35de3797ffd9170a7bcb8"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: post: \u0060post\u0060 calls \u0060_dio.post(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/api_client.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbbc75788f1ca5e0f89e7ec05f4ed0840c044de15e8a31560d17ab1c7e57f26"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: put: \u0060put\u0060 calls \u0060_dio.put(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/api_client.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada4e0517c7e01154afb36d5d7ab41277f0eef42586cebb9948ec614db1cc1e9"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: patch: \u0060patch\u0060 calls \u0060_dio.patch(\u2026)\u0060 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 \u0060CancelToken? cancelToken\u0060 and pass it on as \u0060cancelToken: cancelToken\u0060 \u2014 or, in a widget\u0027s State or a notifier, hold one and cancel it in \u0060dispose\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/api_client.dart"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a7ae7b069645969e5cd22bfe5ec6a4b3507c588c061f62b9caadd665f031e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f0e0a2b52f89f21fb4ae893f344542d2b9c70e5d6703406d4a90c0bd57f734"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aee33bf326e3585685b2adb1d74f9b8fba4a48e7432053064101b972f43d7ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mobile_scanner/lib/src/web/mobile_scanner_web.dart"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"78da280666d60910f6a0e9ba6f6a313c547152277e7222650fcde10dca040a41"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mobile_scanner/lib/src/web/preferred_device_storage.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"882c65ce6ad54fd8e678bffedcb5aa931d681fb0e6d4748718d119f95cd0bfc5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mobile_scanner/lib/src/web/barcode_detector/barcode_detector_js.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d69c80641469998cb17690a83c3eaae1e841465d8dea4a0245e07eb9f4c8bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mobile_scanner/darwin/mobile_scanner/Sources/mobile_scanner/MobileScannerPlugin.swift"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"54abee38c7616d52ba1140854eb648ac5275bf5388888b7da2e3a530296b0706"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/mobile_scanner/android/src/main/kotlin/dev/steenbakker/mobile_scanner/MobileScanner.kt"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb82b2aa44a1f9da38ae60e67c4591695f4c42865fdbe74c03a9eee0043873f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macos/Runner/MainFlutterWindow.swift"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e36557f794660df51d088eb1c4732b6120a4dc128d294e99f39dc1f2079cfc0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/truenas_capability.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"536ab2d0c68893fe2fb37c13a5d6ce5e02b39e61617df33a8fecbb86787b97ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/truenas_capability.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4426de7bd1ee64416b01c8ab4973dc04ebc800b5634d03ce3b5277b03e55268d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/truenas_hub_screen.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"67495a41f0892ddf769b187fac57f5b7a842b1b2da9796959139d7a462eba548"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/presentation/dashboard/truenas_dashboard_screen.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5149c5349a71a8e38c4bfe0de072e9a10b5c4b181b783149c918c9c38425341d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/data/truenas_ws_client.dart"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"1408bc75d0ae3b1c5a9bf703284b6851ad87bf78d816ac729827c58c36b64de8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/truenas/data/truenas_ws_client.dart"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"badaab1217f3339b2f04188721d6be8437cbba8cf4a553fa4dd1cd825dad7d9c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/transmission/presentation/transmission_overview_provider.dart"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c101a700b2be274821656f3cfaef0be074ad20d205c434aaceb768a83b5548"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/tracearr/data/tracearr_owner_client.dart"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5343a13e5ae2f2fcce2784bd3a5a76b4063f1a755eef8c9958e3a57870095e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/play_with.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f77c832e3ac8328d13371baecf25b611e18bfcea29faea2cd8202848be63bf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/presentation/widgets/stream_now_playing_section.dart"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae253515087f1842714b0b66f01a6d91011008a8f01126d4a45ef7b89c5c450f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/data/stream_app_launcher.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f3a04109cd566ed403d7482401c4fb7e10df76883852e3e48cf36cd4d66de9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/stream/data/stream_app_launcher.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b5dba87b8739d77b6a700987da7d25fe303ccf9a109d578dadb3ef3d185662"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/presentation/widgets/donation_sheet.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c0f571c37444be724f16ea69b3d90f16fdcecf4e4416fcf54d569303eec0f2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/domain/service_key.dart"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3930846c64607f98fe345dcb74754c1980d9d62b1b51710940851b50ad756d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/operator_adds_via_provider.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbed07e03c6a5c2b3c7fec7f7eeda39ea0bedb0df79f9e8f5cb8cad0bdce234f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/route_knock.dart"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"174e54c17581566c3186594aa96ab55a551c8d9573568e092a9dc772df485e7a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/service_verification.dart"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dd70a665080f1b1fee36c99f8e3a89926098e84f9da747ed2aca2583b7c8be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/stream_player_provider.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a62a1a6c8d64f7c3fc165eaf2254dd35df0e920c8961b5eaf13c44a6702e790"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/kept_waiting_provider.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d627b714b4e0ca5b051699eebb1df1af518e63a88fd1093a99ab4ebeac091c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_all_screens.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3985d8061eb478db0f278b212969b934511ad7489520af922775f43e19bcda9b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_kpi_provider.dart"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dab355f480944bdda50f87150e26b505a3c32021ec4cd29b9c29b93c770639"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_kpi_provider.dart"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c8c6077370154e15f91696466c7915b37e17a78d6fc5b0c45c0212bf1b7ba1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/service_kpi_provider.dart"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9743cb7d72de3ec6d017a0e9edfb0e4f0a72d9c7be520fa5c12d94a502be233f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/services_decisions.dart"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11926eb61fa27a464703ec71f80f5f3ae67a4a919266052d78744efbc7aa738"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/services_decisions.dart"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"033c9115cb0ad3c26044f23185819b63843e19f01655b11afc020dea270a6f86"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/stack_screen.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea381fd44b918ccde1a0b2ab1d9627e898453b8427481c932ca5cc21a4b44810"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/search/presentation/recent_searches_provider.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"362742dc00b7eac261f4cbd52d58b1d6c18a7715374edafba82deca57c15feb6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/requests/presentation/requests_screen.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a88925c43ca524c7397d68f77255d5844deae97cc3792e14097ea8fc007412"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/release_search_headroom_provider.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f291b6e161af23684b4d2aa182857d1e2add00d75f65cb0e93c28b4b31ccbc0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/release_search_settings_screen.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c24c184de8fe52abe4fe2835197c6f51b621429684d2b757a571f1e669f2d8b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/data/release_search_transport.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc4de88006bdce068c22f0f0f37f9e389dd2ac1dee0999cf5111de7715b9e13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/readarr/presentation/readarr_overview_provider.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"295d721ce21d04f6fa904d2740a5bbaf480ca1f7d45414f57a36163ac7d63ef6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/domain/models/torrent.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d09603c47304e723ee0013ad2f22285bcc764d33f0422532bb7aa06d5d454c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/data/qbittorrent_client.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"176688ef038d4c145abe23df54bc862a922a501691be8946024486967244cd65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/data/qbittorrent_client.dart"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ab5bb961774e6c92b4e64ae8b5d91da4449e9e952cfdbfcce001ae8ee9dfcb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/data/qbittorrent_refusal_store.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01950ff450b52ce7b4ac08f56256a84ef89c35ef05ef71ab983c0236e35eaa4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/presentation/plex_capability.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd3cf5169d1898afbc5662d63a7e10073127d428aa8e87d54011306163782d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"2934fa2d7ab9b2030fca0f165863f4303dc33a569f2b2b24b84ac7da09405fa9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c24e260ac0846a1c018443594562803a8d927659c1df64a42b66279e301a97"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f7d38d21cb300fecc90e0c9cce7d5e892ebfc409aa36e977c17c2d8f97bb4e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b485e1aa44676f6c0821311003b3e36caad6018936d922226a3695fac04578d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"da06a95250ac3e9fbfdfc1e594b57fddf9c9f1599e24470a023755f0ae7fc945"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f1b7ff94e7ad1593f6f675dfd06de0685c889784366a92aedf8119053f283c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abd3cefcb501f6d82f9c849f4e72ee4cfb4ba52f16017de610b711461aba25d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bf20ff2f04139737c29f9fd0dfdbc096b0d3e09363dab141746512dcd9aa4c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ae6835b98afb621f7ab68f3c589ce96901ca0444516ace8652cb647ca06cd9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/presentation/settings_notifications_screen.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c49212c213bab1aa92a6d913ee71bcf7803217548ffa1eb8ec5d4537875bbd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/data/outside_run.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3233472ce701a5ed4860c1ed0775d2d81c1fecbe3288aa0663394a0493e6076"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/data/outside_shelf.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec11244a41c84e75a9a9c7a9b5e006a6cea8a18e9cb0699bcbb570b9c50c63e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/outside/data/outside_speaker.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d28945e0d02d7b1c91c7a59998b34a54209d83ff14d6dbbf123c81c8fe33606"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/presentation/widgets/onboarding_found.dart"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"afee4d9b4c36e73f1786d9e79c45ca6f790c41692e0e450fb2f6cc93e8bc93ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/onboarding/data/known_candidates_provider.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf6486887187b4a36d31786868be9a9fcc1cd3b28219d6066493d75c263c5e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/nzbget/presentation/nzbget_overview_provider.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ad7bca84a2d4accedfd009f8d15dd5515bb45d25471ba933e61a5cbd39a277"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/npm/presentation/npm_access.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"066c98d70a739e904580de6cc8bfb336e0a25208ebb5edfb4c2be13a283bd3c7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_page.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e08df0b9215752d63dfda80cf9ab48a7aacbea45c92ed0a077b09c105c5fe5a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_sources_provider.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd8eafc5d63649fd8e781399a37643f23df13ce23690132d43dfff1269dfdb7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_sources_provider.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b1ee2be8dd09ff20eb9db93a71ed603eb5f133b29e4ac27c70455e09fe58d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/media_sources_provider.dart"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"80eb58512a035cc717b13816c6c33bcf98f6fe150cae12bbc17a9d69045b7103"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/open_media.dart"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a524bce4d100728529c3e52e7e5ff33d0115b4bb06c0afc7fc23e8c68eaf9643"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/report_problem_sheet.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1481498d617b6008961f7f61fe3c22d76d6046f4cb00069b2cf9e8f7c34df83a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/media/presentation/seerr_issue_thread_screen.dart"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a451d8ff9f6c9d4e48186aa9134ee2640f3132767bcd31d06ab2d1923be3459"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0976f84502616cf0c6bd4de96c593440b8ba25742dc06a05bd7cafcb32ab8aa2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcae0afd7a64ce25bb0c07014d2db4289af3fe8c6b105f95d0ffbd94d13228a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc51724107e7f2fcc4ab13372be10184ba8f67891f112ee7209b785817e7b9d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecc071e0e8249774ad8731281806d1741fd93c71d71243f2dd9552a2025e908"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fe0d280a4da1a65d0bef041d47b0d78d801133395561062bcbae126baeb895"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e1a4ea17016faed44bc78c5b5c11d8cf41b4b1fd9e897db8911b37460e46e7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"a833dfdcee58e8f4869906ffc74d7c70f3ca661bb649d137f5c3ae6e625a780e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbd829b241af2bc4dc6f8c8ae20bf09f0ed8524c0157d47492eb2b0c46dc7f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_dialect.dart"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"497af79f78c9d88985643079c0ba5ba52d6ef639e5cc43a60c500c889855c03d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7984bdb584952927be87fb2448e6eb0aac5897f171683abc5f69e3b317b523"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/import/presentation/manual_import_provider.dart"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d400d965d0f1bf37c8ba7a28d13e4539a554775d28b9d46a7ed997478008210"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/home_screen.dart"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"67602862080274b38446c5b5f25f0413de873d1ad98a348e2855bcabd85b92a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/presentation/widgets/featured_module.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ba6479f2c539d84fef67c6f626bce5a8817b3ef79f2b5fd635c9db9bcfc2ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/home/data/home_last_known.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b70f230766061c9aef22a2cdc7c816d2bbc279668125a9b1d9dbb2f5d6999c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/emby/data/emby_dialect.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae6a86794eb5bdeab49ef9ac2b0aaebb0964e4f844dface3fe7e5ea5b6c449b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/catalog_providers.dart"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a082243be5777be157c2c176c0e38632b4fd4aef8d438bb598a2a4887b0eee16"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/catalog_providers.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3802fad502f80735c7ea3cfe546f4bbc3c7c66e28b735478429786adc8ab0d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/catalog_title_actions.dart"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"405f1d20a1df667a53a07bc7af9265a6ffc39bc984756b266c08c9d4ba0a2f0c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/presentation/catalog_title_actions.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec263242dc27b6d12f15e2f5a46d329e5d4cf48b71b95c2a09d89528a9b32f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_accounts.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c81bc44d8fd3b4318d0fe2960cc8dbb5500d3b2082d0cbee2bd8b0a7972de7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_service.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e740d93bf7420e6184d960942c421346d44e7f2df1446de6f566ce16e1ac8f22"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_service.dart"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8584ed0c0faaeafc9594a82752217eea010a7d193fee618260b60f20466f58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_service.dart"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a9d4e73e51508888ca3f07aed1d0f5bb499231f1d40a0e1944ee57cb0eb85a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/discover/data/seerr_service.dart"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4d48c1ba78e285d6ec37c946f2fbc74d0e4621201939534e02d6527a12afac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/activity_blocklist_page.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cd9548b419b94934d4586451904d4e5fe4c6a3f8dfa4888182832b8f7fef12"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/download_page.dart"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef90a5076ddaf3588d3b0bb4b7a320d0209e6407d132d9a94027661558ab918"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_formatters.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de6351b49f6ec541754366327213905b21a382912061411a2e51a0babae1104"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/presentation/widgets/activity_formatters.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cc4ce3c16b7830885f615a8c39a846beb66796ee2e63e93a2f742f11a90e45"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/activity/data/activity_live.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a218828df4fa1708415af1ca0a4e80f42d27fe702e6fc07dd33c910f7d8160"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/brief_failure_line.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd468cdfba88d78b0834526fa121bb0e38b12fcfa1afb3d4eee761047ea64c2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/brief_failure_line.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c835a09a12a5955df6187978b483a244c17d1ed60785c997cc8d6cf2f044295a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/brief_failure_line.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"863d03bb707ee0a24104fd9cf8a1c098b864426ff303bce2d9cca692b5cdc2dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/not_configured_placeholder.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea15119d99fe9e14ef4640afb4e93b3c106b2bd76dd71707f652fd28a304463"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/not_configured_placeholder.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ac18bec1cd83508f24fc37acd615796910f6c3fa49660c0c17d797596bd95d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/not_configured_placeholder.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba00afd2558d2955855077770076962dde15687244eb65a5056703762f6e1a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/widgets/not_configured_placeholder.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb49cd5d05b05d66a20d56ae77a2c676df988ff44a88eff986cfe58c986eed8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/arr_model_helpers.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9e890887adca40ab879d6453df093997989a595f67e25de9caa5fdb3c3bbbb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/date_format.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17ee48884bfd4ab2353af6113b6517a174f27160a34374390d55d100bd20bb0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/platform/device_time_zone.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcc012e62d0636c6e2cc09ee5207a69ace27edc4ddcd1bde9347c243c6fe163"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/platform/local_network_access.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe106b29e244fd91a5bf98a8c180bb0d20be0bcfd61490ee23a9e8818a2e6e0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/platform/local_network_access.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c662c7d8543c2f13feda336857041ec0906dbee033d6c87e8fb5f56789277e12"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/artwork_cache_migration.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"13272b8f18b5bb1d1ee4785a7a968c29b38dbd3b050a9c92026590bdb91c1139"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/cert_trust.dart"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b886d6b60c52c8fe6699ad5e074706a042f40ae606c9fd1716e0983737ba8019"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/host_reach.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a2d1727d3d1ce59d4c6a36616cbc62a00d8d62b859519b281f1705e621c941"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/local_network_target.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2284700fffc0ed57089f7e4d19520ece5354f56352ba0df6de4166e5dac33e70"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/base_arr_service.dart"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e34ae0b5a89c8e26baa920ad8948f122eb6d1c61dd1725449d1bab411444df6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/base_arr_service.dart"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bb674a598b626bff784ae6d5065261b51d094f0fca515a59a98f66ef8d8d81"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/base_arr_service.dart"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26c60cbf96ccdd380106148878541b3d43bf78402b7fabf9cac5ed949dbdada"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/base_arr_service.dart"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b048026f69e89fa70886b8425b476c71ef79ddf2faf343cdc42d35d645e6634"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/base_arr_service.dart"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb628ecb00ff5160f81ba01da5e2e51eb1c114e0ea1a07aeb40388078e911d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efc0735dc2113b5e7e4135c290651f9a022a5c7571b5df11e4baf8f15a2f004"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/design_system/lint_boards.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dafbdea5a89ebbc2a4e152cf9836369035de2d5414d9f0be21f88b9c450f06"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_read_state\u0060 returns \u0060{}\u0060 when \u0060(OSError, json.JSONDecodeError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/e2e/testlab/emby_play.py"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"df611e36e2ed488dd6bfaf5d76a8da8742a33e482055301093db43ea24eda650"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060lidarr_tracks\u0060 returns \u0060[]\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/e2e/testlab/forge/forge.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bc384f6c788f119e8b655a05a00af096918780117cd31879911f0fadf91976"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_read_state\u0060 returns \u0060{}\u0060 when \u0060(OSError, json.JSONDecodeError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/e2e/testlab/jellyfin_play.py"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b94d70a441dcccb57acddcb1d3a5a52726afd37b9606a80bbc33da8ad49166"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_release\u0060 returns \u0060{}\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/e2e/testlab/mock/server.py"},"region":{"startLine":2650}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95d3b61fb82d8930298acfbf5eada01fbe665053076cadfb3528a00c65ab2ae"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_read_state\u0060 returns \u0060{}\u0060 when \u0060(OSError, json.JSONDecodeError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/e2e/testlab/seerr_world.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb69b199677d1f916ad84fa3533b15e67235d06143579df5ad4562a533ce1cf6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getAllCutoff\u0060 turns every thrown error into \u0060[]\u0060 \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/base_arr_service.dart"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"06185a04cf65de819cdf37a04137bdd4cb5593f308108f19559f3aaf80758fdb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fetchAllItems\u0060 turns every thrown error into \u0060[]\u0060 \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/base_arr_service.dart"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fb26902dd58db5dd3220b5d2321f993daaa26bfb58e109d89bfeda3e04c230"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fetchQualityProfiles\u0060 turns every thrown error into \u0060[]\u0060 \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/api/base_arr_service.dart"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9151a290cda24a3d574bf4a0dc1f842f74ddba8ffbe6036adfbe2826f26c10"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getRecentlyWatched\u0060 turns every thrown error into \u0060[]\u0060 \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/jellyfin/data/media_browser_client.dart"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"5883c71844d3817cf41a8c602531b7a22af466dd6f37a062670db37b6cc054eb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getRecentlyWatched\u0060 turns every thrown error into \u0060[]\u0060 \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/plex/data/plex_client.dart"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1b61d77de8587286a916069273111a000174c80e50f55e4bc606b5cbfa24bf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060trackerDomain\u0060 turns every thrown error into \u0060\u0027\u0027\u0060 \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/qbittorrent/domain/models/torrent.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69c7763970bd06e43baf5e9c53c7a409b654053b052f04cf255c9e7ca924a5c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060build\u0060 turns every thrown error into \u0060{}\u0060 \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/release_search/presentation/release_search_headroom_provider.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef26228f5f6a97e3ed950d796a1246ee673294a28e02ca50226200f39c9e834"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060build\u0060 turns every thrown error into \u0060[]\u0060 \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/search/presentation/recent_searches_provider.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd0749e2c350d169c9a031326d0df93e57da6d10e3de73b075407fd34141cac"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060build\u0060 turns every thrown error into \u0060{}\u0060 \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/services/presentation/kept_waiting_provider.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a0b999fc44c1f4437ee81df4c16d4d57fa7297348d677aa4e40a65986b74f4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060loadActiveInstances\u0060 answers \u0060{}\u0060 when \u0060FormatException\u0060 is thrown, with no log or rethrow \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c46cdb975cd402c1506856f8d3c5fac837b82fbdd25eb33685c0d7d22689564"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060loadConnectionRoutes\u0060 answers \u0060{}\u0060 when \u0060FormatException\u0060 is thrown, with no log or rethrow \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d62eda2731c357b387cb27f2f5aa125405c9e5e2df447e985e9271162adbb5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_readRoster\u0060 answers \u0060[]\u0060 when \u0060FormatException\u0060 is thrown, with no log or rethrow \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cc988091f1e6a55602f5cb451e511780bc1b33b753bac0109511fb0742e1ff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_loadTrustedCertificates\u0060 turns every thrown error into \u0060{}\u0060 \u2014 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 \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/features/settings/data/settings_service.dart"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"a885adac3dc54a7bab25818ffd2acce377b506b731782885abdef16e235732b1"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-653","guid":"aa3e371b-590e-225d-a56c-cd490a1dca63","name":"Insufficient Compartmentalization","shortDescription":{"text":"Insufficient Compartmentalization"},"helpUri":"https://cwe.mitre.org/data/definitions/653.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":8,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}