{"$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":"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":"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":"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":"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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"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":"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"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":"_TrackMetadataScreenState._refreshResolvedAudioMetadataFromFile (cyclomatic 154): _TrackMetadataScreenState._refreshResolvedAudioMetadataFromFile has cyclomatic complexity 154 (threshold 15). To reduce it, separate the cases: extract each independent 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/screens/track_metadata_screen.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d30631854919ac7b2423e087b75873d14580d55988700178eae23ad8dd5f6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"_HomeTabState.build (cyclomatic 100): _HomeTabState.build has cyclomatic complexity 100 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/home_tab.dart"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"0820f33284f796d4fdee352921193f9505959868843bf25659273bd68a32f39f"}},{"ruleId":"D1","level":"warning","message":{"text":"_NowPlayingScreenState._buildPlayer (cyclomatic 97): _NowPlayingScreenState._buildPlayer has cyclomatic complexity 97 (threshold 15). To reduce it, separate the cases: extract each independent 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/screens/now_playing_screen.dart"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2aad5d21244b845a1741463897c81840c4d47ae4b19874bc4de64551aed7d3"}},{"ruleId":"D1","level":"warning","message":{"text":"RustCoreBackendApplicationKt.dispatchApplication (cyclomatic 94): RustCoreBackendApplicationKt.dispatchApplication has cyclomatic complexity 94 (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":"android/app/src/rust/kotlin/com/zarz/mornye/RustCoreBackendApplication.kt"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d87180d282a86c6d59fb1b6eac8fd7a34ea30989c6cd0cc0eda8caf67d7eb2"}},{"ruleId":"D1","level":"warning","message":{"text":"RustCoreBackend.invokeApplication (cyclomatic 92): RustCoreBackend.invokeApplication has cyclomatic complexity 92 (threshold 15). Of this number, 91 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"ios/Runner/CoreBackend.swift"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"42446774bee1e9ce894bd369bbecd7e632b91d3201b6bb1fb73cfa159c04b355"}},{"ruleId":"D1","level":"warning","message":{"text":"_SyncedLyricsViewState._buildLyrics (cyclomatic 82): _SyncedLyricsViewState._buildLyrics has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/player_lyrics.dart"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b395e8f153a8e2c07189e419b939917e91c581af3830588f4a78da478b2235"}},{"ruleId":"D1","level":"warning","message":{"text":"_QueueTabState.build (cyclomatic 80): _QueueTabState.build has cyclomatic complexity 80 (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/screens/queue_tab.dart"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abb5978feb77bd7ed7c8c121b5f8e47b83cdd57d3161c35c89a58fd96f3485b"}},{"ruleId":"D1","level":"warning","message":{"text":"_DownloadRun._handleDownloadSuccess (cyclomatic 76): _DownloadRun._handleDownloadSuccess has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dd033791b616cc7815092329e68ffd3d29abf59dea9c3ec5e0c797e7d053dd"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadMetadataEmbedding.embed (cyclomatic 75): DownloadMetadataEmbedding.embed has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/download_metadata_embedding.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"62615585a15f2f041e6c101556ab7db5a57a103d794556273e1c95b5ac12e7a6"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadQueueNotifier._processQueueSingleFlight (cyclomatic 74): DownloadQueueNotifier._processQueueSingleFlight has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_queue_provider.dart"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"badbeb3c8301f022ef8e73cc532777a5ea946066452bed673cce2c504856997a"}},{"ruleId":"D1","level":"warning","message":{"text":"_NetworkStorageScreenState.build (cyclomatic 69): _NetworkStorageScreenState.build has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent 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/screens/network_storage_screen.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"591be234aaf610f792c96c5309c6b860d1fb5034f2554424e4c21a62e1119f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"_MusicAutoMix._start (cyclomatic 69): _MusicAutoMix._start has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent 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/services/music_player_automix.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"679d080ca8a53036cebe7a0880aa859eb8cc40003bb58c22ae679f732c642b63"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkLibraryScanner._scan (cyclomatic 69): NetworkLibraryScanner._scan has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent 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/services/network_library_scanner.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29f8094b1e6c178c3ef9583e2a99cbd8b6f953ea2b223eedff51869df8625b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionManager::provider_operation_value (cyclomatic 68): ExtensionManager::provider_operation_value has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/manager/providers.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"baad8f6a39e30d93e3abc341a4fc26ab7e2c762271204955db15438ba9548685"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicPlayerHandler._loadIndex (cyclomatic 64): MusicPlayerHandler._loadIndex has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent 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/services/music_player_service.dart"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95df8fc96760fdc9afd279d890120d7694b9f41a7b512067c9402b68193e5c7"}},{"ruleId":"D1","level":"warning","message":{"text":"MainActivitySafScanKt.scanSafTree (cyclomatic 64): MainActivitySafScanKt.scanSafTree has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent 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/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a28c4d24869d6abdd2caeb81ab212e66ea86922b09c50b438050283f972697"}},{"ruleId":"D1","level":"warning","message":{"text":"_PlaybackSettingsPageState.build (cyclomatic 58): _PlaybackSettingsPageState.build has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent 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/screens/settings/playback_settings_page.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"791c961ebf667289ab517d22d59feabcc576dbbf0109021d543f841f1d54d591"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::write::id3::read_frames (cyclomatic 58): mornye_core::tags::write::id3::read_frames has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent 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":"rust_backend/crates/core/src/tags/write/id3.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f016deb85441537b0102b94a53f50609a8a0696696b09d758569ef0e5ffe2e1"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibrarySearchResultsState._buildSlivers (cyclomatic 54): _LibrarySearchResultsState._buildSlivers has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent 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/widgets/library_search_results.dart"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bab61c3f3448be40aad340d232a5b1bc5f8de16965d8ba871df33118af932c"}},{"ruleId":"D1","level":"warning","message":{"text":"SafFileInspectionKt.inspectSafFiles (cyclomatic 54): SafFileInspectionKt.inspectSafFiles has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent 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/zarz/mornye/SafFileInspection.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f2ec4bb37a4e1fc7aade0c2bafc6786669d10cf0c5b445191d9a144823b0ce"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataAutofillService.enrich (cyclomatic 52): MetadataAutofillService.enrich has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent 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/services/metadata_autofill_service.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"763ad29783ca4a82817ea5066e30accb91a4f17d293d054cbb37a7424f5e7535"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeFinalizerMediaKt.embedBasicMetadata (cyclomatic 52): NativeFinalizerMediaKt.embedBasicMetadata has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent 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/zarz/mornye/NativeFinalizerMedia.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1efe3d2342e7c6443b3225980cb9f76a4b399436bf9a1dd8510c577ec1298a"}},{"ruleId":"D1","level":"warning","message":{"text":"MainActivitySafScanKt.scanSafTreeIncremental (cyclomatic 51): MainActivitySafScanKt.scanSafTreeIncremental has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent 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/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d224edac87de6478037986bdd626b91c58db274c302b077e7e0a8eaf4397a12"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::download::chunked::download (cyclomatic 51): mornye_extensions::download::chunked::download has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent 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":"rust_backend/crates/extensions/src/download/chunked.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1407644e42118d954b532a2e6729f1de445002dbfaf8309dce4499b45d0a24db"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibrarySettingsPageState.build (cyclomatic 50): _LibrarySettingsPageState.build has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent 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/screens/settings/library_settings_page.dart"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee532cfbd11af1396caffbf8deec6166c383d00273782c45802a2b7444b3097b"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::plan_download (cyclomatic 50): Backend::plan_download has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent 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":"rust_backend/crates/extensions/src/backend/downloads.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"595aa3083baeace339a6969d40ad966c8fdf7a573a1ca0babf46057f497c9952"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::download_attempt (cyclomatic 50): Backend::download_attempt has cyclomatic complexity 50 (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":"rust_backend/crates/extensions/src/backend/downloads.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd202a8bd16b20be0ee1cb429d57994a79d9f3a44b00c9b0d44809e3de375672"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkLibraryExecutor.call (cyclomatic 49): LinkLibraryExecutor.call has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent 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/services/link/desktop/link_library_executor.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3cdf1ce549d1135a2e04ec3b3a9433de259213fd7429ab5706d8ca4f79b454"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkStorageService.parseListing (cyclomatic 49): NetworkStorageService.parseListing has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent 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/services/network_storage_service.dart"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"739f9b044990e1e61bbd1e103604ca396066ca7ea7d948c1fc091511558dc49f"}},{"ruleId":"D1","level":"warning","message":{"text":"MornyePlayerLayout.build (cyclomatic 49): MornyePlayerLayout.build has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent 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/widgets/mornye_player_layout.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4f4db2c4f0309d43a4af16e50378b5ecc1e79e4ab6d93c6145258190fd9afc"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibraryTracksFolderScreenState._buildAppBar (cyclomatic 48): _LibraryTracksFolderScreenState._buildAppBar has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/library_tracks_folder_screen.dart"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7abb8d218966dbb79cf921293076586bb45b03a4da0b31440755e537c473f15"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionManifest::deserialize (cyclomatic 48): ExtensionManifest::deserialize has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"20191cb6eda2276f51b77f59a0e4ac6161cd42e1622898b97e620bc7b98a394d"}},{"ruleId":"D1","level":"warning","message":{"text":"MornyeGlass.build (cyclomatic 47): MornyeGlass.build has cyclomatic complexity 47 (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/widgets/mornye_chrome.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1118ccbb6a74f85a3963cd81bdcb11e94ca4c0a547f23eac70ae7d32bcce1f50"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::media::hires::check_file (cyclomatic 47): mornye_core::media::hires::check_file has cyclomatic complexity 47 (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":"rust_backend/crates/core/src/media/hires.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"50906c72567ce8595eb6e1281153572c28b60bb9d553af195cdf92d884b3ca6a"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::download::download (cyclomatic 47): mornye_extensions::download::download has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent 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":"rust_backend/crates/extensions/src/download.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"228e01ab67e861462d0f72c061b9a8254da5ac53e7f5a8f1269a66a12f8fe967"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsTranslator.translate (cyclomatic 46): LyricsTranslator.translate has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/lyrics_translation.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2004002284d4e7a97b4fb84f97197288501ca3bdd6c6db3e76a50db91872cb7"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayerPlaybackControls.build (cyclomatic 46): PlayerPlaybackControls.build has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/player_playback_controls.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"721968cfb42cea90b505e65804e096707ba10c02635a0dc5c30629f0aec9eb55"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::write::riff::edit (cyclomatic 46): mornye_core::tags::write::riff::edit has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/tags/write/riff.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad09aabfee4eea17e5613004161f69639aef93871e22037ba2804603edbc8695"}},{"ruleId":"D1","level":"warning","message":{"text":"_DownloadRun._applyFormatHandling (cyclomatic 45): _DownloadRun._applyFormatHandling has cyclomatic complexity 45 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_queue_provider_single_item.dart"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3faed2bcb8bd7c3511dda5681cf17e323dd4b80ccd78aa2a00585272442c91"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioMetadataMapper.vorbisToNativeChunkFields (cyclomatic 45): AudioMetadataMapper.vorbisToNativeChunkFields has cyclomatic complexity 45 (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/services/audio_metadata_mapper.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47ccc6919dbd201ad9564058a8f5af795655f4f2b50e70eed391a21a8c1c479"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadFileRecovery._recover (cyclomatic 44): DownloadFileRecovery._recover 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/services/download_file_recovery.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d869013c19cd7f5ac676a16f0f4d0f867eff27240b78d50fe4eb3bb6e3d553"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkDesktopRemote._applyLocally (cyclomatic 44): LinkDesktopRemote._applyLocally 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/services/link/features/link_desktop_remote.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5771df4a60ed44b016b4312d13464ab517d9d20eb6c8deb7562b77f945a41b59"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::id3::apply (cyclomatic 44): mornye_core::tags::id3::apply has cyclomatic complexity 44 (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":"rust_backend/crates/core/src/tags/id3.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaa4e746f5c007349daca9c02fae97f645797a8064e03e5d0abd43b4d834579"}},{"ruleId":"D1","level":"warning","message":{"text":"_MusicGapless._prepare (cyclomatic 43): _MusicGapless._prepare has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_gapless.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b717eccd7bc498bce9cd6401cec717b1d7f9ddb18dda3d52308ce48c43dc1271"}},{"ruleId":"D1","level":"warning","message":{"text":"_AudioFacts._output (cyclomatic 42): _AudioFacts._output 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/widgets/audio_info_sheet.dart"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ace4c793b7cc4d803aea65e9ae8a09137afe02d154ea5ba61a76ade0e05a42"}},{"ruleId":"D1","level":"warning","message":{"text":"RepoExtension::deserialize (cyclomatic 42): RepoExtension::deserialize 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":"rust_backend/crates/extensions/src/repository/model.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"da75a2656c3953449ad2208941e455349896464518f1e252a9de8597bfe9ca96"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::native_autoplay_taste::execute (cyclomatic 42): mornye_mobile::native_autoplay_taste::execute 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":"rust_backend/crates/mobile/src/native_autoplay_taste.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"037df2403e5a23b513475a9d69f8da215408732c0f86a82f037c13dd86750b1e"}},{"ruleId":"D1","level":"warning","message":{"text":"_MornyeArtworkContrastState._sample (cyclomatic 41): _MornyeArtworkContrastState._sample has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/mornye_artwork_contrast.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e31879dabcff736df1ecc59961b541b1fd933375db301139939077ad59707e"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioMetadataMapper.normalizeToVorbisComments (cyclomatic 40): AudioMetadataMapper.normalizeToVorbisComments has cyclomatic complexity 40 (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/services/audio_metadata_mapper.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84e8571d446ae33a98867905d40eafe784472bdf597e2c0e77bbfbf6012a436"}},{"ruleId":"D1","level":"warning","message":{"text":"_MiniPlayerBodyState.build (cyclomatic 40): _MiniPlayerBodyState.build has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent 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/widgets/mini_player.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc6d24e14db9446a450c189f794a7e2a8ff3ffcea064985f0cbd9d859ed0fc6"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::file::read_metadata (cyclomatic 40): mornye_core::tags::file::read_metadata has cyclomatic complexity 40 (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":"rust_backend/crates/core/src/tags/file.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0068e8ba89d9267d1d6b9f69347b3ba7bce3bbf85cb2b44d3a124ca86365143"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionManifest::validate (cyclomatic 40): ExtensionManifest::validate has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c27d8abffac96fc93fff70df36295e4647727560f521118e5c5d638be6652e2"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::usb_audio::descriptors::parse (cyclomatic 40): mornye_mobile::usb_audio::descriptors::parse has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent 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":"rust_backend/crates/mobile/src/usb_audio/descriptors.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ef802ecd21a3300405e7b4d3b2749820d88513726d407b4540980bf796b760"}},{"ruleId":"D1","level":"warning","message":{"text":"AppDelegate.invokeOsMethod (cyclomatic 39): AppDelegate.invokeOsMethod has cyclomatic complexity 39 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/AppDelegate.swift"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d9ce130401ad27ded914a2b2c126338069553adc59cb713a86fc7de36a733c"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::scan_library (cyclomatic 39): Backend::scan_library has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/library/scan.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"510e0015f63ef1aa68ee815a24e9c3aaa41ed35a48cd30d477def95f156ef194"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadHistoryNotifier._inspectOrphanedEntries (cyclomatic 38): DownloadHistoryNotifier._inspectOrphanedEntries has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_history_provider.dart"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"6412fbfa812193fb898780e065abd79cc6d7227962943185497b900d00df7bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"TrackNotifier.fetchFromUrl (cyclomatic 38): TrackNotifier.fetchFromUrl has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/track_provider.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d6dd1e2f451899936afc46e8c6ef121025d4e92a3f3452859cf53bcb04ee91"}},{"ruleId":"D1","level":"warning","message":{"text":"_ArtistScreenState._buildPage (cyclomatic 38): _ArtistScreenState._buildPage has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/artist_screen.dart"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e09e2472daa6397db6a830d4d7587dc700b5892d121f6181d439fb0115db5f"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::comments::apply (cyclomatic 38): mornye_core::tags::comments::apply has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"rust_backend/crates/core/src/tags/comments.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4824ab8ee334e2f228534a6554e63226bdd24170262bb98a7ceabe5277582459"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibraryTracksFolderScreenState.build (cyclomatic 36): _LibraryTracksFolderScreenState.build has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/library_tracks_folder_screen.dart"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6cf0ddb95ceda4430bef6afc1a21b9aa4656dc5a1e1096f6ae247e1f05e6b0"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsParser._parseTtml (cyclomatic 36): LyricsParser._parseTtml has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/utils/lyrics_parser.dart"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c7272460ea23e20cc8e6907e7e8c8ef1cac22b3033b14809749a5eb4c6f039"}},{"ruleId":"D1","level":"warning","message":{"text":"_TrackTableRowViewState.build (cyclomatic 36): _TrackTableRowViewState.build has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/desktop/track_table.dart"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cc3248449f159d1971deb9eba8651d828dd8f565d5f6afb26b069d88b546b6"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::filenameMetadata::visit (cyclomatic 36): (anonymous)::filenameMetadata::visit has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4172e3ab19aacd93ce49ce3143187ac219d08dab1f92856e6dbbcdd2f02a743"}},{"ruleId":"D1","level":"warning","message":{"text":"_RewindSlide._content (cyclomatic 35): _RewindSlide._content has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/listening_rewind_slides.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e66ead57bbd2870c8c19e409bcc954e97dfb674857108df268f7a63cabd462"}},{"ruleId":"D1","level":"warning","message":{"text":"_ExtensionDetailPageState.build (cyclomatic 35): _ExtensionDetailPageState.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/screens/settings/extension_detail_page.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b5df8864e7712dc74fe4bae08752f1a9cdb24ae282d05edf89a385745815cc"}},{"ruleId":"D1","level":"warning","message":{"text":"BackupService._parseArchive (cyclomatic 35): BackupService._parseArchive has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/backup_service.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"86818302447f64d6860323c479dd16d3a1c4ef29df9d2bca8a8ef1a5860771c5"}},{"ruleId":"D1","level":"warning","message":{"text":"_MusicAutoMix._prepare (cyclomatic 35): _MusicAutoMix._prepare has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_automix.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf36de56caa3764f095fcc8a2b85f178822aa245b069a15f94fcb3e7be8ad2d6"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::media::audio::mp3_quality (cyclomatic 35): mornye_core::media::audio::mp3_quality has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/media/audio.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f46ba0d6d1d1cfe57dab37ee692e832b1ba83fc2abea9e4ce5e3ccf089fbdc"}},{"ruleId":"D1","level":"warning","message":{"text":"_DownloadRun._run (cyclomatic 34): _DownloadRun._run 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b4aa57d79a9085945114782ef370cbc2d597b40586c8255f0734d59be31c34"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkStorageService._request (cyclomatic 34): NetworkStorageService._request 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/services/network_storage_service.dart"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b604b58177d3b52e473021f1a5a117c9ec04a5e5e892e93a5dbce35a982a3e"}},{"ruleId":"D1","level":"warning","message":{"text":"_SyncedLyricsViewState._maybeAutoScroll (cyclomatic 34): _SyncedLyricsViewState._maybeAutoScroll 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/widgets/player_lyrics.dart"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"216d2107e191d1dc131da2f3feedef2aec4e45bad4706ecde03a001e882a113e"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::filename::date::render (cyclomatic 34): mornye_core::filename::date::render 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":"rust_backend/crates/core/src/filename/date.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"822a745bcf180c54a16700bdc24423849c93524782c270e2d6c543685cef6604"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::library::read (cyclomatic 34): mornye_core::tags::library::read has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"rust_backend/crates/core/src/tags/library.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ad0c99b26843113bede0d614cd2725a3070a7e4e76a8dd6d06cbc584e5ddb1"}},{"ruleId":"D1","level":"warning","message":{"text":"ApkDownloader.downloadApk (cyclomatic 33): ApkDownloader.downloadApk 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/services/apk_downloader.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b410cdd93644e91b68991d1271ab07be92e36a99a7592d4b223d90827b5d14c1"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkLibraryJobsHost.handle (cyclomatic 33): LinkLibraryJobsHost.handle 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/services/link/desktop/link_library_jobs_host.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1210c95722be609203ca716af5595429fca719f72151a1eeb856797bc03b5fbc"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDownloadFinalizer.finalize (cyclomatic 33): NativeDownloadFinalizer.finalize 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e437ec98a24931666bca98a62346d1dc35d401f8ab29993b848a8278ba3faca"}},{"ruleId":"D1","level":"warning","message":{"text":"SignedSessionClient::signed_fetch (cyclomatic 33): SignedSessionClient::signed_fetch 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":"rust_backend/crates/extensions/src/signed_session/fetch.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea6e67151b63accf6b02ed4479545199fe162f9e2d7bb03b53fe4c396da21a7"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).exportValue (cyclomatic 33): (anonymous).exportValue 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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40a5d6fb6902537b94a4c94253ba62f9e8b46ae7c64e509d279a91098f8c4e4"}},{"ruleId":"D1","level":"warning","message":{"text":"BackupService.writeBackupArchive (cyclomatic 32): BackupService.writeBackupArchive has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/backup_service.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e4bd80013480ce1ea746e75ffe074261d9963af89eaa9cbe1cbcdf9481a46d"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadFileFinalizer.autoConvert (cyclomatic 32): DownloadFileFinalizer.autoConvert has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/download_file_finalizer.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"82696f9d2f9bb8c94fd1f1816b0d7d60d462fa40fbaf9ba2e460ec5477b651de"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkPlaysOnDesktop.build (cyclomatic 32): LinkPlaysOnDesktop.build has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/features/link_remote_playback.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a95a6b1ac333aa2420166bfd0afeae7c641bcaeea76b0ba37665d3671575247"}},{"ruleId":"D1","level":"warning","message":{"text":"PlatformBridge._ensureBackendEventHandler (cyclomatic 32): PlatformBridge._ensureBackendEventHandler has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/platform_bridge.dart"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c224c51027bbacd32db81f01e6381edfe0dbc76dc6a6395b73e2685b0c33829"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadService.processConcurrentNativeRequest (cyclomatic 32): DownloadService.processConcurrentNativeRequest has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59859a8361048bedd85f1a66e1acc502532fffe098a8b42865768b1e972e579"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::id3::frames (cyclomatic 32): mornye_core::tags::id3::frames has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/tags/id3.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d708a5f1529b2823a4a2956ea60d46e85b212c9c927c49b060f105f46ea060"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::cache_cover (cyclomatic 32): Backend::cache_cover has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/cover.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bcd598188390f8a6eef4c58639a0fe3d91adbe02dd346226ffc0f1e3ded650"}},{"ruleId":"D1","level":"warning","message":{"text":"_AccountForm.parse (cyclomatic 31): _AccountForm.parse has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/controllers/extension_action_forms.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c5311095e9e8367f0e8d81fade643724664a66eb2b3da0e748ebc6a575ea35"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioMetadataMapper.convertToId3Tags (cyclomatic 31): AudioMetadataMapper.convertToId3Tags has cyclomatic complexity 31 (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/services/audio_metadata_mapper.dart"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6694cf88cef5a015c6c0dafa075da92de896549b0df354fd083aef515eaddd"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoplayPreferenceModel.decode (cyclomatic 31): AutoplayPreferenceModel.decode 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/services/autoplay_personalization.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5f4b9588a41e82789842e21adf0095802aebbc821899ec3948c603f1b5c6e3"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsDraft.parse (cyclomatic 31): LyricsDraft.parse 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/utils/lyrics_draft.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"664112a1735192dfe15d82e08b38618c4ec8042f6cc7814c3ee79aa27220602d"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::media::audio::riff_quality (cyclomatic 31): mornye_core::media::audio::riff_quality 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":"rust_backend/crates/core/src/media/audio.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22d091a6eb27e8d12a8963c482c76116ef41e6376549e48f8c554b0b07bf895"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::write::mp4::edit (cyclomatic 31): mornye_core::tags::write::mp4::edit 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":"rust_backend/crates/core/src/tags/write/mp4.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f72879484295ee47faeecac781d604ccbf048d1f816d35643983d0158e1c42"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsTranslationController.translate (cyclomatic 30): LyricsTranslationController.translate 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/providers/lyrics_translation_provider.dart"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c47fc9a156737de6c8a5030960c025650cbae59e4f3882dc1e5c4b6a65a4573"}},{"ruleId":"D1","level":"warning","message":{"text":"_NowPlayingScreenState._showMoreActions (cyclomatic 30): _NowPlayingScreenState._showMoreActions has cyclomatic complexity 30 (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/screens/now_playing_screen.dart"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbfb3c66750aa968a8d8342e9c48c62aa63fa637f9861b380d94361894a69e1"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkLibraryJobRow.build (cyclomatic 30): LinkLibraryJobRow.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/widgets/link/link_library_actions.dart"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f920e4a587ff5c2a76e89528dd046f6866f6f1b0cfa20862de23eae376d8672"}},{"ruleId":"D1","level":"warning","message":{"text":"_MornyeBottomBarState.build (cyclomatic 30): _MornyeBottomBarState.build has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/mornye_bottom_bar.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dff0d6be099c650177b3e84d4fc06e061455f6d604e6ff85377413389963834"}},{"ruleId":"D1","level":"warning","message":{"text":"SafDownloadHandler.handleSafLocked (cyclomatic 30): SafDownloadHandler.handleSafLocked 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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fa1d7ef4d1689f97c86a7fc4c579d6f72b5c251f2a07df6e770a0125b0257d"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::cue::parse (cyclomatic 30): mornye_core::cue::parse 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":"rust_backend/crates/core/src/cue.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6450719e536bb32cb6353da5169a381e61be210dbb97ae0a466f61304580f38a"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::native_audio_analysis::estimate_spectral_cutoff (cyclomatic 30): mornye_core::native_audio_analysis::estimate_spectral_cutoff 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":"rust_backend/crates/core/src/native_audio_analysis.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c735417ec7e7a7aeb9b3fe464a8712f36357d40ba088255a568fb914eea0fc6d"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::file_transform::transform (cyclomatic 30): mornye_extensions::file_transform::transform 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":"rust_backend/crates/extensions/src/file_transform.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3d1c3f2678aee91f0ee3ed665b076a799b397cc719ec91ea072eac1052166a"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayerMetadataController.load (cyclomatic 29): PlayerMetadataController.load 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/controllers/player_metadata_controller.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d80804c39108c7e80d73b93bb294c70d16be46e0474955ff75c9fbcc89c1249"}},{"ruleId":"D1","level":"warning","message":{"text":"_MornyeLibraryScreenState.build (cyclomatic 29): _MornyeLibraryScreenState.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/screens/mornye_library_screen.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b1b3d64786c946c8560cf9c36eb6b58501c5b82031e97813926022b13c310c"}},{"ruleId":"D1","level":"warning","message":{"text":"_NetworkConnectionFormState.build (cyclomatic 29): _NetworkConnectionFormState.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/screens/network_storage_screen.dart"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"1367c8b51c2eb445eb5c9b0c9ea0752b8023b621fa7aa382e1c3d61cbe6a2732"}},{"ruleId":"D1","level":"warning","message":{"text":"_MixBuilder.build (cyclomatic 29): _MixBuilder.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/services/library_mixes.dart"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13349310910f1d97fc6dac26de669eb3db2d5730dad32ba6d42c9a5a67cd0b3"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryQueueStore._queueAlbumUnionSql (cyclomatic 29): LibraryQueueStore._queueAlbumUnionSql 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/services/library_queue_store.dart"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"15610988d83e4a6f95d9d7a6807250ddcb273622616beae2324a7f263ca618af"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkHistorySyncStore.apply (cyclomatic 29): LinkHistorySyncStore.apply 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/services/link/sync/link_history_sync_store.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"899ed6bc9ab3428240a566ab0b989ab258a1a63af90fb69fa0250dbb3ddd6601"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsParser._parseLrcOrPlain (cyclomatic 29): LyricsParser._parseLrcOrPlain 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/utils/lyrics_parser.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"af01723f6c1a060ba20dc8e0ef12600f213a48f2f709eaf4b6f235949a435bb2"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibraryDirectoryViewState.build (cyclomatic 29): _LibraryDirectoryViewState.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/widgets/library_directory_view.dart"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3a14865ef1bb6b7de51076c2e022227ea9da3784a9e4870a16174ec8f11218"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkOfflineNotifier.save (cyclomatic 28): NetworkOfflineNotifier.save 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/providers/network_offline_provider.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd389dccb9c8c17616ac957a59bf9464003cb70ff101281fcfff5d58496878d4"}},{"ruleId":"D1","level":"warning","message":{"text":"TrackCard._buildCard (cyclomatic 28): TrackCard._buildCard 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/widgets/track_card.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"36847051dc8991d9f91971f79dabe9363166ac0a5825d56a33bb3edff3869285"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::write::ape::edit (cyclomatic 28): mornye_core::tags::write::ape::edit 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":"rust_backend/crates/core/src/tags/write/ape.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c6f0a66a2d96cc36c7f16a9d9db72b7445f029b06fdc013156de8f2b44ea13"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::download::segments::download (cyclomatic 28): mornye_extensions::download::segments::download 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":"rust_backend/crates/extensions/src/download/segments.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba101ee6a81630a58e857b00fa81c4df08e4c6554fedd7b4b22a765ff8de46f"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryQueueStore._appendQueueCommonFilters (cyclomatic 27): LibraryQueueStore._appendQueueCommonFilters has cyclomatic complexity 27 (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/services/library_queue_store.dart"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"2890758d870c9f67b80c782e084bda84cc4b73f594a021c1a1fa3047f6ab851b"}},{"ruleId":"D1","level":"warning","message":{"text":"LibrarySearchStore.search (cyclomatic 27): LibrarySearchStore.search 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/services/library_search.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da49d5e14b8e1d772b6cd22e539314cc440644510cebcaf1a65ef217d1f6b29"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkPhoneSession.apply (cyclomatic 27): LinkPhoneSession.apply 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/services/link/features/link_phone_session.dart"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dfebd56fc8f43582751b89fa12dbfcfd12585acd3f649f273b0b6a116c34c4"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkCollectionSyncStore._withData (cyclomatic 27): LinkCollectionSyncStore._withData 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/services/link/sync/link_collection_sync_store.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4558b31688e22c84cb437e09265d91da6ec8122f45623225b2d6fa83e251a7c9"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkHistoryArtwork.sync (cyclomatic 27): LinkHistoryArtwork.sync 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/services/link/sync/link_history_artwork.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec378c16cbee26e7cfb4eb526d1d8c43bddc2ea8a35041d0a86b9114bac350b8"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalTrackRedownloadService._scoreMatch (cyclomatic 27): LocalTrackRedownloadService._scoreMatch 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/services/local_track_redownload_service.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1145e776bf1fc91f7b4637bdbdb89bcf6f42c21e76d37946454eb3e882b1b8"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioplayersPlaybackDeck.resume (cyclomatic 27): AudioplayersPlaybackDeck.resume 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/services/music_playback_deck.dart"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9405bb8c0800c492a0628f5825a974f3fc49e9220041f71c273b1e7db0e3536"}},{"ruleId":"D1","level":"warning","message":{"text":"_LastfmSettingsState.build (cyclomatic 27): _LastfmSettingsState.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/widgets/lastfm_settings.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7084b0d37b9113715392ad27640fd0e5f9d9d82b4bc10159f347c54101e2197b"}},{"ruleId":"D1","level":"warning","message":{"text":"MornyeLevelSlider.build (cyclomatic 27): MornyeLevelSlider.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/widgets/mornye_level_slider.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6969505e92afcf5908cb812dce2e07ac1db7417eca22c077c0b2bd17b776c29"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::write::flac_header (cyclomatic 27): mornye_core::tags::write::flac_header 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":"rust_backend/crates/core/src/tags/write.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bf3fc2184f401b537b85c802c31bd49f4826a91bbc7f38227fc34007e930b3"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::usb_audio::volume::feature (cyclomatic 27): mornye_mobile::usb_audio::volume::feature 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":"rust_backend/crates/mobile/src/usb_audio/volume.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd78d0cf4d9acf5cdf53bc628e00287716a1b1efba00206796ce260209c3644f"}},{"ruleId":"D1","level":"warning","message":{"text":"_HomeContinueListeningCardState.build (cyclomatic 26): _HomeContinueListeningCardState.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/screens/home_tab_intro.dart"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec9ae11cf02cce4922157406faffceeb03ff3ac6aed0908cf4d5dd73fa2580e"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioMetadataMapper.convertToM4aTags (cyclomatic 26): AudioMetadataMapper.convertToM4aTags has cyclomatic complexity 26 (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/services/audio_metadata_mapper.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda76c419ac0a40ec8a6339adcf46e102baa4ed97d4e1ab9d00e3dedf33b6c39"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadedEmbeddedCoverResolver._runPersistentCacheMaintenance (cyclomatic 26): DownloadedEmbeddedCoverResolver._runPersistentCacheMaintenance has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"7335ff11d278d11910d6d7eeb635931f8306496e04d8e5d57bda60a0ca47710a"}},{"ruleId":"D1","level":"warning","message":{"text":"FFmpegConversion.convertAudioFormat (cyclomatic 26): FFmpegConversion.convertAudioFormat has cyclomatic complexity 26 (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/services/ffmpeg_conversion.dart"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fc7c146260ad5aa03048c02eb2c300c85b7cf3111013c8a1b313a70873aa57"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkClientSession._connect (cyclomatic 26): LinkClientSession._connect has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/client/link_client_session.dart"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec1decc3929e67b9a48e5b469983f5c8ea02fa1ff5a0efbf3acc38d559f11b2"}},{"ruleId":"D1","level":"warning","message":{"text":"_ExpressivePlaybackTransportState.build (cyclomatic 26): _ExpressivePlaybackTransportState.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/widgets/expressive_playback_transport.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b85ac4df7240e539bbbb80af1e0b88d4904e9cffda3194c7ae174acbf5ffe1"}},{"ruleId":"D1","level":"warning","message":{"text":"_MornyeArtistSurfaceState.build (cyclomatic 26): _MornyeArtistSurfaceState.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/widgets/mornye_artist_header.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bdc2c787af6377225d0a9d6ee9666a4a5a94b8288eb6c2e886d0abfffd882d"}},{"ruleId":"D1","level":"warning","message":{"text":"_TimedLyricSweepPainter.paint (cyclomatic 26): _TimedLyricSweepPainter.paint has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/player_lyrics_word_sweep.dart"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a64be8f41a04f3ec81547ce30e95a988bbf9a1def574b86970331809a1a3fd2"}},{"ruleId":"D1","level":"warning","message":{"text":"_PlaylistPickerSheetContentState.build (cyclomatic 26): _PlaylistPickerSheetContentState.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/widgets/playlist_picker_sheet.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"090e9e6d273b5792355e1fc2e5d7cf34fd6980b20005269609f16dcc4cf2af1f"}},{"ruleId":"D1","level":"warning","message":{"text":"_TrackOptionsSheet.build (cyclomatic 26): _TrackOptionsSheet.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/widgets/track_collection_quick_actions.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b022e2a969a39f523c432350ae86d3a89a7432d826f3c39fd4c9dc1a3b23f0a"}},{"ruleId":"D1","level":"warning","message":{"text":"UsbDirectPlayback.command (cyclomatic 26): UsbDirectPlayback.command has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/UsbDirectPlayback.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"67aed9231bd190cd4447ddc4ab0cf256737c675d2af9dba3667d244bc134364d"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::reenrich_file (cyclomatic 26): Backend::reenrich_file has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/reenrich.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"66992fa631e49ca2e1cb2fa0d5619cdaacc5e437324a086f7aaa7866b64821da"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::resolve_reenrich_request (cyclomatic 26): Backend::resolve_reenrich_request has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/reenrich.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"be29fddfdd34bb5b25a2d35aff38fa8bb5cdf88f79dad860f79f1541be1fc315"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::file_host::call (cyclomatic 26): mornye_extensions::file_host::call has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/file_host.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b5248d74d8a46d2d193449c8903a7d2075f6ed2751c3f2ee3c57d8df8eb7f8"}},{"ruleId":"D1","level":"warning","message":{"text":"Inner::search (cyclomatic 26): Inner::search has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/providers/src/lyrics/service.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"08adb3e3d4860037466cc753a1fa137d33574d1ea0e4bf90167484178042a218"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).exported (cyclomatic 26): (anonymous).exported 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":"rust_backend/crates/extensions/src/provider.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbc7e0852cf17c46e1edeb94da5207f81ae5fd41ef32820348ff01e08cc70d7"}},{"ruleId":"D1","level":"warning","message":{"text":"ExploreNotifier._restoreFromCache (cyclomatic 25): ExploreNotifier._restoreFromCache 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/providers/explore_provider.dart"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a405c7586adc2a1989aeaf80fcfd556bb78ceb6855f503ad3f9719a7b4acf52"}},{"ruleId":"D1","level":"warning","message":{"text":"_HomeTabState._performSearch (cyclomatic 25): _HomeTabState._performSearch 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/screens/home_tab.dart"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41a717742a3f0755389804a3c2de641c5959d6a58114ed4dc90701aa275a68c"}},{"ruleId":"D1","level":"warning","message":{"text":"_MainShellState._handleBackPress (cyclomatic 25): _MainShellState._handleBackPress 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/screens/main_shell.dart"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f22e8d4b65e869744dc65b5812e62c21b1440b284905fe5f7878b2c0dae24c2"}},{"ruleId":"D1","level":"warning","message":{"text":"_FilesSettingsPageState.build (cyclomatic 25): _FilesSettingsPageState.build 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/screens/settings/files_settings_page.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"32820c5bfec310f95287cf8028eed7d3b76947b2473885d8cb8ca149ed69bf73"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibraryHeroCard.build (cyclomatic 25): _LibraryHeroCard.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/screens/settings/library_settings_page_widgets.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2de9b32d86a56bdce5f6651abe0238eddaebdf2840efd4fe85c9cd0df0de783"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoplayPreferenceModel._features (cyclomatic 25): AutoplayPreferenceModel._features 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/services/autoplay_personalization.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"440bb7724cdb0ec09731f5e4bc29f7de949725b8b06db7f467df9fc1582fd6d9"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadContainerFinalizer.finalize (cyclomatic 25): DownloadContainerFinalizer.finalize 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/services/download_container_finalizer.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8d5c4f05a9c041eebf6d4ef65ddd45a18980f9c8d606ccf22157c89ed17dd0"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadedEmbeddedCoverResolver._extractCover (cyclomatic 25): DownloadedEmbeddedCoverResolver._extractCover 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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"398e498dd276bbd9eafdce215c894d3c3806c96f81fbb21fd3884c6846f13b36"}},{"ruleId":"D1","level":"warning","message":{"text":"ExclusiveOutputDeck._switchTo (cyclomatic 25): ExclusiveOutputDeck._switchTo 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/services/exclusive_output_deck.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d91e61be856be1c895fe42a3ef3dbb78afddb221f37e6423388fd4b8b64fa13"}},{"ruleId":"D1","level":"warning","message":{"text":"LibrarySchema.rebaseContainerPaths (cyclomatic 25): LibrarySchema.rebaseContainerPaths 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/services/library_schema.dart"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ccccb4ffedb2e8482b0bde6d01d5b9de1661bad87a4baff418175eb5780fc9"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkDesktopOps.runCommand (cyclomatic 25): LinkDesktopOps.runCommand 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/services/link/desktop/link_desktop_ops.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b996d8bb1cfe5030f2fba2ecbd5954dfbcdfa32231c09ed8e0d7a5673a7732"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkWebCovers._run (cyclomatic 25): LinkWebCovers._run 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/services/link/desktop/link_web_covers.dart"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4270a0246d4c1613e5bfefc7831312f262f73f923eeb351052fba2e7da6af2b"}},{"ruleId":"D1","level":"warning","message":{"text":"_LinkSyncHandlers.star (cyclomatic 25): _LinkSyncHandlers.star 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/services/link/sync/link_sync_handlers.dart"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd0b937e2818da095993a7c50401255f8efaf0f8640738dc991fb87d3fadf0b"}},{"ruleId":"D1","level":"warning","message":{"text":"MotionArtworkProxy._handle (cyclomatic 25): MotionArtworkProxy._handle 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/services/motion_artwork_proxy.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9819454fe68ad76982f26ccc76c5fa357163ade59734252ba651da764f14f5f"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicPlayerHandler.applySettings (cyclomatic 25): MusicPlayerHandler.applySettings has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_service.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"536aeb65b1613a672d01010c2d16f859e5fb6250cba78442fe6ba678ee430adf"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicPlayerHandler._playInternal (cyclomatic 25): MusicPlayerHandler._playInternal 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/services/music_player_service.dart"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0634737138461760d3624bace229f85ba4528bc658dbac2199ee986a9806caa"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicPlayerHandler.onSourceMetadataChanged (cyclomatic 25): MusicPlayerHandler.onSourceMetadataChanged 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/services/music_player_service.dart"},"region":{"startLine":2554}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccfb9abba0621d726a7504878bfd0aa905106deb789b7fdd0aff160f5dc9d00"}},{"ruleId":"D1","level":"warning","message":{"text":"SubsonicClient.cachedCover (cyclomatic 25): SubsonicClient.cachedCover 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/services/network_storage_subsonic.dart"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c856d308972ed74f2fc4daf0bb3f5dcbead76a1f26ae99e8da944cd8969f5df"}},{"ruleId":"D1","level":"warning","message":{"text":"_AudioFacts._processing (cyclomatic 25): _AudioFacts._processing 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/widgets/audio_info_sheet.dart"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"81577a7206eb6b95f7c7748b99c801826d774f829c133f46564eec5dad963019"}},{"ruleId":"D1","level":"warning","message":{"text":"_DesktopShortcutsState._run (cyclomatic 25): _DesktopShortcutsState._run has cyclomatic complexity 25 (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/widgets/desktop/desktop_shortcuts.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6cf77f21ed02d6a863fe7262e58a1af63e3e057e00a516fa14ac0df1d2cf4a"}},{"ruleId":"D1","level":"warning","message":{"text":"_MornyeSelectionPillState.build (cyclomatic 25): _MornyeSelectionPillState.build 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/widgets/mornye_selection_pill.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d370cad0331e53f44c7bb77bf3e5e02219036c488e7625cd38d70d307fe693f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Request::select (cyclomatic 25): Request::select 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. This is NOT this file\u0027s highest cyclomatic complexity: Request::update (cyclomatic 56) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/metadata/reenrich.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f802dd54d3eede31f8bb6eef8090e7ee4b4b6b124a39370771b593ab8c7e3d17"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::write::id3::edit_header (cyclomatic 25): mornye_core::tags::write::id3::edit_header 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":"rust_backend/crates/core/src/tags/write/id3.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8403b4f6fc11f4c5c83c91817a6f69b62c2aa9cbe974b7082462484a0478e8"}},{"ruleId":"D1","level":"warning","message":{"text":"CookieJar::store (cyclomatic 25): CookieJar::store 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":"rust_backend/crates/network/src/cookies.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a6fd915362e2f43b235b489c44f3eba0a07df3cd9d7c1bcac374234bda8efc"}},{"ruleId":"D1","level":"warning","message":{"text":"_AlbumScreenState._buildAppBar (cyclomatic 24): _AlbumScreenState._buildAppBar 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/screens/album_screen.dart"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"a806eb5db2969ef79cd372723074412f0aae3aabcd328d7d7a53a320472fc348"}},{"ruleId":"D1","level":"warning","message":{"text":"_DownloadSettingsPageState.build (cyclomatic 24): _DownloadSettingsPageState.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/screens/settings/download_settings_page.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6b623bf23c2e1943df1735c1343518b2be11055cc7268afe813c846d256b45"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkMirroredPlayback._resolve (cyclomatic 24): LinkMirroredPlayback._resolve 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/services/link/link_mirrored_playback.dart"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02b799b652a677f564f9c37176a9371cdb7033a502281486510c67325479a48"}},{"ruleId":"D1","level":"warning","message":{"text":"_MusicAutoplay._fill (cyclomatic 24): _MusicAutoplay._fill has cyclomatic complexity 24 (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/services/music_player_autoplay.dart"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"303bf429309902d33a72f16bf05a3b9a02465de14470c4f7b1a53aa5547600e5"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicPlayerHandler._listenToPlayer (cyclomatic 24): MusicPlayerHandler._listenToPlayer has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_service.dart"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c40ef5de0b0b2a47f91a3e799441afe48ede6d561b2647a60abe36ba0e1882"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkStorageService.list (cyclomatic 24): NetworkStorageService.list 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/services/network_storage_service.dart"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"925a2e254e8a1996a268bc3675a725a1ac01f5b3f8b070ce9179886b4a10da16"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibraryDirectoryViewState._buildFolder (cyclomatic 24): _LibraryDirectoryViewState._buildFolder 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/widgets/library_directory_view.dart"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"1708419885aece9f86b2198ed346b6fd9dba741360ce4ca0307c892bcbccce64"}},{"ruleId":"D1","level":"warning","message":{"text":"_LyricsOptionsButtonState._showMenu (cyclomatic 24): _LyricsOptionsButtonState._showMenu 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/widgets/lyrics_options_button.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfb2a4c5dca01acb8a90c04a981f5fd83c07b6b1d6eb83ad12f1fdfa2e1bd88"}},{"ruleId":"D1","level":"warning","message":{"text":"_RenderPinnedSectionList.performLayout (cyclomatic 24): _RenderPinnedSectionList.performLayout 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/widgets/pinned_section_sliver_list.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1927cd9ebe2e68da3077b6f8c8084a817087ce194fec7ee597593d8c36b259"}},{"ruleId":"D1","level":"warning","message":{"text":"_TvNavigationState._handleKey (cyclomatic 24): _TvNavigationState._handleKey has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/tv_navigation.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"810623598fabef86bcf3542785bda64c49110147f6628f3af3ade11935bbc080"}},{"ruleId":"D1","level":"warning","message":{"text":"_UpdateDialogState.build (cyclomatic 24): _UpdateDialogState.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/widgets/update_dialog.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb086c21558718a45fea6d993aabd4d0539c4c8be1df77dfcd5addfadd8e0a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::native_library::import (cyclomatic 24): mornye_mobile::native_library::import 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":"rust_backend/crates/mobile/src/native_library.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"613e30fcfe82f9b372d9d881d3e5004aa447201de949319718b598e90ce400ff"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::native_library::path_keys::build (cyclomatic 24): mornye_mobile::native_library::path_keys::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":"rust_backend/crates/mobile/src/native_library/path_keys.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae599b25fad4f1dc48a9e2523b95ecccb74606521f57061551dba24f67f07ee3"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::native_lyrics::lrc::parse_lrc (cyclomatic 24): mornye_mobile::native_lyrics::lrc::parse_lrc 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":"rust_backend/crates/mobile/src/native_lyrics/lrc.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9726d73c5cf4aab7c8e7ebe16c2bacfef5d14773e0d29c85cff9942858a59229"}},{"ruleId":"D1","level":"warning","message":{"text":"ResolverHttp::execute (cyclomatic 24): ResolverHttp::execute 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":"rust_backend/crates/providers/src/resolver/http.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4674b692abf0bb39c7d50a1f7bae5b51fe7b66400c4e4434ca916c42af9a328c"}},{"ruleId":"D1","level":"warning","message":{"text":"_HomeSections.build (cyclomatic 23): _HomeSections.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/screens/home_tab_intro.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7bb0003681de34bd373f6d01bb8cabe7da2d437efdc820954274af9923086b"}},{"ruleId":"D1","level":"warning","message":{"text":"_CollectionTrackTile.build (cyclomatic 23): _CollectionTrackTile.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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"945e2fe76b48d50755036a33f0a872359968ca32445915437cbfc498f5a10257"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoMixPlan.create (cyclomatic 23): AutoMixPlan.create 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/services/automix_analysis.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e30b81c6f9ccce7d3c9765ab2297eda0fe188579aa13a55552f23f01f480a7f"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoplayPersonalization.finish (cyclomatic 23): AutoplayPersonalization.finish 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/services/autoplay_personalization.dart"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"91441d76767dc4806b3e5fca6461309243b58bbf61e7862d44f572a851c970bd"}},{"ruleId":"D1","level":"warning","message":{"text":"CsvImportService._bestCandidate (cyclomatic 23): CsvImportService._bestCandidate 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/services/csv_import_service.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12b8382bcc8f59497eaf7a355eac8c424fd3d802a5d556c0a983052006d2860"}},{"ruleId":"D1","level":"warning","message":{"text":"CueSplitLibraryService.publish (cyclomatic 23): CueSplitLibraryService.publish has cyclomatic complexity 23 (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/services/cue_split_library_service.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4148f928722b3a435cb6cad17f76750a49049940b05ebb8c2168a1244ce659d"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryDatabase.updateAudioMetadata (cyclomatic 23): LibraryDatabase.updateAudioMetadata 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/services/library_database.dart"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3e84bddfd84fc48b5435b354088275e138eadf1373f927f1ebbe18977a826a"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataPersistenceService._saveLocal (cyclomatic 23): MetadataPersistenceService._saveLocal 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/services/metadata_persistence_service.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5541ccce5ee17bdc491a16df947be3a6c78d940d28733436b8a06fc7ddbd2fc2"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayableMedia.toMediaItem (cyclomatic 23): PlayableMedia.toMediaItem 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/services/playable_media.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1db20633020876b5813c7c63a6bd020c5738c4d3f8e3d19328b14cceb4c197"}},{"ruleId":"D1","level":"warning","message":{"text":"SongAnalysis._sweepLibrary (cyclomatic 23): SongAnalysis._sweepLibrary 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/services/song_analysis.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"462e65737cf30d0362d9e71b1b28e040cac562efa0c1b6b477015fd8efc19b70"}},{"ruleId":"D1","level":"warning","message":{"text":"SongFeatureAnalyzer.analyze (cyclomatic 23): SongFeatureAnalyzer.analyze 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/services/song_feature_analyzer.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67625a6eac3b74ff511a3a212a140b3ba986357492edbc99f1b171474f152af"}},{"ruleId":"D1","level":"warning","message":{"text":"_HiResCheckCardState._buildResult (cyclomatic 23): _HiResCheckCardState._buildResult 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/widgets/hires_check_card.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1dd267d8f8906a3d9f7ac6f113684fe6097c3d963e53161db636b044482216"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibrarySearchResultsState._row (cyclomatic 23): _LibrarySearchResultsState._row 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/widgets/library_search_results.dart"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b575e2cc9530edc6aeb8ddd38f4554e00be25b787340f1b0034ffab5f0813c5d"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeHistoryStore.buildPathMatchKeys (cyclomatic 23): NativeHistoryStore.buildPathMatchKeys 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeHistoryStore.kt"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c125595c9a351180d7d15ee5f742a75c483d16102819da11e6047accddaca32"}},{"ruleId":"D1","level":"warning","message":{"text":"CastService::call (cyclomatic 23): CastService::call 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":"rust_backend/crates/cast/src/service.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"20169462b724a1309cde8675d30e29892061f881d076cf69bce9f1f1ce54e1aa"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::native_audio_analysis::analyze_automix_pcm (cyclomatic 23): mornye_core::native_audio_analysis::analyze_automix_pcm 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":"rust_backend/crates/core/src/native_audio_analysis.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"399fe108c24e73c37340ada452493b0a9e089eb8d7e5ffd8fae29b035c790a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::mp4::read (cyclomatic 23): mornye_core::tags::mp4::read 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":"rust_backend/crates/core/src/tags/mp4.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb98d79e94289c3c8687501786105da14179ff8ca263ce92672fa6fde621f481"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::backend::health::classify_body (cyclomatic 23): mornye_extensions::backend::health::classify_body 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":"rust_backend/crates/extensions/src/backend/health.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"088f745b05239b0723322013b41fa7f418e43df7ef8073c96e9daa611ee6f96d"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::native_listing::execute (cyclomatic 23): mornye_mobile::native_listing::execute 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":"rust_backend/crates/mobile/src/native_listing.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb852dbb8862bc3e33066c2e0a28de851dc1c7e85a3d0c173d31365a208766d"}},{"ruleId":"D1","level":"warning","message":{"text":"UrlParts::parse (cyclomatic 23): UrlParts::parse 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":"rust_backend/crates/network/src/url.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"674b308c2cae78e13b5bdc1a1681fa27e9886ba6a96e1446c0000908fed5acd0"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadQueueNotifier._buildDownloadRequestPayload (cyclomatic 22): DownloadQueueNotifier._buildDownloadRequestPayload 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/providers/download_queue_provider.dart"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"379fb3cc1f439c5c6d8319b23614be5eb9df6eae847ce69d22619793341724ed"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibraryTracksFolderScreenState._buildSelectionBottomBar (cyclomatic 22): _LibraryTracksFolderScreenState._buildSelectionBottomBar 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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"fced47629f8d8ab22efbecf81b6c7a12da28982aedb1f09e5c8b5e97a0456018"}},{"ruleId":"D1","level":"warning","message":{"text":"_MainShellState.build (cyclomatic 22): _MainShellState.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/screens/main_shell.dart"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4da0fecf1aa37291bd27f397d4483ca79761c220b12f1ac60c411f9f6f037ba"}},{"ruleId":"D1","level":"warning","message":{"text":"_ExtensionItem.build (cyclomatic 22): _ExtensionItem.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/screens/repo_tab.dart"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"f363017784577363243a215a46f8dd2e4277fdbd620ae726ae4effe72daecce1"}},{"ruleId":"D1","level":"warning","message":{"text":"CoverDownloadService.saveRemoteCover (cyclomatic 22): CoverDownloadService.saveRemoteCover 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/services/cover_download_service.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c180408f079df3c0a8e2c529a6d48eb4db58e4def324b21a2030d4fc954a5c6"}},{"ruleId":"D1","level":"warning","message":{"text":"DiscordPresenceService._authenticate (cyclomatic 22): DiscordPresenceService._authenticate 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/services/discord_presence_service.dart"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efde059cbe35087df1c5d7172a0923087e0c22a1deda45e975547b4bc0bd321"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkClientController._updateDiscovery (cyclomatic 22): LinkClientController._updateDiscovery has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/client/link_client_controller.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1d53f26f422474a00b3385d007c44c5b5b4104791f4f53fd6d2faede71bffb"}},{"ruleId":"D1","level":"warning","message":{"text":"MprisPlayerObject.handleMethodCall (cyclomatic 22): MprisPlayerObject.handleMethodCall 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/services/media_session_mpris.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8423e1537a618a150079bd096fce08f8e2851e84d36157c54c956b8c1d0fd7a"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicHapticsAnalyzer.analyze (cyclomatic 22): MusicHapticsAnalyzer.analyze 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/services/music_haptics.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"66070b2ea0c05bc63f125791d42e69c0ddf4c14f4090dac3bdd41e749e6e7447"}},{"ruleId":"D1","level":"warning","message":{"text":"AlbumDetailHeader._buildAppBar (cyclomatic 22): AlbumDetailHeader._buildAppBar 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/widgets/album_detail_header.dart"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a31c141cb9c626dcdbfc6e63745642caac1bb1719df4f715a204faa57adac4"}},{"ruleId":"D1","level":"warning","message":{"text":"_TransferSongRow.build (cyclomatic 22): _TransferSongRow.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/widgets/link/link_transfer_tile.dart"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"14431bf62d7e130e5fe854da9972021475da907ff513fb70bd1c8cd9aa92666f"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayerWidgetProvider.render (cyclomatic 22): PlayerWidgetProvider.render 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":"android/app/src/main/kotlin/com/zarz/mornye/PlayerWidgetProvider.kt"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba49a54316024a303980616cdc0becaf040bc167583227d0dfd501bc1016b288"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkNowPlayingController.handle (cyclomatic 22): LinkNowPlayingController.handle 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":"ios/Runner/LinkNowPlayingBridge.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab874146a3707882319710be4afe07af4dcea256ad20be93a71b0b2ac0f9194b"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::native_palette::wsmeans (cyclomatic 22): mornye_core::native_palette::wsmeans has cyclomatic complexity 22 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/native_palette.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc266703a9ca13950c20587a107cc98783e627069e17326968e2445984ce3e97"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::write::ogg::rewrite (cyclomatic 22): mornye_core::tags::write::ogg::rewrite 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":"rust_backend/crates/core/src/tags/write/ogg.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38a56895434dc51897d1b208fb04dc1c2478828c9ab987a6ea29681638ff92e"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionSetting::deserialize (cyclomatic 22): ExtensionSetting::deserialize 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fc85ef37fd18c415fa251c627e7196aaabe60d63a95f147a5e6deb04bfc2a7"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::download::segments::fetch (cyclomatic 22): mornye_extensions::download::segments::fetch 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":"rust_backend/crates/extensions/src/download/segments.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b292da0e6e66f2558156565a3a74e09b55f3a9cfdc4f95e3141dbfe9f0bedf91"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::configure (cyclomatic 22): Session::configure 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":"rust_backend/crates/mobile/src/usb_audio/transport.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"624c7dc263a3c4fe863dfd01a015dcca7ca870071f9206e81c9d0bd1a1467696"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::run (cyclomatic 22): Session::run 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":"rust_backend/crates/mobile/src/usb_audio/transport.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77faa576b74de4aef20d0abeac9566f478d45c25d4486da5b08e7652962a80d"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayerMetadataController.searchOnline (cyclomatic 21): PlayerMetadataController.searchOnline 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/controllers/player_metadata_controller.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8324f3e34c20e5098bcb8e42a65b8233cd85da48ce919493dc0806d22aeab6a7"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadQueueNotifier._startQueueRestore (cyclomatic 21): DownloadQueueNotifier._startQueueRestore 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/providers/download_queue_provider.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4339aadd6d0cd00b249b214c59421ec9dcfd6093c03e99426e0c621bc2965343"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibrarySourceSettingsItem.build (cyclomatic 21): _LibrarySourceSettingsItem.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/screens/settings/library_settings_page_widgets.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d777f806c6cbac5ebbd0c5acef28b07d7b3d238859bb1377e2054a3ccc000df"}},{"ruleId":"D1","level":"warning","message":{"text":"_LogScreenState.build (cyclomatic 21): _LogScreenState.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/screens/settings/log_screen.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fa2808505527e71cef843f39263f3b18368e8674a33552983aa6c279055d32"}},{"ruleId":"D1","level":"warning","message":{"text":"_CategoryRow.build (cyclomatic 21): _CategoryRow.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/screens/settings/settings_tab.dart"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"779af8048839b6ad404a3d9cd2bed4251e31ca1078d7018a1f0ab421a0976059"}},{"ruleId":"D1","level":"warning","message":{"text":"_SetupScreenState._selectDirectory (cyclomatic 21): _SetupScreenState._selectDirectory 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/screens/setup_screen.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb28f12378f6d18f70484128a9e34e539fed5e19b67b414a56f1af32cbe0a58"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentUriPlaybackCache.resolve (cyclomatic 21): ContentUriPlaybackCache.resolve 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/services/content_uri_playback_cache.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d12da3d62238d221205a038f333f6aefd972af3ca32b7f9a7b98c2fc09fab9"}},{"ruleId":"D1","level":"warning","message":{"text":"LastfmService.finishConnection (cyclomatic 21): LastfmService.finishConnection 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/services/lastfm/lastfm_service.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc23be3a26815dff5e46ba92c666064cc7f969dd2110f8b7bc3b5b46d226037"}},{"ruleId":"D1","level":"warning","message":{"text":"LibrarySchema.upgrade (cyclomatic 21): LibrarySchema.upgrade 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/services/library_schema.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f622739d5a6df3d875bd8ea704550d854ae9d8a2c3b0524cdd8974271ebba5"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkPairingClient.pair (cyclomatic 21): LinkPairingClient.pair 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/services/link/client/link_client_pairing.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b56c0686fa89900b241e8d574683ed2e840982c771205c0dd82557f7c3d0c96"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkPhoneCatalogs._page (cyclomatic 21): LinkPhoneCatalogs._page has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_phone_catalogs.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd6c2c859010a19d4f56f7f3ef893730aa7fc2f92477f39eab0cd4e8481c137"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedLyricsTranslation.fromJson (cyclomatic 21): SharedLyricsTranslation.fromJson has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/lyrics_translation_sharing.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b16ed563c4b15c43652843ae3d3465e71f98d752ae97574897793419ed1b1e"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioplayersPlaybackDeck.setFileSource (cyclomatic 21): AudioplayersPlaybackDeck.setFileSource 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/services/music_playback_deck.dart"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a07e981aee807d570ee5f4bfb89678423ee56a327e00e90691c5e18e433f97b"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkStorageService._openRead (cyclomatic 21): NetworkStorageService._openRead 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/services/network_storage_service.dart"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78b205b568237a617e33c61b88cc64523cfa0896bef5c3f88f6e13ad3b5e927"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkStorageService._serve (cyclomatic 21): NetworkStorageService._serve has cyclomatic complexity 21 (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/services/network_storage_service.dart"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02930779069120f107d1d2750bf5c25918b031bdfe016ae61b2f57d275d74c4"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplayGainService._writeLocalTags (cyclomatic 21): ReplayGainService._writeLocalTags has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/replaygain_service.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3cc75b9cb0c694dfe001fe7bcabeb375480a252a3ae538404018100e66992b"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopInspector.build (cyclomatic 21): DesktopInspector.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/widgets/desktop/desktop_inspector.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b49bdb7310f8055ba1e1d8ead0aaa1bcd236c59364c5e28fb4672f87b36e5c"}},{"ruleId":"D1","level":"warning","message":{"text":"_DesktopListScopeState._handleKey (cyclomatic 21): _DesktopListScopeState._handleKey has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/desktop/desktop_selection.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f411a8a35dd1b4950ace373f48602d8eb354c803489e59421e5292bb7edd9b2"}},{"ruleId":"D1","level":"warning","message":{"text":"_MornyeLandscapePlayerState.build (cyclomatic 21): _MornyeLandscapePlayerState.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/widgets/mornye_landscape_player.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f828e47d4b87f2df34ba151e656cf09ee369fba023f670455e07f35b465ff7e"}},{"ruleId":"D1","level":"warning","message":{"text":"MornyePlayerQueue.build (cyclomatic 21): MornyePlayerQueue.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/widgets/mornye_player_queue.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2370587a4fbca799024e12c19eb139aeb129b0a8812428017ab7164eea20195e"}},{"ruleId":"D1","level":"warning","message":{"text":"_PlaybackTimeBuilderState._sync (cyclomatic 21): _PlaybackTimeBuilderState._sync has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/playback_time_builder.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92c5e2c3a2e16ef82fad37e568d351e70f74b3a391befa60bf07bab4d702565"}},{"ruleId":"D1","level":"warning","message":{"text":"_SyncedLyricsViewState._scheduleNextLine (cyclomatic 21): _SyncedLyricsViewState._scheduleNextLine has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/player_lyrics.dart"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"54294eb3060ec5dc15b72eec24b1c7ad93f0acd550cf0d4e1c4155fb997ae02e"}},{"ruleId":"D1","level":"warning","message":{"text":"CastOutputPlugin.handle (cyclomatic 21): CastOutputPlugin.handle has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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":"android/app/src/main/kotlin/com/zarz/mornye/CastOutputPlugin.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69953310d45b9a284d48252863520eba9a3d630c30100c3eed935477684d0d3"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadQueueWidgetProvider.render (cyclomatic 21): DownloadQueueWidgetProvider.render 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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadQueueWidgetProvider.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba6c43f83773fea716b46d98a44e6b822d2b97e26373cbf868a68797fa8e759"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeFinalizerContainerKt.finalizeAutoConversion (cyclomatic 21): NativeFinalizerContainerKt.finalizeAutoConversion 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerContainer.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"336a79d6c618a318eba7234a577af02cb0da40057387e6e876ef694f1b7c2404"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::resolver::titles_match (cyclomatic 21): mornye_core::resolver::titles_match has cyclomatic complexity 21 (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":"rust_backend/crates/core/src/resolver.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d818ee5577448299671d698dc8060d9c041823b4dff036b6b5c5170d1fc4bd"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionAuth::call (cyclomatic 21): ExtensionAuth::call 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":"rust_backend/crates/extensions/src/auth/client.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c1f852048970563351654537d41aaab0905b50822f8e93b21d56ffafb89d95"}},{"ruleId":"D1","level":"warning","message":{"text":"Health::run_check (cyclomatic 21): Health::run_check 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":"rust_backend/crates/extensions/src/backend/health.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be962856b70470594bfd982b81c0aa8012800fe4fa8dc89e038faaf2218a08f"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::native_backup::archive::read (cyclomatic 21): mornye_mobile::native_backup::archive::read has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_backup/archive.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34d9de355acfc80a521e8af3bc90eef8e88fcce151d38da9ca027859b8fc2a7"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::native_lyrics::ttml::parse_ttml (cyclomatic 21): mornye_mobile::native_lyrics::ttml::parse_ttml 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":"rust_backend/crates/mobile/src/native_lyrics/ttml.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9228e889a1632c668b415a60ce6b406208101eacab4d7b859db253afa3828e15"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).invokeManaged (cyclomatic 21): (anonymous).invokeManaged has cyclomatic complexity 21 (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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b7cff65a45b36209c0959ba4fb424da2a5bee5ba9325d68144fc5ed002722e"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadQueueLookup.withoutIndex (cyclomatic 20): DownloadQueueLookup.withoutIndex 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/providers/download_queue_state.dart"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdf25e73273389871662141453580466698c708e6154bd994107aada753d688"}},{"ruleId":"D1","level":"warning","message":{"text":"PlaybackController.playTrackList (cyclomatic 20): PlaybackController.playTrackList 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/providers/playback_provider.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7cc2ceb73b03ecf73cf15a5d0c96a547f7c749fee899fc0eed449d79aa1a9a"}},{"ruleId":"D1","level":"warning","message":{"text":"TrackNotifier.search (cyclomatic 20): TrackNotifier.search has cyclomatic complexity 20 (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/providers/track_provider.dart"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff843d9dc0961fe7ebfe2dc9e52ede9133ca6adffb58a26f8681525fbb9cda95"}},{"ruleId":"D1","level":"warning","message":{"text":"_DownloadedAlbumScreenState._buildAppBar (cyclomatic 20): _DownloadedAlbumScreenState._buildAppBar 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/screens/downloaded_album_screen.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"170363080fc70f34f60591b43e83874f9c9e8bbc45b341f9fc9251f7a9656cc6"}},{"ruleId":"D1","level":"warning","message":{"text":"_LogSummaryCard._analyzeLogs (cyclomatic 20): _LogSummaryCard._analyzeLogs 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/screens/settings/log_screen_widgets.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef71e5dfbaeaa7bec7957e350c0e1958473491820bfa732d1ecddb40c5bc02e"}},{"ruleId":"D1","level":"warning","message":{"text":"_SettingsTabState._buildCategoryList (cyclomatic 20): _SettingsTabState._buildCategoryList 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/screens/settings/settings_tab.dart"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17a1cda3de1b6413115fc52fd046691a71cf92b9fae14f2c313d0f73f98b61c"}},{"ruleId":"D1","level":"warning","message":{"text":"_SetupScreenState._requestStoragePermission (cyclomatic 20): _SetupScreenState._requestStoragePermission 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/screens/setup_screen.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae89e149e81ee6eb67b7c11b132ff2baae1a98a2239442fdbb2451f0fc7a05e"}},{"ruleId":"D1","level":"warning","message":{"text":"FFmpegDecryption._decryptMovKeyFile (cyclomatic 20): FFmpegDecryption._decryptMovKeyFile 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/services/ffmpeg_decryption.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"df53cc7bbdaf83cc88d6fd0788c4b6171ccef431e70885a2abb5a38c9412ed6b"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkDesktopHost.exportCatalog (cyclomatic 20): LinkDesktopHost.exportCatalog 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/services/link/desktop/link_desktop_host.dart"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb86c2c4150a08bbd6546abdddd0285ac8185371532658eb6822dd526336d78"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeLinkPlayerPort.snapshot (cyclomatic 20): RuntimeLinkPlayerPort.snapshot 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/services/link/desktop/link_player.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc132bfb1686d8b6897350e0514c04a90c1cac7707aebfdf915696044555b08"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkSyncRunner._syncOnce (cyclomatic 20): LinkSyncRunner._syncOnce 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/services/link/sync/link_sync_runner.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cd96535d81aae9d497f4eede5450e0887ddd1f4aaa4bf5502062748e2b6670"}},{"ruleId":"D1","level":"warning","message":{"text":"SubsonicClient.list (cyclomatic 20): SubsonicClient.list 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/services/network_storage_subsonic.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ef8cb98106effb2fe84a1d5af6515e5241648dc4ff9c6aa4f6f6a24a1d6000"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricPronunciationLayout.measure (cyclomatic 20): LyricPronunciationLayout.measure 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/widgets/aligned_lyric_pronunciation.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b345e41de9489367acb3b2ab04823a7ebd9faef43ab2f68f584ee5a8805ed9"}},{"ruleId":"D1","level":"warning","message":{"text":"_AudioOutputButtonState._showPicker (cyclomatic 20): _AudioOutputButtonState._showPicker 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/widgets/audio_output_button.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64fe2978a0109ef3aed7deb3aa565e0b29f5ec2f5f9a9f9b58fb3c539afb9e5"}},{"ruleId":"D1","level":"warning","message":{"text":"_BatchConvertSheetState.build (cyclomatic 20): _BatchConvertSheetState.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/widgets/batch_convert_sheet.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"93147857b7c9e2e5a2a98191e026cbb87f1152855ae4793be5fe4aed378e1fa9"}},{"ruleId":"D1","level":"warning","message":{"text":"MaterialPlayerLayout.build (cyclomatic 20): MaterialPlayerLayout.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/widgets/material_player_layout.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c02a5def7c7d1f5de1f6131d76b64de913f10c26585f5d0c90fa1c34c2cf0be"}},{"ruleId":"D1","level":"warning","message":{"text":"_MornyePlaybackButtonState.build (cyclomatic 20): _MornyePlaybackButtonState.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/widgets/mornye_playback_button.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8c38451a4a0e3654bc969d9e0e812a8164c7df4c6beb12e01e52a19f53539e"}},{"ruleId":"D1","level":"warning","message":{"text":"_PlaybackSeekSliderState.build (cyclomatic 20): _PlaybackSeekSliderState.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/widgets/playback_seek_slider.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4927cfe342f1b7351727602d1e860ec9b048b686696480680eaff99e3806f515"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadServiceSnapshotKt.writeNativeWorkerSnapshot (cyclomatic 20): DownloadServiceSnapshotKt.writeNativeWorkerSnapshot 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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceSnapshot.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1a42b12fa61ce96b60335fbf0d2cb0ae9760462ab89ffb0aa640b8c8d180ec"}},{"ruleId":"D1","level":"warning","message":{"text":"SafTreeListingKt.querySafChildrenOrThrow (cyclomatic 20): SafTreeListingKt.querySafChildrenOrThrow 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":"android/app/src/main/kotlin/com/zarz/mornye/SafTreeListing.kt"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c302b331c26790d01176eba0851a802b8204a79c647f7a33580fd130140afe62"}},{"ruleId":"D1","level":"warning","message":{"text":"UsbBitPerfectPlugin.onMethodCall (cyclomatic 20): UsbBitPerfectPlugin.onMethodCall 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":"android/app/src/main/kotlin/com/zarz/mornye/UsbBitPerfectPlugin.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e126731a41f99bbe516bccd5fbf64530f9665aa973273336c05e542ca21ce178"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadProgressSubscription.poll (cyclomatic 20): DownloadProgressSubscription.poll has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/DownloadProgressSubscription.swift"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dbe690ba917e7e11e7f560c926ae1b34d5dd4fb63f6c066e419acd95ecf90d"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::metadata::share::select (cyclomatic 20): mornye_core::metadata::share::select 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":"rust_backend/crates/core/src/metadata/share.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d9cf831d555ba62a8d23456222996750b7887c2e5cc8ceaf9c8ce39f0f0837"}},{"ruleId":"D1","level":"warning","message":{"text":"FilePath::open_native_read (cyclomatic 20): FilePath::open_native_read 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":"rust_backend/crates/extensions/src/files.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e964e98abfd6f5a0fa967fe2428fe42df9233e94b1f11625b0b560f79cc7a2f"}},{"ruleId":"D1","level":"warning","message":{"text":"SignedSession::deserialize (cyclomatic 20): SignedSession::deserialize 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0314cb8a9110152ba5c0daf4f003f0b5ed558b0a50c2ef7950aec03dcf5679aa"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_link::subsonic::forward::call (cyclomatic 20): mornye_link::subsonic::forward::call 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":"rust_backend/crates/link/src/subsonic/forward.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4f564f8128bbbb558397b17a823c620a058f141c420837756f36162aad2de9"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::native_directory_stats::scan (cyclomatic 20): mornye_mobile::native_directory_stats::scan 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":"rust_backend/crates/mobile/src/native_directory_stats.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b55eeda92dc014cc5648646ad4862fa350cfce0230fd5fed59f6e4c6e4f7ae"}},{"ruleId":"D1","level":"warning","message":{"text":"ArtistConcert.parseList (cyclomatic 19): ArtistConcert.parseList 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/models/artist_concert.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0381f614f262021004e90913409dbeee168aca78b91e5253d995b3ae4d4cc61b"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadHistoryNotifier.updateAudioMetadataForItem (cyclomatic 19): DownloadHistoryNotifier.updateAudioMetadataForItem has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_history_provider.dart"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"c791c8ce0d40aae161276b56163c71d9a37210902047f17cbd5ae91a15ac380c"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadProgressSample.applyTo (cyclomatic 19): DownloadProgressSample.applyTo 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/providers/download_progress.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f95743d864bec214e36588e4cd82b10f39b13095ba9fb3d05d86399612656b9"}},{"ruleId":"D1","level":"warning","message":{"text":"_SearchProviderDropdown.build (cyclomatic 19): _SearchProviderDropdown.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/screens/home_tab_widgets.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"021d9553209cc1a69eb6327a86438bb480c1ec090d63da9d96a5000506302fa7"}},{"ruleId":"D1","level":"warning","message":{"text":"_MonthlyDonationGoalCard.build (cyclomatic 19): _MonthlyDonationGoalCard.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/screens/settings/donate_page.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"957ed5ed62023f98fb61f3191d00e2556033716ec47212875b4452c2f2be2cd4"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkDesktopSettingsPage.build (cyclomatic 19): LinkDesktopSettingsPage.build 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/screens/settings/link_desktop_settings_page.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f8c3933c1ebab1c341a1c9e5585b079c73aa38eeb321f396d1a4ca51163ed7"}},{"ruleId":"D1","level":"warning","message":{"text":"AppStateDatabase.migrateRecentAccessFromSharedPreferences (cyclomatic 19): AppStateDatabase.migrateRecentAccessFromSharedPreferences 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/services/app_state_database.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"890057574638a03aed70845e91abd70f56245ce8fde7593f11c67ecae45ca2b5"}},{"ruleId":"D1","level":"warning","message":{"text":"SoundAutoplaySignal.prepare (cyclomatic 19): SoundAutoplaySignal.prepare has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/autoplay_sound_signal.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6a8640385e9b1e0de459e9d0fedd4f4fa2cf6b5cea3c8ba0afd369ddd8db62"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionStorageService.setUnsecuredStorage (cyclomatic 19): ExtensionStorageService.setUnsecuredStorage 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/services/extension_storage_service.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"703abec6416423c20f316bc4d565fc22656c2b883b042ec46a4b575a52331ed5"}},{"ruleId":"D1","level":"warning","message":{"text":"FFmpegConversion._convertToLossless (cyclomatic 19): FFmpegConversion._convertToLossless 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/services/ffmpeg_conversion.dart"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ac96eaa21cf2eb22fcbfda2de6ec452c9a0de5bfab9dfe03119b8568f265d3"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryCollectionsDatabase.replaceDatabaseFromBackup (cyclomatic 19): LibraryCollectionsDatabase.replaceDatabaseFromBackup 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/services/library_collections_database.dart"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e1f93149dc8dddd3d564e4bd521ebfd24583b3fb1364b0b4596eeb3764074a"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkDownloadUpdates._drain (cyclomatic 19): LinkDownloadUpdates._drain 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/services/link/desktop/link_downloads.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea39428e23a69e70ee6b88562b13754f2c4c79a0305ede8ea7aa20c8d1ea3abb"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkPhoneSources.onMessage (cyclomatic 19): LinkPhoneSources.onMessage 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/services/link/desktop/link_phone_sources.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"01de26ce058380b3dd47826d2adfe8c9fcbb28d7ca0accd4c1165de801b63b45"}},{"ruleId":"D1","level":"warning","message":{"text":"_MusicCast._changed (cyclomatic 19): _MusicCast._changed 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/services/music_player_cast.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11724a6fdf15d0ebc54439000a67cff810fcf7fa06ff1e928eebea51be05b88"}},{"ruleId":"D1","level":"warning","message":{"text":"_MusicGapless.handoff (cyclomatic 19): _MusicGapless.handoff 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/services/music_player_gapless.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4c72e0da62e4e47d78530036faf6e08d58f45ce994543440650dc81e2131fd"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkMetadataService._load (cyclomatic 19): NetworkMetadataService._load 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/services/network_metadata_service.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"20580fd48bf4d103d45f80e865e64f4026fbc5f10b1f67ecce828dd75b7dd62d"}},{"ruleId":"D1","level":"warning","message":{"text":"PlatformBridge._scanToNDJSONFile (cyclomatic 19): PlatformBridge._scanToNDJSONFile 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/services/platform_bridge.dart"},"region":{"startLine":2587}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced4a7ed1770cbc6d46ac5e324490a2d4e15328dd84d5569b9c2936f56c9ea2e"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayableMedia.toJson (cyclomatic 19): PlayableMedia.toJson 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/services/playable_media.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7ecfca82ea3088c932bf1424440385d2595116ba918641148e1990254f9412"}},{"ruleId":"D1","level":"warning","message":{"text":"HeaderCircleButton.build (cyclomatic 19): HeaderCircleButton.build 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/widgets/album_detail_header.dart"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"7794b5321c2c940cf58b8b8267f370d630e67654f6fb8b32d1b31a2f25cbee89"}},{"ruleId":"D1","level":"warning","message":{"text":"AppContentCard.build (cyclomatic 19): AppContentCard.build 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/widgets/app_content_card.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"612944e80e75cce2df55aabbb5e7ec39b96f1aa73a42b976736f82fd665fe88d"}},{"ruleId":"D1","level":"warning","message":{"text":"MornyeContextMenu._action (cyclomatic 19): MornyeContextMenu._action 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/widgets/mornye_context_menu.dart"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54b7012a4f35478e7b72cba41aef80dfc89a383205591d2eca377da70ea35b0"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeFinalizerDecryptKt.finalizeDecryption (cyclomatic 19): NativeFinalizerDecryptKt.finalizeDecryption 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/zarz/mornye/NativeFinalizerDecrypt.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"337dc35a2ad05a488c3a67a8d0f5ab91e50ebe5409fa77b4f00159e36c04a4ce"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeFinalizerMetadataKt.refreshFinalAudioQualityMetadata (cyclomatic 19): NativeFinalizerMetadataKt.refreshFinalAudioQualityMetadata 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerMetadata.kt"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"8353e0a9736db8f7f4f0b6cb6b1a0a6e3e178f070535624b3926a9460dc61ff9"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexCache::index (cyclomatic 19): IndexCache::index 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":"rust_backend/crates/core/src/isrc/cache.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66bf97a69d67ee745845d2fc9d12f772d146a02135f2efe35fda510a3898e14"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::media::audio::ogg_quality (cyclomatic 19): mornye_core::media::audio::ogg_quality 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":"rust_backend/crates/core/src/media/audio.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"194b045b7f4076a84b47831b435a27d0ab8b33c879469667812bf58b17ddcbe5"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::write::edit_comments (cyclomatic 19): mornye_core::tags::write::edit_comments 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":"rust_backend/crates/core/src/tags/write.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad52a2773bfb191c6f6e3eb399b6c90290a4ae03083c0b6aefe1a8bcd321c56f"}},{"ruleId":"D1","level":"warning","message":{"text":"Vm::call (cyclomatic 19): Vm::call 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":"rust_backend/crates/extensions/src/runtime/vm.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a407b5b1eff5df95bc2f3dcaf2f8a9e16fd12a9bcb90932a5df98381f70de8c6"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_link::ws::session (cyclomatic 19): mornye_link::ws::session has cyclomatic complexity 19 (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":"rust_backend/crates/link/src/ws.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6bbb263cd2a9df5dd97b8d6a173514f3873e83ec5b2567803a22cc3c00770f"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::native_lyrics::credits::with_credits (cyclomatic 19): mornye_mobile::native_lyrics::credits::with_credits 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":"rust_backend/crates/mobile/src/native_lyrics/credits.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18cd849092733907cf72d8701e252fab6191c3d0ed24bc49c49d772bbc15df0"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkPermissions::validate_with_grants (cyclomatic 19): NetworkPermissions::validate_with_grants 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":"rust_backend/crates/network/src/policy.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7e47f599b152c49a4c8bf084e7e619f19f07b0d54abe3509181b481a940fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"UrlParts::reference_string (cyclomatic 19): UrlParts::reference_string 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":"rust_backend/crates/network/src/url.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"799a2afc867f872d048ef522202a61afacdd7cc1d19b184e44a27a335dfaecbb"}},{"ruleId":"D1","level":"warning","message":{"text":"_DownloadRun._embedSafNonM4a (cyclomatic 18): _DownloadRun._embedSafNonM4a 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e28c9a51d75892fd36dac369ab20224db5c1e963e1587849c81bd695bd44ce"}},{"ruleId":"D1","level":"warning","message":{"text":"ExploreNotifier.fetchHomeFeed (cyclomatic 18): ExploreNotifier.fetchHomeFeed 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/providers/explore_provider.dart"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1761e8c6d2707fabf211bd1f46b4bb524a4107b80a0a619ec78fe762e020fc"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionNotifier.restoreFromBackup (cyclomatic 18): ExtensionNotifier.restoreFromBackup 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/providers/extension_provider.dart"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca6f0d421ba6c135fe0c47651859faf399f8994188710fc61aa6d7fb2a578a9"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsNotifier._runMigrations (cyclomatic 18): SettingsNotifier._runMigrations 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/providers/settings_provider.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f70fe4047cc4a97eb7eb5a316dcc01544c1f2df60349c886ffe403f7f3fca2"}},{"ruleId":"D1","level":"warning","message":{"text":"_BackupRestorePageState._restoreBackup (cyclomatic 18): _BackupRestorePageState._restoreBackup 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/screens/settings/backup_restore_page.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"558dddf5448426b629cb786c97c7581888bf581ef6085dd568c85da730fa7f0b"}},{"ruleId":"D1","level":"warning","message":{"text":"_SetupScreenState.build (cyclomatic 18): _SetupScreenState.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/screens/setup_screen.dart"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7cad7d86143bd8d1b33d7874259287a2b998da0d36738598dd7206b5314655"}},{"ruleId":"D1","level":"warning","message":{"text":"_EditMetadataSheetState._save (cyclomatic 18): _EditMetadataSheetState._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. This is NOT this file\u0027s highest cyclomatic complexity: _EditMetadataSheetState._fieldLabel (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/track_metadata_edit_sheet.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc811766cb9344aac0ba9b2d3653cd6a11295881f8e29d1522d1491be89af022"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadFileFinalizer.decrypt (cyclomatic 18): DownloadFileFinalizer.decrypt 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/services/download_file_finalizer.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b304a17ab3f168f28c7e33ccb7931360bbf32f7286f33358f137b862baf3f7db"}},{"ruleId":"D1","level":"warning","message":{"text":"FolderPathTemplate.segments (cyclomatic 18): FolderPathTemplate.segments 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/services/folder_path_template.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca0ea1bc5ba82930daeee1ebac3f2e010430608b18f1f286db6035fbfd4dc2e"}},{"ruleId":"D1","level":"warning","message":{"text":"HistorySchema.upgrade (cyclomatic 18): HistorySchema.upgrade 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/services/history_schema.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08f906393993b93e82685beccd697a4a17c89f7b4ec189c2ded3332a77d9d88"}},{"ruleId":"D1","level":"warning","message":{"text":"LastfmService._flush (cyclomatic 18): LastfmService._flush 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/services/lastfm/lastfm_service.dart"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed765fa6b84ddd550a0ec0fe90ad469b5fd951d41178f061796562e67c51471"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryCollectionsDatabase.migrateFromSharedPreferences (cyclomatic 18): LibraryCollectionsDatabase.migrateFromSharedPreferences 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/services/library_collections_database.dart"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcab7914163415f9d6740f10dbf75f20fb4da39f4d850396a56cc5777fb3939"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkClientController._onDiscoveryChanged (cyclomatic 18): LinkClientController._onDiscoveryChanged 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/services/link/client/link_client_controller.dart"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"5377aa8eaf0defd922d1157b9674f71f9181bc960f324d7eb942655da49fdf6c"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkCollectionSyncStore._write (cyclomatic 18): LinkCollectionSyncStore._write 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/services/link/sync/link_collection_sync_store.dart"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"9564f474270c1dab93f793ddb029f96703a674d883a4f2d75992db252b8d040c"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkHistoryArtwork._apply (cyclomatic 18): LinkHistoryArtwork._apply 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/services/link/sync/link_history_artwork.dart"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"445ed56e0da58b0bbe1d07913d6c9181a89f7b397a35b5bc36c2418c0d381af1"}},{"ruleId":"D1","level":"warning","message":{"text":"ListeningRewind.compute (cyclomatic 18): ListeningRewind.compute 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/services/listening_rewind.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b3f2b485bc1b2fa6114bda53f85871e5c8f411bd966b7b045d30573a3dabd4"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioplayersPlaybackDeck._syncEqualizer (cyclomatic 18): AudioplayersPlaybackDeck._syncEqualizer 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/services/music_playback_deck.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d186bab5d4b0f365843b5dd9c2d0a2dcf972e9cd55c6d466e717e4cbb13a4d01"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioplayersPlaybackDeck.refreshNativeStatus (cyclomatic 18): AudioplayersPlaybackDeck.refreshNativeStatus 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/services/music_playback_deck.dart"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47082fa9a6f3e91e643067d61ffdab2676137a01af26145d1c5d2ba00fb0583"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicPlayerHandler._refreshPlaybackAutomation (cyclomatic 18): MusicPlayerHandler._refreshPlaybackAutomation has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_service.dart"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"381b98018505c5e6a96d69717806a26800e07390885bce3140f24d6e73b5b03c"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicPlayerHandler.reapplyNormalization (cyclomatic 18): MusicPlayerHandler.reapplyNormalization has cyclomatic complexity 18 (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/services/music_player_service.dart"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ac4cd6e43e9ec1792e3f03edb7673ed00dce9541af3e0e7a4d0cb13330ed10"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicPlayerHandler._resolveSource (cyclomatic 18): MusicPlayerHandler._resolveSource 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/services/music_player_service.dart"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f7e25fb4d2e86b069464c4f1b9a2aa11d710520e27e3a1d8f80b1975321378"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateChecker.checkForUpdate (cyclomatic 18): UpdateChecker.checkForUpdate 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/services/update_checker.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"636c2adf202592e684dfed724df617b588b89c75abaa61fedea317ebab0e75e9"}},{"ruleId":"D1","level":"warning","message":{"text":"AppAlertDialog.build (cyclomatic 18): AppAlertDialog.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/widgets/app_alert_dialog.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3945635d376d9505d3fa1cf836c852c4a44c8aefc00e183dd4d03c08a9c3181e"}},{"ruleId":"D1","level":"warning","message":{"text":"AppSheetOption.build (cyclomatic 18): AppSheetOption.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/widgets/app_bottom_sheet.dart"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"566cb8635a424adff9a975a552efb48e13a284888ff18a182b03724c38acb8b1"}},{"ruleId":"D1","level":"warning","message":{"text":"AppChoiceChip.build (cyclomatic 18): AppChoiceChip.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/widgets/app_choice_chip.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fd6e5e9055e672cfc93b129ef956cc168b12da85f9cb49b9a0c951c8819f81"}},{"ruleId":"D1","level":"warning","message":{"text":"_MornyeSwitchState.build (cyclomatic 18): _MornyeSwitchState.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/widgets/app_switch.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d339f85947179d04f421b14785acb6adac8978b43a1bf4fd78b5197a894a5f"}},{"ruleId":"D1","level":"warning","message":{"text":"_AudioFacts._source (cyclomatic 18): _AudioFacts._source 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/widgets/audio_info_sheet.dart"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2dc6b0eb5e09cc7bdb005f8763063f6c9b1e47eff67dcebcb2cca28068cd78"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibrarySearchResultsState._tile (cyclomatic 18): _LibrarySearchResultsState._tile 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/widgets/library_search_results.dart"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d966cb067b240236964beba489b0fc1b43ad47f1fd1eee2fea5a83b578647d3"}},{"ruleId":"D1","level":"warning","message":{"text":"_LyricsOptionsButtonState._buildButton (cyclomatic 18): _LyricsOptionsButtonState._buildButton 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/widgets/lyrics_options_button.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3de0fa9fc05c14af8d17a333a645378cbca680e7190a9587f2699757de51886"}},{"ruleId":"D1","level":"warning","message":{"text":"_MotionHeaderBannerState._initialize (cyclomatic 18): _MotionHeaderBannerState._initialize 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/widgets/motion_header_banner.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c8710e086e1d9a71b50fa8728f023c3bea92029b9ec677dee593eea41f3e3b"}},{"ruleId":"D1","level":"warning","message":{"text":"_PlaybackFeedbackState.initState (cyclomatic 18): _PlaybackFeedbackState.initState 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/widgets/playback_feedback.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"569e54ea93868672691cbd2aa0386fd3f0debb2622c971ee4ff6a12f5c84978a"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadService.buildNotification (cyclomatic 18): DownloadService.buildNotification 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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0e39e2ea5f64d2c0d4b60c6d702520599cb97a0e5ef2f1d427a8470fe64c1c"}},{"ruleId":"D1","level":"warning","message":{"text":"WavSource::open (cyclomatic 18): WavSource::open 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":"rust_backend/crates/core/src/media/hires.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea02140cd81050d9dc203956f4e210203d40274fae9b5efa957ac17455b2ac1"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::media::mp4::probe (cyclomatic 18): mornye_core::media::mp4::probe 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":"rust_backend/crates/core/src/media/mp4.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c907403b6b2eced52476401b63b12b74d8f6878b104db3ae4ffd4153113599"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::write::mp4::ac4::config (cyclomatic 18): mornye_core::tags::write::mp4::ac4::config 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":"rust_backend/crates/core/src/tags/write/mp4/ac4.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7882d2ac1e39c3852a07ca95fb5acba754fecccf405fa79477daaa9c5a89dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::edit_file_metadata (cyclomatic 18): Backend::edit_file_metadata 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":"rust_backend/crates/extensions/src/backend/tags.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5ca38d4ac46b04d207627be175b63e8f9a097bf42bbc99d1714a1f59d8b878"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionManager::search_metadata_providers_value_with_lease (cyclomatic 18): ExtensionManager::search_metadata_providers_value_with_lease 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":"rust_backend/crates/extensions/src/manager/metadata.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7a76c56c3b0293eeece924059085937db5e014b65077286dde0db753b98e33"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionManager::run_post_processing (cyclomatic 18): ExtensionManager::run_post_processing 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":"rust_backend/crates/extensions/src/manager/postprocess.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fe06a9cf67d3edd272d5c4b76c685c03ab1c68633a547e331212c1d74e2f3e"}},{"ruleId":"D1","level":"warning","message":{"text":"QualitySpecificSetting::deserialize (cyclomatic 18): QualitySpecificSetting::deserialize 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c652d0544c9a15d53409a91a3c6cfd82f012e8b458ff9160bb13581ed76b7e10"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchBehavior::deserialize (cyclomatic 18): SearchBehavior::deserialize 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba48d86a556b03d7517c673ed437bdb087d52869ae8d1621e77833ea0ca97648"}},{"ruleId":"D1","level":"warning","message":{"text":"HealthCheck::deserialize (cyclomatic 18): HealthCheck::deserialize 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"351a73b4f3ceb99aa5e17d0011485830c42bc484ee17ec3ca0ef0af8a3cfc8ea"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::native_cache::unix::collect (cyclomatic 18): mornye_mobile::native_cache::unix::collect 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":"rust_backend/crates/mobile/src/native_cache/unix.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2fd86cdd0d8a6312c9d090226437dd14043a63c96dfb9cd35b4146a94f8441"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkSession::execute_stream (cyclomatic 18): NetworkSession::execute_stream 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":"rust_backend/crates/network/src/client.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33992c048bc223178ff67f3fc28bdca786b3b16bc47a8b0d29dbeaaac687e76"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::downloadSegments (cyclomatic 18): (anonymous)::downloadSegments 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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"73beb679cc0c14a625f05f551665d9a4fcb3a7ea722ecf690b12468d0860f7d1"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadHistoryNotifier._commitInspectedHistoryChanges (cyclomatic 17): DownloadHistoryNotifier._commitInspectedHistoryChanges 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/providers/download_history_provider.dart"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbbc9fdec7351928778ea3084bcc813c22d5a0d34559b52ae37c8ad315c3c4d"}},{"ruleId":"D1","level":"warning","message":{"text":"_DownloadRun._resolveTrackIdentifiers (cyclomatic 17): _DownloadRun._resolveTrackIdentifiers has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_queue_provider_single_item.dart"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96709cf3b9a66d6dac79023b280c8567da64b0234a6de05a59b493af1d5145e"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalLibraryNotifier._loadFromDatabase (cyclomatic 17): LocalLibraryNotifier._loadFromDatabase 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/providers/local_library_provider.dart"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fab75f50b591760d4ef1af38d7f4b837a33b9caba1e36a3354b6ea164543026"}},{"ruleId":"D1","level":"warning","message":{"text":"_ConcertDetailScreenState._materialPage (cyclomatic 17): _ConcertDetailScreenState._materialPage 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/screens/concert_detail_screen.dart"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"893b14beb8ff2d6a054b444f050b185be3de795167cde4da13f4d8ac26287ef7"}},{"ruleId":"D1","level":"warning","message":{"text":"_SearchCoverCell.build (cyclomatic 17): _SearchCoverCell.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/screens/home_tab_search_wide.dart"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cbccf41cfa9b528aab78ba809e5e657cf18478e57856f65c75e1c82333e94d"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibraryTracksFolderScreenState._showEntryMenu (cyclomatic 17): _LibraryTracksFolderScreenState._showEntryMenu 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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d718d1a017f5e94da883227dabe1ab501d26d97df0dfb6bd20f1c4be3a05585"}},{"ruleId":"D1","level":"warning","message":{"text":"_NetworkConnectionFormState._save (cyclomatic 17): _NetworkConnectionFormState._save 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/screens/network_storage_screen.dart"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b36b44138b0148c7f04cdd2dffadc5c5c9d0b6bd7579455a1876a64b333dad"}},{"ruleId":"D1","level":"warning","message":{"text":"_SettingItemState._invokeAction (cyclomatic 17): _SettingItemState._invokeAction 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/screens/settings/extension_detail_page_widgets.dart"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"908128a62c232b95edaaedd56ca1f8b56578ab5f04fea00faa093709815dd697"}},{"ruleId":"D1","level":"warning","message":{"text":"_LibrarySettingsPageState._pickLibraryFolder (cyclomatic 17): _LibrarySettingsPageState._pickLibraryFolder 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/screens/settings/library_settings_page.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f685f1eb427a5da26738fd37e6fe46f9b84eac008034712a80b7b7e6e26d3b"}},{"ruleId":"D1","level":"warning","message":{"text":"_ScanProgressTile.build (cyclomatic 17): _ScanProgressTile.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/screens/settings/library_settings_page_widgets.dart"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f383b4a26361f54431da0f3a7efcda47e8ee7491b1d8281c2a81398f6af040"}},{"ruleId":"D1","level":"warning","message":{"text":"_SettingsTabState._buildList (cyclomatic 17): _SettingsTabState._buildList 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/screens/settings/settings_tab.dart"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de632e9011ea5e0eddc0237b1ced4cdcf4e00531bb03e664ce26f5ccf21a144"}},{"ruleId":"D1","level":"warning","message":{"text":"_WhatsNewScreenState.build (cyclomatic 17): _WhatsNewScreenState.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/screens/whats_new_screen.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7b0d06d473463980ea185cab0388e62aa5a9e5c5109696f16743c3f73d635e"}},{"ruleId":"D1","level":"warning","message":{"text":"AppStateDatabase.getPendingDownloadQueueRows (cyclomatic 17): AppStateDatabase.getPendingDownloadQueueRows 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/services/app_state_database.dart"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19c74815c491c40b64bb38a25366ead915156165c0fa94d2d503d3db2936c4f"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioAnalysisCache.trim (cyclomatic 17): AudioAnalysisCache.trim 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/services/audio_analysis_cache.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"902b920d7ec57f3270fb0f6f57cbbb42e89a039ed47a134757d5caffd35b2f46"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioAnalysisRunner._getMediaInfo (cyclomatic 17): AudioAnalysisRunner._getMediaInfo 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/services/audio_analysis_runner.dart"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd43367c18f7b3b6442ea8df7e47167214a27973c15317f4c11ae68dffc06fc"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoMixAnalyzer.analyze (cyclomatic 17): AutoMixAnalyzer.analyze 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/services/automix_analyzer.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5476515e06fb581a163b3257be63f5f9552b2ae21d04af10a1e131dfa46d54ff"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopUpdater.download (cyclomatic 17): DesktopUpdater.download 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/services/desktop_updater.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c075a7170e273e5c8624594521aacd56d3fb91af726c2d1da1192d355943ff42"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadMetadataResolver.resolveSpotifyTrackViaDeezer (cyclomatic 17): DownloadMetadataResolver.resolveSpotifyTrackViaDeezer 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/services/download_metadata_resolver.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d2eb10cbdc15dbea562fde953c281ebeadba36fc42ad5ae98ab8372759d124"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadQueuePersistence._enqueue (cyclomatic 17): DownloadQueuePersistence._enqueue 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/services/download_queue_persistence.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"db48a2ba62234905a061f7d9490fc488a03efb82335ec6944847685fd1f32b9a"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadedEmbeddedCoverResolver._drainPreviewValidations (cyclomatic 17): DownloadedEmbeddedCoverResolver._drainPreviewValidations 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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f3037c368f4e2a095977ecead350163c41a19ee3a66452a4927252e69faeb8"}},{"ruleId":"D1","level":"warning","message":{"text":"FFmpegConversion._convertToPcm (cyclomatic 17): FFmpegConversion._convertToPcm 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/services/ffmpeg_conversion.dart"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"9852d1edc9f7f6e69e1857b138b2f73d182b390bb6c12507cc4a433a2d5b4442"}},{"ruleId":"D1","level":"warning","message":{"text":"FFmpegMetadataInput.prepare (cyclomatic 17): FFmpegMetadataInput.prepare 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/services/ffmpeg_metadata_input.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5533db2ab018e47c801d9008cf4382b8a602938052422244005074173396157"}},{"ruleId":"D1","level":"warning","message":{"text":"_MixBuilder._index (cyclomatic 17): _MixBuilder._index 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/services/library_mixes.dart"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b2911ce9181a4759fb76b35da8ad5a18c5c38b937a6a3ed2661f6cec858073"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkArrivingFiles._serve (cyclomatic 17): LinkArrivingFiles._serve 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/services/link/desktop/link_arriving_files.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b0287be13ebfd61b8742ab57fb8bf8e4caf93f34298279a15ba02418240d3a"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkPhoneCatalogs._addCovers (cyclomatic 17): LinkPhoneCatalogs._addCovers 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/services/link/desktop/link_phone_catalogs.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"294cae565e927dc9c3a085d1ecad36d583d32f4ebdb2d8292607a80f1246a0b1"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkTrackResolver.resolve (cyclomatic 17): LinkTrackResolver.resolve 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/services/link/features/link_track_resolver.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"554b563052104858a78ff5ba50b9f36288dbdc61bda84ce8646557574ded83a8"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkPhoneSong.toJson (cyclomatic 17): LinkPhoneSong.toJson 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/services/link/link_protocol.dart"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54d2463aa614d58a4f93d69516edf7d670d7f70683896e4fcfe86c54708fa32"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkCollectionSyncStore.apply (cyclomatic 17): LinkCollectionSyncStore.apply has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/sync/link_collection_sync_store.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1516f8909ea00028cdc93713f999d71ebe39136ce6e6ff3e6497f4eafcd2f7"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalNetworkAccess._isLocalAddress (cyclomatic 17): LocalNetworkAccess._isLocalAddress has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/local_network_access.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0d516b7f005ae785dbfe7c088a99be3bf5991e0bd0bd06bed855092d7dbc66"}},{"ruleId":"D1","level":"warning","message":{"text":"MediaKitPlaybackDeck.queueNextSource (cyclomatic 17): MediaKitPlaybackDeck.queueNextSource has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/media_kit_playback_deck.dart"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2a0c4c977b5dc6f3d5fd8d580a2505779db509bdb08d8bea648bbe2199d709"}},{"ruleId":"D1","level":"warning","message":{"text":"_MusicFailures.skipMissing (cyclomatic 17): _MusicFailures.skipMissing 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/services/music_player_failures.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6664afa22c38ed9c5c109888618a41cb991d3b654035e454d0590f369b646810"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkPlaybackCache.lookup (cyclomatic 17): NetworkPlaybackCache.lookup 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/services/network_playback_cache.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"53777ee7bfbf3aac5aa8270bb5729d2e7779848ba4f99e5da7e48c2b9ace2ccb"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricDisplayLayout.LyricDisplayLayout (cyclomatic 17): LyricDisplayLayout.LyricDisplayLayout 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/utils/lyrics_timeline.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"da56f789360d22b9ed1c97a0ba8cf837138047e657d85990e475daf0f2b0ea60"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopNavigationRail.build (cyclomatic 17): DesktopNavigationRail.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/widgets/desktop/desktop_navigation.dart"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edf9fc6f764fbb68dc2f31358fefc88375de257969cea424d7a3feea948cbdf"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopSidebar.build (cyclomatic 17): DesktopSidebar.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/widgets/desktop/desktop_navigation.dart"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30860bf713cab7bd48b8ad0a94ca6142dfebcc8239745a83b402b56e75c9d1c"}},{"ruleId":"D1","level":"warning","message":{"text":"_TrailingControls.build (cyclomatic 17): _TrailingControls.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/widgets/desktop/desktop_player_bar.dart"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46b355ad81146c9a349252ef6cc3d8b16883c70ee1e2820d3d6051b6038bba1"}},{"ruleId":"D1","level":"warning","message":{"text":"_ServiceChip.build (cyclomatic 17): _ServiceChip.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/widgets/download_service_picker.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e410939ca20eeabca3fd245e96c0acc00baefb70fbd3e7585735bcdbbf24f88e"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkDevicesSheet.build (cyclomatic 17): LinkDevicesSheet.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/widgets/link/link_devices_sheet.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82747d9c6eb09b49322ab397e02d002a10fce4d6f91642e2c28fa4803db27d2"}},{"ruleId":"D1","level":"warning","message":{"text":"_LyricsEditorSheetState._buildFooter (cyclomatic 17): _LyricsEditorSheetState._buildFooter 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/widgets/lyrics_editor_sheet.dart"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9833ad6db1dc5ec82c1ba38d264da35396b00a1607a3b945fa670025f858dc0"}},{"ruleId":"D1","level":"warning","message":{"text":"_LyricsEditorRow.build (cyclomatic 17): _LyricsEditorRow.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/widgets/lyrics_editor_sheet.dart"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23123061e3f83a79f844ef96a07a44378c91574d2c6627873750a5cf1934319"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadService.onStartCommand (cyclomatic 17): DownloadService.onStartCommand has cyclomatic complexity 17 (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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4818c13a3b79e21900b530f30d9f9d1f07a4748624d34628dda2814c1408735"}},{"ruleId":"D1","level":"warning","message":{"text":"AppDelegate.handleMethodCall (cyclomatic 17): AppDelegate.handleMethodCall has cyclomatic complexity 17 (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":"ios/Runner/AppDelegate.swift"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2168fce10b2ffa64e79345877b9a9223b2e8f66dc38263d9509c74156148330d"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::lyrics::payloads::format_apple_payload (cyclomatic 17): mornye_core::lyrics::payloads::format_apple_payload 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. This is NOT this file\u0027s highest cyclomatic complexity: PaxLine::update (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7146d1fb1a181855242adf2855980603f3bbb40cb72a6d2b075eba21341daaa7"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::lyrics::payloads::format_apple (cyclomatic 17): mornye_core::lyrics::payloads::format_apple 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. This is NOT this file\u0027s highest cyclomatic complexity: PaxLine::update (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"26166af03037efb952650c4e5a4d7a0aa86b9d48d7abe143642dc94ba2f16bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::manager::metadata::track_input (cyclomatic 17): mornye_extensions::manager::metadata::track_input 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":"rust_backend/crates/extensions/src/manager/metadata.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8dc75ddc710f4c6920d3735d00112e8cebac1166b5222edbe73906c3020f4f"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::runtime::vm::run_worker (cyclomatic 17): mornye_extensions::runtime::vm::run_worker 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":"rust_backend/crates/extensions/src/runtime/vm.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c366aa976ffac2dcf004041d57d1101b44e97dc48349c5029455407a9954f91"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_mobile::usb_audio::descriptors::formats (cyclomatic 17): mornye_mobile::usb_audio::descriptors::formats 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":"rust_backend/crates/mobile/src/usb_audio/descriptors.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3333865cb8bc8e5adcfe356e07f2fbc55185c0fb5830cac0c81aa34e73db1901"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).album (cyclomatic 17): (anonymous).album has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/provider.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38360e4657102301240d8c2e47aca1cdbd868b3c665594422baa654376075e0"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAudioController.open (cyclomatic 16): OpenAudioController.open 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/controllers/open_audio_controller.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c79aacbdb6bdc5ed33fadd1abb803bdf2d60e22fb512b56c7a452e6e6d1327"}},{"ruleId":"D1","level":"warning","message":{"text":"ThemeSettings.== (cyclomatic 16): ThemeSettings.== has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/models/theme_settings.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd93ca304ae3da910c364e8cfc7ac74738320ccc278b3b935977d4089372a755"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadQueueNotifier.updateItemStatus (cyclomatic 16): DownloadQueueNotifier.updateItemStatus has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_queue_provider.dart"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ee8d00eafc348729451724ce94a96f342585c61d1f1fbc61df30c7db944a75"}},{"ruleId":"D1","level":"warning","message":{"text":"_DownloadRun._persistCompletionAndNotify (cyclomatic 16): _DownloadRun._persistCompletionAndNotify 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e935fce354c19de8960dd39b1833cd86b1ac34a1b03a2961742cf1e33f3eca"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadQueueLookup.updatedForIndices (cyclomatic 16): DownloadQueueLookup.updatedForIndices 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/providers/download_queue_state.dart"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"12830f03db7c6c690a975a25d65ccc49732bfeb9509db64409c4c02d34249d8f"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionNotifier.initialize (cyclomatic 16): ExtensionNotifier.initialize 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/providers/extension_provider.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"246ddc1060c98cb70baa88a118a8db8ab744645abbf43846ba4ea345890b0afe"}},{"ruleId":"D1","level":"warning","message":{"text":"_HomeShortcuts.build (cyclomatic 16): _HomeShortcuts.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/screens/home_tab_intro.dart"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"faffa1067a9bb58c3ea0c6ac9bb7148f600656fe5e030181434d77cadc5af266"}},{"ruleId":"D1","level":"warning","message":{"text":"_RepoTabState.build (cyclomatic 16): _RepoTabState.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/screens/repo_tab.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"825f86da12689b49ee4101b215faff07792a02b2555ba5e0f8e0ae397212d78e"}},{"ruleId":"D1","level":"warning","message":{"text":"_CacheManagementPageState.build (cyclomatic 16): _CacheManagementPageState.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/screens/settings/cache_management_page.dart"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d935338eacda757b1a18850945297a753a7a347d3678fc8e4578c20639c361b"}},{"ruleId":"D1","level":"warning","message":{"text":"_LinkSettingsPageState._notices (cyclomatic 16): _LinkSettingsPageState._notices 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/screens/settings/link_settings_page.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"14605605cabbd1e8820bed4f93f7771d56fc761e395be4b17207cbe268c37a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"_LyricsAiTranslationPageState.build (cyclomatic 16): _LyricsAiTranslationPageState.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/screens/settings/lyrics_ai_translation_page.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c854bbd4953368d8d4ecb1d3469715b2016deb3add06854170894883fc11f04a"}},{"ruleId":"D1","level":"warning","message":{"text":"_TextSheetBodyState.build (cyclomatic 16): _TextSheetBodyState.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/screens/settings/lyrics_ai_translation_page.dart"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"441c588bf2b4c342d34d5d7d0892d8a6d86c31c27603784566491f2a0c2b7598"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsSettingsPage.build (cyclomatic 16): LyricsSettingsPage.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/screens/settings/lyrics_settings_page.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc984ea7685dde5be4b4edd96d4d1d105a456261580d104b9e74dc80d9118d06"}},{"ruleId":"D1","level":"warning","message":{"text":"_SetupScreenState._isStepCompleted (cyclomatic 16): _SetupScreenState._isStepCompleted 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/screens/setup_screen.dart"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfd41b2e321373f657a44d315a5da4a26e0220a83a8fec2086daa0194f42422"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAudioFile.parse (cyclomatic 16): OpenAudioFile.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/services/audio_file_open_service.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c97e945951d4397e0eabc0f617b8a7bf24c5204593483719681bcd8b853b8"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoMixAnalyzer.analyzeTransition (cyclomatic 16): AutoMixAnalyzer.analyzeTransition 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/services/automix_analyzer.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"850b197cb99d7b9de2ada4bb6f88c95afc14d2eae547ef40145ad35d73973d22"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoMixEffectRenderer.render (cyclomatic 16): AutoMixEffectRenderer.render 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/services/automix_effect_renderer.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01336e3dae72d754fe1499ddb986340a33db30fed6e6eb9d6532b6566399840"}},{"ruleId":"D1","level":"warning","message":{"text":"CoverStore.file (cyclomatic 16): CoverStore.file 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/services/cover_store.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"faceb69a8524a21e1e3a9081b758e97d1ff9c00cfe3a5a557bb1f9a21b65f2c2"}},{"ruleId":"D1","level":"warning","message":{"text":"CoverStore.trim (cyclomatic 16): CoverStore.trim 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/services/cover_store.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28dfb48ae5143504e12cba059e1b2ba44751e9a07653acfbe56008b8f6c8a50"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadScheduler.run (cyclomatic 16): DownloadScheduler.run 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/services/download_scheduler.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb463a89e39d35217b7bfefadb258ad231654903f04b4556ef328bbd3ea1ab9"}},{"ruleId":"D1","level":"warning","message":{"text":"LastfmListening.update (cyclomatic 16): LastfmListening.update has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/lastfm/lastfm_listening.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b6c0471b92c7c7ac9fe098979acf14c5bd82c3745a0b00b728e22348218d49"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkDesktopOps.playHandoff (cyclomatic 16): LinkDesktopOps.playHandoff 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/services/link/desktop/link_desktop_ops.dart"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c13c79a3ee40798329a3d7d4e61c0d5e069c925862fa0bd97c1886722dbee6"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkWebCovers._probeNew (cyclomatic 16): LinkWebCovers._probeNew has cyclomatic complexity 16 (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/services/link/desktop/link_web_covers.dart"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"7888e13ef15c68f110d826e41cd56aeffe219490f4508daf5271148f0b03043e"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkHandoff._sendQueue (cyclomatic 16): LinkHandoff._sendQueue 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/services/link/features/link_handoff.dart"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"0252446d680e5bb08eaf26e4e3f2403f225dcdb25e7e865f0c6fe4080912e6b4"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkPhoneFileRequests._deleteSong (cyclomatic 16): LinkPhoneFileRequests._deleteSong 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/services/link/features/link_phone_library_sync.dart"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4eaade98766ff7d356a9918345202e165999b99fd191e52b05c30082e0894a"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkOfflineSaver.save (cyclomatic 16): LinkOfflineSaver.save 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/services/link/features/link_save_offline.dart"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c2b9725d51303e54f664c5dd417562e1088af8cabce3f8d264a53073145d9b"}},{"ruleId":"D1","level":"warning","message":{"text":"MediaSessionFilter._advancesTo (cyclomatic 16): MediaSessionFilter._advancesTo has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/media_session_filter.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b41b77f3b6c7df3666401438151d7b0f8302405fd547968f44fcddc4ec02a3f"}},{"ruleId":"D1","level":"warning","message":{"text":"_MusicAutoMix.onPosition (cyclomatic 16): _MusicAutoMix.onPosition 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/services/music_player_automix.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ee967304e8647568b60f469aa829f5557cea7a245d67965d3330fc434df4aa"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicPlayerHandler._stopSession (cyclomatic 16): MusicPlayerHandler._stopSession 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/services/music_player_service.dart"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1dd3772ff37ea5908250044721e9d00c3dc796422d4aabe21a2590b6b1edee"}},{"ruleId":"D1","level":"warning","message":{"text":"LogBuffer.exportWithDeviceInfo (cyclomatic 16): LogBuffer.exportWithDeviceInfo 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/utils/logger.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec51c25db213802965a8e6e90d20a35579a0d52a9c1c9cfdcea2c6d968959143"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsDraft.toLrc (cyclomatic 16): LyricsDraft.toLrc 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/utils/lyrics_draft.dart"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f494104ea18fab4358da0de80d5df18e2c5a9c442bdc2e370663be8fb9c3392b"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricTimelineIndex.activeIndices (cyclomatic 16): LyricTimelineIndex.activeIndices has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/utils/lyrics_timeline.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"989f87a18e108e2c8e2f68aeb89f566c03a94966df5240c503eb4d4ed6d02ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"AppActionButton.build (cyclomatic 16): AppActionButton.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/widgets/app_action_button.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac844fbc4bd0969c0b1d0e4321a43eb08982ec70eda76683a0f8479477b96411"}},{"ruleId":"D1","level":"warning","message":{"text":"_AppCrashBannerState.build (cyclomatic 16): _AppCrashBannerState.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/widgets/app_crash_banner.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0c7190307303a63bcbf47490cd3c2fe5c4ab4d2ecf87b4e1fdabf044e9a6ed"}},{"ruleId":"D1","level":"warning","message":{"text":"_AudioAnalysisCardState._analyze (cyclomatic 16): _AudioAnalysisCardState._analyze 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/widgets/audio_analysis_widget.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1823d31fe5f5f2b6e80f7f3bedc92f43cf46ee2d449a5d8b37c1346fb5d3dd1d"}},{"ruleId":"D1","level":"warning","message":{"text":"_AlbumRowViewState.build (cyclomatic 16): _AlbumRowViewState.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/widgets/desktop/track_table.dart"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70f2b7b33424be6fff67ab9096c5a7842bca75b011d6ffe7a051f8694940536"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkTransferGlyph.build (cyclomatic 16): LinkTransferGlyph.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/widgets/link/link_transfer_tile.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"885ea9b297f1684ccccf831af2c827cd7cf5d73392d1c37092aaba1ee092025b"}},{"ruleId":"D1","level":"warning","message":{"text":"_MornyePlayerArtworkState.build (cyclomatic 16): _MornyePlayerArtworkState.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/widgets/mornye_player_artwork.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"603ff116912be6d222b320287145042f55996ac0fc509a518903f7d4ff223e35"}},{"ruleId":"D1","level":"warning","message":{"text":"_SyncedLyricsViewState._scrollUntilBuilt (cyclomatic 16): _SyncedLyricsViewState._scrollUntilBuilt 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/widgets/player_lyrics.dart"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"35252209740f15ed9bdb7fde7236b6dd12a1a4a684d00354e5a2899999676189"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsSwitchItem.build (cyclomatic 16): SettingsSwitchItem.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/widgets/settings_group.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e72498c3f6e5e9c02acdd432e45d6d803579e16cbd71f923a6076845d34427"}},{"ruleId":"D1","level":"warning","message":{"text":"ImpellerCompatibilityKt.shouldDisableImpeller (cyclomatic 16): ImpellerCompatibilityKt.shouldDisableImpeller 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":"android/app/src/main/kotlin/com/zarz/mornye/ImpellerCompatibility.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee32dbaed4825e0fef0087cdd7615783e4e7974b41a4eaaa1a501dbb1a75cb2"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeDownloadFinalizer.writeAlbumReplayGain (cyclomatic 16): NativeDownloadFinalizer.writeAlbumReplayGain 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"955656d4cb77a167f110f22c18db21d3d8b9deba0dd07bfa348322583ca53b3b"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkNowPlayingController.sharedArtwork (cyclomatic 16): LinkNowPlayingController.sharedArtwork has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/LinkNowPlayingBridge.swift"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"28921ce4dce1f6b58958a03d5281376c5f259ee418f570e2d324cbfaf27df076"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::cover::resize (cyclomatic 16): mornye_core::cover::resize 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":"rust_backend/crates/core/src/cover.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"22508bf32c4dcc1c25add64b9982fe64b586190bd09382a3114e86320f481d75"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::lyrics::payloads::apple_vocal_sides (cyclomatic 16): mornye_core::lyrics::payloads::apple_vocal_sides has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: PaxLine::update (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d48f9bf39460b0340de06316cbe632cd7d2d1ff22ae3b394a4912c936e4c8c"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::lyrics::payloads::parse_proxy (cyclomatic 16): mornye_core::lyrics::payloads::parse_proxy 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. This is NOT this file\u0027s highest cyclomatic complexity: PaxLine::update (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2bcd859a4cd23b4102a5dfeda0de1374a6708a79047710a858920802dd1ac2"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::containers::ogg_packets_until (cyclomatic 16): mornye_core::tags::containers::ogg_packets_until 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":"rust_backend/crates/core/src/tags/containers.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bf83add7b450482a8e5b59b28cd3b36c14ea45574a08b7cc3fa0ce161f61dc"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_core::tags::containers::riff_chunks (cyclomatic 16): mornye_core::tags::containers::riff_chunks 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":"rust_backend/crates/core/src/tags/containers.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7581336325f9c8a9b7c96d2e0b595d5ac382316f47976c29c12d535cda31ea"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionAuth::exchange (cyclomatic 16): ExtensionAuth::exchange 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":"rust_backend/crates/extensions/src/auth/client.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15ebee53f735fdde8ea8156ad1a6542bf525c7aa31cb8fea3238222820ea41f"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionPackage::open (cyclomatic 16): ExtensionPackage::open 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":"rust_backend/crates/extensions/src/package.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ec5931e625a4e556806f0bdecd1f92de47d49990af58ee41b674967ec72999"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::backend::downloads::metadata::download_metadata_fields (cyclomatic 16): mornye_extensions::backend::downloads::metadata::download_metadata_fields 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":"rust_backend/crates/extensions/src/backend/downloads/metadata.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f12ef8c3c9f62b918992959c520bbd6de55bf281a27bba7ac031b5831281a3"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::backend::downloads::result::success (cyclomatic 16): mornye_extensions::backend::downloads::result::success 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":"rust_backend/crates/extensions/src/backend/downloads/result.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6481eded6b7260ca6aa64aeeb514daad1ab34cdc555bb449ba7ae10fa7dea9"}},{"ruleId":"D1","level":"warning","message":{"text":"mornye_extensions::crypto_host::segments (cyclomatic 16): mornye_extensions::crypto_host::segments 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":"rust_backend/crates/extensions/src/crypto_host.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c32e83c916f67665ae65e35e69b762f5ba09da183022a05612dd16048bce662"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::dispatch (cyclomatic 16): (anonymous)::dispatch 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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99cae954f54e469120384a9ce87542b836468f5987febe443984295128f8521"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::fileCall (cyclomatic 16): (anonymous)::fileCall 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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe89bdff01ba9277d5fbf92b5cdd3dcfd868a8dd971f03f1cc57eed44f5e6c3"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous).fields (cyclomatic 16): (anonymous).fields 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":"rust_backend/crates/extensions/src/provider.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29386112186e3329ce4a97f6602fd9fba12eedaee4829a9f8461ca86e08f2b2"}},{"ruleId":"D2","level":"warning","message":{"text":"_TrackMetadataScreenState._refreshResolvedAudioMetadataFromFile (cognitive 278): _TrackMetadataScreenState._refreshResolvedAudioMetadataFromFile has cognitive complexity 278 (threshold 15). Drivers by points: ternaries 33 (109 pts), boolean chains 90, if/else 28 (76 pts), loops 1 (2 pts), error handling 1 (nesting depth added 125). 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/screens/track_metadata_screen.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"342577c985b6820332d2d5759c83861145cea48c72fba09928607014303a65c5"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkLibraryScanner._scan (cognitive 209): NetworkLibraryScanner._scan has cognitive complexity 209 (threshold 15). Drivers by points: if/else 36 (134 pts), boolean chains 19, error handling 6 (19 pts), loops 5 (19 pts), ternaries 5 (18 pts) (nesting depth added 138). 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/services/network_library_scanner.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"98597045968c2599181d69d6c6bbd4e09a8107a17c7c2abdef2bed0f48464900"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicAutoMix._start (cognitive 168): _MusicAutoMix._start has cognitive complexity 168 (threshold 15). Drivers by points: if/else 38 (114 pts), ternaries 12 (33 pts), boolean chains 15, error handling 3 (6 pts) (nesting depth added 100). 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/services/music_player_automix.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"06acf9356ddd5722a406cf8db36cb1c2dcb779577a705520374ae5e0dc878d56"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadMetadataEmbedding.embed (cognitive 163): DownloadMetadataEmbedding.embed has cognitive complexity 163 (threshold 15). Drivers by points: if/else 31 (85 pts), boolean chains 30, error handling 9 (27 pts), ternaries 6 (21 pts) (nesting depth added 87). 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/services/download_metadata_embedding.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3533b3e011cae960d008620b8b3b05323c452d9c3b9404e67b52959ec44b318"}},{"ruleId":"D2","level":"warning","message":{"text":"SafFileInspectionKt.inspectSafFiles (cognitive 137): SafFileInspectionKt.inspectSafFiles has cognitive complexity 137 (threshold 15). Drivers by points: if/else 32 (82 pts), loops 14 (30 pts), error handling 6 (16 pts), boolean chains 9 (nesting depth added 76). To reduce it, split the body into named stages: move each independent 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/zarz/mornye/SafFileInspection.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"797883cdd92564c01dcc5ed6cfe3185c9cc60f5bb03efd75492cfea322c59904"}},{"ruleId":"D2","level":"warning","message":{"text":"_NowPlayingScreenState._buildPlayer (cognitive 122): _NowPlayingScreenState._buildPlayer has cognitive complexity 122 (threshold 15). Drivers by points: ternaries 43 (61 pts), boolean chains 35, if/else 20 (26 pts) (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/screens/now_playing_screen.dart"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58f405a0355eb1d195df60725e9a7860b12a52ee8c804ec1bee5a1f002e3bac"}},{"ruleId":"D2","level":"warning","message":{"text":"MainActivitySafScanKt.scanSafTree (cognitive 119): MainActivitySafScanKt.scanSafTree has cognitive complexity 119 (threshold 15). Drivers by points: if/else 50 (80 pts), error handling 11 (23 pts), boolean chains 9, loops 5 (7 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d3b2677fb041e92fc3eb86a1f4011d039787b1208b64dc292a1d5b13f0ce78"}},{"ruleId":"D2","level":"warning","message":{"text":"MainActivitySafScanKt.scanSafTreeIncremental (cognitive 113): MainActivitySafScanKt.scanSafTreeIncremental has cognitive complexity 113 (threshold 15). Drivers by points: if/else 38 (80 pts), loops 8 (15 pts), error handling 6 (12 pts), boolean chains 6 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"27beb115ae2b85c4ffb73284484e603ffcd8c70f0625b9bccae3b00162836bd9"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler._loadIndex (cognitive 112): MusicPlayerHandler._loadIndex has cognitive complexity 112 (threshold 15). Drivers by points: if/else 43 (85 pts), boolean chains 10, error handling 6 (10 pts), ternaries 4 (7 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_service.dart"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe4f2b8e1ad3a7dc23ed4b6b0067e1a59f638c34199acb0ee804ea3d39226f6"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibrarySearchResultsState._buildSlivers (cognitive 112): _LibrarySearchResultsState._buildSlivers has cognitive complexity 112 (threshold 15). Drivers by points: if/else 23 (53 pts), ternaries 12 (35 pts), boolean chains 16, loops 3 (5 pts), error handling 1 (3 pts) (nesting depth added 57). 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/widgets/library_search_results.dart"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"34798cce5f016439bfa4c9b24e98f4988f4ae6f2c9a3713ff964c133383caa5d"}},{"ruleId":"D2","level":"warning","message":{"text":"_SyncedLyricsViewState._buildLyrics (cognitive 107): _SyncedLyricsViewState._buildLyrics has cognitive complexity 107 (threshold 15). Drivers by points: ternaries 35 (52 pts), boolean chains 30, if/else 17 (22 pts), loops 1 (3 pts) (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/widgets/player_lyrics.dart"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d300a6b6ad71137a87bb633ddaaabf6cfdb13959ff8cfc9cb6320e8912ce9c"}},{"ruleId":"D2","level":"warning","message":{"text":"_NetworkStorageScreenState.build (cognitive 103): _NetworkStorageScreenState.build has cognitive complexity 103 (threshold 15). Drivers by points: ternaries 28 (57 pts), if/else 15 (23 pts), boolean chains 21, match/switch 1 (2 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/network_storage_screen.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b0545147cae400aea5d7f90a7b550bcdb138d01ec785d7cb70988ae5cc6248"}},{"ruleId":"D2","level":"warning","message":{"text":"_HomeTabState.build (cognitive 101): _HomeTabState.build has cognitive complexity 101 (threshold 15). Drivers by points: boolean chains 77, if/else 20 (21 pts), ternaries 3 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/home_tab.dart"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b052a9d57cf5e70192e73d77907397ac25ca5e67862bf4f18223a60f985aa4"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueueNotifier._processQueueSingleFlight (cognitive 97): DownloadQueueNotifier._processQueueSingleFlight has cognitive complexity 97 (threshold 15). Drivers by points: if/else 37 (51 pts), boolean chains 30, error handling 7 (15 pts), ternaries 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_queue_provider.dart"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b340dd26b6223d4bfc13f169260a67ef1e79c946297665bbcd0b9ecb0196666"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadRun._handleDownloadSuccess (cognitive 96): _DownloadRun._handleDownloadSuccess has cognitive complexity 96 (threshold 15). Drivers by points: if/else 27 (41 pts), boolean chains 35, ternaries 9 (16 pts), error handling 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_queue_provider_single_item.dart"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23897b3d2c39257742438e89ed22f0e86d94c41a7bc91ad18e396e74e7e69ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionManifest::deserialize (cognitive 96): ExtensionManifest::deserialize has cognitive complexity 96 (threshold 15). Drivers by points: match/switch 23 (49 pts), if/else 23 (46 pts), loops 1 (nesting depth added 49). 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50ea6761fbbb019bb7d3886617eff3ed3f8cdabc962e417cdd1f0357a24b50a"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::download::chunked::download (cognitive 96): mornye_extensions::download::chunked::download has cognitive complexity 96 (threshold 15). Drivers by points: if/else 22 (59 pts), boolean chains 21, match/switch 3 (9 pts), loops 4 (7 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent 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":"rust_backend/crates/extensions/src/download/chunked.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"54eacc8248239dab3f287c1080a268f85824e9616cf45290cf5f7c0df5dbec71"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadHistoryNotifier._inspectOrphanedEntries (cognitive 95): DownloadHistoryNotifier._inspectOrphanedEntries has cognitive complexity 95 (threshold 15). Drivers by points: if/else 17 (57 pts), loops 6 (12 pts), boolean chains 9, error handling 3 (9 pts), ternaries 3 (8 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_history_provider.dart"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"c488b660cde415af14dc386a23b76dafe425882f7df8650b7c3bd8aa21bfe675"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::id3::read_frames (cognitive 94): mornye_core::tags::write::id3::read_frames has cognitive complexity 94 (threshold 15). Drivers by points: if/else 42 (79 pts), boolean chains 7, loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent 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":"rust_backend/crates/core/src/tags/write/id3.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee11f08054ecb5940115508d86f7be1f1b85af97677c1f065cefcdca2f5ce45"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::riff::edit (cognitive 94): mornye_core::tags::write::riff::edit has cognitive complexity 94 (threshold 15). Drivers by points: if/else 46 (82 pts), boolean chains 8, match/switch 1 (3 pts), loops 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/tags/write/riff.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"17368c3480ebe031a8cc28a034d19f4a534b3be971ac4bfeb27ab31f1f12bea2"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsParser._parseTtml (cognitive 92): LyricsParser._parseTtml has cognitive complexity 92 (threshold 15). Drivers by points: if/else 13 (41 pts), ternaries 6 (24 pts), loops 6 (17 pts), boolean chains 9, error handling 1 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/utils/lyrics_parser.dart"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce10193737a44db6f77a83f8e1e6ed583ef818f14caf6709256256693e3af1b8"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_autoplay_taste::execute (cognitive 92): mornye_mobile::native_autoplay_taste::execute has cognitive complexity 92 (threshold 15). Drivers by points: if/else 23 (55 pts), loops 15 (30 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_autoplay_taste.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca654a4a6fa65ec31aa6d63fae5e479d922243e4542b128bf8e540496da29197"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::download::download (cognitive 91): mornye_extensions::download::download has cognitive complexity 91 (threshold 15). Drivers by points: if/else 32 (68 pts), boolean chains 15, match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent 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":"rust_backend/crates/extensions/src/download.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5748df9e0a81f29e4c3c02a74847b5feb01cbcd74c22c756b9e8fbce251d839"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::plan_download (cognitive 90): Backend::plan_download has cognitive complexity 90 (threshold 15). Drivers by points: if/else 40 (72 pts), boolean chains 10, match/switch 4 (7 pts), loops 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/downloads.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68e2b6fe1a2ce2657bd6be3729201dacd29387fe555922f49222154164d1731"}},{"ruleId":"D2","level":"warning","message":{"text":"_PlaybackSettingsPageState.build (cognitive 88): _PlaybackSettingsPageState.build has cognitive complexity 88 (threshold 15). Drivers by points: if/else 25 (47 pts), boolean chains 20, ternaries 8 (17 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/settings/playback_settings_page.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b668fbe39f1d742dcb8672c7b9fa927f41af0f9c0b9b5d081296ca47fae1e7dc"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackNotifier.fetchFromUrl (cognitive 86): TrackNotifier.fetchFromUrl has cognitive complexity 86 (threshold 15). Drivers by points: if/else 19 (49 pts), ternaries 6 (24 pts), boolean chains 10, loops 1 (2 pts), error handling 1 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/track_provider.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8246647961b0f623a02d7a70c59f23240d5692a2be19e0bd642951a2315fba7c"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFinalizerMediaKt.embedBasicMetadata (cognitive 84): NativeFinalizerMediaKt.embedBasicMetadata has cognitive complexity 84 (threshold 15). Drivers by points: if/else 47 (65 pts), boolean chains 15, error handling 1 (2 pts), loops 1 (2 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerMedia.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5adbbd5e880f4c9da9c751136beb80c1aef2601264b1d6b9c7e8def22e7e734"}},{"ruleId":"D2","level":"warning","message":{"text":"_QueueTabState.build (cognitive 82): _QueueTabState.build has cognitive complexity 82 (threshold 15). Drivers by points: boolean chains 31, if/else 25 (31 pts), ternaries 17 (18 pts), match/switch 2 (nesting depth added 7). 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/screens/queue_tab.dart"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"348dac709ebf4426e5893505934e14c370db566f3f7ce59f37079c50dfd8ddfb"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicGapless._prepare (cognitive 81): _MusicGapless._prepare has cognitive complexity 81 (threshold 15). Drivers by points: if/else 24 (57 pts), boolean chains 12, ternaries 5 (8 pts), error handling 2 (4 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_gapless.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad73b11fc7986b92757a8b409722dc60aef6f256318068d62bbc7a6236d1801"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibrarySettingsPageState.build (cognitive 79): _LibrarySettingsPageState.build has cognitive complexity 79 (threshold 15). Drivers by points: ternaries 29 (56 pts), boolean chains 15, if/else 5 (7 pts), loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/settings/library_settings_page.dart"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d868951987b0a48816d10a6c3f54886a027554b3b3019a710f57b6b17d0f01"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionManager::provider_operation_value (cognitive 77): ExtensionManager::provider_operation_value has cognitive complexity 77 (threshold 15). Drivers by points: if/else 29 (51 pts), loops 4 (12 pts), boolean chains 7, match/switch 5 (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":"rust_backend/crates/extensions/src/manager/providers.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bacfeab4b56a7ba301eddef707b1183f1bcf5feba9d429e735158c765abd2a"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataAutofillService.enrich (cognitive 76): MetadataAutofillService.enrich has cognitive complexity 76 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 19, error handling 4 (9 pts), ternaries 8, loops 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/services/metadata_autofill_service.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afac6eff84f21e5c554b607554781be793d57c01ed6f8ac86205f4f237ec16c"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::scan_library (cognitive 76): Backend::scan_library has cognitive complexity 76 (threshold 15). Drivers by points: if/else 29 (52 pts), loops 10 (17 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/library/scan.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"befbbc45e2a39a7d10479dc77e63a17db501db050777a6ec49e6657b8a96ae1e"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerPlaybackControls.build (cognitive 75): PlayerPlaybackControls.build has cognitive complexity 75 (threshold 15). Drivers by points: ternaries 28 (47 pts), if/else 15 (20 pts), boolean chains 8 (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/widgets/player_playback_controls.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"31807a3bb1919f743d0974bafe97c4f17759bc83cc146342099a89e479c0239b"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkStorageService.parseListing (cognitive 74): NetworkStorageService.parseListing has cognitive complexity 74 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 25, loops 4 (7 pts), error handling 1 (4 pts), ternaries 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/network_storage_service.dart"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f4eeb85896a260d594d60308b07d455d33309d46ee6275ad1d3be1ac91df2e"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::usb_audio::descriptors::parse (cognitive 74): mornye_mobile::usb_audio::descriptors::parse has cognitive complexity 74 (threshold 15). Drivers by points: if/else 17 (51 pts), boolean chains 12, loops 3 (9 pts), match/switch 1 (2 pts) (nesting depth added 41). 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":"rust_backend/crates/mobile/src/usb_audio/descriptors.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"921ab0788f9a957cb0429694733747a7df15af546d3da17159e6200b1df9ce4a"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupService._parseArchive (cognitive 73): BackupService._parseArchive has cognitive complexity 73 (threshold 15). Drivers by points: if/else 19 (54 pts), boolean chains 12, error handling 2 (4 pts), loops 1 (3 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent 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/services/backup_service.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0478db26db9e18e9b1b69fa10008e9c97fe1f7aeabf940cd79467144b1a348"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupService.writeBackupArchive (cognitive 72): BackupService.writeBackupArchive has cognitive complexity 72 (threshold 15). Drivers by points: if/else 21 (48 pts), loops 5 (16 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent 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/services/backup_service.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af100d4488e8bf341d5289dbabf3ad37506eacc200fa6142b1a1ec915c0fb41"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::download::segments::download (cognitive 71): mornye_extensions::download::segments::download has cognitive complexity 71 (threshold 15). Drivers by points: if/else 16 (49 pts), loops 6 (13 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 44). 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":"rust_backend/crates/extensions/src/download/segments.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0a531bb9c95b1679d7228b73c85312388dfcc99aeb220c7a9252bf35d8974d"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::download_attempt (cognitive 70): Backend::download_attempt has cognitive complexity 70 (threshold 15). Drivers by points: if/else 38 (49 pts), boolean chains 16, loops 2 (4 pts), match/switch 1 (nesting depth added 13). 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":"rust_backend/crates/extensions/src/backend/downloads.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5647b3c8dafb478b1b5ad56b51e2407caa94e57375a701bbc86973ffd859ac"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadRun._run (cognitive 67): _DownloadRun._run has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (46 pts), error handling 3 (7 pts), ternaries 3 (6 pts), boolean chains 4, loops 2 (4 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"40456724ee688721fa34b1660a4e59415e2cca287df2a16ed92ea0a1eeb2393e"}},{"ruleId":"D2","level":"warning","message":{"text":"RepoExtension::deserialize (cognitive 67): RepoExtension::deserialize has cognitive complexity 67 (threshold 15). Drivers by points: if/else 20 (40 pts), match/switch 20 (26 pts), loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/repository/model.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8d6a7de8a3438068b243cc7a17186dfe54b68a070caa1579b2752776638fc6"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsTranslator.translate (cognitive 66): LyricsTranslator.translate has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 11, loops 8 (10 pts), ternaries 6 (8 pts), error handling 2 (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/services/lyrics_translation.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b65ae23545ac890fc202ef659d845e36a46eae2e15cc8025ddd1016f43f495"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsParser._parseLrcOrPlain (cognitive 65): LyricsParser._parseLrcOrPlain has cognitive complexity 65 (threshold 15). Drivers by points: if/else 14 (38 pts), ternaries 6 (15 pts), boolean chains 6, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 36). 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/utils/lyrics_parser.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a3c8555049802ecbf7bb60145ee501dc8a2f4dc1452f4d0c8dc22c3bfa1bd3"}},{"ruleId":"D2","level":"warning","message":{"text":"_AudioFacts._output (cognitive 65): _AudioFacts._output has cognitive complexity 65 (threshold 15). Drivers by points: if/else 28 (40 pts), ternaries 7 (15 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/audio_info_sheet.dart"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34d475e417c4ff000b073b7d2f4a8bc28b593b82f916d049ea48d57df7a3e96"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadService.processConcurrentNativeRequest (cognitive 65): DownloadService.processConcurrentNativeRequest has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (45 pts), error handling 4 (9 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"622e72b02248db3159bc4838d18732418c5e198bbdfad54ef7fdda84ddcc3c11"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::cue::parse (cognitive 65): mornye_core::cue::parse has cognitive complexity 65 (threshold 15). Drivers by points: if/else 25 (55 pts), match/switch 2 (8 pts), boolean chains 1, loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent 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":"rust_backend/crates/core/src/cue.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff733e184f92f3bdde5043886ecf6c2a5b94438c85dc97c9410df764635578a"}},{"ruleId":"D2","level":"warning","message":{"text":"ApkDownloader.downloadApk (cognitive 64): ApkDownloader.downloadApk has cognitive complexity 64 (threshold 15). Drivers by points: if/else 22 (49 pts), boolean chains 6, ternaries 2 (4 pts), error handling 2 (3 pts), loops 1 (2 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/apk_downloader.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1856f6002e35ec9e2173a2d5faa2f4458cee490ab244c7794cd798d2829441bf"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkLibraryExecutor.call (cognitive 64): LinkLibraryExecutor.call has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 13, loops 4 (8 pts), ternaries 1 (2 pts), match/switch 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/services/link/desktop/link_library_executor.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3be2912183d2de37ba0671876e233ca5ddc67a7b02472aee1ed782e77aee0d"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::resolve_reenrich_request (cognitive 64): Backend::resolve_reenrich_request has cognitive complexity 64 (threshold 15). Drivers by points: if/else 16 (51 pts), boolean chains 8, loops 1 (5 pts) (nesting depth added 39). 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":"rust_backend/crates/extensions/src/backend/reenrich.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e83247523bc79b6c634bbb8ba11da6750a0981aa539356f455355950a0f1a3"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadFileRecovery._recover (cognitive 63): DownloadFileRecovery._recover has cognitive complexity 63 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 15, ternaries 5 (9 pts), loops 3 (5 pts), error handling 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":"lib/services/download_file_recovery.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d0ed31ba9dd38374c80ebcbddd2ac673e0a36adc3146b53652e069763d27a5"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicAutoMix._prepare (cognitive 63): _MusicAutoMix._prepare has cognitive complexity 63 (threshold 15). Drivers by points: if/else 20 (44 pts), boolean chains 8, ternaries 4 (6 pts), error handling 2 (5 pts) (nesting depth added 29). 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/services/music_player_automix.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"84050d239f18364d23a861fd348bdead3f713cc4b03f650b12ed80bb491ae09c"}},{"ruleId":"D2","level":"warning","message":{"text":"MornyePlayerLayout.build (cognitive 62): MornyePlayerLayout.build has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 29 (42 pts), boolean chains 11, if/else 6 (7 pts), loops 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/widgets/mornye_player_layout.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2664ca680688552d4fbd20156a1770e3dbf04555f963d61f622bd3fdb55b54f"}},{"ruleId":"D2","level":"warning","message":{"text":"SafDownloadHandler.handleSafLocked (cognitive 62): SafDownloadHandler.handleSafLocked has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (49 pts), boolean chains 7, error handling 3 (6 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b5bbb5688c96a7c5267826bc1e5f2096f39f2bd040ba4a758127b2784fe279"}},{"ruleId":"D2","level":"warning","message":{"text":"_LinkSyncHandlers.star (cognitive 61): _LinkSyncHandlers.star has cognitive complexity 61 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 6 (17 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent 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/services/link/sync/link_sync_handlers.dart"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"372194709ae7da444748f00562e01d71b0686cea5017642c7d8567da9970cd16"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkWebCovers._run (cognitive 60): LinkWebCovers._run has cognitive complexity 60 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 7 (17 pts), error handling 2 (4 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent 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/services/link/desktop/link_web_covers.dart"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b831b88a7cd6c9b9a15c5d27a8ce29d40f11db099b01dbef0d670c8c61080a"}},{"ruleId":"D2","level":"warning","message":{"text":"LibrarySchema.rebaseContainerPaths (cognitive 58): LibrarySchema.rebaseContainerPaths has cognitive complexity 58 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 7 (13 pts), ternaries 3 (8 pts), boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/library_schema.dart"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf75bab8466e12975fa8de3330ecab53cd161f6332e88112e6838645c9e6fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsDraft.parse (cognitive 58): LyricsDraft.parse has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 8 (12 pts), ternaries 6 (12 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/utils/lyrics_draft.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9fe9e58cec6c16a400f9e61618ef02d9a53e321b2a1ac6c7b3855e9621fcff"}},{"ruleId":"D2","level":"warning","message":{"text":"_MiniPlayerBodyState.build (cognitive 58): _MiniPlayerBodyState.build has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 25 (41 pts), if/else 10 (11 pts), boolean chains 6 (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/widgets/mini_player.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a87b545259bb587fd0190afe794d22706c6a6e6b36c5847d63cb03cee92db39"}},{"ruleId":"D2","level":"warning","message":{"text":"_MornyeArtworkContrastState._sample (cognitive 58): _MornyeArtworkContrastState._sample has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 19, loops 4 (10 pts), ternaries 2 (6 pts), error handling 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/widgets/mornye_artwork_contrast.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fbe2837898a15ce624f471dee2e9f4069b3369c65194242b1cecd4263aa959"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::media::hires::check_file (cognitive 58): mornye_core::media::hires::check_file has cognitive complexity 58 (threshold 15). Drivers by points: if/else 28 (34 pts), boolean chains 12, loops 4 (8 pts), match/switch 2 (4 pts) (nesting depth added 12). 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":"rust_backend/crates/core/src/media/hires.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de3e12dca001220b70e1e9789ebc1d72d715d2034a43fa6642a453aade28f49"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::file_host::call (cognitive 58): mornye_extensions::file_host::call has cognitive complexity 58 (threshold 15). Drivers by points: if/else 24 (50 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 30). 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":"rust_backend/crates/extensions/src/file_host.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8d78b5e5c64a65a4637e7ffbc16778b73ac87c0be43543d9e806c01e1c31f5"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::usb_audio::volume::feature (cognitive 58): mornye_mobile::usb_audio::volume::feature has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (41 pts), boolean chains 7, match/switch 2 (6 pts), loops 3 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent 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":"rust_backend/crates/mobile/src/usb_audio/volume.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc451ee914f341c105621e960b81331a8c275b9fbdd37ff1c6b1f78e71f2ab79"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibraryTracksFolderScreenState._buildAppBar (cognitive 57): _LibraryTracksFolderScreenState._buildAppBar has cognitive complexity 57 (threshold 15). Drivers by points: boolean chains 21, if/else 10 (17 pts), ternaries 14 (15 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/library_tracks_folder_screen.dart"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"8956725fcbdc475de1fb9a39230ae0e518a2507c3ebf6856df9c58f7b1992e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::run (cognitive 57): Session::run has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (47 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/usb_audio/transport.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b64f2761e1505421218bf2b2716e98dafa01a3cbdd7c3399c34edd155001f8"}},{"ruleId":"D2","level":"warning","message":{"text":"_ArtistScreenState._buildPage (cognitive 56): _ArtistScreenState._buildPage has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 15, ternaries 5 (8 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/screens/artist_screen.dart"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"882e500fcd2f0e9624fa06a851288a361d0677219a12506d20f9040db4108945"}},{"ruleId":"D2","level":"warning","message":{"text":"_SetupScreenState._selectDirectory (cognitive 56): _SetupScreenState._selectDirectory has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (46 pts), ternaries 1 (5 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 36). 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/screens/setup_screen.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"07560c66794a906b30a7e06f0e2d9dcffe77ffb5234ef15e3b343839590595f9"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::flac_header (cognitive 56): mornye_core::tags::write::flac_header has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (43 pts), loops 5 (10 pts), boolean chains 3 (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":"rust_backend/crates/core/src/tags/write.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c69320e8f426b236d5d41f0658c6a9b4e6b57861b08c030c092baf4310aaa13"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadRun._applyFormatHandling (cognitive 55): _DownloadRun._applyFormatHandling has cognitive complexity 55 (threshold 15). Drivers by points: boolean chains 32, if/else 13 (19 pts), ternaries 2 (4 pts) (nesting depth added 8). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_queue_provider_single_item.dart"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c14cb6a909f9764592924f349eb17b3270bf7961f1a27d251f5e55815154c6"}},{"ruleId":"D2","level":"warning","message":{"text":"MotionArtworkProxy._handle (cognitive 55): MotionArtworkProxy._handle has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 4 (13 pts), boolean chains 8, error handling 3 (5 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/motion_artwork_proxy.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf273da692e3147d046d2d5608b468afb26fa332943a144c8bbc9c2b7a940f4"}},{"ruleId":"D2","level":"warning","message":{"text":"SignedSessionClient::signed_fetch (cognitive 55): SignedSessionClient::signed_fetch has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (43 pts), boolean chains 8, match/switch 2 (3 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/signed_session/fetch.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"306b5f548b6962cfbaba6c4d08eba9133669259b9fee9e23576aac17a388e3ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::search (cognitive 55): Inner::search has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (41 pts), match/switch 2 (7 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/providers/src/lyrics/service.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eee3e66c5a86b398710830a4cdaa5934ed47fab28d5baa7465f27f956704bf7"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueueWidgetProvider.render (cognitive 54): DownloadQueueWidgetProvider.render has cognitive complexity 54 (threshold 15). Drivers by points: if/else 29 (49 pts), boolean chains 4, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/DownloadQueueWidgetProvider.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a302f2646b6a02049b2d7d67bee9731b5e7c943d148f65ef7119f078dddb20a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::reenrich_file (cognitive 54): Backend::reenrich_file has cognitive complexity 54 (threshold 15). Drivers by points: if/else 25 (47 pts), boolean chains 5, loops 1, match/switch 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":"rust_backend/crates/extensions/src/backend/reenrich.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2084e81d2f18855baf875f6b1c85ec8a6b1af24e41a82f0acb931824bb5e487c"}},{"ruleId":"D2","level":"warning","message":{"text":"MornyeGlass.build (cognitive 53): MornyeGlass.build has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 23 (28 pts), boolean chains 20, if/else 3 (5 pts) (nesting depth added 7). 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/widgets/mornye_chrome.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b78e314c0e48d6de0c91476c1df087242023b55e5e24e5ee487b01b4caa519"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::media::audio::riff_quality (cognitive 53): mornye_core::media::audio::riff_quality has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 12, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/media/audio.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4240fe1459ea1cf000d3d37cc2e94218e8c014aa1916b5d0df1cba8956732d"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::id3::frames (cognitive 53): mornye_core::tags::id3::frames has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 14, loops 2 (4 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":"rust_backend/crates/core/src/tags/id3.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6df462d434d7fb5e7f5851da351e6ef268372ab22c5f02dd5c2457831f10aea"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionManifest::validate (cognitive 53): ExtensionManifest::validate has cognitive complexity 53 (threshold 15). Drivers by points: if/else 29 (41 pts), boolean chains 8, loops 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc089dec828728164584cf51377abb604fe73ed8b8ca8aedbde31bf0cdaed86"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::filenameMetadata::visit (cognitive 53): (anonymous)::filenameMetadata::visit has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 7 (17 pts), boolean chains 8, loops 3 (5 pts), error handling 3 (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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b12346696a0d13b895b59ebdb88a0eaa03c8d261e798acb8d4185a6b6ebc71"}},{"ruleId":"D2","level":"warning","message":{"text":"RustCoreBackend.invokeApplication (cognitive 52): RustCoreBackend.invokeApplication has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (35 pts), ternaries 5 (11 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 22). Of this number, 51 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/CoreBackend.swift"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dd08a4aece6cb56d5b4ddfa6507cbdeb5606e74bcd5fa13c853543a86aeb43"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::mp4::edit (cognitive 52): mornye_core::tags::write::mp4::edit has cognitive complexity 52 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 6 (7 pts), boolean chains 2 (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":"rust_backend/crates/core/src/tags/write/mp4.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"44726cf7cae46380ee766c542bf703fdc6223f7c4fdd8358e034cb486677258b"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDownloadFinalizer.finalize (cognitive 51): NativeDownloadFinalizer.finalize has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (28 pts), error handling 11 (20 pts), boolean chains 3 (nesting depth added 14). 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0707621c780218fd34a81a746d9ebd626512c1e8efedec60d1e54c7d19103cba"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::download::segments::fetch (cognitive 51): mornye_extensions::download::segments::fetch has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 7, loops 3 (7 pts), match/switch 2 (7 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent 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":"rust_backend/crates/extensions/src/download/segments.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a9fdfee58980a91005c35855b45eebbed5e97abdefe2ec76ae905906ce9c61"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_library::import (cognitive 51): mornye_mobile::native_library::import has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 5 (10 pts), match/switch 1 (2 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":"rust_backend/crates/mobile/src/native_library.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51cd8be979ba08b3b169c8546daaf1c12b8ac31e1da2c2b7211036d8c769c9b"}},{"ruleId":"D2","level":"warning","message":{"text":"ExploreNotifier._restoreFromCache (cognitive 50): ExploreNotifier._restoreFromCache has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (38 pts), ternaries 3 (6 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/explore_provider.dart"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2274518311d8c6f65ceb5dd85bb0856186ad9077f83b7bceffeb9cf24993d7"}},{"ruleId":"D2","level":"warning","message":{"text":"_MornyeLibraryScreenState.build (cognitive 50): _MornyeLibraryScreenState.build has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (35 pts), boolean chains 6, ternaries 4 (6 pts), loops 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/mornye_library_screen.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"387b0b5b44caa58f9729bb02715e58e4de0cee4fe3cd040a021b37ba5f672415"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadFileFinalizer.autoConvert (cognitive 50): DownloadFileFinalizer.autoConvert has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 10, ternaries 4 (7 pts), error handling 4 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/download_file_finalizer.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d930125bfe930983ffb1136c5deb9cebe990e2c04c24cf802a589069e04badde"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkDesktopRemote._applyLocally (cognitive 50): LinkDesktopRemote._applyLocally has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 6 (18 pts), if/else 9 (16 pts), boolean chains 13, match/switch 2 (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":"lib/services/link/features/link_desktop_remote.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"096a9bdc9ee7ba2d793aac96c218bc3cd045902e2be882aa327a75c72915c969"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollectionSyncStore._withData (cognitive 50): LinkCollectionSyncStore._withData has cognitive complexity 50 (threshold 15). Drivers by points: loops 15 (24 pts), if/else 9 (23 pts), ternaries 1 (2 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/services/link/sync/link_collection_sync_store.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb05059ae577f6040c767f14cd5960b22f504da16fbda2f0cae91ead430421c"}},{"ruleId":"D2","level":"warning","message":{"text":"DsdFile.readFrames (cognitive 50): DsdFile.readFrames has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 4 (10 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/DsdFile.kt"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0004511abdf1b294ef0dfdd117168a6ee78cb3137e9f2cd1e24c5f88534427d7"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::media::audio::mp3_quality (cognitive 50): mornye_core::media::audio::mp3_quality has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 10, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/media/audio.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d644908b177951563b694aacc5238ef1748bd4efa98ac4fdd30d512f406a311"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::native_palette::wsmeans (cognitive 50): mornye_core::native_palette::wsmeans has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 10 (21 pts), boolean chains 1 (nesting depth added 28). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/native_palette.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f93ca3e031f99279cd1485f8a7ae2b42c2cec5f1558763ec2ca42b23aca16c"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_directory_stats::scan (cognitive 50): mornye_mobile::native_directory_stats::scan has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (42 pts), match/switch 2 (7 pts), loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_directory_stats.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b2481f66fe72ddad2f7400bbdb46452d815969840de88a36d2ae3b84782799"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_lyrics::lrc::parse_lrc (cognitive 50): mornye_mobile::native_lyrics::lrc::parse_lrc has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 3 (5 pts), boolean chains 4, match/switch 1 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_lyrics/lrc.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1f520f5beeff6b173f26c7ab66475f6660206a3ed36dd0cc15d9ac67533326"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkHistorySyncStore.apply (cognitive 49): LinkHistorySyncStore.apply has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 7 (19 pts), if/else 7 (13 pts), loops 7 (10 pts), boolean chains 7 (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/services/link/sync/link_history_sync_store.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7722a46cb789e71cbe87c1eb73b64f34edbcb97c0258c7f8c0aaeec3f22d9f16"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::native_audio_analysis::estimate_spectral_cutoff (cognitive 49): mornye_core::native_audio_analysis::estimate_spectral_cutoff has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 9 (13 pts), boolean chains 5 (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":"rust_backend/crates/core/src/native_audio_analysis.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dabcb2892616c7c43de4e784a704fffa515024c84a176f2cb5722c3ad37e66c"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::ape::edit (cognitive 49): mornye_core::tags::write::ape::edit has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 6, boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/tags/write/ape.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb0fc0d36186b9de5e397dbcf3db5399e78561d7a7e49d83d1a90874720b119"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadedEmbeddedCoverResolver._drainPreviewValidations (cognitive 48): DownloadedEmbeddedCoverResolver._drainPreviewValidations has cognitive complexity 48 (threshold 15). Drivers by points: if/else 7 (27 pts), ternaries 2 (8 pts), error handling 2 (7 pts), boolean chains 4, loops 1 (2 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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"832846bc84ec574d1c7e70900337a8ae37da91cb2aab1c323929d2ed0fb518b9"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadedEmbeddedCoverResolver._extractCover (cognitive 48): DownloadedEmbeddedCoverResolver._extractCover has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 6, ternaries 2 (4 pts), error handling 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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"d747204bf07aa6bc5ec8e7309fea983d30223c4d9619e0a8082df07f877aacbe"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkHistoryArtwork.sync (cognitive 48): LinkHistoryArtwork.sync has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 7 (12 pts), boolean chains 8 (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/services/link/sync/link_history_artwork.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd97cd152e374f6c229af0fca732e1475954e2338b8eb6953517d490036ed4da"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler.onSourceMetadataChanged (cognitive 48): MusicPlayerHandler.onSourceMetadataChanged has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 7, loops 2 (5 pts), ternaries 2 (5 pts) (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/services/music_player_service.dart"},"region":{"startLine":2554}}}],"partialFingerprints":{"codehealthFindingId/v1":"9408d4af8bb5fcbb1a7712d2e52585c62ed7601f12268085ff48845b5645c41d"}},{"ruleId":"D2","level":"warning","message":{"text":"SongFeatureAnalyzer.analyze (cognitive 47): SongFeatureAnalyzer.analyze has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (35 pts), error handling 4 (5 pts), loops 2 (4 pts), boolean chains 3 (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/services/song_feature_analyzer.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d152dc7157c8be254c7de5bc1be54e9a061532ad2d8530816b77c586db93258"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkOfflineSaver.save (cognitive 46): LinkOfflineSaver.save has cognitive complexity 46 (threshold 15). Drivers by points: if/else 7 (24 pts), error handling 5 (18 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/features/link_save_offline.dart"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a24f2642150bf5fcc9c7fb7bef5b8ade14bc3db7243f1c43b4e2e85ebea54f"}},{"ruleId":"D2","level":"warning","message":{"text":"RustCoreBackendApplicationKt.dispatchApplication (cognitive 46): RustCoreBackendApplicationKt.dispatchApplication has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (30 pts), match/switch 5 (8 pts), error handling 3 (6 pts), boolean chains 2 (nesting depth added 17). 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":"android/app/src/rust/kotlin/com/zarz/mornye/RustCoreBackendApplication.kt"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5110901a9ad64acfedd68646a19c1c159e2a7cf2c3cbf6bd0ed74fbffac7023a"}},{"ruleId":"D2","level":"warning","message":{"text":"_SetupScreenState._requestStoragePermission (cognitive 45): _SetupScreenState._requestStoragePermission has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (41 pts), boolean chains 3, error handling 1 (nesting depth added 25). 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/screens/setup_screen.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e0c29c9bb566d895992d835cf439b9d53340f6031e15c6e47518c6b3cdaeed"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkClientSession._connect (cognitive 45): LinkClientSession._connect has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 7, ternaries 2 (5 pts), error handling 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/services/link/client/link_client_session.dart"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c959002cc58d8c7dcfdf8e07e2adfde27b3518801ef35cd40ae521959bcf1c41"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkOfflineNotifier.save (cognitive 44): NetworkOfflineNotifier.save has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 11, ternaries 3 (7 pts), loops 3 (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/providers/network_offline_provider.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c430d5e212e38f4f5e346050f66c9f3c8f84f6d1e37c3fc4f46c9da3553e52"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibraryTracksFolderScreenState.build (cognitive 44): _LibraryTracksFolderScreenState.build has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 9 (16 pts), match/switch 4, boolean chains 3, loops 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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e0009a2d354eedc3b9861fea2eedf907b7cb51d4063b69d31e5f49ff72748d"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioAnalysisCache.trim (cognitive 44): AudioAnalysisCache.trim has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 3 (7 pts), error handling 2 (5 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent 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/services/audio_analysis_cache.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03cb25073d6b9242e6690ef7c2f6dcee3a366d021a7b9f2b026aeff6ddc4f91"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadedEmbeddedCoverResolver._runPersistentCacheMaintenance (cognitive 44): DownloadedEmbeddedCoverResolver._runPersistentCacheMaintenance has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 8, error handling 2 (4 pts), loops 2, ternaries 1 (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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0a18a14129ccf67cfff45ff9dfd767b794ba5bbf22e97f3bb54ac47a46ccb3"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataPersistenceService._saveLocal (cognitive 44): MetadataPersistenceService._saveLocal has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (23 pts), error handling 4 (9 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/metadata_persistence_service.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cc2d0e94a7297d84dbf377433685764c775071b70c385a98b9ae228f020077"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkStorageService._request (cognitive 44): NetworkStorageService._request has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 14, ternaries 3 (6 pts), error handling 3 (4 pts), loops 1 (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":"lib/services/network_storage_service.dart"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"970c2901b3c0a839fdc0715969c6b4469a279dd6d9b5cfb20f40c4d507952022"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::file_transform::transform (cognitive 44): mornye_extensions::file_transform::transform has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 9, match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/file_transform.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d69790f5a66f45a5d0c6c2af69744060ff9793c286f2782e5b2169cc0f5bf7"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoplayPreferenceModel.decode (cognitive 43): AutoplayPreferenceModel.decode has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 17, loops 2 (4 pts), ternaries 1 (2 pts), 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/services/autoplay_personalization.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"118017347a431f088a82fd529ee940e0211d5bd20a2f652c0a7c7de692baf3b0"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadScheduler.run (cognitive 43): DownloadScheduler.run has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (29 pts), loops 3 (9 pts), boolean chains 3, error handling 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent 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/services/download_scheduler.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b773a33cb1bda50739f996d87454a831c41e1e0bc07790789b4f8e6af850492f"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryQueueStore._queueAlbumUnionSql (cognitive 43): LibraryQueueStore._queueAlbumUnionSql has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 16 (29 pts), boolean chains 7, if/else 5 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/library_queue_store.dart"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e50f50bb8c972e8d216cd58da886f6c85dc2979d15008f172a461faf622bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioplayersPlaybackDeck.setFileSource (cognitive 43): AudioplayersPlaybackDeck.setFileSource has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (25 pts), ternaries 2 (8 pts), boolean chains 6, error handling 2 (4 pts) (nesting depth added 23). 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/services/music_playback_deck.dart"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e0d01cea97c13a0f447e0d1dfbce373fe06176858728d539a437b3433b868f"}},{"ruleId":"D2","level":"warning","message":{"text":"_TrackTableRowViewState.build (cognitive 43): _TrackTableRowViewState.build has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 18 (25 pts), if/else 7 (11 pts), boolean chains 6, match/switch 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/widgets/desktop/track_table.dart"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40fb17b4ae1402c784249f1c9ed6e1f1b1055dc0ebbc78934e1d08278f13945"}},{"ruleId":"D2","level":"warning","message":{"text":"_TimedLyricSweepPainter.paint (cognitive 43): _TimedLyricSweepPainter.paint has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 5 (11 pts), loops 6 (8 pts), boolean chains 7 (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/widgets/player_lyrics_word_sweep.dart"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f19b3a0078d73a0e7536254ba17be35f330d0232af1315413e62266c943c039"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::cache_cover (cognitive 43): Backend::cache_cover has cognitive complexity 43 (threshold 15). Drivers by points: if/else 29 (34 pts), boolean chains 6, match/switch 2 (3 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":"rust_backend/crates/extensions/src/backend/cover.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"af04cf06ee6f44b05061bceb658678bc4ece74fdbf50db9337f53c6ae84d880c"}},{"ruleId":"D2","level":"warning","message":{"text":"FilePath::open_native_read (cognitive 43): FilePath::open_native_read has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (35 pts), match/switch 2 (4 pts), boolean chains 3, loops 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":"rust_backend/crates/extensions/src/files.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba513103b263f2b62f13d7b144e843cb6d0e56a35d46bbbfbef3f1950bcba350"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_lyrics::ttml::parse_ttml (cognitive 43): mornye_mobile::native_lyrics::ttml::parse_ttml has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 5 (8 pts), boolean chains 4 (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":"rust_backend/crates/mobile/src/native_lyrics/ttml.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c31f6eb399043c3baaf6bec072f774eb78489c8104fddacc130753dbb48f0c3"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkSession::execute_stream (cognitive 43): NetworkSession::execute_stream has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 3 (11 pts), boolean chains 4 (nesting depth added 26). 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":"rust_backend/crates/network/src/client.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"0feb31c788f87844b7754d81a6af37a60060b88b8843a892960382cf13113cad"}},{"ruleId":"D2","level":"warning","message":{"text":"_MixBuilder.build (cognitive 42): _MixBuilder.build has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 8 (9 pts), boolean chains 5, ternaries 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/services/library_mixes.dart"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"256f331bfb79a24e35ad0098bf59294cc60805cd17a10937c9a3ec1a5e76f68e"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkLibraryJobsHost.handle (cognitive 42): LinkLibraryJobsHost.handle has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 12, loops 4 (6 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/services/link/desktop/link_library_jobs_host.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"af760178caf8d5fcd2a19ecdc28007e91f608d7213a27977e4abd8fde8032922"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicHapticsAnalyzer.analyze (cognitive 42): MusicHapticsAnalyzer.analyze has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (31 pts), error handling 3 (5 pts), boolean chains 4, loops 1 (2 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":"lib/services/music_haptics.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0555250a02cc604c91f808aa3af21c2ca247d6e502aa40b1cf8458ef0c0faf1c"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkStorageService._openRead (cognitive 42): NetworkStorageService._openRead has cognitive complexity 42 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 6 (13 pts), error handling 5 (11 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/network_storage_service.dart"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"30aa987d6b7f9479303fcccf4a067f3a374463951be99397e1ef1aa6d176eaa1"}},{"ruleId":"D2","level":"warning","message":{"text":"_SyncedLyricsViewState._maybeAutoScroll (cognitive 42): _SyncedLyricsViewState._maybeAutoScroll has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 16, ternaries 6 (9 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/widgets/player_lyrics.dart"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"0516c8d389b11db7b66ce8f8b2bc5085443ad9e645577c96a1aaecf78851a84b"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::metadata::musicbrainz::casing::title (cognitive 42): mornye_core::metadata::musicbrainz::casing::title has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 26). 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":"rust_backend/crates/core/src/metadata/musicbrainz/casing.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7516e35dad6bbd2b3bbc4c39556e015437f46ba4e7123e0e2ab4c80c64baef1"}},{"ruleId":"D2","level":"warning","message":{"text":"CookieJar::store (cognitive 42): CookieJar::store has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 7, match/switch 1 (2 pts), loops 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":"rust_backend/crates/network/src/cookies.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5483dbb0c87ee89db9f2a14f261360ccfacad9a63c4686f23247353d347183"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverDownloadService.saveRemoteCover (cognitive 41): CoverDownloadService.saveRemoteCover has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 5, ternaries 2 (3 pts), error handling 1 (2 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":"lib/services/cover_download_service.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6d8acd39ea9d256585a22de077da30c7b28795626985f7ec4150317be066fc"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateChecker.checkForUpdate (cognitive 41): UpdateChecker.checkForUpdate has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (28 pts), ternaries 2 (6 pts), loops 2 (5 pts), boolean chains 1, error handling 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/services/update_checker.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f716737ab221e32ab67a3c899a5b8fa5d69045397f1002da040e65813423398c"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::id3::edit_header (cognitive 41): mornye_core::tags::write::id3::edit_header has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 6 (8 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/tags/write/id3.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"709cd3b63c20c95efb8f100bf1ba8cb5008b23aafe62357d6bfc6095cddda0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerMetadataController.load (cognitive 40): PlayerMetadataController.load has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 9, 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/controllers/player_metadata_controller.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"619079eff0e199730b6f63f89121fec9af1720662a67dd69725e12c42f6b4b96"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaybackController.playTrackList (cognitive 40): PlaybackController.playTrackList has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 3 (5 pts), ternaries 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/playback_provider.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf503f5f90528c97351f885fd57734b802d1836f9118298fedb3719d8eee7f11"}},{"ruleId":"D2","level":"warning","message":{"text":"_RepoTabState.build (cognitive 40): _RepoTabState.build has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (29 pts), ternaries 3 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 19). 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/screens/repo_tab.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7391e4ac5a3ac066dce874faced521439d8062c0c2fdb92c67b3120596d3dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibrarySettingsPageState._pickLibraryFolder (cognitive 40): _LibrarySettingsPageState._pickLibraryFolder has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (29 pts), error handling 2 (5 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 23). 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/screens/settings/library_settings_page.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"30321d6b1d8988a86b8056891f67a37a9f9144b90b39beefa7e7a43b70b097e4"}},{"ruleId":"D2","level":"warning","message":{"text":"SongAnalysis._sweepLibrary (cognitive 40): SongAnalysis._sweepLibrary has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 6, loops 2 (3 pts), error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/song_analysis.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c49c71eff72436db3e82ddcb23dfef4c954788ca42d5f3583ce3d5b5239109"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkLibraryJobRow.build (cognitive 40): LinkLibraryJobRow.build has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 6 (8 pts), ternaries 5 (8 pts), boolean chains 7, match/switch 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/widgets/link/link_library_actions.dart"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b68a0cff38ef31c69038777538bdcb3039c5bf1f884ed85ffa28e249ebc86e"}},{"ruleId":"D2","level":"warning","message":{"text":"_RenderPinnedSectionList.performLayout (cognitive 40): _RenderPinnedSectionList.performLayout has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (6 pts), boolean chains 5, ternaries 3 (4 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/widgets/pinned_section_sliver_list.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9a0afe74eac650f60d5f1ad54035818e319019431022c5608134d31b081c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).exportValue (cognitive 40): (anonymous).exportValue has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 6, ternaries 3 (6 pts), error handling 3, loops 1 (2 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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be44f24859debb645e75a687c5cea6688c1533de2681dec719a53b4ed806394"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkDownloadUpdates._drain (cognitive 39): LinkDownloadUpdates._drain has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (17 pts), ternaries 3 (10 pts), boolean chains 6, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_downloads.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a04174d8a6c9a0e0a053890cf1e1d0e4becc2feb612c7dce240283238d8ef52"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkMirroredPlayback._resolve (cognitive 39): LinkMirroredPlayback._resolve has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 9, ternaries 2 (5 pts), 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/services/link/link_mirrored_playback.dart"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d286ce6c4b6a919b0ba8eea8e9d618e31c52a9a45169344c3869abf9d5c4d50"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibraryDirectoryViewState._buildFolder (cognitive 39): _LibraryDirectoryViewState._buildFolder has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 7, ternaries 4 (6 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/widgets/library_directory_view.dart"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2ebaa4a521a5441be060071b77f8e7a7ef9b1d4f8cc16680f8d7dfa9379fc2"}},{"ruleId":"D2","level":"warning","message":{"text":"_UpdateDialogState.build (cognitive 39): _UpdateDialogState.build has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 12 (24 pts), if/else 8 (11 pts), match/switch 2 (4 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/widgets/update_dialog.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8b33a40e5a633dc4432af465b4c0e240289ece462345b5781b178017375d44"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::edit_comments (cognitive 39): mornye_core::tags::write::edit_comments has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 7 (14 pts), boolean chains 2 (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":"rust_backend/crates/core/src/tags/write.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"a313d58c1e7bdb4cb4dc26ba6e52209913243e13fc419be5a6d7aabd4420263e"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::mp4::shift_offsets (cognitive 39): mornye_core::tags::write::mp4::shift_offsets has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 4 (8 pts), match/switch 1 (3 pts) (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":"rust_backend/crates/core/src/tags/write/mp4.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6fd087a003479fa2503bed8496910bedb228221e687a97145ec6dbdee287f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionSetting::deserialize (cognitive 39): ExtensionSetting::deserialize has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 10 (18 pts), loops 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c304568fa5a9ab703d2001b05217f0bd4b97d4037f410dfe6fb609658242eb"}},{"ruleId":"D2","level":"warning","message":{"text":"_RewindSlide._content (cognitive 38): _RewindSlide._content has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 4 (10 pts), loops 4 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 19). 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/screens/listening_rewind_slides.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7e02a3d5fb78123dde9617f93adf00a11dfbbda5577c8dc1e36f6bae492313"}},{"ruleId":"D2","level":"warning","message":{"text":"_NetworkConnectionFormState.build (cognitive 38): _NetworkConnectionFormState.build has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 13 (21 pts), if/else 8, match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 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/screens/network_storage_screen.dart"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0b4ba567645802e1ee7f551e6ab3eb53891488423a6a6762ddf694e847d456"}},{"ruleId":"D2","level":"warning","message":{"text":"_SettingItemState._invokeAction (cognitive 38): _SettingItemState._invokeAction has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 4, error handling 1 (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/screens/settings/extension_detail_page_widgets.dart"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5feaf58fe2f696dc5368ed7b5a4a8931ed6c0627f14815ce91b7054aed561b9"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkHandoff._sendLater (cognitive 38): LinkHandoff._sendLater has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (20 pts), error handling 3 (6 pts), ternaries 2 (6 pts), loops 2 (5 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/services/link/features/link_handoff.dart"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"958dc8ace6ec46ba70ecb0cc37c69cfcd4cca0402413ad6199840ba8751a63d0"}},{"ruleId":"D2","level":"warning","message":{"text":"SubsonicClient.cachedCover (cognitive 38): SubsonicClient.cachedCover has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 12, error handling 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/network_storage_subsonic.dart"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eb8f8ffd0a659a199a2a9b6a55f4fe0eda7a350bdf09f7c416b34d79cffd62"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkNowPlayingController.handle (cognitive 38): LinkNowPlayingController.handle has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 7, loops 1 (4 pts), ternaries 1 (3 pts), match/switch 1 (2 pts), error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/LinkNowPlayingBridge.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7606548fefcdd981a2ad0e7b28f4576f6579563adc68ad6fbd70d6cab3cad573"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::ogg::rewrite (cognitive 38): mornye_core::tags::write::ogg::rewrite has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/tags/write/ogg.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ed15ad2ad51cf6f9ae27667a4b4f2e90b6b28de59681db57c7fe29c2e5d3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExtensionDetailPageState.build (cognitive 37): _ExtensionDetailPageState.build has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 17, if/else 13 (15 pts), boolean chains 5 (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/screens/settings/extension_detail_page.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab02118a63a4db07aeaef42f0a7f6dd0217397ea3041d5b66a75e9f73357692f"}},{"ruleId":"D2","level":"warning","message":{"text":"_SettingsTabState._buildCategoryList (cognitive 37): _SettingsTabState._buildCategoryList has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 6 (13 pts), ternaries 6 (8 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/settings/settings_tab.dart"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bf4b84bffec0dc63304a8530cc0ccacc939b39c11ed1342a1bdfc8bc1b4a09"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkStorageService._serve (cognitive 37): NetworkStorageService._serve has cognitive complexity 37 (threshold 15). Drivers by points: error handling 6 (14 pts), if/else 7 (14 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/network_storage_service.dart"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"7072f4dcbba9a4e2070fc764bcf1d5b8595e8bf348422a06945688eff20b553e"}},{"ruleId":"D2","level":"warning","message":{"text":"_LyricsOptionsButtonState._showMenu (cognitive 37): _LyricsOptionsButtonState._showMenu has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 4 (8 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/lyrics_options_button.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a06a5b43bfd2da50f655edead28c1f2faad4755575f2ba0c06f68ea5f59cdbe"}},{"ruleId":"D2","level":"warning","message":{"text":"SafTreeListingKt.querySafChildrenOrThrow (cognitive 37): SafTreeListingKt.querySafChildrenOrThrow has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (18 pts), error handling 5 (13 pts), boolean chains 5, 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":"android/app/src/main/kotlin/com/zarz/mornye/SafTreeListing.kt"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"213be5b47ac833ade8265fa7c75366eee7b48f79f424ffd78ce39afd58784d85"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionManager::run_post_processing (cognitive 37): ExtensionManager::run_post_processing has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 3, loops 2 (3 pts), match/switch 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":"rust_backend/crates/extensions/src/manager/postprocess.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f98de875b10b6897c899970de1a325d54eddb8608fb01e0abb7c54b51b131a"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_cache::unix::collect (cognitive 37): mornye_mobile::native_cache::unix::collect has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 3 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_cache/unix.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7082c704ddd32e5e99e6f044393c26cce118526c3b8118eebf9c3f76789d0b"}},{"ruleId":"D2","level":"warning","message":{"text":"UrlParts::parse (cognitive 37): UrlParts::parse has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 8, match/switch 1 (3 pts), 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":"rust_backend/crates/network/src/url.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22a1b5cbd1958d15d37ceffe284c1f5d99dfb075163e6774ccd506fcee54e2b"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsTranslationController.translate (cognitive 36): LyricsTranslationController.translate has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 15, if/else 10 (15 pts), ternaries 2 (4 pts), error handling 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/providers/lyrics_translation_provider.dart"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d2cf95ce0e36675e44138c244649f7b3874828c1328a073390662d645d3bde"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryCollectionsDatabase.replaceDatabaseFromBackup (cognitive 36): LibraryCollectionsDatabase.replaceDatabaseFromBackup has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 3 (10 pts), loops 3 (9 pts), match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/library_collections_database.dart"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4815b222a0a7411dfa2bffbc0fb1c325a953f58a9876d064a8f44139c81d8321"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkHistoryArtwork._apply (cognitive 36): LinkHistoryArtwork._apply has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), error handling 2 (6 pts), loops 3 (5 pts), boolean chains 3 (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/services/link/sync/link_history_artwork.dart"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a0bec24db7c38cec1c136c315c5aaa4434cea3258079958fb2d8f447931f90"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicAutoplay._fill (cognitive 36): _MusicAutoplay._fill has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 12, loops 2 (5 pts), error handling 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_autoplay.dart"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe594661aaa0d58d9d72cd2d80eec7bd8b77224313cca67ff125e0c49dcb748"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkMetadataService._load (cognitive 36): NetworkMetadataService._load has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (23 pts), error handling 4 (11 pts), boolean chains 1, ternaries 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/services/network_metadata_service.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37da92cdfa6800dc45b9cdea55053015d6f3ef10a96b48cb17b455aedc060d4"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformBridge._ensureBackendEventHandler (cognitive 36): PlatformBridge._ensureBackendEventHandler has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (26 pts), ternaries 3 (7 pts), error handling 1 (2 pts), match/switch 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/services/platform_bridge.dart"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f7838a86a65638c557a79d4250db37b96a34490949ad7bcb89d7b46927c254"}},{"ruleId":"D2","level":"warning","message":{"text":"LogBuffer._fetchNativeLogs (cognitive 36): LogBuffer._fetchNativeLogs has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 1 (6 pts), error handling 2 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/utils/logger.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"67630390626f52986ce0b7d9f2e690a102f3fd19f6a7fae55e014cd8fb13472d"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDownloadFinalizer.writeAlbumReplayGain (cognitive 36): NativeDownloadFinalizer.writeAlbumReplayGain has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 4 (6 pts), error handling 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d94059045d07f81c5f7696e1ab2b127f3d981ef34f2614172ce4ad8b7f5dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_library::path_keys::build (cognitive 36): mornye_mobile::native_library::path_keys::build has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 7, 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":"rust_backend/crates/mobile/src/native_library/path_keys.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfeba36fbd5070026dbac3e3531d15c7c1131f891756e54421b23654bcf707a"}},{"ruleId":"D2","level":"warning","message":{"text":"_AccountForm.parse (cognitive 35): _AccountForm.parse has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 21, if/else 6 (11 pts), ternaries 2, loops 1 (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/controllers/extension_action_forms.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a267ae0f53077167c6ee084852fa01dd8504294fbf08ab6d098502e472851907"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueueNotifier._startQueueRestore (cognitive 35): DownloadQueueNotifier._startQueueRestore has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 8, error handling 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_queue_provider.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"457f7b1a06fe50075d9f2296b57cb0def67d5d68e6d95943483e5c488b5c9052"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalLibraryNotifier._loadFromDatabase (cognitive 35): LocalLibraryNotifier._loadFromDatabase has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (28 pts), error handling 2 (4 pts), loops 1 (2 pts), boolean chains 1 (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/providers/local_library_provider.dart"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b8eafaf96b6107d9fa6447fb864af5e8857dad5764d7d03c8d80b20c956780"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsNotifier._runMigrations (cognitive 35): SettingsNotifier._runMigrations has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, loops 1 (4 pts), ternaries 1 (3 pts) (nesting depth added 18). 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/providers/settings_provider.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"095446a4ae689abf48db3ee124991473a441579c4dcd8c655decc2e196be9465"}},{"ruleId":"D2","level":"warning","message":{"text":"_SettingsTabState._buildList (cognitive 35): _SettingsTabState._buildList has cognitive complexity 35 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 6 (13 pts), ternaries 6 (7 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/settings/settings_tab.dart"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3f8829edbaaaed251a3f820a40eab388cc47dd72cb479d4e45360b5794d696"}},{"ruleId":"D2","level":"warning","message":{"text":"LastfmService._flush (cognitive 35): LastfmService._flush has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 5, error handling 2 (4 pts), ternaries 1 (4 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/lastfm/lastfm_service.dart"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"e244a08e597349ee37e06d7f6c78a47ee3753f69390f540ac09fa6be40c88ad1"}},{"ruleId":"D2","level":"warning","message":{"text":"LibrarySearchStore.search (cognitive 35): LibrarySearchStore.search has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 13 (26 pts), if/else 3 (4 pts), match/switch 2 (3 pts), boolean chains 1, loops 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/services/library_search.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9893fd530ddb00668eb60b2cb2dfbbfe5e7a4503ff95b3705f095b626ca1d78c"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkDesktopHost.exportCatalog (cognitive 35): LinkDesktopHost.exportCatalog has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (8 pts), boolean chains 5, error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_desktop_host.dart"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0201657f0a1d6d92a8544f7dd5e86e72233591fd9d41b35f9ee83c20183138"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPlaysOnDesktop.build (cognitive 35): LinkPlaysOnDesktop.build has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 15, error handling 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/services/link/features/link_remote_playback.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeeab352c1ec8093f9f5174717c72f5ed68ed4f25b86a2412884f17a40679a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioplayersPlaybackDeck.resume (cognitive 35): AudioplayersPlaybackDeck.resume has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 10, error handling 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/services/music_playback_deck.dart"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"1072c8123c4bb0cee4d3aae5a52aa7a778d36e3170d5af2b100154d53be3f107"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::containers::ogg_packets_until (cognitive 35): mornye_core::tags::containers::ogg_packets_until has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/tags/containers.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"9476532765e1323e06a4f204182f24b0ef1daba1daec238aee17ee2473592170"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_lyrics::ttml::xml_source (cognitive 35): mornye_mobile::native_lyrics::ttml::xml_source has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_lyrics/ttml.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d5672ec7e14301a4028e2d38a3b39a895a0fd5ee418429721f7d8a1af25101"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionNotifier.restoreFromBackup (cognitive 34): ExtensionNotifier.restoreFromBackup has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 4 (9 pts), boolean chains 2, ternaries 2, loops 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/providers/extension_provider.dart"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafd1b89230ec9f685ab050a1df5516763422565f1529ef75f3348b18936d8b9"}},{"ruleId":"D2","level":"warning","message":{"text":"AppStateDatabase.migrateRecentAccessFromSharedPreferences (cognitive 34): AppStateDatabase.migrateRecentAccessFromSharedPreferences has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 8, loops 2 (7 pts), error handling 1 (nesting depth added 16). 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/services/app_state_database.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"30be4a0fdb2b9446f256d723b5a54ce5922189053bb96b1fbf7bfe41f8d26d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollectionSyncStore._write (cognitive 34): LinkCollectionSyncStore._write has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (29 pts), ternaries 2, boolean chains 1, loops 1, match/switch 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/services/link/sync/link_collection_sync_store.dart"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"859dd5e9401aacca1c55255979715a5adf17942131a28bf1e337e705cf3a4e71"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler._resolveSource (cognitive 34): MusicPlayerHandler._resolveSource has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (18 pts), error handling 5 (11 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_service.dart"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e195a5b59c9349efa5c32e36d0e0b2e9f78c94edec5e167a33515c3c88ceeeaa"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibraryDirectoryViewState.build (cognitive 34): _LibraryDirectoryViewState.build has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 10, ternaries 7 (8 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, 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/widgets/library_directory_view.dart"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b5e958047aa26acbc745f42ba4eee1dcc3cefad47885e3c2aac706769e1845"}},{"ruleId":"D2","level":"warning","message":{"text":"_TrackOptionsSheet.build (cognitive 34): _TrackOptionsSheet.build has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (18 pts), ternaries 12 (15 pts), boolean chains 1 (nesting depth added 8). 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/widgets/track_collection_quick_actions.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"408baea3a1a964c1190a7d7f765d37b57a3681ec8222329d67485db44e4f6584"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionManager::search_metadata_providers_value_with_lease (cognitive 34): ExtensionManager::search_metadata_providers_value_with_lease has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/manager/metadata.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea00ec303400e76afa9032180f18723ced8bfdd3bec4d4adc6cd55c1ec284e7"}},{"ruleId":"D2","level":"warning","message":{"text":"SignedSession::deserialize (cognitive 34): SignedSession::deserialize has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 9 (15 pts), loops 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ad7182aa12b376bd8cf8ab1276f69ea3481be1442695d9886fb2ea4134aa44"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadSettingsPageState.build (cognitive 33): _DownloadSettingsPageState.build has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 9 (14 pts), if/else 7 (10 pts), boolean chains 7, loops 1 (2 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/screens/settings/download_settings_page.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2232889e7373cc2389880851ac40a487c755e08c6836af7a6b29263a45d56e"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibraryHeroCard.build (cognitive 33): _LibraryHeroCard.build has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 11 (18 pts), boolean chains 8, if/else 6 (7 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/screens/settings/library_settings_page_widgets.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"16881b0c1c2b72722a64721a0a2df34907261eda9465b3d90da55020c4cf4f58"}},{"ruleId":"D2","level":"warning","message":{"text":"LastfmService.finishConnection (cognitive 33): LastfmService.finishConnection has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 3 (9 pts), boolean chains 7, error handling 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/services/lastfm/lastfm_service.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a91c71c9ddb0785d88e1306c53a3efb8f41e256d5ede946d04d7bb858e9df2"}},{"ruleId":"D2","level":"warning","message":{"text":"_HiResCheckCardState.build (cognitive 33): _HiResCheckCardState.build has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 3 (7 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/widgets/hires_check_card.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f60865d87c6c5828e4958b79fa4107820458a4a00ae78e926259f99cec85aa"}},{"ruleId":"D2","level":"warning","message":{"text":"_MornyeBottomBarState.build (cognitive 33): _MornyeBottomBarState.build has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 26 (30 pts), boolean chains 2, if/else 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/widgets/mornye_bottom_bar.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"239e2f875acaa96946bc8b1ba873cdf4d332017d37cb0aac7ca1f0e41cb8772c"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackCard._buildCard (cognitive 33): TrackCard._buildCard has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 12 (15 pts), if/else 12 (13 pts), boolean chains 5 (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/widgets/track_card.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e85d24be9269192751b5329bdb4db67a612d18ebafa2b766ca30bf7dcec6002"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFinalizerDecryptKt.finalizeDecryption (cognitive 33): NativeFinalizerDecryptKt.finalizeDecryption has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (17 pts), error handling 2 (6 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerDecrypt.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d631389a28cb835cf032517e5cfba9ba75a8c6fa0f3d63b4af5e869e8469f7"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::file::read_metadata (cognitive 33): mornye_core::tags::file::read_metadata has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 5 (8 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/tags/file.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab448632b4371abf99dfc22e26fd838cd80c1fc90bb54d21f139bafcf7efcd0"}},{"ruleId":"D2","level":"warning","message":{"text":"QualitySpecificSetting::deserialize (cognitive 33): QualitySpecificSetting::deserialize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 8 (16 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"08515c8aeb72ce54f8a64708b11725b7ed6c17f93a55f2ef7da7920990e49282"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchBehavior::deserialize (cognitive 33): SearchBehavior::deserialize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 8 (16 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccdb2835e4a6d5785a0ea79f1e2e59a53cac8e019b1e4d70714bd72b19d3ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::backend::health::classify_body (cognitive 33): mornye_extensions::backend::health::classify_body has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/health.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"757a0eafc6ae349e8299f64027138472aef45ceaad57f0e26e09b5994062cd0b"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::ffmpeg_host::conversion_arguments (cognitive 33): mornye_extensions::ffmpeg_host::conversion_arguments has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 20). 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":"rust_backend/crates/extensions/src/ffmpeg_host.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba171ec65933d906e613632a30da33a1e95900d10bec61dd6614c1aaf4bd6a8"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoMixAnalyzer.analyze (cognitive 32): AutoMixAnalyzer.analyze has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), error handling 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/automix_analyzer.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce262d2c191ed17f6e5c82617013a19a469812eb3eed1c559590c5cb54502ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"DiscordPresenceService._authenticate (cognitive 32): DiscordPresenceService._authenticate has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 8, ternaries 3 (6 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/services/discord_presence_service.dart"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"443b4362f1e44fa772147a0530ebb894ea621f7c132f2c866d2871d404896730"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryCollectionsDatabase.migrateFromSharedPreferences (cognitive 32): LibraryCollectionsDatabase.migrateFromSharedPreferences has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (9 pts), boolean chains 5, 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/services/library_collections_database.dart"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d51bce7bef4a2249cd7e48cc656d15a1cf83b260987a55a0aa3a69256608c4"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPhoneCatalogs._fetchCovers (cognitive 32): LinkPhoneCatalogs._fetchCovers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (9 pts), ternaries 1 (4 pts), boolean chains 2, error handling 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/services/link/desktop/link_phone_catalogs.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7dbd582e58fc4f9cf59611ef9c3ef969b376c4485918b5332aa63ed5345b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkStorageService.list (cognitive 32): NetworkStorageService.list has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (17 pts), error handling 3 (5 pts), boolean chains 4, loops 2 (4 pts), match/switch 1, ternaries 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/services/network_storage_service.dart"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8268fcb5aa27ca5d228d867948c790b3f73e5e0e1c56b8377d989c67ceca248"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbDirectPlayback.command (cognitive 32): UsbDirectPlayback.command has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, error handling 2 (4 pts), match/switch 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":"android/app/src/main/kotlin/com/zarz/mornye/UsbDirectPlayback.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88e6587a4ff0bcf3c47aeba5379bbc5a66f33a9771bba8670ba3e9d86d843e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Request::select (cognitive 32): Request::select has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 15, 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":"rust_backend/crates/core/src/metadata/reenrich.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"94123139e011658953c3f914fc8b213acd1c28fe53b844d4f1b8d99f6bccf86a"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::lyrics::payloads::format_apple_payload (cognitive 32): mornye_core::lyrics::payloads::format_apple_payload has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"183134b2b903529e22bb54502e0f19a1a0d935bbf72185b7b8f296bd5e86aed0"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_desktop::events::download_loop (cognitive 32): mornye_desktop::events::download_loop has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (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":"rust_backend/crates/desktop/src/events.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00738180c498b3875568f47bf7e0c44c8b78bd26d372eb2c8fcc32620e042fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Vm::call (cognitive 32): Vm::call has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 2 (3 pts), 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":"rust_backend/crates/extensions/src/runtime/vm.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aef1ee6eaaff4655b9c18e257d852117dcb9dd61602bedc1373ddc6cc5df0f7"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::runtime::vm::run_worker (cognitive 32): mornye_extensions::runtime::vm::run_worker has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 4 (11 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/runtime/vm.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d732ef8b1110dfd954d9a2354ce164303a58f1dfd083570b05b711510f81330e"}},{"ruleId":"D2","level":"warning","message":{"text":"_ConcertDetailScreenState._materialPage (cognitive 31): _ConcertDetailScreenState._materialPage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 6 (12 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/screens/concert_detail_screen.dart"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"8826c072b208109ef409cf612510d475c75ed56b10c6df4ed651bf281068a8d5"}},{"ruleId":"D2","level":"warning","message":{"text":"_HomeSections.build (cognitive 31): _HomeSections.build has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 9, ternaries 3 (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/screens/home_tab_intro.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf67fabdd56c433c49d8aba873cf6b7a31c54661c0a9625e83c093d03abeae30"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibraryTracksFolderScreenState._buildSelectionBottomBar (cognitive 31): _LibraryTracksFolderScreenState._buildSelectionBottomBar has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 13 (22 pts), if/else 4, boolean chains 3, 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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"409963a8499577f91391e4f7697de923b204bc6e97f543149fa08f925cfb9c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkDesktopSettingsPage.build (cognitive 31): LinkDesktopSettingsPage.build has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 4 (7 pts), boolean chains 2, 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/screens/settings/link_desktop_settings_page.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"853ca93753e8a27026598074ad14d98dcc9ab4e912dd3ed158d43c1bc29f6f63"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionStorageService.setUnsecuredStorage (cognitive 31): ExtensionStorageService.setUnsecuredStorage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (21 pts), error handling 3 (6 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/extension_storage_service.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"624093f9273bd6d70a4b42569837ead55290f33db63f2eab7ad01aa0c3db881f"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkLibraryJobsHost._drain (cognitive 31): LinkLibraryJobsHost._drain has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (8 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_library_jobs_host.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aab28a37aa6bb46425c194a24f1cf34ee5d3f53d5d21141a8ab7795434b7cf"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalTrackRedownloadService._scoreMatch (cognitive 31): LocalTrackRedownloadService._scoreMatch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 9, ternaries 1 (2 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, 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/services/local_track_redownload_service.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5645eccc68ce920fc2d8c65ce4b8c41c28275c4195df383115dcec1aa9c9e45a"}},{"ruleId":"D2","level":"warning","message":{"text":"MotionArtworkStore.find (cognitive 31): MotionArtworkStore.find has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 17). 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/services/motion_artwork_store.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"004e7bbddf8ba762d77e9efb46519315833835483db14ea6da3c7c40f2212142"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeHistoryStore.buildPathMatchKeys (cognitive 31): NativeHistoryStore.buildPathMatchKeys has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), error handling 4 (6 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/NativeHistoryStore.kt"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7819bf353dda2c6f0b91c6a334457d5d083cb74dfeb81f448ebe642b698a056"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::metadata::share::select (cognitive 31): mornye_core::metadata::share::select has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 4, 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":"rust_backend/crates/core/src/metadata/share.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ed35cb7250237f4287b5584231fb61d655529c0d52cbb184cefae015b016da"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::containers::riff_chunks (cognitive 31): mornye_core::tags::containers::riff_chunks has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/tags/containers.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"2568d96a73da8b651979d425ebabd05a438f52d1e1a4a0c041d5ee542f5f3be0"}},{"ruleId":"D2","level":"warning","message":{"text":"HealthCheck::deserialize (cognitive 31): HealthCheck::deserialize has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 8 (14 pts), loops 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86aaccaa09cacbea3c8b318a446fa0e8f4faebd4f39bdd3310c841fd8b1dba0"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_backup::archive::read (cognitive 31): mornye_mobile::native_backup::archive::read has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_backup/archive.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"0207a015a02cee935f5b7e405395b88a937fd3f962bf658aff220453403ec390"}},{"ruleId":"D2","level":"warning","message":{"text":"UrlParts::reference_string (cognitive 31): UrlParts::reference_string has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 7 (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":"rust_backend/crates/network/src/url.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b16fa678f7b4a20f9c497408e4974a2b906b100531abbe4069d2b59ee2edeca"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).album (cognitive 31): (anonymous).album has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 6, loops 2 (6 pts) (nesting depth added 13). Of this number, 27 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/provider.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"848b6655c4423284878378509adde0bc38b604beb31374f34587d28d66b4ba64"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadContainerFinalizer.finalize (cognitive 30): DownloadContainerFinalizer.finalize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 10, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/download_container_finalizer.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a363b9e6aec478f9b46c8e57b9cfd7c4ddb905b2052c7a405808613b72cba74"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPairingClient.pair (cognitive 30): LinkPairingClient.pair has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, ternaries 2 (5 pts), match/switch 1 (3 pts), 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/services/link/client/link_client_pairing.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33c4b3ab7adbaaa22c2d188b9418c11b7a2bcfe20f73446595dc4daf03fb812"}},{"ruleId":"D2","level":"warning","message":{"text":"PreferenceBlobStore._read (cognitive 30): PreferenceBlobStore._read has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (19 pts), error handling 3 (6 pts), ternaries 2 (4 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/services/preference_blob_store.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f547e27217c21388da6ac27a0e2ec4c82b7a7c359eca34f6b44ee60e4617a679"}},{"ruleId":"D2","level":"warning","message":{"text":"_PlaylistPickerSheetContentState.build (cognitive 30): _PlaylistPickerSheetContentState.build has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 6, ternaries 5, loops 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/widgets/playlist_picker_sheet.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad380472f5f00b0f44a2c90b8fcd13ed035befcf5fbb04eefb0f4453367fa3c"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerWidgetProvider.render (cognitive 30): PlayerWidgetProvider.render has cognitive complexity 30 (threshold 15). Drivers by points: if/else 22, boolean chains 5, match/switch 3. 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":"android/app/src/main/kotlin/com/zarz/mornye/PlayerWidgetProvider.kt"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5601ffa243917dbd766b3f8a3c957f378fc25b4744f44531feaddcc53f2f0364"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbBitPerfectPlugin.onMethodCall (cognitive 30): UsbBitPerfectPlugin.onMethodCall has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 5 (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":"android/app/src/main/kotlin/com/zarz/mornye/UsbBitPerfectPlugin.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d8398fa43fba0b458cc956336cce1507729d1694db880fe00496fc0bfc996a"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexCache::index (cognitive 30): IndexCache::index has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (5 pts), boolean chains 4 (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":"rust_backend/crates/core/src/isrc/cache.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f233bdfef6386704a5413f92660131faa7dac1bf70e0b8f67953893a98742644"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::library::read (cognitive 30): mornye_core::tags::library::read has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (8 pts), boolean chains 5, loops 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":"rust_backend/crates/core/src/tags/library.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"de71ca1d8cb09a06ab2d3c04a16a6ec9d8f803cef06b87b149595d55c9dc879f"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_link::ws::session (cognitive 30): mornye_link::ws::session has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 6 (14 pts), boolean chains 1, loops 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":"rust_backend/crates/link/src/ws.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d171db617f1e919f660c5aa26eb4177b727b1befddcb7b92c21bd6627df9b0"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_listing::execute (cognitive 30): mornye_mobile::native_listing::execute has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 7, loops 2 (4 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":"rust_backend/crates/mobile/src/native_listing.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3d34c1ccba7edcc7e0e1cebf7b8c3c46dcbb9831decc4e0b8daa8266e48a16"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolverHttp::execute (cognitive 30): ResolverHttp::execute has cognitive complexity 30 (threshold 15). Drivers by points: if/else 22 (24 pts), 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":"rust_backend/crates/providers/src/resolver/http.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc61f2bc70329c134bd1d903c65606379fb6d550d5e385594ece6414879e55e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArtistConcert.parseList (cognitive 29): ArtistConcert.parseList has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, ternaries 3 (6 pts), error handling 1 (3 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/models/artist_concert.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba8c30eff3bfd347fd8e8042579eeac3c2c1b2bdfe97e5065ec5db79ab0dc5b"}},{"ruleId":"D2","level":"warning","message":{"text":"_HomeContinueListeningCardState.build (cognitive 29): _HomeContinueListeningCardState.build has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 16, if/else 6 (9 pts), boolean chains 4 (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/screens/home_tab_intro.dart"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d7aaf06488f29fa1c8c4b15943022e1ee5d384b37e9c2a1a8ec26273b709da"}},{"ruleId":"D2","level":"warning","message":{"text":"_FilesSettingsPageState.build (cognitive 29): _FilesSettingsPageState.build has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 11 (14 pts), if/else 8 (9 pts), boolean chains 6 (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/screens/settings/files_settings_page.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a987102117b44f4c4ade52572f6cdf91bdb5f8fd4a27531906206f155f60afe"}},{"ruleId":"D2","level":"warning","message":{"text":"AppStateDatabase.getPendingDownloadQueueRows (cognitive 29): AppStateDatabase.getPendingDownloadQueueRows has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 5 (9 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/app_state_database.dart"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c206b979773c2a7a5c7af683f2484dc0d5840ddb4705b2753ebc045cb4721896"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataAutofillService.resolveDetails (cognitive 29): MetadataAutofillService.resolveDetails has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 2 (5 pts), boolean chains 4, ternaries 1 (4 pts), loops 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/metadata_autofill_service.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5a7230de9d669873416f79d4905a28d84aca11e2e208ca7ed920ad62245fec"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler._playInternal (cognitive 29): MusicPlayerHandler._playInternal has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 11, error handling 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/services/music_player_service.dart"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb1b0f834a585fab0b458bb34039175b0149974a3e31fce3d79a2202fb37d8e"}},{"ruleId":"D2","level":"warning","message":{"text":"AlbumDetailHeader._buildAppBar (cognitive 29): AlbumDetailHeader._buildAppBar has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 10 (15 pts), if/else 11 (12 pts), boolean chains 2 (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/widgets/album_detail_header.dart"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"051732d90ce0f501dd09d62dc40bf7ec0388ae238815eec60af661caa618952b"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopInspector.build (cognitive 29): DesktopInspector.build has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 8 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/desktop/desktop_inspector.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cdcc6f2655f789d53bdfada5b8956dbe064be579a40db218d0ddf86e4314bd"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadServiceSnapshotKt.writeNativeWorkerSnapshot (cognitive 29): DownloadServiceSnapshotKt.writeNativeWorkerSnapshot has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23 (26 pts), boolean chains 2, error handling 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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceSnapshot.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0fbe0b96195c587b3f1d23430124ffa832eb72ae4ec35b209f94a9f2923911"}},{"ruleId":"D2","level":"warning","message":{"text":"WavPackDsdSource.readFrames (cognitive 29): WavPackDsdSource.readFrames has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (7 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":"android/app/src/main/kotlin/com/zarz/mornye/DsdSource.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea858095379fc2bd07e750f53e358f5d9bf3006c2961e0ebf55f47ddb4930f23"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFinalizerContainerKt.finalizeAutoConversion (cognitive 29): NativeFinalizerContainerKt.finalizeAutoConversion has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21 (24 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, 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerContainer.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0968812b2f1b05358c3d23b813a0e4eff6bb9b27a48a44d87072b286314f4ff"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::native_audio_analysis::analyze_automix_pcm (cognitive 29): mornye_core::native_audio_analysis::analyze_automix_pcm has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 12 (14 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":"rust_backend/crates/core/src/native_audio_analysis.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b89dc4c17de5a826f52c3dcfd6476552efe66287c320fe6473029100eb72a0"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::mp4::ac4::config (cognitive 29): mornye_core::tags::write::mp4::ac4::config has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 2 (4 pts), boolean chains 1, 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":"rust_backend/crates/core/src/tags/write/mp4/ac4.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7b20437e688a8451b50ed850261ae5b2f49a37cf225e1716ef41eb1cc572c4"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_lyrics::credits::with_credits (cognitive 29): mornye_mobile::native_lyrics::credits::with_credits has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 4, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_lyrics/credits.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"678a10d3ed221a7fa96725107c3d4fa1817da6c07d4c5db48857f5e9a1fe9d33"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).queryMethods (cognitive 29): (anonymous).queryMethods has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 5 (18 pts), if/else 4 (9 pts), boolean chains 1, loops 1 (nesting depth added 18). Most of this is not in the body itself: 7 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 74, a function literal at line 80, toString). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4e67af17f066a3b4ba692099ed897fbae0cc87ca4923cb8039b10acf22922f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).exported (cognitive 29): (anonymous).exported has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6, error handling 4, loops 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":"rust_backend/crates/extensions/src/provider.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9772255e4305f94300cd86ffded2f2e111d97510890576e9d70a3f467d9596c5"}},{"ruleId":"D2","level":"warning","message":{"text":"RecentAccessNotifier._loadHistory (cognitive 28): RecentAccessNotifier._loadHistory has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 2 (4 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/recent_access_provider.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f866551b441fd6e9e9d732c7d75395250d200ac2b9e17e021b3f9b8b4e3b9b0"}},{"ruleId":"D2","level":"warning","message":{"text":"_ConcertDetailScreenState._page (cognitive 28): _ConcertDetailScreenState._page has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 5 (10 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/screens/concert_detail_screen.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a24c47a29ab6a3b6d0f1956a8bf82c35c153dcd492a76815362ccaa4470d89b"}},{"ruleId":"D2","level":"warning","message":{"text":"_NetworkConnectionFormState._save (cognitive 28): _NetworkConnectionFormState._save has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 4 (7 pts), boolean chains 4, 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/screens/network_storage_screen.dart"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"58afe145db9b22820ac0eb86abb939f71c0573c36228198a95ae23cc49b8a7e7"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoplayPreferenceModel._features (cognitive 28): AutoplayPreferenceModel._features has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 3 (6 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/autoplay_personalization.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0254b18c56335fe31b460c5a9787576eb7f09542a5307b21fe6a514555f9ab"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentUriPlaybackCache.resolve (cognitive 28): ContentUriPlaybackCache.resolve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 8, 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/services/content_uri_playback_cache.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6edd33ce4e9527e69cee4eb90f250581725e334c33503e9675bd069d2c2290"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPhoneCatalogs._addCovers (cognitive 28): LinkPhoneCatalogs._addCovers has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 6, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_phone_catalogs.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b18bb9988a831d5899d9ebf0d251bfa0469063fa8a46ee978df12b645f7187"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkPlaybackCache._load (cognitive 28): NetworkPlaybackCache._load has cognitive complexity 28 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (8 pts), error handling 3 (7 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/network_playback_cache.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e467b4370b7da8f9ca408c3373b62738447c3747a7c7af1b155435e3e3d93ca"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkPlaybackCache._download (cognitive 28): NetworkPlaybackCache._download has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), error handling 3 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/network_playback_cache.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5878a1be904a11076dc0d8c9b2a747b8264ffab535a774edbc87846fdbb4482"}},{"ruleId":"D2","level":"warning","message":{"text":"SubsonicClient._albumCatalog (cognitive 28): SubsonicClient._albumCatalog has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 3 (6 pts), ternaries 1 (2 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/services/network_storage_subsonic.dart"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e7981ce30f24de92354ae97f51085db06ba2b204959b316b7120635bdc620e"}},{"ruleId":"D2","level":"warning","message":{"text":"WeeklyReleaseService.load (cognitive 28): WeeklyReleaseService.load has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 5, error handling 2 (5 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/weekly_releases.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7596f120dc1fd0a196be6a35b5218da1952a681c530f035540bf300a249c32c1"}},{"ruleId":"D2","level":"warning","message":{"text":"AlbumDescription._text (cognitive 28): AlbumDescription._text has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (5 pts), ternaries 1 (3 pts), loops 2 (nesting depth added 17). 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/widgets/album_description.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d84dcf20da5ccd0d430b58208bcf6e7437e043a8ec0f9d71f2cced7fe373507"}},{"ruleId":"D2","level":"warning","message":{"text":"HeaderCircleButton.build (cognitive 28): HeaderCircleButton.build has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 11 (20 pts), boolean chains 4, if/else 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/album_detail_header.dart"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"93006433fbbd632920bf482f64c0b2e20f10eb83fc99dc34d1a5c2ec1b573514"}},{"ruleId":"D2","level":"warning","message":{"text":"_MornyeSelectionPillState.build (cognitive 28): _MornyeSelectionPillState.build has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 9, if/else 9 (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/widgets/mornye_selection_pill.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"554d820b7521fbe39bf68f6df960be23140b9e5938d28ae2118a01ca6322b274"}},{"ruleId":"D2","level":"warning","message":{"text":"_TvNavigationState._handleKey (cognitive 28): _TvNavigationState._handleKey has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 15, if/else 7 (11 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/tv_navigation.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f143b4a402aca151e4579e9cd96c8f8002debabb24b09df92af6e61308ecc5f2"}},{"ruleId":"D2","level":"warning","message":{"text":"AppDelegate.invokeOsMethod (cognitive 28): AppDelegate.invokeOsMethod has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 9, error handling 1 (2 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 9). 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":"ios/Runner/AppDelegate.swift"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"647608d3c6b27df36a88a4162c5da2f513ab07c825de86b4458fe56b1dff8357"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::filename::date::render (cognitive 28): mornye_core::filename::date::render has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/filename/date.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c24debb4af15c708a14435b8a7584d87a45bc59e1c755fdab2bd8c389d7532b"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::lyrics::lrc::with_metadata (cognitive 28): mornye_core::lyrics::lrc::with_metadata has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 3 (6 pts), 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":"rust_backend/crates/core/src/lyrics/lrc.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a08b9f19e4595ae2b684d140861425b3a8da87a794f8d1c335afa7bb324e2c8"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_lyrics::ttml::visit (cognitive 28): mornye_mobile::native_lyrics::ttml::visit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_lyrics/ttml.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d30bed36b82652a10ae53b86f74b1207a85d01f349582a65b7c56edb236f18"}},{"ruleId":"D2","level":"warning","message":{"text":"ExploreNotifier.fetchHomeFeed (cognitive 27): ExploreNotifier.fetchHomeFeed has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, 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/providers/explore_provider.dart"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dd968c719f9a31f9b88ecec730f90bddbbc9b8d2bb9490da44572ff96f70aa"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibraryMixes._songs (cognitive 27): _LibraryMixes._songs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (12 pts), ternaries 2 (8 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/library_mixes_provider.dart"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05ba1d265c23e866b6a2e3a64f7e3e8473bb2a68fbf267c99c9c3267c2fcce2"}},{"ruleId":"D2","level":"warning","message":{"text":"_MainShellState._desktopDestinations (cognitive 27): _MainShellState._desktopDestinations has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (24 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/main_shell.dart"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f8b8d97f64883f48eb10ed451a4ecb179091f8d5d6d82f28dc0753916e68bb"}},{"ruleId":"D2","level":"warning","message":{"text":"_MainShellState.build (cognitive 27): _MainShellState.build has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 6 (9 pts), boolean chains 3, 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/screens/main_shell.dart"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cb4497301a463e9157108497e67ba609832b8ed8d705345747a90e5912a4ff"}},{"ruleId":"D2","level":"warning","message":{"text":"_CacheManagementPageState.build (cognitive 27): _CacheManagementPageState.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 5 (8 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/screens/settings/cache_management_page.dart"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e17d0ac3098224da1bdf1340d88af0cfc2eb1a6683fd2693a25061b2a79f39b"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoMixPlan.create (cognitive 27): AutoMixPlan.create has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 12, ternaries 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/services/automix_analysis.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9764fa69288e3befcb4cd9fcef1845901718821cbc4a2e333d2c542a47a6fc5"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvImportService._bestCandidate (cognitive 27): CsvImportService._bestCandidate has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (11 pts), ternaries 3 (4 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/services/csv_import_service.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d0257254139d3c0741431c8f797f6019ffbb2a2bcaa824fea6889869bc7d89"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadedEmbeddedCoverResolver._deletePersistentVariantsForSource (cognitive 27): DownloadedEmbeddedCoverResolver._deletePersistentVariantsForSource has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (17 pts), error handling 2 (5 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f42335ecf18d0349be94ddc50ab6c9c1513feb7dad9be6848eb5a0550f5c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExclusiveOutputDeck._switchTo (cognitive 27): ExclusiveOutputDeck._switchTo has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 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/services/exclusive_output_deck.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"755f09abe7fb00f730f836503fa71dc7cfbe72f0f663746e61d03c3822f89dfd"}},{"ruleId":"D2","level":"warning","message":{"text":"_MixBuilder._index (cognitive 27): _MixBuilder._index has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, loops 4 (6 pts), ternaries 1 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/library_mixes.dart"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce88cfff5cef6a7b60aad819eddb729711460f55c70ceea9205360c622f84515"}},{"ruleId":"D2","level":"warning","message":{"text":"_MixBuilder._compose (cognitive 27): _MixBuilder._compose has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (6 pts), ternaries 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/services/library_mixes.dart"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f956f1170ece458994ac5701b8e6234c59c152a0009e3c12ddc6ae9fe5ec82a"}},{"ruleId":"D2","level":"warning","message":{"text":"LibrarySchema.upgrade (cognitive 27): LibrarySchema.upgrade has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 5 (8 pts), ternaries 1 (3 pts) (nesting depth added 7). 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/services/library_schema.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7977420952136db9b9d090bc8bdf943db7d9d68546954960a548aa450c06688e"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkHistoryArtwork._cover (cognitive 27): LinkHistoryArtwork._cover has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/sync/link_history_artwork.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1bcc9c1636bee9525d9fd2ab1908e32cfc56ce0248381d2d30c94d8e7e70a7"}},{"ruleId":"D2","level":"warning","message":{"text":"AppContentCard.build (cognitive 27): AppContentCard.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (16 pts), boolean chains 8, if/else 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/app_content_card.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"15323f045305be86d2022370e61a1db8685d54c1757ef84a6392b7b9bdbe3520"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExpressivePlaybackTransportState.build (cognitive 27): _ExpressivePlaybackTransportState.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 13, if/else 6, boolean chains 4, loops 2 (4 pts) (nesting depth added 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/widgets/expressive_playback_transport.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6044b7f4265c7e753c67028ab1914f44e7f939c527445d32cf5020971d03cc"}},{"ruleId":"D2","level":"warning","message":{"text":"_MornyeArtistSurfaceState.build (cognitive 27): _MornyeArtistSurfaceState.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 15 (17 pts), boolean chains 6, if/else 4 (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/widgets/mornye_artist_header.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6eefc3f7a8ecdc6c7c35e084be2473ebf4a78431be17237b6a8f3d801fa10a"}},{"ruleId":"D2","level":"warning","message":{"text":"MornyeLevelSlider.build (cognitive 27): MornyeLevelSlider.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 13 (14 pts), boolean chains 10, if/else 3 (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/widgets/mornye_level_slider.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb25a7f0e06c0c1a792c38abe6232ea064db142e2676e512ab5d7dd081523fff"}},{"ruleId":"D2","level":"warning","message":{"text":"_PlaybackSeekSliderState.build (cognitive 27): _PlaybackSeekSliderState.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 14 (22 pts), boolean chains 4, if/else 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/widgets/playback_seek_slider.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8867de1a59f1941cd87a7a5ad64439f141b5fa3a8f3f7a4f750a82ee4845e38"}},{"ruleId":"D2","level":"warning","message":{"text":"_SyncedLyricsViewState._scrollUntilBuilt (cognitive 27): _SyncedLyricsViewState._scrollUntilBuilt has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/player_lyrics.dart"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bf598a1bde51c9f51453f721d2b8293bf3e3c2c9d2690c22ba0c87fa3aec3c"}},{"ruleId":"D2","level":"warning","message":{"text":"SafFileInspectionKt.resolveSafFile (cognitive 27): SafFileInspectionKt.resolveSafFile has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/SafFileInspection.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"776ef68dda9432dbf572193f9cc135a5cf9e04634d28184a0e4c8fb841b21da0"}},{"ruleId":"D2","level":"warning","message":{"text":"SafTreeListingKt.runSafReadsInOrder (cognitive 27): SafTreeListingKt.runSafReadsInOrder has cognitive complexity 27 (threshold 15). Drivers by points: error handling 4 (12 pts), if/else 4 (8 pts), loops 3 (5 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":"android/app/src/main/kotlin/com/zarz/mornye/SafTreeListing.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ee2b2220e4b1eccfc57a670b0a89ee22637f2192a8e647ff0808344b2345eb"}},{"ruleId":"D2","level":"warning","message":{"text":"PcmStream::next_frame (cognitive 27): PcmStream::next_frame has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (10 pts), match/switch 2 (6 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":"rust_backend/crates/core/src/media/hires/replacement.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8d1cf480193137b2f9f711f918644cf40a7f5f5d385ac85978821cde23bc6c"}},{"ruleId":"D2","level":"warning","message":{"text":"WavSource::open (cognitive 27): WavSource::open has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 5, match/switch 2 (3 pts), 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":"rust_backend/crates/core/src/media/hires.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec133f43cee85c1f0bb6ba7fe329aa554a2357f74da07e7ddf0fa1fee9644519"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::containers::flac_inner (cognitive 27): mornye_core::tags::containers::flac_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 5, 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":"rust_backend/crates/core/src/tags/containers.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"579d867564d16632da9f6f2287634bdcceccdd133f369f39ae5bede3c4ddd984"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::usb_audio::descriptors::formats (cognitive 27): mornye_mobile::usb_audio::descriptors::formats has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 7, 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":"rust_backend/crates/mobile/src/usb_audio/descriptors.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1f7bb24d0c770615db90877664fc15b2ed9a3996bb7e7dd19f0582b3f09569"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadRun._persistCompletionAndNotify (cognitive 26): _DownloadRun._persistCompletionAndNotify has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 2 (5 pts), boolean chains 4, ternaries 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94ebf36eddb2b763fdd781ac5f5eac852ca6e0f4733457eccfa7b459c48b488"}},{"ruleId":"D2","level":"warning","message":{"text":"_HomeTabState._performSearch (cognitive 26): _HomeTabState._performSearch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 9, match/switch 2 (3 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/screens/home_tab.dart"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c81a6a381a76caec00fcfba5b46095abec1865e10e99d036d394593e2544bd"}},{"ruleId":"D2","level":"warning","message":{"text":"_BackupRestorePageState._restoreBackup (cognitive 26): _BackupRestorePageState._restoreBackup has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, error handling 2, ternaries 1 (2 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/screens/settings/backup_restore_page.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8030d24396584d9edd2a060192728b86756804940923aecd0c31b0bf7aafca"}},{"ruleId":"D2","level":"warning","message":{"text":"_LogSummaryCard._analyzeLogs (cognitive 26): _LogSummaryCard._analyzeLogs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 12, 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/screens/settings/log_screen_widgets.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d32e09fa76d89483c811dd4082107c82654792b060b6c2bcc90c68fbbf8bcbc"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverStore.trim (cognitive 26): CoverStore.trim has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2, 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":"lib/services/cover_store.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf886cb8505d691ef0175c829c64740d76ef117e7e780a946215f9da8984eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"CueSplitLibraryService.publish (cognitive 26): CueSplitLibraryService.publish has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (7 pts), loops 6, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/cue_split_library_service.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85aa400f43e782a48e1859ccc3b8e0198311ffb23776c2e95e1d1a861cdcbcf"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadFileFinalizer.decrypt (cognitive 26): DownloadFileFinalizer.decrypt has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 7 (11 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/services/download_file_finalizer.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1038830a4a806fce98757079764fee6d661a2da4dc2e28e17adf17d665b254"}},{"ruleId":"D2","level":"warning","message":{"text":"FFmpegMetadataInput.prepare (cognitive 26): FFmpegMetadataInput.prepare has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (5 pts), boolean chains 3, 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/services/ffmpeg_metadata_input.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3768bd2a7d4b69079daa8d4b0a988221da0e872a62801578cba4f5c82412365a"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkArrivingFiles._serve (cognitive 26): LinkArrivingFiles._serve has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, loops 1 (3 pts), error handling 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_arriving_files.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ac259e4e0593583e0b6d28d5228dcdd29ca79926aec4e86f83f9c36df16dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollectionSyncStore._keptCovers (cognitive 26): LinkCollectionSyncStore._keptCovers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (7 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/sync/link_collection_sync_store.dart"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa04fd5e360be6cbe454bc5e17e428aac26c7595cb9af0ec84d7ef2a1a16dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkSyncRunner._syncOnce (cognitive 26): LinkSyncRunner._syncOnce has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 10, 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/services/link/sync/link_sync_runner.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21d765004fcf1b5bd196c560d7499c868690f156ce4d3a10e5b62412f905080"}},{"ruleId":"D2","level":"warning","message":{"text":"M3uPlaylistService.exportPathFor (cognitive 26): M3uPlaylistService.exportPathFor has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, ternaries 1 (2 pts), error handling 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/services/m3u_playlist_service.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"382cf471960e14aa1a3bbbc791bc8e5d1eb73a0a534889aa763df7c4d14f2f43"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler._configureAudioSession (cognitive 26): MusicPlayerHandler._configureAudioSession has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, ternaries 1 (2 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/services/music_player_service.dart"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"05108591ac2a7a7b39224c00aa5bc4af288dca52f74a5848ba1b1dbd5a176af7"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadServicePickerState.build (cognitive 26): _DownloadServicePickerState.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 4 (7 pts), loops 3 (5 pts), 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/widgets/download_service_picker.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0417ad0c2b67d3848223c5047e06f30460f08223f1d4c7c7e2c57335fdba04f"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreBackendKt.withCoreFFmpegExecution (cognitive 26): CoreBackendKt.withCoreFFmpegExecution has cognitive complexity 26 (threshold 15). Drivers by points: error handling 6 (13 pts), if/else 4 (7 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/CoreBackend.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2474081c41f589348d173fb8cf6664b4de77783843d2b2e9e829af4fb120cbfd"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadServiceSnapshotKt.startNativeWorkerProgressCoordinator (cognitive 26): DownloadServiceSnapshotKt.startNativeWorkerProgressCoordinator has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceSnapshot.kt"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"255abc42a6c0336f1f842fd2885866084709ea0fd0fcfb30a057ac8741123ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::cover::resize (cognitive 26): mornye_core::cover::resize has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 5 (11 pts), boolean chains 2 (nesting depth added 8). 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":"rust_backend/crates/core/src/cover.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a0837b89ad88df7c8a514fcce507fbf09dceb4cbbc34e64bd9549a03a4f8ca"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionAuth::call (cognitive 26): ExtensionAuth::call has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 1, 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":"rust_backend/crates/extensions/src/auth/client.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc6a40ef4cc7bf6b49d63a1f068315359583d881f0d886fddc1439ac8ae1e46"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::configure (cognitive 26): Session::configure has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 8, 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":"rust_backend/crates/mobile/src/usb_audio/transport.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c235c7dfe8dbe29ca1a1b3a464115bba5095cf2d303b5fbef489c5a8461a990"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAudioController.open (cognitive 25): OpenAudioController.open has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/controllers/open_audio_controller.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"726cbb012e806ca86c8a06d078e053407814675baf478c09f77c44f79931a758"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerMetadataController.searchOnline (cognitive 25): PlayerMetadataController.searchOnline has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 9, error handling 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/controllers/player_metadata_controller.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1c884425878487248d58eb621186c748021f5f8267ad037c397e57f90110e7"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadRun._convertSafM4aToFlac (cognitive 25): _DownloadRun._convertSafM4aToFlac has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 1 (3 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"220b3a4f0b050c83837eab50fc592d9a997f622a6268fcbdbbd2f7f6bc85dab7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionNotifier.initialize (cognitive 25): ExtensionNotifier.initialize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/extension_provider.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22994eeb4701784102d37b89bbb647e536b58194768638ba8627f0c8ec61ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackNotifier.search (cognitive 25): TrackNotifier.search has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (8 pts), error handling 2 (4 pts), loops 1 (2 pts), 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/providers/track_provider.dart"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"431fc067d41a3cb27cfef42dd5bc7387d90d940af7410fa178abbc0659a50ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"_ArtistScreenState._fetchDiscography (cognitive 25): _ArtistScreenState._fetchDiscography has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (23 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/screens/artist_screen.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a39d5607234af82da223169a68ea38e6b3d465de5a9240b7a76307069d94db"}},{"ruleId":"D2","level":"warning","message":{"text":"_MainShellState._handleBackPress (cognitive 25): _MainShellState._handleBackPress has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12, boolean chains 11, 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/screens/main_shell.dart"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"acff4457ed5d809732666012a366a06a7febeb76eaf0c5133ef5099dd0ae7a99"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExtensionDetailsScreenState._buildInfoCard (cognitive 25): _ExtensionDetailsScreenState._buildInfoCard has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (15 pts), if/else 7 (10 pts) (nesting depth added 14). 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/screens/repo/extension_details_screen.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0879fd8d02a002d0d3570a68ad1276632c31c92ceec5f62715f0e83675aaf408"}},{"ruleId":"D2","level":"warning","message":{"text":"_LinkSettingsPageState._notices (cognitive 25): _LinkSettingsPageState._notices has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, ternaries 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/settings/link_settings_page.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbb1571cfee07d7da76fb27c48d5e0c6e1e1f4c80dc3c3c8b51bc5055f7d6c8"}},{"ruleId":"D2","level":"warning","message":{"text":"_SetupScreenState._requestNotificationPermission (cognitive 25): _SetupScreenState._requestNotificationPermission has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 1, 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/screens/setup_screen.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef26228bd28bdae6568a95ed68763368bc1fd3050a2707c9a1d0651043224c2"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoplayPersonalization.finish (cognitive 25): AutoplayPersonalization.finish has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 12, if/else 8, ternaries 3 (5 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, 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/services/autoplay_personalization.dart"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75f133698b9f7f9d6b61b893e2f5732953b927bc9c3b13b187ce49d7ec51ab4"}},{"ruleId":"D2","level":"warning","message":{"text":"SoundAutoplaySignal.prepare (cognitive 25): SoundAutoplaySignal.prepare has cognitive complexity 25 (threshold 15). Drivers by points: loops 10 (14 pts), if/else 6 (9 pts), boolean chains 2 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/autoplay_sound_signal.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1406d658320cf5aa77e0b16cc85e77a16cade7d1ae7864439f064aa8808259"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryCollectionsDatabase.relinkLocalTrack (cognitive 25): LibraryCollectionsDatabase.relinkLocalTrack has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (8 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/library_collections_database.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"90804a90abac15fa833bc92320deebb59657c96ac4bd376d53002a2d0123e83b"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryDatabase.updateAudioMetadata (cognitive 25): LibraryDatabase.updateAudioMetadata has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11, ternaries 5 (8 pts), boolean chains 6 (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/services/library_database.dart"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f89dff82f07f125ea0cdd134746118545f4dd60553760ea33cb96936827240"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkWebCovers._probeNew (cognitive 25): LinkWebCovers._probeNew has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 6 (10 pts), boolean chains 2, error handling 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/services/link/desktop/link_web_covers.dart"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c648a1f102337170e9761e6a931f6cf3cbd58be82e62a8583227d7e3ea382f48"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPhoneSession.apply (cognitive 25): LinkPhoneSession.apply has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 11). 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/services/link/features/link_phone_session.dart"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6e49c855f033c9806f06c80b5f627ee71062696c3c126281f82ca443dd74ae"}},{"ruleId":"D2","level":"warning","message":{"text":"ListeningRewind.compute (cognitive 25): ListeningRewind.compute has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 4 (6 pts), loops 5, 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/services/listening_rewind.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72c6dc88634cc75164c3409c9c4467db97111942bfafd995abbf4b2712be200"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioplayersPlaybackDeck.refreshNativeStatus (cognitive 25): AudioplayersPlaybackDeck.refreshNativeStatus has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 7, error handling 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/services/music_playback_deck.dart"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7e2cd2858449086b0feaa78387794bd8e0dbd0fab16e43e0ec92f8093d11ff"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDownloadWorkerMonitor.run (cognitive 25): NativeDownloadWorkerMonitor.run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/native_download_worker_monitor.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"434e3b7912eef4b9bd50e0ecb00e036b5f40b368aa8a30ea06585a7f61a43c7a"}},{"ruleId":"D2","level":"warning","message":{"text":"SubsonicClient.list (cognitive 25): SubsonicClient.list has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8, loops 2 (5 pts), ternaries 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/services/network_storage_subsonic.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9204f436110a77cfc8b579c02f6c8ebb30382b89d29a4f2c6578994c3183406"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsDraft.toLrc (cognitive 25): LyricsDraft.toLrc has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 3 (6 pts), loops 3 (5 pts), boolean chains 4 (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/utils/lyrics_draft.dart"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dbb570dd4c0c2516dac43aaa78facafac9d6295907e31b62942c1486f64022"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricDisplayLayout.LyricDisplayLayout (cognitive 25): LyricDisplayLayout.LyricDisplayLayout has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5, ternaries 2 (4 pts), boolean chains 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/utils/lyrics_timeline.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c26b39192cb4b7f1844f70d400e7f3963cdeef54baba3cfb3e315a1e59d231"}},{"ruleId":"D2","level":"warning","message":{"text":"_AudioAnalysisCardState._analyze (cognitive 25): _AudioAnalysisCardState._analyze has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, error handling 3, 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/widgets/audio_analysis_widget.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d69e9c856690194688513e56b62c079088c29d7a8e4a7104ed23574ae7e4e81"}},{"ruleId":"D2","level":"warning","message":{"text":"_AudioFacts._processing (cognitive 25): _AudioFacts._processing has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 4 (6 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/widgets/audio_info_sheet.dart"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"98533fd4e9dada4cf879af72cb738ff8ca336a05f68e71c5b13b3652204b31af"}},{"ruleId":"D2","level":"warning","message":{"text":"_BatchConvertSheetState.build (cognitive 25): _BatchConvertSheetState.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, ternaries 3 (6 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/widgets/batch_convert_sheet.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1263a5bc399aafb3ce8658d9961d996d7dd311cd4280f886241b563d332a708"}},{"ruleId":"D2","level":"warning","message":{"text":"MornyePlayerQueue.build (cognitive 25): MornyePlayerQueue.build has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 10 (16 pts), if/else 5, match/switch 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/widgets/mornye_player_queue.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cf82f4cb60eb16e1067348132a0f38af9e971ae592dc06fe22744d4e6e2e15"}},{"ruleId":"D2","level":"warning","message":{"text":"Wu::quantize (cognitive 25): Wu::quantize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (4 pts) (nesting depth added 12). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/native_palette.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"41684cad67b2cfaa142e34be0c2653b114bb8d04a4e693e8cd082e289e524855"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::lyrics::payloads::format_apple (cognitive 25): mornye_core::lyrics::payloads::format_apple has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 7 (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":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"12630efaaa58f5db77f7a6ee1a0a431bd5c97248b29a601f77dfad29f8a78e8d"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::lyrics::payloads::parse_proxy (cognitive 25): mornye_core::lyrics::payloads::parse_proxy has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"898c865e670d04a528c05edb98895a709aaac41a73a89d504b5f19a4cc39e7aa"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::mp4::edit_freeform (cognitive 25): mornye_core::tags::write::mp4::edit_freeform has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (4 pts), 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":"rust_backend/crates/core/src/tags/write/mp4.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cde9e5efb8ec9729fb6124bc69927abf1b7c9f11cfb52dc01f6d3cb87bae994"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::enrich_download_extended (cognitive 25): Backend::enrich_download_extended has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/downloads.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2afc44cbcc79c2c4eac9de368e716a8a22f5ca96cc0aa1b410842df30d7e7a"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::backend::downloads::metadata::download_metadata_fields (cognitive 25): mornye_extensions::backend::downloads::metadata::download_metadata_fields has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4 (6 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":"rust_backend/crates/extensions/src/backend/downloads/metadata.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e321bc82269dbdf59758dbaebb3b9ba4151696dd67c42927a3a8a894be5e485"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).invokeVerified (cognitive 25): (anonymous).invokeVerified has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 3 (7 pts), error handling 2 (4 pts), boolean chains 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":"rust_backend/crates/extensions/src/provider.js"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"24218f4b5663afb5bf6b353b131467f50b221d4e883812a73d1d7df406c192ee"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadHistoryNotifier._commitInspectedHistoryChanges (cognitive 24): DownloadHistoryNotifier._commitInspectedHistoryChanges has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, ternaries 3 (5 pts), loops 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/providers/download_history_provider.dart"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5f5acc0f42f2d908c014a673ad0b257f791b267adc15049e199bfc5bcf3ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueueNotifier.pauseQueue (cognitive 24): DownloadQueueNotifier.pauseQueue has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 1 (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":"lib/providers/download_queue_provider.dart"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de4c9914b8f13ae68c9637b0fd4d7b5c7a4a138209c58117903ffb83591517a"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueueLookup.withoutIndex (cognitive 24): DownloadQueueLookup.withoutIndex has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 10, if/else 6 (9 pts), boolean chains 3, 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/providers/download_queue_state.dart"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe88ca53ed2a37a2071c0d532f206f809947b797cd2f148c339b06037416234c"}},{"ruleId":"D2","level":"warning","message":{"text":"_HomeShortcuts.build (cognitive 24): _HomeShortcuts.build has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 3 (8 pts), loops 4 (6 pts), match/switch 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/screens/home_tab_intro.dart"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e6c652f7aa4c9450256fc6f06c848128040a67ab10593af7749aaf0fe8a7c8"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibraryTracksFolderScreenState._showEntryMenu (cognitive 24): _LibraryTracksFolderScreenState._showEntryMenu has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 3 (7 pts), loops 2 (4 pts), boolean chains 3 (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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb74c95f3c5ce90e591e533b59744ef98cb19e7b40a5d837a46678bfbad0022"}},{"ruleId":"D2","level":"warning","message":{"text":"_SetupScreenState._completeSetup (cognitive 24): _SetupScreenState._completeSetup has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (nesting depth added 11). 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/screens/setup_screen.dart"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"0420830ca9b6f925a38e9d8882c204b68e56a0f290b10e599235a602d93323dd"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopUpdater.download (cognitive 24): DesktopUpdater.download has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, error handling 2 (3 pts), loops 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/services/desktop_updater.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7881d9519d8e76ad0e42f560940f7627faa8110cfcd63478254e29872c480824"}},{"ruleId":"D2","level":"warning","message":{"text":"FFmpegOutput.finalize (cognitive 24): FFmpegOutput.finalize has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 3 (7 pts), boolean chains 4 (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/services/ffmpeg_support.dart"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daea0ef954e6d245f29a9117159eeb42f4385cce4ad3de79ca405cf733db9e2"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkTrackResolver.resolve (cognitive 24): LinkTrackResolver.resolve has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 2 (3 pts), ternaries 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/services/link/features/link_track_resolver.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f5b40a7ca6a5c41e8313122ff784260c2c0dfbcf7c9a542d71d95266ad88c6"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioplayersPlaybackDeck._syncEqualizer (cognitive 24): AudioplayersPlaybackDeck._syncEqualizer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, ternaries 1 (3 pts), 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/services/music_playback_deck.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"7431285134c4bbc69edab179975478f731cb007ff1cb66f660cc914c5e3763a9"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicCast._changed (cognitive 24): _MusicCast._changed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 8, error handling 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/services/music_player_cast.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa826854328d0bf9c6ff26de33d81c4a747844e5900d0b8d80a8087d69e7dba3"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler.applySettings (cognitive 24): MusicPlayerHandler.applySettings has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 17, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_service.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f18c5646c4d5eb8ff996fd1ec88b02a845b2f19c879b19cc3608ce713ffd6f"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler._listenToPlayer (cognitive 24): MusicPlayerHandler._listenToPlayer has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 11 (12 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_service.dart"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3e1229256be505ba29240b7197cef4521197de850434d68a4a2494576f795d"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricPronunciationLayout.measure (cognitive 24): LyricPronunciationLayout.measure has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9, loops 3 (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/widgets/aligned_lyric_pronunciation.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c2c0302d4ae871bf746daed05d8b1a7ce3a33a05642c48fd9f2874781eecb4"}},{"ruleId":"D2","level":"warning","message":{"text":"AppAlertDialog.build (cognitive 24): AppAlertDialog.build has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, ternaries 2 (4 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/widgets/app_alert_dialog.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bace06d0a085d1b9e7250419135d7ae5f5eabdbd128a4a9679e26e6e2f07d3"}},{"ruleId":"D2","level":"warning","message":{"text":"_AudioOutputButtonState._showPicker (cognitive 24): _AudioOutputButtonState._showPicker has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 4 (8 pts), error handling 4, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/audio_output_button.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"48091f2edb0222fd78539fda9ec673e2af6a9a3fe88133e9abdbc95ebe32902a"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServiceChip.build (cognitive 24): _ServiceChip.build has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 7 (11 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/widgets/download_service_picker.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9624274e1963406fbd808f695a7f4519bfecd71778efa976d3a682435eba0ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressiveButton.build (cognitive 24): ExpressiveButton.build has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 4 (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/widgets/expressive_button.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6c952c696520f08cb5a47377d1420e26401174ea69a60d8377a2c9a9ba21ea"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterialPlayerLayout.build (cognitive 24): MaterialPlayerLayout.build has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 9 (13 pts), boolean chains 7, if/else 3 (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/widgets/material_player_layout.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"516888eeeaa6c412a288355dae33ca7d45026ac89142bf1c632bc6afd39f2d93"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::clock::load_zone (cognitive 24): mornye_core::clock::load_zone has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 1 (3 pts), boolean chains 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":"rust_backend/crates/core/src/clock.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1837f358af35660028d8a575ea30d0010ac8bf059b1063249e4448ff84fe6a80"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::resolver::titles_match (cognitive 24): mornye_core::resolver::titles_match has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 9, loops 4 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/resolver.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d330a255d554686d30d5ca607dbfb4121459ac7f37da50cdb4927c56bed84d41"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::comments::apply (cognitive 24): mornye_core::tags::comments::apply has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 3, 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":"rust_backend/crates/core/src/tags/comments.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b620d9e304d43c609b5566cbe29113f1f5828a6fe6bd9fe9f3018f2a05a4dc0f"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::picture (cognitive 24): mornye_core::tags::write::picture has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 pts), boolean chains 2, match/switch 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":"rust_backend/crates/core/src/tags/write.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d5860bc8c73edab7482b801f46081fd301cbbb3cc67943e019ab166c7aeb98"}},{"ruleId":"D2","level":"warning","message":{"text":"Cover::cached (cognitive 24): Cover::cached has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (7 pts), match/switch 1 (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":"rust_backend/crates/extensions/src/backend/cover.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8187af91f3ec48a1e6298137396e631c1989b7b89ecae52f16d4945e09ad1847"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::edit_file_metadata (cognitive 24): Backend::edit_file_metadata has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4, 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":"rust_backend/crates/extensions/src/backend/tags.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bf8d0bc1fdc224a116b166aa5e940c95e42fb8c2881e5a57a6963e3ab6c623"}},{"ruleId":"D2","level":"warning","message":{"text":"FilePath::open_native_read (cognitive 24): FilePath::open_native_read has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/files.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4e91cfde699448ecc4086ec0254691fcf9daa2177528c7c2738f41d4532c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::backend::downloads::result::success (cognitive 24): mornye_extensions::backend::downloads::result::success has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, loops 3 (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":"rust_backend/crates/extensions/src/backend/downloads/result.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ea98972cf76e6dc21722be33555a5bacebe15cc463d0b85e0eb3d1ced29a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsCache::set_persistence_path (cognitive 24): LyricsCache::set_persistence_path has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 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":"rust_backend/crates/providers/src/lyrics/cache.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3070eb83f3e0e696486ff8511828741711b6eadf646db47ea004424851ce0c9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).goString (cognitive 24): (anonymous).goString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 1 (3 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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c977dc3e726b7d702c60c09c6d3710a8ed3a2081a000a42b9ce66ccf393685"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionBridgeTracker.historyItemFor (cognitive 23): CompletionBridgeTracker.historyItemFor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (7 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/controllers/completion_bridge_tracker.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"525a2fe3f66456bf26799b20241433a3d8a3b3ab4f45ba700c03d461ee1d7934"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueueNotifier._buildDownloadRequestPayload (cognitive 23): DownloadQueueNotifier._buildDownloadRequestPayload has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 9, boolean chains 8, if/else 4 (6 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/providers/download_queue_provider.dart"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5cd7eeb182eaa7ddeb73d70452c25f57788deb436044a3e2be09bbce70b14f"}},{"ruleId":"D2","level":"warning","message":{"text":"_AlbumScreenState._buildAppBar (cognitive 23): _AlbumScreenState._buildAppBar has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 14, 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/screens/album_screen.dart"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fe391975871fe1a6e6b658b7babc3aa8fa2434e349749fb7053ac2cf910280"}},{"ruleId":"D2","level":"warning","message":{"text":"_LoadingOrErrorScaffold.build (cognitive 23): _LoadingOrErrorScaffold.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (13 pts), boolean chains 5, if/else 3 (5 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/screens/extension_collection_screens.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c32e300c613afe724ddfbff6e7fb0d8a4a594fafbeda6d7340a3d179ee0ec54"}},{"ruleId":"D2","level":"warning","message":{"text":"_CollectionTrackTile.build (cognitive 23): _CollectionTrackTile.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 12, if/else 5 (6 pts), boolean chains 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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"689601fabe81225c7ca8ae97b0f8e20302adc9866ba148af8f94d86d88dfb64b"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioAnalysisRunner.runAnalysis (cognitive 23): AudioAnalysisRunner.runAnalysis has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (6 pts), error handling 2 (5 pts), boolean chains 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/services/audio_analysis_runner.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60efd898dff448926849eaa54fe7d182346755ebd50fb8f5a32afebaec0e56d"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioAnalysisRunner._generateSpectrogram (cognitive 23): AudioAnalysisRunner._generateSpectrogram has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 3 (9 pts), ternaries 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/audio_analysis_runner.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d1297463ce7e50c004c3bfc74d796d46aa45cb6d160bd5be757cd770a88d3c"}},{"ruleId":"D2","level":"warning","message":{"text":"FFmpegDecryption._decryptMovKeyFile (cognitive 23): FFmpegDecryption._decryptMovKeyFile has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (7 pts), ternaries 4, loops 1 (2 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/services/ffmpeg_decryption.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7dad529a87da35bbbb8d722925df24e92005e0b2913e5746cf53c622c8c1f6"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryDatabase.findExistingTracks (cognitive 23): HistoryDatabase.findExistingTracks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/history_database.dart"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc05694d41341e71d3649d5f0ec4eaa1d1c1b265d40d495e35e1533daf8a5d2"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkDesktopOps.playHandoff (cognitive 23): LinkDesktopOps.playHandoff has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 4 (7 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_desktop_ops.dart"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc39dd4feb54c76ad7b9c546f3352e71a4ea1d75bacd72467ef6d4eabdd68f74"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollectionSyncStore.apply (cognitive 23): LinkCollectionSyncStore.apply has cognitive complexity 23 (threshold 15). Drivers by points: loops 9 (12 pts), if/else 4 (7 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/sync/link_collection_sync_store.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de638284348003b0a7e564e8f939177b50a46623c39e882e03093fbf3c16006"}},{"ruleId":"D2","level":"warning","message":{"text":"M3uPlaylistService.parseM3uEntries (cognitive 23): M3uPlaylistService.parseM3uEntries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 2 (6 pts), boolean chains 1, 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/services/m3u_playlist_service.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c94136300e8935fc78d8796c14e051bd40818d34a3fa533edb9a0cc9188a7ab"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkFileDownload.download (cognitive 23): NetworkFileDownload.download has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 2 (6 pts), boolean chains 4, 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/services/network_storage_download.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7b6007598ca56f2b15ed969b32459c47d3a7b209059d308eb55b2fd5a5797d"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplayGainService._writeLocalTags (cognitive 23): ReplayGainService._writeLocalTags has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 6 (8 pts), ternaries 2 (3 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/replaygain_service.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62c30d0810bc8b9c347152cd282fee34ed8fde5f20178712df45775a0102912"}},{"ruleId":"D2","level":"warning","message":{"text":"AppChoiceChip.build (cognitive 23): AppChoiceChip.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 10 (15 pts), if/else 6 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/app_choice_chip.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa075bfd1890b7ff3778fa4d2ec85153fa6f9bbc72d238e738419b80cb869e24"}},{"ruleId":"D2","level":"warning","message":{"text":"_TrailingControls.build (cognitive 23): _TrailingControls.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 7 (9 pts), boolean chains 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/widgets/desktop/desktop_player_bar.dart"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"d475a5e301ecb9d59f4f580796c1648e1e2f58e20ba346b7a9bedac719766e65"}},{"ruleId":"D2","level":"warning","message":{"text":"_LastfmSettingsState.build (cognitive 23): _LastfmSettingsState.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 5, boolean chains 4, match/switch 1 (2 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/widgets/lastfm_settings.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a4ac3ad71094361f20fb8894e04db800b506a2ca81bde871c6c224c50af370"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibrarySearchResultsState._open (cognitive 23): _LibrarySearchResultsState._open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 1 (3 pts), match/switch 1 (2 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/widgets/library_search_results.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"57224e99b70fd08851b821ef0f9faea47154f72325607b6f40b2ce169bf870d2"}},{"ruleId":"D2","level":"warning","message":{"text":"ImpellerCompatibilityKt.shouldDisableImpeller (cognitive 23): ImpellerCompatibilityKt.shouldDisableImpeller has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (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":"android/app/src/main/kotlin/com/zarz/mornye/ImpellerCompatibility.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9caa31beecc9a6e4900d674ed91d7db7614b8bc9043c300ddc612f452d499c"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::media::audio::ogg_quality (cognitive 23): mornye_core::media::audio::ogg_quality has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, 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":"rust_backend/crates/core/src/media/audio.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b357643b4f568eb64f03e3b40ac019a90f03c10348441601253e8f4226dc7d4b"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::crypto::transform (cognitive 23): mornye_extensions::crypto::transform has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 5 (10 pts) (nesting depth added 13). 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":"rust_backend/crates/extensions/src/crypto.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0519e981f467e10823dd0efe1b443702b7fcccd3d87b295cc04ff151191468"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::finish (cognitive 23): Builder::finish has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 6 (8 pts), match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/link/src/catalog.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2191073103970bab28400b40ef3bcc4972ad7e26277374a61cb3e1d664fe52"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_lyrics_translation::chunks (cognitive 23): mornye_mobile::native_lyrics_translation::chunks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_lyrics_translation.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"64726ef052c3c7f4d6152c3ceb636388398ed3f64f32a45a1c789ea053369dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"DeezerClient::get_json (cognitive 23): DeezerClient::get_json has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 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":"rust_backend/crates/providers/src/deezer.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf12defb4acea27d46a99338a93dd26566b87cc9af98f94c9cbac1fbd42852b8"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadProgressSample.applyTo (cognitive 22): DownloadProgressSample.applyTo has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, ternaries 4 (7 pts), if/else 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_progress.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e369dad0529edad5a4f3dfa1f331b4a69c0d3419e50fe966149e4d8033690b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueueNotifier._loadQueueFromStorage (cognitive 22): DownloadQueueNotifier._loadQueueFromStorage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, 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/providers/download_queue_provider.dart"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"335e21125cb8ea30720ca6a2afbfb274a6648fb27886851fc07fcfba4632a666"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryCollectionsNotifier.restoreFromBackup (cognitive 22): LibraryCollectionsNotifier.restoreFromBackup has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 5, ternaries 1 (3 pts), 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/providers/library_collections_provider.dart"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0eb4174dc6f05468b3465a32ddbe4af4d64ce993d5feadd62024a49e881cfe6"}},{"ruleId":"D2","level":"warning","message":{"text":"_SearchProviderDropdown.build (cognitive 22): _SearchProviderDropdown.build has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), ternaries 4 (6 pts), 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, 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/screens/home_tab_widgets.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c595ea9cb94928ba2eced81ba5557679dcfd2995c76a6d772a61d4ecb1ee8e15"}},{"ruleId":"D2","level":"warning","message":{"text":"_QueueLibraryPageData.fromHistorySnapshot (cognitive 22): _QueueLibraryPageData.fromHistorySnapshot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 3 (7 pts), loops 3 (6 pts), boolean chains 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/screens/queue_tab_helpers.dart"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e692ab5953c7a3a3507fb5b15c0c6054554db86a24e4c00703d2135747a0c91"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibrarySourceSettingsItem.build (cognitive 22): _LibrarySourceSettingsItem.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 14, if/else 4 (5 pts), boolean chains 3 (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/screens/settings/library_settings_page_widgets.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9cbf20261d21847a8cf3f945de8cd595571ab9d4563888d8e6c9a6730b6df4"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopDiagnostics._osCrashReportSince (cognitive 22): DesktopDiagnostics._osCrashReportSince has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, 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/services/desktop_diagnostics.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da6ce4384ad21636e521bc120f5347f289078c7709d5d717ab22e0d483f0796"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadMetadataResolver.resolveSpotifyTrackViaDeezer (cognitive 22): DownloadMetadataResolver.resolveSpotifyTrackViaDeezer has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 3 (6 pts), ternaries 2 (5 pts), 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/services/download_metadata_resolver.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d36166a2b02dc5191680901905d07fde51ac2ef7d9977618db874bbc12bded"}},{"ruleId":"D2","level":"warning","message":{"text":"FFmpegConversion.convertAudioFormat (cognitive 22): FFmpegConversion.convertAudioFormat has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 3 (4 pts), ternaries 2 (3 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/services/ffmpeg_conversion.dart"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f43695b598abf4f65c3d90db24088ab2db2e70eb13a7b0df26f6b628ea8c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"FolderPathTemplate.segments (cognitive 22): FolderPathTemplate.segments has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 8, 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/services/folder_path_template.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a72fa0292ea51d8648168e37404de274da0ea233d5e7bac4b17cec2f21de90e"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryLyricsSearchStore.index (cognitive 22): LibraryLyricsSearchStore.index has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/library_lyrics_search.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c471c06bf976696d3b8e7d218071f2cd29efae3a2b1d25922457c46431faa2"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkClientController._updateDiscovery (cognitive 22): LinkClientController._updateDiscovery has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 15, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/client/link_client_controller.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"1303306c5392dfbc7a449d4e4c5cf05c5868c036339469581889239b4486f133"}},{"ruleId":"D2","level":"warning","message":{"text":"_Arrival.read (cognitive 22): _Arrival.read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), ternaries 2 (4 pts), error handling 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_arriving_files.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0e519395d372bc7095b73310734c64e4acf779e22f88c843b7dfe49e733c96"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPhoneSources.onMessage (cognitive 22): LinkPhoneSources.onMessage has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (8 pts), ternaries 2 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_phone_sources.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"200c76b767b27482d28b014aab550df076789cfa88d34afb106bad719cff39a9"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPhoneSources.metadata (cognitive 22): LinkPhoneSources.metadata has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 1 (2 pts), ternaries 2, 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/services/link/desktop/link_phone_sources.dart"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d2ed460e8d61cd0da4a2eff8c4ed308f03e8012b1b36463cd18f3051267bb2"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeLinkPlayerPort.snapshot (cognitive 22): RuntimeLinkPlayerPort.snapshot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 8, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_player.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2fc2fa05e2b9b2a3f6b6f7e9bc7c273d2de3d621e00eccd00019f27287f2d3"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicAutoMix._alignIncoming (cognitive 22): _MusicAutoMix._alignIncoming has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_automix.dart"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"82567ddb050241d8761aaf430dc85802476c127b7cc56dcf82c75744d3c423c3"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler.customAction (cognitive 22): MusicPlayerHandler.customAction has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, error handling 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_service.dart"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11da92673c1504292964a72975f4ce16f08d45f0f4d059544a1c02e2a853deb"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayableMedia.toMediaItem (cognitive 22): PlayableMedia.toMediaItem has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9, ternaries 7, boolean chains 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/services/playable_media.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"de18f85bd631b462e09a11b81fc9b1d074979f67a5a56a0ba432da552d04b0e4"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeSearchSkeleton._sectionSkeleton (cognitive 22): HomeSearchSkeleton._sectionSkeleton has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 5 (9 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/animation_utils.dart"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6fa3436a44ebe5f9a0c3e30dcd5cb642096cf1be353179070241015c61f21a"}},{"ruleId":"D2","level":"warning","message":{"text":"_AudioAnalysisCardState._tryLoadFromCache (cognitive 22): _AudioAnalysisCardState._tryLoadFromCache has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, 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/widgets/audio_analysis_widget.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e21558967edd5e1e2ecae680e2ac2d77326b6ad67e5765dbfaa0f040f873bc"}},{"ruleId":"D2","level":"warning","message":{"text":"_LyricsEditorSheetState._buildFooter (cognitive 22): _LyricsEditorSheetState._buildFooter has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 12 (14 pts), if/else 3 (5 pts), loops 1 (2 pts), boolean chains 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/widgets/lyrics_editor_sheet.dart"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a850490269fae23e575e82feebf408587f2f9cd56c41b46894134ae8ad7b98a4"}},{"ruleId":"D2","level":"warning","message":{"text":"_MornyeLandscapePlayerState.build (cognitive 22): _MornyeLandscapePlayerState.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 14 (16 pts), if/else 3, boolean chains 2, 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/widgets/mornye_landscape_player.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe2ad143c70c90ec382f5a3fb1daba0fb8a043d44dd2371e91387af80d79649"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsSegmentedChoice.build (cognitive 22): SettingsSegmentedChoice.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 4 (6 pts), loops 3 (5 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/widgets/settings_group.dart"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e0efd4b494f7a6702a0adbd9cf7f1e1870c5a46803e4fc4dc6ac146a5c4159"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadService.buildNotification (cognitive 22): DownloadService.buildNotification has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bddfd43cd8f3c4c6f837f2667903deffac65cf2b600dc02d1026b1d96fb3b5b"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::lyrics::payloads::apple_supplement_lines (cognitive 22): mornye_core::lyrics::payloads::apple_supplement_lines has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, 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":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"10945fef5282a3a5ca6814c08d33ff0a892926d789c62a0c8f4c6984318cde8b"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::text::json_surrogates (cognitive 22): mornye_core::text::json_surrogates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 1 (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/text.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cc56a43781dfd76aaf6843f8cc16b1969a115cedf7a25c7c0a85e9d714fed5"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::xml::check_depth (cognitive 22): mornye_core::xml::check_depth has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 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":"rust_backend/crates/core/src/xml.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34591c6209b1f67fcb6b4304ac75ff01f2663741f8c9b2aec3c4a6c1487a287"}},{"ruleId":"D2","level":"warning","message":{"text":"PostProcessingHook::deserialize (cognitive 22): PostProcessingHook::deserialize has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 5 (10 pts), loops 1 (nesting depth added 11). 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d279666583154d3f4f2d4ba7a8be0d68afbb4976c0e9d0a99c275086c620563"}},{"ruleId":"D2","level":"warning","message":{"text":"SignedSessionClient::refresh (cognitive 22): SignedSessionClient::refresh has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 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":"rust_backend/crates/extensions/src/signed_session/exchange.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1ed53772a309ea8fcbe93df5dd94c527df664cc6435d14fcfc646b2c61abb3"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::network_host::parse_json (cognitive 22): mornye_extensions::network_host::parse_json has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/network_host.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6cd438cf01f9029d56ad323c0378a42236fb974fb40863d3a6818783b6b741"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_library::snapshot (cognitive 22): mornye_mobile::native_library::snapshot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, loops 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":"rust_backend/crates/mobile/src/native_library.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"330d82a0bb12c48a51a3b28eabaccd17cdfe7f9586ee422c22176752ac7ed0f3"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkPermissions::validate_with_grants (cognitive 22): NetworkPermissions::validate_with_grants has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 8 (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":"rust_backend/crates/network/src/policy.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e77e00d860fa86d6bc50bdefe0629ff15bb327b9bd48ff86f28546ade4490b0"}},{"ruleId":"D2","level":"warning","message":{"text":"DeezerClient::coalesced (cognitive 22): DeezerClient::coalesced has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/providers/src/deezer/cache.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"16576ea279f1cfcd014da82377c447371c02905ad2b0c57f96c6a6e538f6e0b4"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadHistoryNotifier._loadFromDatabase (cognitive 21): DownloadHistoryNotifier._loadFromDatabase has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, 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/providers/download_history_provider.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a390fe3402b9f958376a3e09d13e33aafbbb2ef3e0c19be118322df5c34a19b"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueueNotifier._processQueue (cognitive 21): DownloadQueueNotifier._processQueue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, 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/providers/download_queue_provider.dart"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e806498212f9ed76118f585db81f78781c400b1b4cfbf161b2ab0e216a9e64"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadRun._convertLocalM4aToFlac (cognitive 21): _DownloadRun._convertLocalM4aToFlac has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 1, error handling 1 (nesting depth added 10). 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed8ef2ed46eda2799767ec88855beb734865f43c33fa784794978ea11e465cc"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExtensionItem.build (cognitive 21): _ExtensionItem.build has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 19, 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/screens/repo_tab.dart"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbfecea0b2867b09c123152565c740701f99b7e314c2cc0b516bdc429bc8508"}},{"ruleId":"D2","level":"warning","message":{"text":"_EditMetadataSheetState._save (cognitive 21): _EditMetadataSheetState._save has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, match/switch 1 (2 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/screens/track_metadata_edit_sheet.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f963c5a729565df8d6e4be126409e8859f7f213c4f8b15fbe899587da451a157"}},{"ruleId":"D2","level":"warning","message":{"text":"AppStateDatabase._writeQueueChanges (cognitive 21): AppStateDatabase._writeQueueChanges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 3, 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/services/app_state_database.dart"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02400d5eda202e63a5b64efb317ec3b177eba2737268527d5aa34d6a86218a2"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioMetadataMapper.vorbisToNativeChunkFields (cognitive 21): AudioMetadataMapper.vorbisToNativeChunkFields has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, 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/services/audio_metadata_mapper.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c38e323b0de800d3733babe5d89186f1334fe0d6f5a6099e3d859a0171adc72"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoMixAnalyzer.analyzeTransition (cognitive 21): AutoMixAnalyzer.analyzeTransition has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, ternaries 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":"lib/services/automix_analyzer.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63c8b730612f39cfc22dced304102e7aaee8c2ba364e23a8b731b3685f5e931"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadMetadataResolver.resolveDeezerIdViaProviderIfNeeded (cognitive 21): DownloadMetadataResolver.resolveDeezerIdViaProviderIfNeeded has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (6 pts), boolean chains 4, error handling 1 (nesting depth added 10). 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/services/download_metadata_resolver.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7731a7ea5b9328ffbccc512c71fbe95480d05fa5c8c010638348b73861e86f3"}},{"ruleId":"D2","level":"warning","message":{"text":"FFmpegConversion.splitCueToTracks (cognitive 21): FFmpegConversion.splitCueToTracks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 3 (5 pts), error handling 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/ffmpeg_conversion.dart"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e965b79ba4a381f46a176c291cd5d11115e7f8f6ed1998fec97d6f9d4e4dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryFileSizes._fill (cognitive 21): LibraryFileSizes._fill has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (8 pts), ternaries 3 (8 pts), if/else 2 (4 pts), 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/services/library_file_sizes.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f972956750ec279fa67d70eb65e3ece4d93c5f9404a53524908c8dee8507e5"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkLibraryExecutor._exportSidecar (cognitive 21): LinkLibraryExecutor._exportSidecar has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (6 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_library_executor.dart"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a179d02702a5611d500d51b64207b05793d49fcf44fc74e022ff6b62e950c7f4"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsAiClient._sendTranslation (cognitive 21): LyricsAiClient._sendTranslation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, ternaries 1 (3 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/services/lyrics_ai_client.dart"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c309382b65494c629ace8904c40824e10b6922c92cd07bfa0b0890f31207ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaKitPlaybackDeck._syncEqualizer (cognitive 21): MediaKitPlaybackDeck._syncEqualizer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 1 (4 pts), boolean chains 1, error handling 1 (nesting depth added 11). 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/services/media_kit_playback_deck.dart"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6b5372a9e583fa0a8d07dedb024325faed407c594fb0040b802e9e9e042772"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicGapless.handoff (cognitive 21): _MusicGapless.handoff has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, ternaries 4, error handling 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, 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/services/music_player_gapless.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5c9689f8b780fdcd9b2f904205d741f8d402b7fceaf84380dc9c4f0822f847"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler.restoreSession (cognitive 21): MusicPlayerHandler.restoreSession has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (3 pts), 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/services/music_player_service.dart"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61ecdd0ef6951597f3a22bdf5a9b9f14010347ef2a55da3ba693db1d5dccf70"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkPlaybackCache.lookup (cognitive 21): NetworkPlaybackCache.lookup has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2 (3 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/services/network_playback_cache.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ff0e0c09d8940961cc095c5b9725a6206cdd8bfb1910d8c7009375ce0cdd0e"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformBridge._scanToNDJSONFile (cognitive 21): PlatformBridge._scanToNDJSONFile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 3). 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/services/platform_bridge.dart"},"region":{"startLine":2587}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1b00ab0ad9ff09403c83af51aa529619ac286dc5419437c1989f08ca95263b"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsParser._alignSupplements (cognitive 21): LyricsParser._alignSupplements has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (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/utils/lyrics_parser.dart"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1b745cfe67825155f4ca1b53f33479ffdd756a84f014edb055e40139f45a78"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopNavigationRail.build (cognitive 21): DesktopNavigationRail.build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (6 pts), loops 3 (4 pts), boolean chains 3 (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/widgets/desktop/desktop_navigation.dart"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d71f4e9db8557df583c8c1e804fd2acaa321fcb8e97047443d3b8418f83176e"}},{"ruleId":"D2","level":"warning","message":{"text":"_DesktopListScopeState._handleKey (cognitive 21): _DesktopListScopeState._handleKey has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 9 (10 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/desktop/desktop_selection.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b150714909c057422f99ccf026be6eb1f6a9e2c4fe0b6aa8933d5305819f4dda"}},{"ruleId":"D2","level":"warning","message":{"text":"_TransferSongRow.build (cognitive 21): _TransferSongRow.build has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 2, match/switch 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/widgets/link/link_transfer_tile.dart"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b34595e97658f1ea109c5267ded6ea36a8f099a7ef35b1f3aa2825210132493"}},{"ruleId":"D2","level":"warning","message":{"text":"_MornyeGlassRim.paint (cognitive 21): _MornyeGlassRim.paint has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 10 (17 pts), if/else 4 (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/widgets/mornye_chrome.dart"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b935b1255c4064483278acb9f473e04005472d875b7fdbddb226544d6a4a28d"}},{"ruleId":"D2","level":"warning","message":{"text":"_MotionHeaderBannerState._initialize (cognitive 21): _MotionHeaderBannerState._initialize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, ternaries 3, 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/widgets/motion_header_banner.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b0a5ce49a89ab1f10255a00d343ae57b1d8f82eb6d5d4d34cc92f203f3a565"}},{"ruleId":"D2","level":"warning","message":{"text":"_SyncedLyricsViewState._scheduleNextLine (cognitive 21): _SyncedLyricsViewState._scheduleNextLine has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 13, if/else 4 (5 pts), ternaries 2, loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/player_lyrics.dart"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30ddec6b8c6ee63e2f48d1b544aec6548f0916b00d9a98b6506c49770677c76"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsItem.build (cognitive 21): SettingsItem.build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 4 (9 pts), boolean chains 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/widgets/settings_group.dart"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"a777a687f14b8ee0d4136664b156228fee1d28d43b386bcf4ab4a7694ed492ff"}},{"ruleId":"D2","level":"warning","message":{"text":"_UpdateDialogState._formatChangelog (cognitive 21): _UpdateDialogState._formatChangelog has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 1, loops 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/widgets/update_dialog.dart"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b182413294bc7090abe918285e913b6b17e469870fab42b833d782f045b0a48d"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFinalizerMediaKt.finalizeQualityVariantFilename (cognitive 21): NativeFinalizerMediaKt.finalizeQualityVariantFilename has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerMedia.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"468a7020b15d48082f41abc637778a0b5cec7742fc6bceb0f8c0bcbbdb8f5249"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFinalizerMetadataKt.refreshFinalAudioQualityMetadata (cognitive 21): NativeFinalizerMetadataKt.refreshFinalAudioQualityMetadata has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 5, error handling 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerMetadata.kt"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3231e589508d19ef891e5b579ca0ac2baf011792fb37a962b5b6087e5e7136"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFinalizerPostProcessKt.runPostProcessing (cognitive 21): NativeFinalizerPostProcessKt.runPostProcessing has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerPostProcess.kt"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c83dd6688cc5108c2240819f7a32bc9d5fee657aa30d7a4d0d36332ad2b355"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadProgressSubscription.poll (cognitive 21): DownloadProgressSubscription.poll has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (9 pts), error handling 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/DownloadProgressSubscription.swift"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc859b2579c1b44c2834fece20d868727b8330b5190d7ad76da19ffc7576ec4f"}},{"ruleId":"D2","level":"warning","message":{"text":"Source::analyze_window (cognitive 21): Source::analyze_window has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (11 pts), if/else 2 (6 pts), match/switch 2 (4 pts) (nesting depth added 14). 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":"rust_backend/crates/core/src/media/hires.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3127f2a199e7f385070dee6720734dc711be490dd2717a9e086328da19c48bf9"}},{"ruleId":"D2","level":"warning","message":{"text":"Spectra::describe (cognitive 21): Spectra::describe has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 5 (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":"rust_backend/crates/core/src/native_audio_features.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb22e59779eb96580614159ea9d9efcf3b467302d0ab6e9cd22c610c309eb89"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::lyrics::payloads::format_kpoe (cognitive 21): mornye_core::lyrics::payloads::format_kpoe has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 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":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd3ae04f51983b127faed2abbd7a566fe710d6a65ed2e3dbfbc26f8157ea031"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::metadata::share::share_url (cognitive 21): mornye_core::metadata::share::share_url has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 3). 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":"rust_backend/crates/core/src/metadata/share.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e23116f516215c5f1fa2cc69580c85213d177e234916bb117c2313fa0a167ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::collect_library_files (cognitive 21): Backend::collect_library_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 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":"rust_backend/crates/extensions/src/backend/library/scan.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"74984116add9fc2ee1a1f47eca548786e536c31dbbe3625bcb44cfca56cd7a5b"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::reenrich_identifiers (cognitive 21): Backend::reenrich_identifiers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 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":"rust_backend/crates/extensions/src/backend/reenrich.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"999f13a81ba6ac7c3d1040927066597e0644eb00131e898b57b911b609be38ad"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionPackage::open (cognitive 21): ExtensionPackage::open has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, 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":"rust_backend/crates/extensions/src/package.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df910fdff8e1c2a09316db0af6be2ef120e187dd008ded31c260df954d63e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::crypto_host::segments (cognitive 21): mornye_extensions::crypto_host::segments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/crypto_host.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfceb952fe8c68b05dffa73d7b84eff867d0537777e9ca9356d9e6bf759e1e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::provider::audio_traits (cognitive 21): mornye_extensions::provider::audio_traits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 2 (3 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":"rust_backend/crates/extensions/src/provider.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7be809ad681be28a28b7fe599a005a76aadbb0dd6e76277c7b70630155d296"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_link::files::prune (cognitive 21): mornye_link::files::prune has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2, 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":"rust_backend/crates/link/src/files.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f410c1ed211e8c43ac8eac42c2f68feb99bb1a8129487fa0a816c257ef06d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_link::subsonic::forward::call (cognitive 21): mornye_link::subsonic::forward::call has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 9). 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":"rust_backend/crates/link/src/subsonic/forward.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"86aa690819cc50ac745a82f54b237a3e501ab1a244254c31142ad70f39b9ee57"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_network::url::parse_host (cognitive 21): mornye_network::url::parse_host has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/network/src/url.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"0921911f58c9f85c9c7ea015c11a2b546b207cec178cb6db9ed1530d8305e7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_providers::lyrics::builtin::direct::genius_text (cognitive 21): mornye_providers::lyrics::builtin::direct::genius_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/providers/src/lyrics/builtin/direct.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe786b52721a296595ae14086e88bce73b2a857ac6294a6bae62fbd7973ddb9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::downloadSegments (cognitive 21): (anonymous)::downloadSegments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, ternaries 1 (3 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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e69b046e6494ae89302762dbd7f320ce7877311ee43acd46502406e70b9bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"_AccountFormDialogState._field (cognitive 20): _AccountFormDialogState._field has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 5 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/controllers/extension_action_forms.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da8aa976a277f3841cf527334254ff26b826afb0091c099b84ba10c60015605"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchReEnrichRunner.preview (cognitive 20): BatchReEnrichRunner.preview has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/controllers/local_track_batch_actions.dart"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"838b7da12c62d7054f57cc7ad378b134f11b9b04a0069986725beecddf0f968f"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadRun._embedSafNonM4a (cognitive 20): _DownloadRun._embedSafNonM4a has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (5 pts), ternaries 5, error handling 2 (3 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95fd1593bbc2029110f5aae7dc42b73f76c58b3a7e14e7722aa38f9042de1fa"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionNotifier.setExtensionEnabled (cognitive 20): ExtensionNotifier.setExtensionEnabled has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 1 (4 pts), boolean chains 3, 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/providers/extension_provider.dart"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2d3d108d2a75b46c28ac50d672795c64c4729d0e7db0d092113698b6407783"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryCollectionsNotifier.ensurePlaylistLoaded (cognitive 20): LibraryCollectionsNotifier.ensurePlaylistLoaded has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, 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/providers/library_collections_provider.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f086e0afa58c3c487fa980323955bd43220ca0c2f2ef4ede29221e164b4ddfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalLibraryNotifier.cleanupMissingFiles (cognitive 20): LocalLibraryNotifier.cleanupMissingFiles has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/local_library_provider.dart"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad94f50b7b8e114219c6d93bb2224bdae737fd66767d4784452defa825f0c902"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadedAlbumScreenState._buildAppBar (cognitive 20): _DownloadedAlbumScreenState._buildAppBar has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 11, loops 5 (6 pts), boolean chains 2, if/else 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/screens/downloaded_album_screen.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3837facde392bb4f43e6fec8474a57fbb566053d26771381bc8563f61d6f9140"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocalAlbumScreenState._buildPage (cognitive 20): _LocalAlbumScreenState._buildPage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 1 (4 pts), ternaries 4, boolean chains 2 (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/screens/local_album_screen.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"142f0b7335a568c6a413f1b364cb769ad1af4683bd42de6ef8384f0425cf5aeb"}},{"ruleId":"D2","level":"warning","message":{"text":"_MonthlyDonationGoalCard.build (cognitive 20): _MonthlyDonationGoalCard.build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 5). 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/screens/settings/donate_page.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdc0ffdc979d7a5137c990f96878b23506651eb26d02056e33c7ccedb4b4419"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExtensionsPageState._installExtension (cognitive 20): _ExtensionsPageState._installExtension has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, error handling 1 (2 pts), loops 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/screens/settings/extensions_page.dart"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a02e49fdc6504cd22ee680e63e6d39f51cf6b1560903b0d68bdec247eed9089"}},{"ruleId":"D2","level":"warning","message":{"text":"_LinkSettingsPageState.build (cognitive 20): _LinkSettingsPageState.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (13 pts), if/else 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/settings/link_settings_page.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5f3d6d41c6593360f94363e14bdfe8df77da210615a6981796c421061c1b61"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsSettingsPage.build (cognitive 20): LyricsSettingsPage.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (12 pts), boolean chains 4, if/else 3, 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/screens/settings/lyrics_settings_page.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dabfcb8a3e4f04a54c0f9c42cc7d83bbd9bd7ecee556ff3897732ad09b24be0"}},{"ruleId":"D2","level":"warning","message":{"text":"_CategoryRow.build (cognitive 20): _CategoryRow.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 16, boolean chains 2, 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/screens/settings/settings_tab.dart"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"8242d61a354eb891a1b9d764ebe7f3cba004d986cb9b621cb6a4d51b296d927a"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioAnalysisDiskCache.loadFromCache (cognitive 20): AudioAnalysisDiskCache.loadFromCache has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, 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/services/audio_analysis_cache.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aec6f440c964fe811d7f61c7b573a19896976a4e8f1734d95e1fc5586d2531d"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoMixEffectRenderer.render (cognitive 20): AutoMixEffectRenderer.render has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, error handling 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/services/automix_effect_renderer.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bec5548a9779db4024e4e5f5cf8f78d955a69f4d34c33c6040a530e4eb5b56"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverStore.file (cognitive 20): CoverStore.file has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, 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":"lib/services/cover_store.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2eca1c81b3f7a3c41352176598cac0a7e69d64dbf4baa08d703a45ede7e211"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueuePersistence._enqueue (cognitive 20): DownloadQueuePersistence._enqueue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 3, 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/services/download_queue_persistence.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6110c9efad7a6a90a663b055a717edf689ca02a5bfa640eb6f88035e4bdcadd1"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadedEmbeddedCoverResolver._ensureCover (cognitive 20): DownloadedEmbeddedCoverResolver._ensureCover has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5 (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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e077ca8ca305a778df44a91b3a663090ccd4f8de84c374b28ca1d6f3bb6ddad"}},{"ruleId":"D2","level":"warning","message":{"text":"FFmpegConversion._convertToLossless (cognitive 20): FFmpegConversion._convertToLossless has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 7, boolean chains 3 (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/services/ffmpeg_conversion.dart"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"178b4877b2930c04e4d8b8959d8e0505ec7da36aeaac3e940190e1a8783a4982"}},{"ruleId":"D2","level":"warning","message":{"text":"FFmpegProbe._readAudioProperties (cognitive 20): FFmpegProbe._readAudioProperties has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 2 (5 pts), boolean chains 3, 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/services/ffmpeg_probe.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14ba8019fa9b7a6363baf42a6de05e9343e5953a8778551ba2c47f13ed95534"}},{"ruleId":"D2","level":"warning","message":{"text":"_Arrival._look (cognitive 20): _Arrival._look has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 1 (4 pts), boolean chains 1, error handling 1 (nesting depth added 10). 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/services/link/desktop/link_arriving_files.dart"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1493d4184a42a2da17a704bdf36dab38e5b3c8dc177a8899faa4d4bd349ae31"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkDesktopOps.runCommand (cognitive 20): LinkDesktopOps.runCommand has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 2 (4 pts), match/switch 1 (nesting depth added 9). 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/services/link/desktop/link_desktop_ops.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"835f56965f8b9acf0b5870797add484f96f1e8304b4085f8e6aa4664ff90052d"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPhoneCatalogs._page (cognitive 20): LinkPhoneCatalogs._page has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 13, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_phone_catalogs.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed4fb19df4f68df59e1278cada143e989ca80a6f59a79f4c7f4e0186ffde8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkHistoryArtwork.handle (cognitive 20): LinkHistoryArtwork.handle has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 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/services/link/sync/link_history_artwork.dart"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"656d1d30676516b5bc12c5bad93069a483083fa4edd288221ff0c0d435c7e43e"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedLyricsTranslation.fromJson (cognitive 20): SharedLyricsTranslation.fromJson has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 16, if/else 3, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/lyrics_translation_sharing.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"938107a48f4b2d13b17a0594d96a98f238489d2017e0ca31c442743dc1635070"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformBridge._restorePersistentCache (cognitive 20): PlatformBridge._restorePersistentCache has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, 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/services/platform_bridge.dart"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc69d8056979d142fdb0b02cba82c30fcae7c0acf1945917039f8dc3600b3a98"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerWidgetService._readArtwork (cognitive 20): PlayerWidgetService._readArtwork has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (5 pts), boolean chains 4, loops 1 (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/services/player_widget_service.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3af4e4bdf18ed8b0d5638f98a7635799998a6009bb0cd7ae70d21c74d81c300"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplayGainService._updateFile (cognitive 20): ReplayGainService._updateFile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 2 (4 pts), boolean chains 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/services/replaygain_service.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"55096f955fdb45499f82191cd4ec631da1237917a71e7fed5d3e0f7d71eca379"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverPalette._resolve (cognitive 20): CoverPalette._resolve has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (6 pts), error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 11). 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":"lib/theme/cover_palette.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2491fd3f4c60dfe6139ba8e31d1953531e7c6fc07015511d6d2d7ba34d7dad4"}},{"ruleId":"D2","level":"warning","message":{"text":"_MaterialContextMenuState.build (cognitive 20): _MaterialContextMenuState.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (15 pts), loops 2 (3 pts), if/else 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/desktop/context_menu.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4d04f3a98352efc57b971a9bb6664341ce2fc5661b3a4ccfcae3ce37518106"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopSidebar.build (cognitive 20): DesktopSidebar.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (9 pts), loops 4 (6 pts), if/else 4, boolean chains 1 (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/widgets/desktop/desktop_navigation.dart"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"2286f330b70fefef9ae61d122439fac74399099c4d1e6fcaa13fb2aa7cf09de4"}},{"ruleId":"D2","level":"warning","message":{"text":"MornyeContextMenu.build (cognitive 20): MornyeContextMenu.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (11 pts), loops 3 (4 pts), if/else 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/mornye_context_menu.dart"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"c885cb3ffe94e9cdd932f09f46ada335f8f6556cabf808dcf35d545f7919fd89"}},{"ruleId":"D2","level":"warning","message":{"text":"_PlaybackTimeBuilderState._sync (cognitive 20): _PlaybackTimeBuilderState._sync has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, if/else 4, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/playback_time_builder.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a236f1f7687c6f76c89f02310b12a19f26550b6949273ed2b8b9492e8624222f"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadService.startNativeWorker (cognitive 20): DownloadService.startNativeWorker has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 4 (7 pts), loops 3, 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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bd04275f09d0e1a06d23a2291e72e501ee6ca8da3b3b0071ad87a5e1ae8efa"}},{"ruleId":"D2","level":"warning","message":{"text":"Lines::next (cognitive 20): Lines::next has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (19 pts), 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":"rust_backend/crates/core/src/cue.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5ee1c00ab36c604bb50a840e1c0f70e8f40d744cb0db9c75257823b6ecb16d"}},{"ruleId":"D2","level":"warning","message":{"text":"WavSource::analyze_window (cognitive 20): WavSource::analyze_window has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/media/hires.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be7e8a0e6cb14de17eb347f49876354619c8f4eef682fb50926ee72ea6c4e68"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::library::library_metadata (cognitive 20): mornye_core::tags::library::library_metadata has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3 (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":"rust_backend/crates/core/src/tags/library.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9912c58aadae5cca0383edb1a22a489a6ac22f1445b9198ce95c1fd4708f3f0c"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::xml::markup_end (cognitive 20): mornye_core::xml::markup_end has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (3 pts), boolean chains 2, 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":"rust_backend/crates/core/src/xml.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff971e1db4946b893134be95d8630b34dd52b81013e44d4a0b41118bde0d3736"}},{"ruleId":"D2","level":"warning","message":{"text":"Health::run_check (cognitive 20): Health::run_check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 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":"rust_backend/crates/extensions/src/backend/health.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b2e8dc26a9758d282c4a3826a276a89d62215dee5da2eaaac1906a31627b35"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::handle_url_json (cognitive 20): Backend::handle_url_json has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/provider_metadata.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"58064f97669bacf78bbd12645b2bf6ec5478755b20aa62f168c9d1dc8a605876"}},{"ruleId":"D2","level":"warning","message":{"text":"QualityOption::deserialize (cognitive 20): QualityOption::deserialize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 5 (9 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bf6cb15fc841085d8aac447c164ac0f8ab894f279812206e784cfe5a3056dc"}},{"ruleId":"D2","level":"warning","message":{"text":"SignedSessionClient::bootstrap (cognitive 20): SignedSessionClient::bootstrap has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/signed_session/exchange.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c27bcd1881d80635fad54a2e152f6ffafd06d2beebb551397b676f32a217ebc"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::manager::downloads::normalize_decryption (cognitive 20): mornye_extensions::manager::downloads::normalize_decryption has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 1 (2 pts), match/switch 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":"rust_backend/crates/extensions/src/manager/downloads.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0d94608d48d14b141699ebff3ac4b714a35e60a603deef98089eb3e23ad6bc"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::manager::metadata::track_input (cognitive 20): mornye_extensions::manager::metadata::track_input has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (4 pts), boolean chains 3, loops 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":"rust_backend/crates/extensions/src/manager/metadata.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd5513ca8996a540312416a5d342a44beaab96f409bd08b0a9f49843b7948da"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_playlists::parse_m3u (cognitive 20): mornye_mobile::native_playlists::parse_m3u has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (19 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":"rust_backend/crates/mobile/src/native_playlists.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c044c416eea253cca53f7f587aa9a0607b61f2a1dff4bf778d7057b6c49dc6f4"}},{"ruleId":"D2","level":"warning","message":{"text":"UrlParts::resolve_reference (cognitive 20): UrlParts::resolve_reference has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/network/src/url.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3abe8a72026e552f2f6286253db117498372c8122540a7a36754f8ed87f559a"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_providers::resolver::client::resolve_chain (cognitive 20): mornye_providers::resolver::client::resolve_chain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/providers/src/resolver/client.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdd38459259ecfc1e5018fe4747f10fb8a6d7adab5ba14a423100cc97f69c5c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).invokeManaged (cognitive 20): (anonymous).invokeManaged has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 2 (4 pts), loops 1 (2 pts), error handling 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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0567825089f12eb4e679530b93cc5fa81bb81a1c7ef8292f9505390debfa953"}},{"ruleId":"D2","level":"warning","message":{"text":"_EagerInitializationState._maybeAutoScanLocalLibrary (cognitive 19): _EagerInitializationState._maybeAutoScanLocalLibrary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (2 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/main.dart"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"108133a718c6f070f66d6af4ea271b88c825a0caac194e934165a179cbd8dbf9"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueueLookup.updatedForIndices (cognitive 19): DownloadQueueLookup.updatedForIndices has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 3, 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/providers/download_queue_state.dart"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff1204c1da9708b8b21202fd811d7c10525df1b1468556388bd895c79c08ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"EqualizerController._load (cognitive 19): EqualizerController._load has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 4 (7 pts), boolean chains 2, error handling 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/equalizer_provider.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfed0099350f536ab4513fb592ca00d11ae0941333e68a16bfd920ddc04eb0e"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackNotifier.customSearch (cognitive 19): TrackNotifier.customSearch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 2 (4 pts), loops 1 (2 pts), boolean chains 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/providers/track_provider.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba45290dc718f6c5c609705185e59542db363b4e90e60cea1d707c034c8df328"}},{"ruleId":"D2","level":"warning","message":{"text":"_ArtistScreenState.initState (cognitive 19): _ArtistScreenState.initState has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, 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/screens/artist_screen.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c99a13e983992ed6f35477321c84ee4d08c3412f303aa610fe3a082ca69804"}},{"ruleId":"D2","level":"warning","message":{"text":"_TrackItemWithStatus.activate (cognitive 19): _TrackItemWithStatus.activate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4 (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/screens/home_tab_widgets.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20953441b99a6cb4e4156eea42bd1029562318b922a402f0df65af5e3b478a1"}},{"ruleId":"D2","level":"warning","message":{"text":"_ListeningStatisticsScreenState._summarySlivers (cognitive 19): _ListeningStatisticsScreenState._summarySlivers has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (13 pts), loops 3 (4 pts), if/else 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/screens/listening_statistics_screen.dart"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"374e6b7098c9fae59025346ea8da93518880ffda96a5122c79741b5b2d02f7e3"}},{"ruleId":"D2","level":"warning","message":{"text":"_BackgroundPicker.build (cognitive 19): _BackgroundPicker.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (18 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/screens/lyrics_share_screen.dart"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2e2023308f14d41b66831cef8354a05e2967ee8473847e97777164967e0cea"}},{"ruleId":"D2","level":"warning","message":{"text":"_NetworkStorageScreenState._load (cognitive 19): _NetworkStorageScreenState._load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (3 pts), boolean chains 2, 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/screens/network_storage_screen.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"384395acfb99c286e9e3fefadeb65ba9ee0a7329500121491a38e7ddb449d034"}},{"ruleId":"D2","level":"warning","message":{"text":"_LogScreenState.build (cognitive 19): _LogScreenState.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 13, boolean chains 4, if/else 1, 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/screens/settings/log_screen.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3cc8340cd469c98dd55a564e3cc42b8bbed14b336073cedb6bf62249fbd111"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionStorageService._migrateDirectory (cognitive 19): ExtensionStorageService._migrateDirectory has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/extension_storage_service.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8247f74843f248d233939b0237610e8f4e4e1c4f7a6cf4037a925e3daa5871e8"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkClientController._onDiscoveryChanged (cognitive 19): LinkClientController._onDiscoveryChanged has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, loops 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/services/link/client/link_client_controller.dart"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"a200e49d4610f938702d7df449d93b356338a4b27eaec30c0764d28ccff0d3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"AppLinkDownloadsPort.resolveUrl (cognitive 19): AppLinkDownloadsPort.resolveUrl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (2 pts), ternaries 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/services/link/desktop/link_downloads.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ffb1a72082f1192aeaa999e78ba95180163ca1e622052b8a01fb7f22c5ac94"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkDesktopRemote.refresh (cognitive 19): LinkDesktopRemote.refresh has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, error handling 2, ternaries 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/services/link/features/link_desktop_remote.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb19fdf69f8230838e844e703e0638474451b4e8198a24deedaf4b5bf5fd30b"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPhoneFileRequests._deleteSong (cognitive 19): LinkPhoneFileRequests._deleteSong has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 pts), ternaries 1 (2 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/services/link/features/link_phone_library_sync.dart"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c87bea33410586ccf668e0c3f98efe2b450f48d1b5eabfabe9120498f60a482"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkDownloadFolderDestination.store (cognitive 19): LinkDownloadFolderDestination.store has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3 (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/services/link/features/link_save_offline.dart"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"752f8280ec49afeb20144e8b8e03637739d36c6fe502cfd3d7fdd03554f70ece"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaKitPlaybackDeck.queueNextSource (cognitive 19): MediaKitPlaybackDeck.queueNextSource has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (9 pts), error handling 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/media_kit_playback_deck.dart"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93ececac1bdef2aa77e30ccce89f6a4f9fea7ecb0952fb15d7377dab4919d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicAutoMix.onPosition (cognitive 19): _MusicAutoMix.onPosition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_automix.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1003feff7a10c560c954b1924484b2de0dac4cde9c3c79ed5d7a8ae51e435f"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler._refreshPlaybackAutomation (cognitive 19): MusicPlayerHandler._refreshPlaybackAutomation has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (9 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_service.dart"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92df6aa4535b14f1d0b7add856248a8544349319015932571e78f244eef55c9"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler._loadNetworkMetadata (cognitive 19): MusicPlayerHandler._loadNetworkMetadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts), ternaries 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/services/music_player_service.dart"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72a57c8bc96218c67e7b0515914f9950e5738715419f1f5bb4416c934e7ac80"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler._ensureDurationKnown (cognitive 19): MusicPlayerHandler._ensureDurationKnown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_service.dart"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"22773d5b617e8c785c88ace29dd936871f94d43cb9363c68fe53c6e2d7647948"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayableMedia.fromJson (cognitive 19): PlayableMedia.fromJson has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, error handling 1 (3 pts), 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/services/playable_media.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f793a6d95dc1f3649ae90ddd1f9951a4ac3ea89ef716764a8f49f0bbecf9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"AppSheetOption.build (cognitive 19): AppSheetOption.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/app_bottom_sheet.dart"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dc08c2d57cef6d153597322b720d59af0f228295250df5269b7b9ce5723362"}},{"ruleId":"D2","level":"warning","message":{"text":"_AudioFacts._source (cognitive 19): _AudioFacts._source has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 3 (4 pts), boolean chains 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/widgets/audio_info_sheet.dart"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda3a03f2f23b61f9570d58a550256bc3877f6c15f9ba24f8a7adf9cc43d75e6"}},{"ruleId":"D2","level":"warning","message":{"text":"_Transport._buildControls (cognitive 19): _Transport._buildControls has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (16 pts), if/else 2, boolean chains 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/widgets/desktop/desktop_player_bar.dart"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"4635d29f1a74d596ed954bf0396254c2de6a5cdd4a21471d931b74cded5940eb"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibrarySearchResultsState._row (cognitive 19): _LibrarySearchResultsState._row has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 12, boolean chains 4, if/else 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/widgets/library_search_results.dart"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d9d848c82f0e8c554ab8a1f2db159f4364fc59fbb93b428a76b189d839a458"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkTransferTile.build (cognitive 19): LinkTransferTile.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 5 (6 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/widgets/link/link_transfer_tile.dart"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e62e65de10d6c934e14a40a393d9d543586e7b6060f0049a7680c0f9200a3f"}},{"ruleId":"D2","level":"warning","message":{"text":"_LyricsOptionsButtonState._buildButton (cognitive 19): _LyricsOptionsButtonState._buildButton has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 7, 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/widgets/lyrics_options_button.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a66287d12b660a32077cb00e9372610ac266b83519f7557d32983a59bf66f2"}},{"ruleId":"D2","level":"warning","message":{"text":"MaterialPlayerLayout._metadataAndControls (cognitive 19): MaterialPlayerLayout._metadataAndControls has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (15 pts), if/else 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/material_player_layout.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"835038db282b7d6e14f1f403f13e7ce92194cbfa87e1e16a26e0c976a7876796"}},{"ruleId":"D2","level":"warning","message":{"text":"MornyeContextMenu._action (cognitive 19): MornyeContextMenu._action has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 14 (15 pts), if/else 3, 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/widgets/mornye_context_menu.dart"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"94667a57708cc9ac51c6f1f5f56abe70f7260f78cc7e86e2c9fbe629d2827367"}},{"ruleId":"D2","level":"warning","message":{"text":"_MornyePlaybackButtonState.build (cognitive 19): _MornyePlaybackButtonState.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 12, boolean chains 5, 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/widgets/mornye_playback_button.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba479cad5130d9cb779d19c71029a9ef3cd03b68b94aa22ee5ebaf33a5db3bd"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsSwitchItem.build (cognitive 19): SettingsSwitchItem.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (12 pts), if/else 4, boolean chains 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/widgets/settings_group.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1823a57a93d509d9333a3610125909e7bfcbecc658aff7b56a595cdcb9e9424f"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeDataJobsKt.runNativeDataJobPlatform (cognitive 19): NativeDataJobsKt.runNativeDataJobPlatform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 7). 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":"android/app/src/rust/kotlin/com/zarz/mornye/NativeDataJobs.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad3e176df4c54a7b17222622c14401ff49faffb7962d39284b083d97e1cc4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Actor::run (cognitive 19): Actor::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (8 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":"rust_backend/crates/cast/src/sender.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"655971f5502b38458642caf7c71c6ce248c98d878c917c1667fed066a31a58ef"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::filename::sanitize_filename (cognitive 19): mornye_core::filename::sanitize_filename has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/filename.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"650ac2413354c53a964301d90ca63e2d8139e4573326e3d8ea13cce69350ee35"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::id3::apply (cognitive 19): mornye_core::tags::id3::apply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (5 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":"rust_backend/crates/core/src/tags/id3.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be270c0bf4e61bc2f1c2980ec31307d447604781f4432ab9f49b3b1437ea75e"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::write::mp4::ac4::metadata (cognitive 19): mornye_core::tags::write::mp4::ac4::metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3, boolean chains 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":"rust_backend/crates/core/src/tags/write/mp4/ac4.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5efbab9dc4e104cb805065e16fea86698f5c0af6bc6ce8302822e8148c11b02"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::scan_audio_file (cognitive 19): Backend::scan_audio_file has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (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":"rust_backend/crates/extensions/src/backend/library.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba6967c2c53d076f17f3fd45f83133b4abd2bb2bbd62a417499048a7da85233"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::resolve_cue_audio (cognitive 19): Backend::resolve_cue_audio has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (4 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":"rust_backend/crates/extensions/src/backend/library.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26c64e2f487ca80350c7689e6c794d48d5cf00404478cd33e6ec42ba6eb87a7"}},{"ruleId":"D2","level":"warning","message":{"text":"FilePath::stage_with_parent (cognitive 19): FilePath::stage_with_parent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/files.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26e5528bae6aa388c08b7bdcff7416ee9e044d27c487f4e43fc6b47608adb89"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::host::register (cognitive 19): mornye_extensions::host::register has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 3 (5 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":"rust_backend/crates/extensions/src/host.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f518a8d183561698d5f306dff9894533416a17d9d31b0e8afa50df9e7ffa9768"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::fileCall (cognitive 19): (anonymous)::fileCall has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (12 pts), boolean chains 4, if/else 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"295320e5bfba26d0173358d898d4dbb41a11d370033b88168d88007b5dabb020"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAudioController.pickFolder (cognitive 18): OpenAudioController.pickFolder has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 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/controllers/open_audio_controller.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a785f2e79f4c75c587c819e2414e638e8cf30ea06d64f94070fcd391a8f43999"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadHistoryNotifier.updateAudioMetadataForItem (cognitive 18): DownloadHistoryNotifier.updateAudioMetadataForItem has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, if/else 2, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_history_provider.dart"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"1062eabd2db8e5a55e4d65c2dc1bfe60a72eefb426f82b283e590384ba4c174f"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadRun._recoverSafUriIfNeeded (cognitive 18): _DownloadRun._recoverSafUriIfNeeded has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, error handling 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"5334cd627d3a96ca4c89b2eb66f68ce2b9ecdc9c74bdfcb845c08fe186c08b22"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadRun._handleRunException (cognitive 18): _DownloadRun._handleRunException has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 3, error handling 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 3). 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8903e95a0b5a36971d4a4bc5ce2ad4ec08f9c5060892cc491dbfd75dfd5792b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionNotifier.exportBackup (cognitive 18): ExtensionNotifier.exportBackup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/extension_provider.dart"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d69d078769b1f61e83f28e545cf77b4962316b13b166ad7b9dbd8a4425fc52e"}},{"ruleId":"D2","level":"warning","message":{"text":"_ArtistScreenState._loadMoreAlbums (cognitive 18): _ArtistScreenState._loadMoreAlbums has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (2 pts), 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/screens/artist_screen.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81cb405d57bd464582bef1a92ea33375dfe15c9ac01d344e349224445551bf8"}},{"ruleId":"D2","level":"warning","message":{"text":"_HomeTabState._fetchMetadata (cognitive 18): _HomeTabState._fetchMetadata has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 5 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/home_tab.dart"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2f1b1c461a2d21e26da5dfb33153e6607169b4ee4ce60e558725b2978e58a4"}},{"ruleId":"D2","level":"warning","message":{"text":"_NetworkStorageScreenState._play (cognitive 18): _NetworkStorageScreenState._play has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (5 pts), loops 1 (2 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/screens/network_storage_screen.dart"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cda4b5971ca4c1896b0acf75c29d59c263a743d130918f0bd200755143736e"}},{"ruleId":"D2","level":"warning","message":{"text":"AppearanceSettingsPage.build (cognitive 18): AppearanceSettingsPage.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/settings/appearance_settings_page.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d74e9110c5b97fe7a72373e9edbef2767a52d53de96eb92dc9091e3ef5374e"}},{"ruleId":"D2","level":"warning","message":{"text":"_ScanProgressTile.build (cognitive 18): _ScanProgressTile.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8 (10 pts), boolean chains 6, if/else 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/screens/settings/library_settings_page_widgets.dart"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3b5a20350679fd3498a86f6b70089fa95f042a4f1ecee72b42dc5833cdccf3"}},{"ruleId":"D2","level":"warning","message":{"text":"_SetupScreenState.build (cognitive 18): _SetupScreenState.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, ternaries 6, boolean chains 3. 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/screens/setup_screen.dart"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c824a5646e82d914480374c6252e74934f3424e79859ebe89ea428bf2db576"}},{"ruleId":"D2","level":"warning","message":{"text":"_WhatsNewScreenState.build (cognitive 18): _WhatsNewScreenState.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 12 (13 pts), if/else 3, 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/screens/whats_new_screen.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a6b4795fb0ccdcc1debc5e36452cd29dd198f83a228f685c5eba362ff1123c"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioAnalysisRunner._getMediaInfo (cognitive 18): AudioAnalysisRunner._getMediaInfo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, error handling 1, ternaries 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/services/audio_analysis_runner.dart"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa86faa87badf4b21c02e22ff5069460d594eb69fb25de93145bb292c8db7bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioAnalysisRunner._runFullStreamLevelAnalysis (cognitive 18): AudioAnalysisRunner._runFullStreamLevelAnalysis has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (6 pts), error handling 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/services/audio_analysis_runner.dart"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c7e886c318c6a5471c6ad33c55aa98bc39022644357193732dd72670c01fa7"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAudioFile.parse (cognitive 18): OpenAudioFile.parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (6 pts), ternaries 5 (6 pts), boolean chains 4, error handling 1 (2 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/services/audio_file_open_service.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7cbee71a95758da5f2b60beac6624934d3a01bfa7161af78eec86b7a2d8f53"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioMetadataMapper.normalizeToVorbisComments (cognitive 18): AudioMetadataMapper.normalizeToVorbisComments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 3, 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/services/audio_metadata_mapper.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"127d793b50de8dae27113b4a5d1c5b2aafc1f7e8cbe8cf4e4a84be8e90baccbd"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryDatabase.updateFilePath (cognitive 18): HistoryDatabase.updateFilePath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 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/services/history_database.dart"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4651f6757b230df63f9e9b5747f87b379fcfd27e841745524bf501f4ff48c40"}},{"ruleId":"D2","level":"warning","message":{"text":"HistorySchema.upgrade (cognitive 18): HistorySchema.upgrade has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, loops 1 (2 pts) (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/services/history_schema.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0e2e13b12009dff6ea0808cb31bf2de0330381882de809645ff673ea261402"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryCollectionsDatabase._projectCollectionReadDatabase (cognitive 18): LibraryCollectionsDatabase._projectCollectionReadDatabase has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 2 (4 pts), loops 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/services/library_collections_database.dart"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3bf67a58bb97f49558eec7f199f1bf095969bf30fb95bbe11552aa4be35f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkTrackRefCache.resolve (cognitive 18): LinkTrackRefCache.resolve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (5 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/services/link/features/link_track_resolver.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc041aed1a25cfd960a2c0fb6cb61cf35e5269593e773f2f9ccd0c109a802795"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkLyricsTranslations.handle (cognitive 18): LinkLyricsTranslations.handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (3 pts), boolean chains 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/services/link/link_lyrics_translations.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"54189ee7a7d916852901c3095bd93594566044750b54c1b119145dac2223cb50"}},{"ruleId":"D2","level":"warning","message":{"text":"_LinkSyncHandlers.updatePlaylist (cognitive 18): _LinkSyncHandlers.updatePlaylist has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/sync/link_sync_handlers.dart"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a65cc7019738cc98bf1bdbc09697f615597a2bd27e6c411e3a7858bbadd010a"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalNetworkAccess._isLocalAddress (cognitive 18): LocalNetworkAccess._isLocalAddress has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (6 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/local_network_access.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff185e01d6e530c9b72ced5de2fa3d1d5f6533043b6eaaed2fa0bbc47ae356c5"}},{"ruleId":"D2","level":"warning","message":{"text":"MprisPlayerObject.handleMethodCall (cognitive 18): MprisPlayerObject.handleMethodCall has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, match/switch 2 (3 pts), 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":"lib/services/media_session_mpris.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdf922e259a590564e080592a641fd1bb8c53ab21eaf0f82da40ac5f46f8b3e"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicFailures.skipMissing (cognitive 18): _MusicFailures.skipMissing has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 2 (3 pts) (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/services/music_player_failures.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f77b53817b8eedf68bc2e5c21b267b1d7845cbc3437680944819bd197efdfc"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerRuntime._initialize (cognitive 18): MusicPlayerRuntime._initialize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, 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/services/music_player_runtime.dart"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21588db838d672ead15273d97693de2bb65fe1ba8d85c4148a36775b24a59f5"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler.reapplyNormalization (cognitive 18): MusicPlayerHandler.reapplyNormalization has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 6, error handling 2 (3 pts), 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/services/music_player_service.dart"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"211c9ca022f4961220d7a0d4cff0e309e6058d354d257ef3ec0f6876caf63615"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkFileDownload.identity (cognitive 18): NetworkFileDownload.identity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 1 (4 pts), boolean chains 2, match/switch 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/services/network_storage_download.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dfb617f39ea6a6dc8fbfedc3ec6579763178d0d11b3c89beb299d6b007a447"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformBridge._withMediaFileAccess (cognitive 18): PlatformBridge._withMediaFileAccess has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), error handling 1 (3 pts), boolean chains 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/services/platform_bridge.dart"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1e28e7a4b3b59052a489b7f1cc6151da524b38415def59a59361cb1dde3a67"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayableMedia.toJson (cognitive 18): PlayableMedia.toJson has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 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/services/playable_media.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b170a580bec3fea3311ea74d0577a1dc923deb1fb10fabeafb6c08347ecdda"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopLinkDevicesSheet.build (cognitive 18): DesktopLinkDevicesSheet.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 4 (6 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/desktop/desktop_link_devices_sheet.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ed5728cbc1b9e6d7d68e83d4ffa6eea3a1ee57fd9d50aa50b325f39ad4463f"}},{"ruleId":"D2","level":"warning","message":{"text":"_TrackInfoHeaderState.build (cognitive 18): _TrackInfoHeaderState.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 5 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/download_service_picker.dart"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcba1ffe28a597a4b3538171837aeccc754cf3dab0ad9dadbb650d1900d4866"}},{"ruleId":"D2","level":"warning","message":{"text":"_HiResCheckCardState._buildResult (cognitive 18): _HiResCheckCardState._buildResult has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, loops 1, match/switch 1, ternaries 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/widgets/hires_check_card.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"27021099b8ffd69cec8fb63f9aaded963ae30f9dceeb6cce6e85baecdaf7c681"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibraryFastScrollerState.build (cognitive 18): _LibraryFastScrollerState.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/library_fast_scroller.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"984271d1f8098d2a90cb21a18a52c88bc4342381dd14433cb8ca82ff2a33962d"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkLibraryJobsView.build (cognitive 18): LinkLibraryJobsView.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (6 pts), loops 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/widgets/link/link_library_actions.dart"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb38344de4799452b11a0da579f5afbc394a033a5ba6276fe5fb84f5d85d2988"}},{"ruleId":"D2","level":"warning","message":{"text":"_MornyePlayerArtworkState.build (cognitive 18): _MornyePlayerArtworkState.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, ternaries 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/widgets/mornye_player_artwork.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"45772734182a0241557702a054121f8a1f81e67967c3d2b6aeee0177b1834711"}},{"ruleId":"D2","level":"warning","message":{"text":"_WordHighlightedLyricLineState._updateVisualEnd (cognitive 18): _WordHighlightedLyricLineState._updateVisualEnd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (3 pts), 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/widgets/player_lyrics_word_sweep.dart"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bc695f1f783f315a6da0036310643aae94a16fd328b55fc81639c402291e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"_PlayerTrackSwipeState._finish (cognitive 18): _PlayerTrackSwipeState._finish has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, ternaries 2 (4 pts), error handling 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/widgets/player_track_swipe.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1d9787bacd00a95d95cac843393e7ec14aafe416ba05b82b65d23765153f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"_PlaylistPickerSheetContentState._handleDone (cognitive 18): _PlaylistPickerSheetContentState._handleDone has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), ternaries 1 (2 pts), boolean chains 1, 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/widgets/playlist_picker_sheet.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7f4976089bc0b3575feac227b20c57adf9b5fbedad497eabaa732d60e05d92"}},{"ruleId":"D2","level":"warning","message":{"text":"_ScrollEdgeFadeState.build (cognitive 18): _ScrollEdgeFadeState.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 12 (17 pts), if/else 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/widgets/scroll_edge_fade.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1844903565914da4443d421be328432bdecc54c2dde1dbd042ab2dbd2b403970"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidLibraryCovers.cache (cognitive 18): AndroidLibraryCovers.cache has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 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":"android/app/src/main/kotlin/com/zarz/mornye/AndroidLibraryCovers.kt"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"163fc1a248ec54708d4feffbd8309deb52a034a45f012e3059c8d146ce634d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"MainActivityMetadataCallsKt.handleReEnrichFile (cognitive 18): MainActivityMetadataCallsKt.handleReEnrichFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a485fd3292b4912330bef5bc95e12b8a3ddd8a0a9cd1088423dae75631f9342c"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFinalizationPolicy.flacAutoConversionArguments (cognitive 18): NativeFinalizationPolicy.flacAutoConversionArguments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizationPolicy.kt"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a64fc34df91fa52902881ded67b6b7409f0632bfabe743d5d9956f3da7f66c8"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFinalizerContainerKt.finalizeContainerConversion (cognitive 18): NativeFinalizerContainerKt.finalizeContainerConversion has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerContainer.kt"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e17f61e16839c33027b105d5005e68d2369c0532d930f91bb5d5fabecf27515"}},{"ruleId":"D2","level":"warning","message":{"text":"SafBatchQueriesKt.safExistsBatch (cognitive 18): SafBatchQueriesKt.safExistsBatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, error handling 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":"android/app/src/main/kotlin/com/zarz/mornye/SafBatchQueries.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"338527d0e67a9c9025ae812cc1bcc0e363225cb4a65592fe3d1ac908ca89db63"}},{"ruleId":"D2","level":"warning","message":{"text":"AppDelegate.handleMethodCall (cognitive 18): AppDelegate.handleMethodCall has cognitive complexity 18 (threshold 15). Drivers by points: error handling 4 (8 pts), if/else 4 (5 pts), ternaries 1 (3 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":"ios/Runner/AppDelegate.swift"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f438660fe3d1ec935582750006d932ce0028684bc4d6d293f11c678b3a7e1a33"}},{"ruleId":"D2","level":"warning","message":{"text":"MainFlutterWindow.awakeFromNib (cognitive 18): MainFlutterWindow.awakeFromNib has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 1 (4 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":"macos/Runner/MainFlutterWindow.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"deed2939f5a8ac1e478e3de1651a98d814ea933aa3800b5e024e5ff582f97d97"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::specific_config (cognitive 18): Reader::specific_config has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, 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":"rust_backend/crates/core/src/media/mp4.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f81a8fb3708dc7f2e871e11b86827030dbad636bc9e4b8862f734feaf79193f"}},{"ruleId":"D2","level":"warning","message":{"text":"Wu::prefix (cognitive 18): Wu::prefix has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (18 pts) (nesting depth added 12). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/native_palette.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"528e505e14208a1013ab32b066ccc945fe6d023ea51aeee9740c586f76226e79"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::lyrics::payloads::format_pax_content (cognitive 18): mornye_core::lyrics::payloads::format_pax_content 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":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f017ae0f8503d7ba3e919659476de736ad0ada703e66b6644679cac83e6e1f48"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::containers::ape_at (cognitive 18): mornye_core::tags::containers::ape_at has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/tags/containers.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"52833427b88ffccbae610c6eac0b0a80e78704165de454d7aeb4389a4a9388ee"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::library::apply_tags (cognitive 18): mornye_core::tags::library::apply_tags has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2, boolean chains 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":"rust_backend/crates/core/src/tags/library.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ff56c65767319d8964b66a7e30dfecbc7e8d033bcc90e051510bf697a04a09"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_desktop::discord::run (cognitive 18): mornye_desktop::discord::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 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":"rust_backend/crates/desktop/src/discord.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b595a3ac071ecb2c1833c9f6268eaf9955be91a4d216dffafae874adc8820a35"}},{"ruleId":"D2","level":"warning","message":{"text":"SignedSessionClient::exchange_owned (cognitive 18): SignedSessionClient::exchange_owned has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/signed_session/exchange.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"8856722aa2edb39f37a053324724cd72d75a15a27ca072fd9758bc2133658c37"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::backend::downloads::matching::probe_result (cognitive 18): mornye_extensions::backend::downloads::matching::probe_result has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (4 pts), boolean chains 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":"rust_backend/crates/extensions/src/backend/downloads/matching.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba527fce3d78b4b70b3aa186b1c64c749dbdadaae1f27c3ff355b700599097d1"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::download_host::register (cognitive 18): mornye_extensions::download_host::register has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 2, match/switch 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":"rust_backend/crates/extensions/src/download_host.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb6956f391dd53a1d5559710b7677615d3ea736304e4a36d2a440fb6397ca03"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::package::central_names (cognitive 18): mornye_extensions::package::central_names has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, 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":"rust_backend/crates/extensions/src/package.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"814136c0c1ba13011cf5b361c5e806223457d73ccf1269b0536a779c55f6639a"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::runtime::vm::eval_cached (cognitive 18): mornye_extensions::runtime::vm::eval_cached has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 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":"rust_backend/crates/extensions/src/runtime/vm.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f200bdfbc4543c7dab16232af56224c5b0f77df795b1d387971c73cb9483a03"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::signed_session::protocol::parse_time (cognitive 18): mornye_extensions::signed_session::protocol::parse_time has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/signed_session/protocol.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2506c774f80b7512459bdd267be10fdcb730cc4abbf6e97fa6a2b4d802610b86"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeReader::fetch (cognitive 18): RangeReader::fetch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), 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, 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":"rust_backend/crates/mobile/src/network_tags.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0e8518d7a60e97554596750fbfa61ad2ee8a5293a64e45ba4f6d5f51d96469"}},{"ruleId":"D2","level":"warning","message":{"text":"Volume::open (cognitive 18): Volume::open has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/usb_audio/volume.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8964401825780daa3eb687f7dc4072fadfb2782c32ecfbd58955bb5b442c08a6"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_backup::import (cognitive 18): mornye_mobile::native_backup::import has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3 (4 pts), 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":"rust_backend/crates/mobile/src/native_backup.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2900a9288fbeba176aecaa359b130e275e10df0066d3aa4d64c96f415122a913"}},{"ruleId":"D2","level":"warning","message":{"text":"BuiltinLyricsClient::genius (cognitive 18): BuiltinLyricsClient::genius has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (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":"rust_backend/crates/providers/src/lyrics/builtin/direct.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5167182c9800080a3aa5f1621e60917a3ce26923eaf073b8cad344d204ac39"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::dispatch (cognitive 18): (anonymous)::dispatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, error handling 1, ternaries 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, 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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0613a49b06ecdebdab89a6f2657cf72fb1a13da77d2f63e948a4da8a5472487"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadResult.outputExtension (cognitive 17): DownloadResult.outputExtension has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), ternaries 1 (2 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/models/download_result.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc96fdbad1d082cad495cdee881f698fffc9ed04a852de8a718fb33e02f3cdb9"}},{"ruleId":"D2","level":"warning","message":{"text":"_DownloadRun._resolveTrackIdentifiers (cognitive 17): _DownloadRun._resolveTrackIdentifiers has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/download_queue_provider_single_item.dart"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"86afc17a6016ef111cedd4047960ad24540d1deaee8a0825fc21beedb969faf9"}},{"ruleId":"D2","level":"warning","message":{"text":"RepoNotifier.setRegistryUrl (cognitive 17): RepoNotifier.setRegistryUrl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 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/providers/repo_provider.dart"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"de92323e8903e0c884e66a7d7a3277996dcb5a5dccb7050bf5d8112d7c95e5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"_HomeTabState._onSearchChanged (cognitive 17): _HomeTabState._onSearchChanged has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 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/screens/home_tab.dart"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1d16fd705846751f0e90370ff93734039246479c66095f673ea76c34f2b6f3"}},{"ruleId":"D2","level":"warning","message":{"text":"_SetupScreenState._isStepCompleted (cognitive 17): _SetupScreenState._isStepCompleted has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 4, match/switch 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, 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/screens/setup_screen.dart"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"730ea6450503f9c94ad78fbc499a58c9e90ce300b492dc5d4a08aac021584ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverStore._readStoredIndex (cognitive 17): CoverStore._readStoredIndex has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (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/services/cover_store.dart"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83c942f5bc61778ce3b18092c318a9fd4c9d1ba41d0ee604b7bde3b93af546c"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvImportService._parseCsv (cognitive 17): CsvImportService._parseCsv has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, loops 3 (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/services/csv_import_service.dart"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf22c1039f838023802f311b185a1fb38336aee7ef588cc232cd30fa801149f"}},{"ruleId":"D2","level":"warning","message":{"text":"LastfmListening.update (cognitive 17): LastfmListening.update has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), ternaries 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/services/lastfm/lastfm_listening.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0929df5f11acaa893098eccebc8a4136c12c533ee19b4bf995b1f14be4d15d93"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkDesktopTransfers._run (cognitive 17): LinkDesktopTransfers._run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (5 pts), match/switch 1 (2 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/desktop/link_desktop_transfers.dart"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e21228a6d8152d6eed96821883a1391a9d6905d138bd1b2c50300d494d4642"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkHandoff._sendQueue (cognitive 17): LinkHandoff._sendQueue has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (7 pts), boolean chains 4, if/else 4, loops 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/services/link/features/link_handoff.dart"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7df0aebb75f70f4a7ab7452c23bbf5404c4d8c0efff814a28cddef862578be9"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkLibraryJobsClient.refresh (cognitive 17): LinkLibraryJobsClient.refresh has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, loops 2 (4 pts), error handling 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/services/link/features/link_library_jobs_client.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee84e826ae07ede7558ebad4b3b57462da1ad66c9c219e3695ea35dd9c19ae27"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPhoneLibrary._build (cognitive 17): LinkPhoneLibrary._build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/features/link_phone_library.dart"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae86b909ed2b3698b900974cb349b4be4274ba06ca84ba80c94bb6f4297eac2e"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPlaybackDetails.read (cognitive 17): LinkPlaybackDetails.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 3 (5 pts), boolean chains 2, loops 2, 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/services/link/link_playback_details.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4251ee40f567312d60e9321883950d0517dadfee046dfa8b71d6e01854193d89"}},{"ruleId":"D2","level":"warning","message":{"text":"MotionArtworkStore._save (cognitive 17): MotionArtworkStore._save has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 1 (2 pts), 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/services/motion_artwork_store.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c74e41225f19d93f2b102838321f69d30b94ee5269984dc529a2ec77f5aa6a"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler._stopSession (cognitive 17): MusicPlayerHandler._stopSession has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8 (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/services/music_player_service.dart"},"region":{"startLine":2368}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b737b6363dc75646ac1103446045f59296bd1960150b24d44311068feb0f219"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkStorageService.downloadCover (cognitive 17): NetworkStorageService.downloadCover has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/network_storage_service.dart"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d791352f29663f24a5f7beb756b678de26dc0fb93c600a517c10f885e1cbb3ea"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaylistCoverStore.normalize (cognitive 17): PlaylistCoverStore.normalize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 2 (4 pts), 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/services/playlist_cover_store.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29410e774bf1472903562c666e8bcebbefaf59868061903543f48813b37f738"}},{"ruleId":"D2","level":"warning","message":{"text":"ShareIntentService._handleSharedMedia (cognitive 17): ShareIntentService._handleSharedMedia has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/share_intent_service.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a14c2fe8615eb8f4d7230020e7eaea810f7cd9743162bb1a4d564d30edcfdd"}},{"ruleId":"D2","level":"warning","message":{"text":"UserProfileStore.save (cognitive 17): UserProfileStore.save has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 2 (4 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/user_profile_store.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7b3849f1fcb1b26796cd865043efd98a7a890783f4d7f429079033b2a410fe"}},{"ruleId":"D2","level":"warning","message":{"text":"LogBuffer.exportWithDeviceInfo (cognitive 17): LogBuffer.exportWithDeviceInfo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2, match/switch 1 (2 pts), boolean chains 1, error handling 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/utils/logger.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a7f9057fe1a8c8b2f7fc2bd22b65a7db1e35ce220023e44a08c13d25033d3c"}},{"ruleId":"D2","level":"warning","message":{"text":"AppMenuButton.build (cognitive 17): AppMenuButton.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 3 (5 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/widgets/app_menu_button.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc339275c7ffa41ca58138e9f22b959198343080632b977a7ef96f55dcb207f"}},{"ruleId":"D2","level":"warning","message":{"text":"_MornyeSwitchState.build (cognitive 17): _MornyeSwitchState.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 15, boolean chains 1, 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/widgets/app_switch.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c996d660e433377f16d59210ec8c690d4b74d8003b932b9ed2127de0611d44b1"}},{"ruleId":"D2","level":"warning","message":{"text":"LibrarySelectionPlaybackActions.build (cognitive 17): LibrarySelectionPlaybackActions.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 5 (7 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/library_selection_playback_actions.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a0a0b5d26e6c337fa8738799a1f7a6c819f27d9e9bce4208d237b5c9c7740f"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryTrackSelectionBar.build (cognitive 17): LibraryTrackSelectionBar.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (10 pts), if/else 5, 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/widgets/library_track_selection_bar.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1b0d524585f9334e748d585a6e57ec207c3052ecedca070bfd63657dcfe942"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkDevicesSheet.build (cognitive 17): LinkDevicesSheet.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, boolean chains 4, ternaries 4, loops 1 (2 pts), 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/widgets/link/link_devices_sheet.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eebc932ac2046ff0ebe037ec339fa7aefd250ad02d6c0d321d08bd21c220aff"}},{"ruleId":"D2","level":"warning","message":{"text":"_LyricGapIndicatorState.build (cognitive 17): _LyricGapIndicatorState.build has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/lyric_gap_indicator.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ada737827ea9c0639db9e010976b70b5d586209cb700c4ffe4aa7419a7879f"}},{"ruleId":"D2","level":"warning","message":{"text":"_MenuLayout.getPositionForChild (cognitive 17): _MenuLayout.getPositionForChild has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/mornye_context_menu.dart"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"174559fc594dcc87608f874d8b8659461e618a64ab1e7c8c38e85bdbd6b24aed"}},{"ruleId":"D2","level":"warning","message":{"text":"_PlaybackFeedbackState.initState (cognitive 17): _PlaybackFeedbackState.initState has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 7, 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/widgets/playback_feedback.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf7eb20a4bf4434b4ed66d790672170b24147bba5ed0f567eb8140f4a48278a"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsGroup.build (cognitive 17): SettingsGroup.build has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 3, loops 1 (2 pts) (nesting depth added 3). 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/widgets/settings_group.dart"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"d721e6fee6e9e6ed4d480be436e18ad542e4debf1674eb6d547e2fc173288546"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsInfoCard.build (cognitive 17): SettingsInfoCard.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 3, boolean chains 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/widgets/settings_group.dart"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce31239eb560e745c066f480ded513bcdf0ff27b87dd692dfe43527970d7e48c"}},{"ruleId":"D2","level":"warning","message":{"text":"_UpdateDialogState._downloadAndInstall (cognitive 17): _UpdateDialogState._downloadAndInstall has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 1 (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/widgets/update_dialog.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"494f164504593646f0ef5a5288512933d3558e4adcda5f072dea9fdc850b5912"}},{"ruleId":"D2","level":"warning","message":{"text":"_UpdateDialogState._downloadAndInstallDesktop (cognitive 17): _UpdateDialogState._downloadAndInstallDesktop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 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/widgets/update_dialog.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf32fa153323c8638bae1133746bf3f3d3d72c22982cd0a3b5c4af420a110d4"}},{"ruleId":"D2","level":"warning","message":{"text":"BitPerfectPcm.convert (cognitive 17): BitPerfectPcm.convert has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/BitPerfectPcm.kt"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d93ef6f7fd2042fa02bbf54eb76765aef862e2ed2ec173e0c8214a6abd905ee"}},{"ruleId":"D2","level":"warning","message":{"text":"HiResPlayback.prepare (cognitive 17): HiResPlayback.prepare has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, error handling 1, loops 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":"android/app/src/main/kotlin/com/zarz/mornye/HiResPlayback.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"386cbac0d5b4776323f50fff0f3b844129dacefa123fffda6e0ec1a386428841"}},{"ruleId":"D2","level":"warning","message":{"text":"MainActivityMetadataCallsKt.handleEditFileMetadata (cognitive 17): MainActivityMetadataCallsKt.handleEditFileMetadata has cognitive complexity 17 (threshold 15). Drivers by points: error handling 5 (11 pts), if/else 4 (6 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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39ee223037824409e9b15942e4d01fc12ae9a1a19be91dd1785953b10b1e7fe"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbPcmPlayback.prepare (cognitive 17): UsbPcmPlayback.prepare has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 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":"android/app/src/main/kotlin/com/zarz/mornye/UsbBitPerfectPlugin.kt"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1d8e33c5b0efa4f75b1c4a77937bc4ada7113131d5118a5a9a2aebc85d6133"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbDirectPlayback.prepare (cognitive 17): UsbDirectPlayback.prepare has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, error handling 1, 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, 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":"android/app/src/main/kotlin/com/zarz/mornye/UsbDirectPlayback.kt"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9e08c3b903ef2ea62c42b7fc2379b5490b2a5c6558a27c8411ede296f5da07"}},{"ruleId":"D2","level":"warning","message":{"text":"CastService::call (cognitive 17): CastService::call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts) (nesting depth added 8). 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":"rust_backend/crates/cast/src/service.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd71447b3a3dd4789d3fb6045768f3b074779074a76b82c22e474c67906d5e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Request::apply (cognitive 17): Request::apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, 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":"rust_backend/crates/core/src/metadata/reenrich.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"34619649747b1f88680d8a154b7426cf597ea959cbd2b3fa2872ebedc821d540"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::id3::v2_with_cover (cognitive 17): mornye_core::tags::id3::v2_with_cover has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/tags/id3.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde37414a238b6a374bb3a32905f0d7aadf77e3931fcda3cc9a5d4daa840fce8"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::id3::embedded (cognitive 17): mornye_core::tags::id3::embedded has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, match/switch 1 (2 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, 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":"rust_backend/crates/core/src/tags/id3.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc19103270f221d5b8f0c941c0a9f2807ee16e2721ec9dac204bcfbe2533a249"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::download_verified_retry (cognitive 17): Backend::download_verified_retry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 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":"rust_backend/crates/extensions/src/backend/downloads.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b30c668999b1e43edac9696afde4c3eb004b85dc8c5eedb27617d5c2203a885"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::scan_cue_sheet (cognitive 17): Backend::scan_cue_sheet has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/library.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0c5e95a9745a0c57fcba4fc459a11aa2f329f04a9fd7000866fd976d6e7b87"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionPermissions::deserialize (cognitive 17): ExtensionPermissions::deserialize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (8 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b2fab7f7ba56b47edf01556939564425a3ad2842b1af04a03bd9572b766baf"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::backend::downloads::metadata::apply_metadata (cognitive 17): mornye_extensions::backend::downloads::metadata::apply_metadata has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/downloads/metadata.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdee9be218258db264e8155e75269ed8deb340047b4ffbd5cbe8ee45e24e0344"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_backup::encode (cognitive 17): mornye_mobile::native_backup::encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 5, 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":"rust_backend/crates/mobile/src/native_backup.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"494026fc3151232033bbdd50eb320a4670e6511e32621ae4c205fe0ff012ce18"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_backup::collections::import (cognitive 17): mornye_mobile::native_backup::collections::import has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4, boolean chains 2 (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":"rust_backend/crates/mobile/src/native_backup/collections.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"218a0baba20e54e9389ce1b4afa3d396d60580fe89a4bf41ebbdcad5cd1c919a"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_cache::unix::prune (cognitive 17): mornye_mobile::native_cache::unix::prune has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, match/switch 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":"rust_backend/crates/mobile/src/native_cache/unix.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"626a1458f65758889267f27813d695915f1fa6987c9d8a73cb5539a80516cb94"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::native_library::encode (cognitive 17): mornye_mobile::native_library::encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 4, 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":"rust_backend/crates/mobile/src/native_library.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03cf756e25e13c2ab0e2037b888794a46642fcf423093e31a1c8b09a41d4083"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::fetch_uncached (cognitive 17): Inner::fetch_uncached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 1 (2 pts), 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":"rust_backend/crates/providers/src/lyrics/service.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"77209c795600d6dd4905b8ac68f686b34342edad28de5092af8b44207faa3d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).logValue (cognitive 17): (anonymous).logValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, error handling 2 (4 pts), loops 2, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 3). 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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e7b4c1335ffee1a69a366cc5238ff4f2d57f5b93f15e9fe19e0de541b84636"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadHistoryNotifier._cleanupOrphanedDownloadsIncremental (cognitive 16): DownloadHistoryNotifier._cleanupOrphanedDownloadsIncremental has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3, ternaries 2 (3 pts), boolean chains 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/providers/download_history_provider.dart"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8416b6b654484c98ed3fc8aeef9a866b9cf7f491795abaadbca2d7eb42b6b2"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueueNotifier.exportFailedDownloads (cognitive 16): DownloadQueueNotifier.exportFailedDownloads has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 1 (3 pts), loops 1 (2 pts), 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/providers/download_queue_provider.dart"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"6000176f8a9678ecf534c5362fa68eeb527209eb20e91838cfb32ca1f9bfa303"}},{"ruleId":"D2","level":"warning","message":{"text":"_AlbumScreenState._buildTrackList (cognitive 16): _AlbumScreenState._buildTrackList has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), boolean chains 4, ternaries 3 (4 pts), 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/screens/album_screen.dart"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe33512bcf14e2b58d0b65a7f0d63963cea70c8c527b795022e406bfdaee425"}},{"ruleId":"D2","level":"warning","message":{"text":"_EqualizerCurve.paint (cognitive 16): _EqualizerCurve.paint has cognitive complexity 16 (threshold 15). Drivers by points: loops 8, if/else 2 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 3). 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":"lib/screens/equalizer_curve.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df3a0b84c34fcf0c549ec72e5dc6c18cc5f7c0acbb1071e0041fab52d59e4ae"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExtensionAlbumScreenState._fetchTracks (cognitive 16): _ExtensionAlbumScreenState._fetchTracks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (6 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/screens/extension_collection_screens.dart"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcca8a1d85d632da9b60e77d6d920b9df350d57077c0d9131959f290dd9f1c3"}},{"ruleId":"D2","level":"warning","message":{"text":"_HomeTabState.initState (cognitive 16): _HomeTabState.initState has cognitive complexity 16 (threshold 15). Drivers by points: 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/home_tab.dart"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab20030adbcc56818b05035fb467fd0a8041304a26d4155caf7428afb1aa6a7"}},{"ruleId":"D2","level":"warning","message":{"text":"_SearchCoverCell.build (cognitive 16): _SearchCoverCell.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 12, boolean chains 2, 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/screens/home_tab_search_wide.dart"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ef1f43338a61d60b8f8b46178e706f1324c9a61f15f6956e215c7e6d5f2402"}},{"ruleId":"D2","level":"warning","message":{"text":"_LibraryTracksFolderScreenState._saveOrder (cognitive 16): _LibraryTracksFolderScreenState._saveOrder has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (2 pts), 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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d454ece554ff65f8b8c562a2802f573f4ca7e202372c7662759d07808861fdde"}},{"ruleId":"D2","level":"warning","message":{"text":"_MainShellState._handleSharedUrl (cognitive 16): _MainShellState._handleSharedUrl has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 4, boolean chains 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/screens/main_shell.dart"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7d76c04908bfe3701fba43cb3a36b060525eb7ff2ba69f1372d7c49af9d584"}},{"ruleId":"D2","level":"warning","message":{"text":"_ResultStageState.build (cognitive 16): _ResultStageState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, ternaries 5, loops 1 (2 pts) (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/screens/music_recognition_screen.dart"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb01ee0113a9ce01e4c0de7069fb954881483d9a9a14a36fcda50252baa6980"}},{"ruleId":"D2","level":"warning","message":{"text":"_NowPlayingScreenState._showMoreActions (cognitive 16): _NowPlayingScreenState._showMoreActions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, ternaries 5, boolean chains 4, 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/screens/now_playing_screen.dart"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"05509599a815914a4845ff9b57c34f9e62a934fd066d4613b33426d6e8d34077"}},{"ruleId":"D2","level":"warning","message":{"text":"_LyricsAiTranslationPageState.build (cognitive 16): _LyricsAiTranslationPageState.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 12 (13 pts), if/else 2, 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/screens/settings/lyrics_ai_translation_page.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"607df4a9e9dedad11ab4297c5cce9e853a7e7e2d280a16bf8cab33426654dfed"}},{"ruleId":"D2","level":"warning","message":{"text":"_EditMetadataSheetState._showEditorOptionPicker (cognitive 16): _EditMetadataSheetState._showEditorOptionPicker has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 2 (3 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/screens/track_metadata_edit_sheet.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb1016477e27fe55f82cc7dd2de485493a410ec7216de7874c01b20191e96c9"}},{"ruleId":"D2","level":"warning","message":{"text":"_TrackMetadataScreenState._navigateToAdjacentTrack (cognitive 16): _TrackMetadataScreenState._navigateToAdjacentTrack has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 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":"lib/screens/track_metadata_screen.dart"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5ffd4526818b5a638db9bdcf43d1839a0b988232112bc0f28334e7f1309b37"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioMetadataMapper.convertToId3Tags (cognitive 16): AudioMetadataMapper.convertToId3Tags has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/audio_metadata_mapper.dart"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b326eb8279f569bddba414bbd1ba15d0e5e97940a1a2b456452721ba4b7b917"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoplayTasteModel._load (cognitive 16): AutoplayTasteModel._load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/autoplay_taste.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7aee9104593123f105c799469c0e212f33e851028c30974d3dcecb405508d7"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverDownloadService.detectCoverFileFormat (cognitive 16): CoverDownloadService.detectCoverFileFormat has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 2 (4 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/cover_download_service.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da29e65ef6ee1c5cbe0596b46d6f4e77f394de48366b6b8b0cb0e0a86ff8bde"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadMetadataEmbedding._ffmpegFields (cognitive 16): DownloadMetadataEmbedding._ffmpegFields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (5 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/download_metadata_embedding.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11a92183f7dea137a35eb47bad4fa813082487d69c67c4e66689d499092c83f"}},{"ruleId":"D2","level":"warning","message":{"text":"FFmpegConversion._convertToPcm (cognitive 16): FFmpegConversion._convertToPcm has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8, boolean chains 5, if/else 3. 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/services/ffmpeg_conversion.dart"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"880efe6d1b45a93a35403a0cbb06edc6803aa12ad3060659cff6bc76ad5d9fea"}},{"ruleId":"D2","level":"warning","message":{"text":"Id3v23Lyrics._writeUnsyncedLyricsToFile (cognitive 16): Id3v23Lyrics._writeUnsyncedLyricsToFile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4 (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/services/id3v23_lyrics.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0bd1761835fa9ce900db9ba9899b749f989d4097dc7a40a394441194ea8a5a"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryCollectionsDatabase._readDateOrderedRows (cognitive 16): LibraryCollectionsDatabase._readDateOrderedRows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 4 (5 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/services/library_collections_database.dart"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac60f4ac551bd8496a6f084c793d8758725ba26c3099ec131da9b34c4a9d99d"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCatalogExporter.export (cognitive 16): LinkCatalogExporter.export has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (6 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/services/link/desktop/link_catalog_exporter.dart"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0177c0d08d8e04107e426752d7ae5b14b1b75edadb457c45d8580937428c6f87"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkPhoneSong.toJson (cognitive 16): LinkPhoneSong.toJson has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. 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/services/link/link_protocol.dart"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"834d1f77651e434458570f9c3968c016df9571f3227cc46f47ab2d5e1fe0b2bf"}},{"ruleId":"D2","level":"warning","message":{"text":"_MusicFailures.onRuntimeError (cognitive 16): _MusicFailures.onRuntimeError has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, ternaries 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/services/music_player_failures.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c0585a0ced2e24d2076068ec525e9047dd81f1b864a71700c20c93fdc5485c"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler.restoreIosNowPlaying (cognitive 16): MusicPlayerHandler.restoreIosNowPlaying has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (7 pts), error handling 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_service.dart"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d3030307655ea2443713448b0e8ebc07b97040686f539b43731bd6bb29de71"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayerHandler._playIndex (cognitive 16): MusicPlayerHandler._playIndex has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 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/services/music_player_service.dart"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b207987401676beb9eb46ad7cf3e305da602bfff2cc02654850fb4236d131db"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordMicrophone.requestAccess (cognitive 16): RecordMicrophone.requestAccess has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (5 pts), boolean chains 3, 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/services/music_recognition.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eace1c28e43b0216df435244779496a93703421446bcfdb393ba498489e3a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkLibraryUploader.upload (cognitive 16): NetworkLibraryUploader.upload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (5 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/services/network_library_upload.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"368c8043c2497763529fe4b2e732142b12177ef546e02b6367d1bab0feda43ba"}},{"ruleId":"D2","level":"warning","message":{"text":"SubsonicClient._searchCatalog (cognitive 16): SubsonicClient._searchCatalog has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/network_storage_subsonic.dart"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24ba1e8307b93923dd08709d7006d03035274e7e516289a5ae35f14ae32a6e0"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaybackAutomation._applyVolume (cognitive 16): PlaybackAutomation._applyVolume has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/playback_automation.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ec651e158fa6fb41deb78fefbb423e13867219eea02cb16d003b4439083d65"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateChecker._isNewerVersion (cognitive 16): UpdateChecker._isNewerVersion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 1, 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/services/update_checker.dart"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb411c02432ff94dac1640969596bd2495c0e72d5966d69f115828ea9a62fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricTimelineIndex.activeIndices (cognitive 16): LyricTimelineIndex.activeIndices has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/utils/lyrics_timeline.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3068ac2b96552bea69467b76b639af68287a7a58749859a8ee01ad8d1d71ce1"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgressStreamPoller._runGuarded (cognitive 16): ProgressStreamPoller._runGuarded has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, 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/utils/progress_stream_poller.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeaa1b482ae05506304ef428864579cc5d371affc52a62cec5e17d2df236507"}},{"ruleId":"D2","level":"warning","message":{"text":"AlignedLyricPronunciation.build (cognitive 16): AlignedLyricPronunciation.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), boolean chains 4, ternaries 2 (4 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/widgets/aligned_lyric_pronunciation.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0533fb5dd82237fd6540e09c0faed8287833b14825beb3ac99664da06db01321"}},{"ruleId":"D2","level":"warning","message":{"text":"AppActionButton.build (cognitive 16): AppActionButton.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7, boolean chains 6, if/else 3. 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/widgets/app_action_button.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45391fe70ce63cfdfb9ebf546d8a90e62c150fa95ca6899a1c9439b92020274"}},{"ruleId":"D2","level":"warning","message":{"text":"_AppCrashBannerState.build (cognitive 16): _AppCrashBannerState.build has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (5 pts), ternaries 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/widgets/app_crash_banner.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bfb0aa9e1975a18e9f882ed5763baa6ad4be890d55efe3a0992c43094e6be9"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExpressiveMenuAnchorState._openMenu (cognitive 16): _ExpressiveMenuAnchorState._openMenu has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, loops 2, ternaries 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, 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/widgets/app_menu_button.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d0cc74c7c66fddb519bc343e6f5a41170e0ef2cdff4cb9ccfa2d86b9c722d0"}},{"ruleId":"D2","level":"warning","message":{"text":"_AudioAnalysisCardState._saveSpectrogram (cognitive 16): _AudioAnalysisCardState._saveSpectrogram has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, ternaries 2 (3 pts), error handling 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/widgets/audio_analysis_widget.dart"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"962310a8adffc007772d9ec95944c06a773a7e46d75adc0e6dfee206762222c9"}},{"ruleId":"D2","level":"warning","message":{"text":"_DesktopContentArea.build (cognitive 16): _DesktopContentArea.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8 (10 pts), boolean chains 4, if/else 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/widgets/desktop/desktop_navigation.dart"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09d7da2952133b3b604e9166c8466f786fafd76b2ff4ecce86fa66d857697ef"}},{"ruleId":"D2","level":"warning","message":{"text":"_DesktopScrollArrowsState._arrow (cognitive 16): _DesktopScrollArrowsState._arrow has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 11 (15 pts), if/else 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/widgets/desktop/desktop_scroll_arrows.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abb010cc8c9f6ab3656749d6848ac876da3544589ed2da414cddbeab9c63705"}},{"ruleId":"D2","level":"warning","message":{"text":"_TransfersListState.build (cognitive 16): _TransfersListState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3, 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":"lib/widgets/link/link_transfers_view.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"847f12096c6347059c92fc614c90d9a21d5f2db2a7312a4c0266a6bccc8f0a85"}},{"ruleId":"D2","level":"warning","message":{"text":"_LyricsEditorRow.build (cognitive 16): _LyricsEditorRow.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 16. 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/widgets/lyrics_editor_sheet.dart"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc01cf377c76e276b14fa13b84ea6b4bdf67da512641e83c7ce30f40e3328324"}},{"ruleId":"D2","level":"warning","message":{"text":"_ReEnrichFieldSheetState.build (cognitive 16): _ReEnrichFieldSheetState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (5 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 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/widgets/re_enrich_field_dialog.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ab7e61ef8890c27ecf6b9d5f7e56d932b9c2e951d1c926b70ee3cca34600f1"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreFFmpegStaging.create (cognitive 16): CoreFFmpegStaging.create has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 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":"android/app/src/main/kotlin/com/zarz/mornye/CoreBackend.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8377c4d4e04d8f7c6294f78d58dca928c18e442ea8e849122db29a2c6a38fb"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeCrashTrace.fields (cognitive 16): NativeCrashTrace.fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 2, error handling 1 (2 pts), loops 2, match/switch 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeCrashTrace.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"375fd614b2d9874605a3babb58c60a9dceafea4c09173998d64db140a1d8f54a"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeFlacConversionKt.convertToStagedFlac (cognitive 16): NativeFlacConversionKt.convertToStagedFlac has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFlacConversion.kt"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a58633121448bd38b8deb2f1f84d3b1d4726d5aa62e8b34f22e73a6ed3bda9"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerWidgetBridge.attach (cognitive 16): PlayerWidgetBridge.attach has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, error handling 1 (2 pts), 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":"android/app/src/main/kotlin/com/zarz/mornye/PlayerWidgetProvider.kt"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"75921ac6903118305dc0e1b7f496b42ba3972bfa37c1e440c73cbd328b070f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkNowPlayingController.sharedArtwork (cognitive 16): LinkNowPlayingController.sharedArtwork has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ios/Runner/LinkNowPlayingBridge.swift"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e5b21a0565fdd191d33839f25818640b2057f9b0d4cfe02852cedb04cb4af8"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::lyrics::lrc::parse_synced (cognitive 16): mornye_core::lyrics::lrc::parse_synced has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2, 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":"rust_backend/crates/core/src/lyrics/lrc.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4048f6a0ee0eca8cad64be7c9750040e9e6ed927dd0dde17750b204b221bae0"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::media::mp4::probe (cognitive 16): mornye_core::media::mp4::probe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, 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":"rust_backend/crates/core/src/media/mp4.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59409300807bd8e9989a9ee08cccfe1764f43bc82f2e9ca13c1e9a34ad83e23"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::containers::ogg_cover (cognitive 16): mornye_core::tags::containers::ogg_cover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, 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":"rust_backend/crates/core/src/tags/containers.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d41e018759af9405667178279ca1b70768d192073f6a381e3f3e76a57143f4"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_core::tags::mp4::read (cognitive 16): mornye_core::tags::mp4::read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, match/switch 1 (2 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":"rust_backend/crates/core/src/tags/mp4.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"acec1e07d2abf43f5291461926475624d3617f2f782fce7030c5ac293129c98e"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_desktop::ffmpeg::pump_commands (cognitive 16): mornye_desktop::ffmpeg::pump_commands has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), match/switch 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":"rust_backend/crates/desktop/src/ffmpeg.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a01b3c2a79a3a0719818ff9a57a760b0926db60173f590606e7db7949fe1d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionManager::download_with_lease (cognitive 16): ExtensionManager::download_with_lease has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2, boolean chains 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, 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":"rust_backend/crates/extensions/src/manager/downloads.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c614ce626a38206080ac56152ec90a6d95a2b87ca753df511177ce015a5f50eb"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackMatching::deserialize (cognitive 16): TrackMatching::deserialize has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (6 pts), loops 1 (nesting depth added 9). 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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90ab5019e87c0412399c5a73be74c32863a91c4f02e7e7591a8e7878abb7491"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionPackage::extract (cognitive 16): ExtensionPackage::extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/package.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"277939a33d5fd01ab88ad03b02b5f284baf533cebca6b0bd0b6f1bf715fae4c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry::deserialize (cognitive 16): Registry::deserialize has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (6 pts), loops 1 (nesting depth added 9). 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":"rust_backend/crates/extensions/src/repository/model.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd49939232ba198f35251e7e26770cded5d10ccdf05dfcda96525e64285079e"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_extensions::backend::downloads::metadata::preferred_track_id (cognitive 16): mornye_extensions::backend::downloads::metadata::preferred_track_id has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/downloads/metadata.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d181e18c062d9a2888228cde720faf4eec0f380d69b7cc4172455bf4b80198"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_mobile::library_metadata::read_library_metadata_from_descriptor (cognitive 16): mornye_mobile::library_metadata::read_library_metadata_from_descriptor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/library_metadata.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f3dba5ac37228c403f81a9e58541e57703d51cf34a6e75949b647b933bda1b"}},{"ruleId":"D2","level":"warning","message":{"text":"AvailabilityService::lookup (cognitive 16): AvailabilityService::lookup has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 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":"rust_backend/crates/providers/src/resolver/availability/cache.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"020722ce0204082aea99a70d2f5b6acccc79b341ddb8867283ab380bcd6ebfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"mornye_providers::resolver::urls::direct (cognitive 16): mornye_providers::resolver::urls::direct has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 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, 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":"rust_backend/crates/providers/src/resolver/urls.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c27efcab37ebdfb3a5f06282355e8a60e43cc3a7116e67ce8b77fbe8b0534e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlatformBridge: TooManyMethods \u2014 251 methods. The bar is 30 methods; this is 221 over it, 8.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/services/platform_bridge.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99b3ea0b6691f62454c8a039300d1f022c67c3b242c8aad49008fab7874290f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PlatformBridge: ClassTooLong \u2014 2012 significant lines (blank, comment-only and punctuation-only lines excluded), 251 methods. The bar is 400 significant lines; this is 1612 over it, 5.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/services/platform_bridge.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc0ce81699fe890fc3460eeb0c78a1bc73f07648332c54a90fb876966b03b8f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MusicPlayerHandler: ClassTooLong \u2014 2001 significant lines (blank, comment-only and punctuation-only lines excluded), 103 methods. The bar is 400 significant lines; this is 1601 over it, 5.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/services/music_player_service.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5e6f0c8c72f314eace4ebda2e6e7f1a752711d3dbeb53e4e9ff03e009670c8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SettingsNotifier: TooManyMethods \u2014 146 methods. The bar is 30 methods; this is 116 over it, 4.87\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/providers/settings_provider.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"78af1a89e2709bb3ca13bf6c04f4ead948ed7455d61281287884961ed56cc59a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/music_player_service.dart: FileTooLong \u2014 2105 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: MusicPlayerHandler (136-2815). The bar is 500 significant lines; this is 1605 over it, 4.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/services/music_player_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd1e0d5fcf547ce7f258744e2fb90743adf98e668f79c45e82b613e4e27756a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/platform_bridge.dart: FileTooLong \u2014 2065 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: PlatformBridge (74-3021). The bar is 500 significant lines; this is 1565 over it, 4.13\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/services/platform_bridge.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cd45075ee4c9ff7028039484697db3540a8b306be8f05231ff3795489c695f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PlaybackSettingsPageState.build: MethodTooLong \u2014 build runs 409 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 309 over it, 4.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/screens/settings/playback_settings_page.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"680798113851fcf100a9c98dc1564b386dc1281b5f649ca4f4895b0e285e53b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _QueueTabState.build: MethodTooLong \u2014 build runs 397 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 297 over it, 3.97\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/screens/queue_tab.dart"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bcec8c1bda6bf3fa6a68e187d9deb49d0824a2d727223496b4884ce88b687e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _NowPlayingScreenState._buildPlayer: MethodTooLong \u2014 _buildPlayer runs 395 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 295 over it, 3.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/screens/now_playing_screen.dart"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e0135d2517354dae6ae78022569a879a9d84363124b4f52cdf4aed39b753e6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MusicPlayerHandler: TooManyMethods \u2014 103 methods. The bar is 30 methods; this is 73 over it, 3.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/services/music_player_service.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86b52f7e6b0c30976b0ee62192ec1a50271ed3666929dcf391f7a5f0ac24b23"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _DownloadRun: ClassTooLong \u2014 1351 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 951 over it, 3.38\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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"035ca92e87ef5d89791ba77a2567275084cccabbe1013d96972b6e396ab268a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LibrarySettingsPageState.build: MethodTooLong \u2014 build runs 334 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 234 over it, 3.34\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/screens/settings/library_settings_page.dart"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8882d0e84419a7cbae5d7efcfc10e09469300a2cb77bdcb85933bd85c1a85f9e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Backend: TooManyMethods \u2014 100 methods, declared across 14 files: src/backend.rs (12), library/scan.rs (12), backend/metadata.rs (12), backend/lyrics.rs (11), \u002B10 more file(s). The bar is 30 methods; this is 70 over it, 3.33\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a28551ade9a8b42f03ecd019c9752544f8c3434bb57f20b5aaa0245f449f59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ExtensionDetailPageState.build: MethodTooLong \u2014 build runs 318 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 218 over it, 3.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/screens/settings/extension_detail_page.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2294ce4e09bd5f0613e38788647ede1ccddedc8808d9dbe9ee6ee05f77cfb6e3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DownloadService: ClassTooLong \u2014 1253 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 853 over it, 3.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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"295bbdfcaf31e6f38cfe96b6a760805d6d93b9c1f4dffc6b4c690d6268625bf2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppSettings.copyWith: MethodTooLong \u2014 copyWith runs 302 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 202 over it, 3.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/models/settings.dart"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5c88678c1b41449218c85bd863f8a1678066c28e4255b76322bed8dbff4495"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SyncedLyricsViewState._buildLyrics: MethodTooLong \u2014 _buildLyrics runs 300 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 200 over it, 3.00\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/widgets/player_lyrics.dart"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fabf2c88bcb4d89732eaf49178c8d2901bbe434f14b79f687846e88c5e2afd0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainActivitySafScanKt.scanSafTree: MethodTooLong \u2014 scanSafTree 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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d342f8a64f943bac7ee4b7088c98f9580a8d97c728bd1212279316ad6a1c16b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MornyePlayerLayout.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/widgets/mornye_player_layout.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fad10d11117eabf30c2ad9aeee428d2fb402311a75a280dd2e9df40c5cc3c6d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Backend.download_attempt: MethodTooLong \u2014 download_attempt runs 292 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 192 over it, 2.92\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":"rust_backend/crates/extensions/src/backend/downloads.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feb61d3301fc4786752c88e6a3464a82c1d1e2f034117b569ab0ed204134dfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/download_queue_provider_single_item.dart: FileTooLong \u2014 1407 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: _DownloadRun (83-1881). The bar is 500 significant lines; this is 907 over it, 2.81\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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"705af33fcca08a8aebfc83ee8ed1adf16b960fc8e4ca2adf4a93fe689c0f07ea"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _HomeTabState: ClassTooLong \u2014 1046 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods. The bar is 400 significant lines; this is 646 over it, 2.62\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/screens/home_tab.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"31af3e496f676145f131febc7344f4402e89557ba74c8bc4611badf95942d76d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TrackOptionsSheet.build: MethodTooLong \u2014 build runs 260 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 160 over it, 2.60\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/widgets/track_collection_quick_actions.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f448f5814efa71d7071a4bbca9ad78984a685d35804cae1462044b565aef88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mornye/DownloadService.kt: FileTooLong \u2014 1289 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: DownloadService (46-1745). The bar is 500 significant lines; this is 789 over it, 2.58\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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85286cb480fd0740ea4c03759236d4e9f79113e42fda55ab17767508b6679491"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _RewindSlide._content: MethodTooLong \u2014 _content runs 257 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 157 over it, 2.57\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/screens/listening_rewind_slides.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"146aa09cb088b83e44e0f42fa9274f277812fc77717cc98fa83c5202c5cfdd65"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetworkLibraryScanner._scan: MethodTooLong \u2014 _scan runs 256 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 156 over it, 2.56\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/services/network_library_scanner.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb806a53ae6252d6bf0022252a15916c22eba3acdb727af9694e1fd6cc22c96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _NetworkStorageScreenState.build: MethodTooLong \u2014 build runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.54\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/screens/network_storage_screen.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1af676889fc821c261b59c523c1fbcd1c430c96a75694ca24130e7096a4e41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/library_tracks_folder_screen.dart: FileTooLong \u2014 1232 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: _LibraryTracksFolderScreenState (88-1333). The bar is 500 significant lines; this is 732 over it, 2.46\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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"430362a6049a1631be3023755f9083953876cfac078de232c5da93d5bb782782"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExtensionManager: TooManyMethods \u2014 73 methods, declared across 8 files: src/manager.rs (15), manager/providers.rs (12), manager/downloads.rs (11), manager/install.rs (9), \u002B4 more file(s). The bar is 30 methods; this is 43 over it, 2.43\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/manager.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"83246033f3fd2451b5745fa640b84375cc5f22639e0ca136e925bcb3e42421a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExtensionManager: TooManyMethods \u2014 73 methods, declared across 5 files: src/manager.rs (30), src/tags.rs (18), src/metadata.rs (16), src/lyrics.rs (8), \u002B1 more file(s). The bar is 30 methods; this is 43 over it, 2.43\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/manager.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11d37422769ec1c5ed4db91439dbcfcf5b7772b576b416d3d3071d417b12e5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/home_tab_intro.dart: FileTooLong \u2014 1212 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 712 over it, 2.42\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/screens/home_tab_intro.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64419e4c219af61e7396e493018d34c0ef9bf5dcd2f9458f799aa4da340c3c14"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MornyeLibraryScreenState.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/screens/mornye_library_screen.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fce154ac8d993188be10f33be088a4007cabeb46157938281acaaf44afb630"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/artist_screen_widgets.dart: FileTooLong \u2014 1205 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 705 over it, 2.41\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/screens/artist_screen_widgets.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb97040781b3ea3942bb52cdc40fa914701a8d8948c59412c6610f2ac46738a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RustCoreBackendApplicationKt.dispatchApplication: MethodTooLong \u2014 dispatchApplication runs 241 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 141 over it, 2.41\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":"android/app/src/rust/kotlin/com/zarz/mornye/RustCoreBackendApplication.kt"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bf892b8f85dff3a4f4add44798d5c877f9461e4d8b423379067e3acb540641"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/download_queue_provider_native_worker.dart: FileTooLong \u2014 1204 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 704 over it, 2.41\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/providers/download_queue_provider_native_worker.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dd6994a1cb85df793745b8f3829e4de1b1feb1e231f53b93429b93ed31db4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DownloadSettingsPageState.build: MethodTooLong \u2014 build runs 238 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 138 over it, 2.38\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/screens/settings/download_settings_page.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbb7501149259968dc4f569f7f3a10d3c94e606b41706164f6bcbc193442ece"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/network_storage_service.dart: FileTooLong \u2014 1188 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: NetworkStorageService (325-1596). The bar is 500 significant lines; this is 688 over it, 2.38\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/services/network_storage_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e788355070be38e50496e7e00c46df20119a9419dafe64b58dc4c6485401bc7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NetworkStorageService: ClassTooLong \u2014 949 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 549 over it, 2.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/services/network_storage_service.dart"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbabc6b7e0a06122d1c09e8ddc84d8654e6ebe9a9c2ce0a97245d9d4d75b14df"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _NowPlayingScreenState: ClassTooLong \u2014 948 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 548 over it, 2.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/screens/now_playing_screen.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85bcc49bb0eece164024d7c53c44990cc3a6ee038a6346b3b6bf97a1767a90a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FilesSettingsPageState.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/screens/settings/files_settings_page.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a505289b5d2f785ea85e5f0bea94308996b9974c13f21991b9fc1f376aabb942"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _SyncedLyricsViewState: ClassTooLong \u2014 943 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 543 over it, 2.36\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/widgets/player_lyrics.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ebfe60adf9d47f27c611631c6bacd9111f97102b3ca819fa92e0b0178f636f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/player_lyrics.dart: FileTooLong \u2014 1173 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: _SyncedLyricsViewState (98-1322). The bar is 500 significant lines; this is 673 over it, 2.35\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/widgets/player_lyrics.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2fd78816e63f274869a18d3e365071e1839fbef5e0a1c30ee63fbe0ec8bbfb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _LibraryTracksFolderScreenState: ClassTooLong \u2014 935 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 535 over it, 2.34\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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e073bfd47bcbb3f4ecc4db9919ddec8e18225365c82c5e85170581d8b0131c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/home_tab.dart: FileTooLong \u2014 1164 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: _HomeTabState (127-1581). The bar is 500 significant lines; this is 664 over it, 2.33\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/screens/home_tab.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92849bb18f8249ad381f1a96e1edea4fa020e6e07c772e38fbe9318ff3773173"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LibraryCollectionsDatabase: ClassTooLong \u2014 929 significant lines (blank, comment-only and punctuation-only lines excluded), 56 methods. The bar is 400 significant lines; this is 529 over it, 2.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/services/library_collections_database.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6156ba1e44e99ecd15e78fdfefc15cde9f0c04e1b6d52448f15743054e30fa01"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DownloadService.processConcurrentNativeRequest: MethodTooLong \u2014 processConcurrentNativeRequest runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c263ca558bffc91183c2d155144ed544137da79886856bd13a09353443ea0e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LibraryDatabase: TooManyMethods \u2014 69 methods. The bar is 30 methods; this is 39 over it, 2.30\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/services/library_database.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c771ddbbee62eaba00358da17c4df7300643eeae11a56e434e7de007bc50ffb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/animation_utils.dart: FileTooLong \u2014 1149 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 649 over it, 2.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/widgets/animation_utils.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b52c63e1a4dc809a9953420d2e486db26f1cd3fda180cfec009e7f756c34b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _UpdateDialogState.build: MethodTooLong \u2014 build runs 228 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 128 over it, 2.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":"lib/widgets/update_dialog.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"259d6703b31cabdbbfa8f07497dfd84980e1c2f795b7685baf342a107ed174bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_extensions::download::chunked::download: FunctionTooLong \u2014 mornye_extensions::download::chunked::download runs 227 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 127 over it, 2.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":"rust_backend/crates/extensions/src/download/chunked.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03331d0d807969fb3411e87107aaa8aae039fae99fb39f2775b1f9f0a3f5862"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/download_history_provider.dart: FileTooLong \u2014 1132 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: DownloadHistoryNotifier (141-1345). The bar is 500 significant lines; this is 632 over it, 2.26\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/providers/download_history_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb481f51fe532da0269fbc088f63c2e0898399c2fb10cbdeb050218afb7303d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DownloadHistoryNotifier: ClassTooLong \u2014 900 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 500 over it, 2.25\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/providers/download_history_provider.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e3890c6e505a72d5bac06e9a1851542d67970ac2d65933d33a60e3c3f069d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LinkLibraryExecutor.call: MethodTooLong \u2014 call runs 225 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\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/services/link/desktop/link_library_executor.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe44fd7064496cfe292ddc64b64e6c8ce4bc586283d11b8cc13a8473127ebf5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MusicAutoMix._start: MethodTooLong \u2014 _start runs 220 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 120 over it, 2.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/services/music_player_automix.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79f84a202f922310660a4acf45814e6868d5f857f3a4171a370aa294c4fe33f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _MainShellState: ClassTooLong \u2014 877 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 477 over it, 2.19\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/screens/main_shell.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"12004e6776055929fe5ee110e6d5df6bb3d3ce0d0074b30d6673392013b59cb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_extensions::download::download: FunctionTooLong \u2014 mornye_extensions::download::download runs 217 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 117 over it, 2.17\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":"rust_backend/crates/extensions/src/download.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43c774b3fb99dbfb664f49e6862435dc7e48505d3375011d58d50f92236e62a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/queue_tab_item_widgets.dart: FileTooLong \u2014 1073 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 573 over it, 2.15\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/screens/queue_tab_item_widgets.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8fbd502e50b5f4dac66b6625eba45beaa929f13af4c720ac405b62f6a8fc32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ConcertDetailScreenState._page: MethodTooLong \u2014 _page runs 212 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\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/screens/concert_detail_screen.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1dda85a8ca0ba261c4512dae19fe13442b7958997e7293703bd303537a0275"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _EqualizerScreenState._buildPage: MethodTooLong \u2014 _buildPage runs 212 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\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/screens/equalizer_screen.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2febb25f3cb7591bb1e5b37ded94de3d8ee74b0e357fa91be672e9ad9253bfa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RustCoreBackend.invokeApplication: MethodTooLong \u2014 invokeApplication runs 211 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 111 over it, 2.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":"ios/Runner/CoreBackend.swift"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0890d69231c7626bc056bcbb0789bab0f969433e9fb1cf97089906c96492f1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/library_collections_database.dart: FileTooLong \u2014 1053 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: LibraryCollectionsDatabase (78-1314). The bar is 500 significant lines; this is 553 over it, 2.11\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/services/library_collections_database.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4c284d57edf653a5da1b18b3db35e20da85442a6b57ec6c06e4c617f5e9221"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/library_queue_store.dart: FileTooLong \u2014 1050 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 550 over it, 2.10\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/services/library_queue_store.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aecceb428ed195ec852c28a0b9c03469efd5a547cca48a712c08af2334fcd8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SettingsTabState._groups: MethodTooLong \u2014 _groups runs 210 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 110 over it, 2.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/screens/settings/settings_tab.dart"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0f356d918b163e609da38460902d33704d99a25dc22017b00c48a0622ae135"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MornyePlayerQueue.build: MethodTooLong \u2014 build runs 210 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 110 over it, 2.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/widgets/mornye_player_queue.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ef96b42d6a6b28adb69af6cb94fc7f5048c4947725e89cd809fa2c17a5552c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Backend.plan_download: MethodTooLong \u2014 plan_download runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.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":"rust_backend/crates/extensions/src/backend/downloads.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"690f57d6a3a20e39dd2ccf4d77e1dc77a671449b5e306be2d53f8ef88244840f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LibraryDatabase: ClassTooLong \u2014 837 significant lines (blank, comment-only and punctuation-only lines excluded), 69 methods. The bar is 400 significant lines; this is 437 over it, 2.09\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/services/library_database.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"562961a24d38a1b8f060f6c27941a30070ba6fe16789a53d14a573781b92bffa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: desktop/desktop_navigation.dart: FileTooLong \u2014 1042 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 542 over it, 2.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/widgets/desktop/desktop_navigation.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05705edfb7193a92786bcf1ec1c724ae6529afc2314cba7e4281b6c1bdc5fdae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlayerPlaybackControls.build: MethodTooLong \u2014 build runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.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/widgets/player_playback_controls.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"513f3f429d21cd4cba7aa0a24a1c65565107a7717e826b94bcdfa87cedfe46f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LinkDesktopHost: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.07\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/services/link/desktop/link_desktop_host.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c83b78c61f04b7666bbd11f317fce318a8d133a2f60af7f6f2133ef2ee5e313"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/now_playing_screen.dart: FileTooLong \u2014 1033 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: _NowPlayingScreenState (124-1376). The bar is 500 significant lines; this is 533 over it, 2.07\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/screens/now_playing_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc2babf63c620d33a4fe3c0a92ad17a3f855ead351aac4b3ab1298df9d14bb5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _HomeTabState.build: MethodTooLong \u2014 build runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.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/screens/home_tab.dart"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caa2176baeaaec0d3deb7ff25828ed8611edbceceff8e268a55f4d0b5f1ddb6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _EditMetadataSheetState.build: MethodTooLong \u2014 build runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.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/screens/track_metadata_edit_sheet.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0f68f923a9b1c67d92ea69855f27b89c516df7ae1f83eb3285f2aa61ffb09e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/main_shell.dart: FileTooLong \u2014 1028 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: _MainShellState (129-1417). The bar is 500 significant lines; this is 528 over it, 2.06\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/screens/main_shell.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09dbbfa47d18fd282e82353f3da9c71a1968c3ba2fe1e6af4cc8b5f9dca65b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_extensions::host::register: FunctionTooLong \u2014 mornye_extensions::host::register runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.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":"rust_backend/crates/extensions/src/host.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95b9d63140a6701dfd54c5a5503742f711b4956bbaa6d60c4032012a0deb2e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_mobile::native_library::import: FunctionTooLong \u2014 mornye_mobile::native_library::import runs 202 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 102 over it, 2.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":"rust_backend/crates/mobile/src/native_library.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2b687a5f274d7b888a9c29adc7ea4ac863ce02f9d8c9ce517bb00f71802ded"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Backend.scan_library: MethodTooLong \u2014 scan_library runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\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":"rust_backend/crates/extensions/src/backend/library/scan.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4e28e1d1c3b33dc75bf494b6d03463f22a0520e76ec6385e40aca04f176132"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DownloadRun._handleDownloadSuccess: MethodTooLong \u2014 _handleDownloadSuccess runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb5c896cfe762a9cf2a11ec5710954bf815e710313c5790eb10277b18bc10a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MiniPlayerBodyState.build: MethodTooLong \u2014 build runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\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/widgets/mini_player.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b15391408032cd891b08ea432c0ba6d3840a9674caa6d11316c3decbf1bea9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LogScreenState.build: MethodTooLong \u2014 build runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\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/screens/settings/log_screen.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ea76786c897419b3e6b1acd64565d3605c0bbea4b5c760b0d01c8d396d88a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/network_storage_screen.dart: FileTooLong \u2014 962 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 462 over it, 1.92\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/screens/network_storage_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c0c43bbfbedb23429798e9bb79b2343096a7b9ff72fd2eafcbecf42775db24"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MusicPlayerHandler._loadIndex: MethodTooLong \u2014 _loadIndex runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\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/services/music_player_service.dart"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e898698789259759fdda29b72c32e57ca2e2fcc20cc232dbf64528c2fd541af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_mobile::native_autoplay_taste::execute: FunctionTooLong \u2014 mornye_mobile::native_autoplay_taste::execute runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\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":"rust_backend/crates/mobile/src/native_autoplay_taste.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b735c47dfd3acce5f775431625f18459f9146b6d2224fe3bc673d2ff7347e1a0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LinkDesktopHost: ClassTooLong \u2014 767 significant lines (blank, comment-only and punctuation-only lines excluded), 62 methods. The bar is 400 significant lines; this is 367 over it, 1.92\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/services/link/desktop/link_desktop_host.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb9c6665957ccf68a8178ee36b90200c3db0e850f4b647e4f824148a9e71b2c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MornyeBottomBarState.build: MethodTooLong \u2014 build runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\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/widgets/mornye_bottom_bar.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"347ba419bf823c39d474e728e17de949f65aaefd328d5a5be0127a6a5cd49c01"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _QueueTabState: ClassTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 352 over it, 1.88\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/screens/queue_tab.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90465a50317419b47256190fad680113959d2aef399bf5c5fd4879d7599edfd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LibraryHeroCard.build: MethodTooLong \u2014 build runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\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/screens/settings/library_settings_page_widgets.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"5999eb73b7068716e9bcb0da7fcd37fedff78910113d07a2e5223608ef7e8c50"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LibraryCollectionsDatabase: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\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/services/library_collections_database.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7ee771de19a855f0a78d963330ebd74823cbabec282e0cee1931759ab980e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ConcertDetailScreenState._materialPage: MethodTooLong \u2014 _materialPage runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.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/screens/concert_detail_screen.dart"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"851aa26c08fdaa1aa1c5ef762afa19d4805a1482a6b54318b458ec5dfe9afaa1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GitHubPainter.paint: MethodTooLong \u2014 paint runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.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/widgets/donate_icons.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"018a2c63df81c139b371e9c5817e0e588ee1448a756173e39885a069497d5cd2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SettingsSearchCatalog: ClassTooLong \u2014 736 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 336 over it, 1.84\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/utils/settings_search_catalog.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a06f67ba610c0de88ab602e528ea3c2186d85979f5aef08fd99a04b17174f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RustCoreBackend: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. Most of these members implement mornye.CoreBackend (38 of 54 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/rust/kotlin/com/zarz/mornye/SelectedCoreBackend.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"58af57275d3c5fc07f927598a90093269fc85f5d509bf63acf8e8dea25d2be79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: desktop/link_desktop_host.dart: FileTooLong \u2014 900 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: LinkDesktopHost (182-1283). The bar is 500 significant lines; this is 400 over it, 1.80\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/services/link/desktop/link_desktop_host.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"337702639d1e691e1ca79a0805a588a40e05775b238e98968bf68d3674cbe26a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LibrarySearchResultsState._buildSlivers: MethodTooLong \u2014 _buildSlivers runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80\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/widgets/library_search_results.dart"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06ec6cf62fdf01b8b68f7fec5676a45dd3d83db361cf14d76c86749e3650e43"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DownloadedEmbeddedCoverResolver: ClassTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 316 over it, 1.79\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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d49f3501709a0739644d96feb23f0c2e75a91305045df09596b9e6a84a7d1ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AboutPage.build: MethodTooLong \u2014 build runs 179 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\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/screens/settings/about_page.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77cad318f4c33c07eccf8c6318af58cd167a11d025a8d66c203652c8835d74f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_link::subsonic::forward::call: FunctionTooLong \u2014 mornye_link::subsonic::forward::call runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\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":"rust_backend/crates/link/src/subsonic/forward.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9ec12f8cd2b85d797fb10b29826c6c098ceedd54889e896f284115b913d3ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LibraryTracksFolderScreenState._buildAppBar: MethodTooLong \u2014 _buildAppBar 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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cb0d946dd9bc0d83a2de55c66c958d2a7f4a22cf8bcd02b06ebaf5d867d8d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _BatchConvertSheetState.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/widgets/batch_convert_sheet.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc62d2b0002a30ebb78db1ab4797dc1ddf01d890f0b7883a8cb900d09d08967e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_extensions::download::segments::download: FunctionTooLong \u2014 mornye_extensions::download::segments::download runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/extensions/src/download/segments.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be2a979f35854846463eadfdee5880cded9e8c1f5ddb39efde9985fad05e23e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/library_database.dart: FileTooLong \u2014 888 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: LibraryDatabase (32-1187). The bar is 500 significant lines; this is 388 over it, 1.78\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/services/library_database.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a8b8038addf33e2599e1739b8f068885e8924b207d4714254cd8a0bb0600d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DownloadRequest: TooManyFields \u2014 53 stored fields beside 2 methods. The bar is 30 stored fields; this is 23 over it, 1.77\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/downloads.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"396b2b1da64fe150718d21a71ddef186534f7a91c297cedb338d0f9af22a6ee9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.finish: MethodTooLong \u2014 finish runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\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":"rust_backend/crates/link/src/catalog.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"9021635302dedbf914327e1d44e3877812d9be5af09941d6b27755c4707203a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/queue_tab_filter_widgets.dart: FileTooLong \u2014 875 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 375 over it, 1.75\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/screens/queue_tab_filter_widgets.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a239cc6bc5f61551523d8ec49da3768d63be98ab8661e06948da5db4b83c9b71"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DownloadMetadataEmbedding.embed: MethodTooLong \u2014 embed runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\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/services/download_metadata_embedding.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba114adfedec30a21a692f877d227897e22268401f46b3b903d12f7c119ad0e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AudioInfoCard.build: MethodTooLong \u2014 build runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\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/widgets/audio_analysis_info_card.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f90322ad0b8a06321da27da1f3dd46f19a10dfe3a2a375e1b3be5c9a0a60932"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_core::tags::write::riff::edit: FunctionTooLong \u2014 mornye_core::tags::write::riff::edit runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\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":"rust_backend/crates/core/src/tags/write/riff.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"193c8c69c29ee9ecfb5b016210f4c69999628548d2d04f1482981b1c07e70aaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_extensions::file_host::call: FunctionTooLong \u2014 mornye_extensions::file_host::call runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\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":"rust_backend/crates/extensions/src/file_host.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b20183a60a3750c91439d582125f8fc1c0cb72e8187c374391d1ecfccc0e97"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RustCoreBackend: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 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":"ios/Runner/CoreBackend.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d792e358d55c0970457dbcd172d2a2b68c427aa4180a947332feb3b339a382"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LibraryTracksFolderScreenState.build: MethodTooLong \u2014 build runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9788dad0be0a72aa9f029cc1823d355f02ceff2fc7186d50cd39baf085e80e8b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CacheManagementPageState.build: MethodTooLong \u2014 build runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\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/screens/settings/cache_management_page.dart"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"28038317ff980a4f477d83b74054d838a5c4c9c1d068bdeb760dd568c6a83c87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/whats_new_screen.dart: FileTooLong \u2014 850 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 350 over it, 1.70\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/screens/whats_new_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3081897ba056e43489104371e3596269906b2da5b6d3677faf5ed6058ba87361"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppearanceSettingsPage.build: MethodTooLong \u2014 build runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\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/screens/settings/appearance_settings_page.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d76df569f1c261f544ac564f8d3a13d2f71b926f5e35e087c17f4b717a57631"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MornyeTheme._build: MethodTooLong \u2014 _build runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\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/theme/mornye_theme.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ce21540157584ee55e57dee6144b3cc09f58bb3fb9bea366107f60584bc27f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MaterialPlayerLayout.build: MethodTooLong \u2014 build runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\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/widgets/material_player_layout.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abb55eb7762750ca895c12a768ceba6b06185678d56bfd57a1d45dc400608f6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _LibrarySearchResultsState: ClassTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 278 over it, 1.70\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/widgets/library_search_results.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"508b6943301fa0a04f6d0c3ad0368f5375e30f29fad880d0366d71503e33989b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/downloads.rs: FileTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: Backend (58-1097). The bar is 500 significant lines; this is 342 over it, 1.68\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":"rust_backend/crates/extensions/src/backend/downloads.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b31b0a78e60f42b2fdbb98675da3a7c25f4761fe946b99b0763de370619f98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/settings_tab.dart: FileTooLong \u2014 835 significant lines (blank, comment-only and punctuation-only lines excluded), about 73% of them inside a single declaration: _SettingsTabState (106-928). The bar is 500 significant lines; this is 335 over it, 1.67\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/screens/settings/settings_tab.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df49d50d6d39c7f0fca4c53927373daddbbd97bacac59c35f6738a2c3c9cf2d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MediaKitPlaybackDeck: 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/services/media_kit_playback_deck.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30619aca333469ad27a10e2c805e68c6f341bda55d2c075431b7b3b7ad71740"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/album_detail_header.dart: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 325 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/widgets/album_detail_header.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec43cf26c782dd517851d1c9507a581180599f16474439505e63af4c339abea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/library_mixes.dart: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 321 over it, 1.64\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/services/library_mixes.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df2eb2f69897bc1fb1f126453848ae7cc2a241b0e7870d76c668b193cdf4e75"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/queue_tab.dart: FileTooLong \u2014 818 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: _QueueTabState (131-1165). The bar is 500 significant lines; this is 318 over it, 1.64\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/screens/queue_tab.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4f2f4cdfe781aeb28920fa288ce6d9c6c09dfc782dd38e4d13a31b3754f26c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TutorialScreenState.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/screens/tutorial_screen.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0876e6cafe14272c1602a39a7fde87e0e5c517f1c3d322668edd64b86d03e669"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MainShellState.build: MethodTooLong \u2014 build runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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/screens/main_shell.dart"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61ba2e000010aac1fed095794f70780ce63c259e9c9d8d0117bd4329f50542e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _NowPlayingScreenState._showMoreActions: MethodTooLong \u2014 _showMoreActions runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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/screens/now_playing_screen.dart"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3939bf960d8c37bb4efe3a2b5112971b4e819d5e83bc4daca0607211fa99e925"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ThemePreviewCard.build: MethodTooLong \u2014 build runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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/screens/settings/appearance_settings_page_widgets.dart"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b300753ea76888914dca4fff70b324d01c6c4be5de18cb7bd9e1aecffec1ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AlbumDetailHeader._buildAppBar: MethodTooLong \u2014 _buildAppBar runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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/widgets/album_detail_header.dart"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c28e915350d45d5a10a7c9f4b939513378ce7200962c7c6aeee2488f42f18aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Backend.cache_cover: MethodTooLong \u2014 cache_cover runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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":"rust_backend/crates/extensions/src/backend/cover.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6f853d9fe56a79743af917a6fa2b561ac5cdc17791e31b09e544f4e54ad6eb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _LibraryDirectoryViewState: ClassTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 246 over it, 1.62\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/widgets/library_directory_view.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"824a0a5400c43f055b853bb7f59fdbd3e1c764af76e2ecad7e186d7f0b9fb010"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _LibrarySettingsPageState: ClassTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 243 over it, 1.61\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/screens/settings/library_settings_page.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53d3b0b083f2d42e9e06ed3be6f38347d2efe17b22fd3c3d2788c2f0fc3487c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _HomeTabState: 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/screens/home_tab.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"10daf0d326d94d93f9f4053d0bfbbed8e3fb8833f3996523dc0b6493e015e039"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TrackCard._buildCard: MethodTooLong \u2014 _buildCard runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\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/widgets/track_card.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f971ae30b8f19ca119c300a8968d8a9f9a5147551d158f15897757fda1cfbe8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _AlbumScreenState: ClassTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 237 over it, 1.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/screens/album_screen.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"809f0a982990bc792606f5be102cb01fb06569282a7284639b2a999247ca0e02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DownloadFileFinalizer.autoConvert: MethodTooLong \u2014 autoConvert runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\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/services/download_file_finalizer.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bdaa897940143e3881da52fb648f4fc33dd2d299fff09b71116dfca7fae692"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/repo_tab.dart: FileTooLong \u2014 792 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 292 over it, 1.58\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/screens/repo_tab.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff021e672e8a9ce4551dc057f633c0dcd32eee6f680500e1f72cc9230f9ab59e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SafDownloadHandler.handleSafLocked: MethodTooLong \u2014 handleSafLocked runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97d37f63f93c4227a36a43d8edc6ba4f07ed3f2b8e4bc9d8369e5f470ab1f76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtensionManager.provider_operation_value: MethodTooLong \u2014 provider_operation_value runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\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":"rust_backend/crates/extensions/src/manager/providers.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"660cef8486bbb145584789888cd68e2af8ce0db7da3aa9947dd996a55baf99b6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SettingsNotifier: ClassTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded), 146 methods. The bar is 400 significant lines; this is 227 over it, 1.57\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/providers/settings_provider.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"646a88ad34df56b3b3d08d2a1b7848818e0f8d23c9f45388e98d54400253b069"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _FilesSettingsPageState: ClassTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 225 over it, 1.56\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/screens/settings/files_settings_page.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"59657286a2f72e6ce7c3f929278d103743670596b31c9de69f34e1ac7aa6ba8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/home_tab_explore.dart: FileTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 280 over it, 1.56\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/screens/home_tab_explore.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82bbff5f968844b76d72b15f151a6318a5b3121c3f0d157202893aabce45dc7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppSettings: ClassTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 223 over it, 1.56\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/models/settings.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"253d597f0d421ff56f1074e65ccced4ebc438711f135163481f5c3e8383b5551"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LibraryCollectionsNotifier: ClassTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 222 over it, 1.56\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/providers/library_collections_provider.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf0d2115dacae967b09fcd2627fc7fb2cf80c3fd0fa741d4ac6872253c4fd96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dispatch.rs: FileTooLong \u2014 774 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 274 over it, 1.55\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":"rust_backend/crates/desktop/src/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f96a827b642e0bc5f737f8104778a0e60ad979468917a4c34d9dec6d75de833"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _SetupScreenState: ClassTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 219 over it, 1.55\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/screens/setup_screen.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f468f8f1c4cb2bd1982d6644642f4dcbedad1e89fb98cac922b563899bc7aed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: desktop/desktop_player_bar.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/widgets/desktop/desktop_player_bar.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71c334c1c217ac257733ee4d5d70bd4eda722e435e2143639955a41dbbe0003"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/settings_search_catalog.dart: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: SettingsSearchCatalog (54-952). The bar is 500 significant lines; this is 269 over it, 1.54\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/utils/settings_search_catalog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"185ae81ba4dea08275030ea5e255a11c8f51d7bf63cfd8c3553f1ad4dada82c7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _SettingsTabState: ClassTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 208 over it, 1.52\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/screens/settings/settings_tab.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeed78691f91068c5efe8b08befe7a06455fad413c9c3ca8fdfbe4119c0dff0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/downloaded_embedded_cover_resolver.dart: FileTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: DownloadedEmbeddedCoverResolver (66-1053). The bar is 500 significant lines; this is 259 over it, 1.52\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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e176df5f33410884059e7221136a0d1aaef33806c71338e13efa8e228b1ef7f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _DownloadedAlbumScreenState: ClassTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 207 over it, 1.52\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/screens/downloaded_album_screen.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42f5e87d55b57bc87b5120ada775cafb6dcbdfb2da543db53e53887d436c11b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ListeningStatisticsScreenState._summarySlivers: MethodTooLong \u2014 _summarySlivers runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\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/screens/listening_statistics_screen.dart"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cffc5a6cd10c2fe6169fbdfb31926325685cd0d4b6178dc5a095a7e98334bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Backend.reenrich_file: MethodTooLong \u2014 reenrich_file runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\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":"rust_backend/crates/extensions/src/backend/reenrich.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a19fb4f462f8ba41781bc25e009cbdcaa8a5f2dacae881c6757b5693d3937cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/settings_group.dart: FileTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 252 over it, 1.50\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/widgets/settings_group.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"204b2e06ba04921f5bb6ed17f0dbf1bc18d36864dca89a9668f4a2b413da59de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainActivity.configureFlutterEngine: MethodTooLong \u2014 configureFlutterEngine runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"118df0d41299c19bb5ec0ef60e8df8ad0cca4bbf32ec314fe987b2e47d7975d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PlaylistPickerSheetContentState.build: MethodTooLong \u2014 build runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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/widgets/playlist_picker_sheet.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"122b2dee91e70b305cc6ed10217ff5c3ee1e628b2c1c0b129237ca502bd3eb52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ReEnrichFieldSheetState.build: MethodTooLong \u2014 build runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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/widgets/re_enrich_field_dialog.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae789ce89f9210e733348ddd70c91a112009c8c7a2b69c881f55ac937a971a3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeFinalizerMediaKt.embedBasicMetadata: MethodTooLong \u2014 embedBasicMetadata runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerMedia.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"681a4cb3941b0ba3133c696ff4de6b9c8e9e345c5a8c3df08efe737e08f5e69f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ArtistConcertsScreenState._buildPage: MethodTooLong \u2014 _buildPage runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.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/screens/artist_concerts_screen.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"594e1b2568597dbda614442219f36f948b0ac2a80053a11ffed1e0b9f0bb04fd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ArtistScreenState: ClassTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 195 over it, 1.49\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/screens/artist_screen.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6521d3723c5147dca3bc43d248bac44d2feb8f3aabe456026d0cd4a71a7e0ac3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/artist_screen.dart: FileTooLong \u2014 742 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: _ArtistScreenState (169-946). The bar is 500 significant lines; this is 242 over it, 1.48\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/screens/artist_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bede969bb098aaeef80a90427f356a83d8f11ee85cb153a0fa40edeaf0e9e46c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _MusicAutoMix: ClassTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded), 19 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/services/music_player_automix.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71a96145cab0ea8facb8692238b77c5b63656b8b8da9551747b3419863539d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TrackTableRowViewState.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/widgets/desktop/track_table.dart"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a5d7b13b663753ff43837535c58fe1be3d28d232791011089b09b4c5e4c3eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _RepoTabState.build: MethodTooLong \u2014 build 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/screens/repo_tab.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"218c74a02881ea6f09e6dbb389bc546773802a6ce5005b95c0c7af504367bcd0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LyricsTranslator.translate: MethodTooLong \u2014 translate 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/services/lyrics_translation.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d3a99bc83d384b718c999594b53aba0b803d5ff39a1660f8135db5aac1ccb1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DownloadedEmbeddedCoverResolver: 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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8874feb49ec3c7aa08d9dc8c8d18e8407fb4566a80395fd1f6ab5796e1cf7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/library_search_results.dart: FileTooLong \u2014 727 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: _LibrarySearchResultsState (63-1007). The bar is 500 significant lines; this is 227 over it, 1.45\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/widgets/library_search_results.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"977457f1dc37f7b95b3c385527dac0316274e11e9eabbaad0c228b46bffe1087"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ConcertDetailScreenState: ClassTooLong \u2014 580 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 180 over it, 1.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/screens/concert_detail_screen.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d3bb225cd798e6961c26a4ecc9e71fd58aab38e249a661c58f540be4f24140"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DownloadRun._persistCompletionAndNotify: MethodTooLong \u2014 _persistCompletionAndNotify runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"af810623a13d4d011d1e16f311fc7b033ab83188b1d7f539952f97e7f4144f2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ArtistScreenState._buildPage: MethodTooLong \u2014 _buildPage runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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/screens/artist_screen.dart"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7df725fc3a7173279ad3121d0a33812e9cee5dd30588bda157405cd7165cdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/download_queue_provider_finalization.dart: FileTooLong \u2014 724 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 224 over it, 1.45\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/providers/download_queue_provider_finalization.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c4f9d433951c96e9531343ed7b2afc7982d82c73a167b3f295c0f0bb92427d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _HomeContinueListeningCardState.build: MethodTooLong \u2014 build runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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/screens/home_tab_intro.dart"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef7be342a2a64537bbaed509f6b7747ca7b40762e5e4d2f7bb6bcb89e2feef7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/album_screen.dart: FileTooLong \u2014 718 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: _AlbumScreenState (93-923). The bar is 500 significant lines; this is 218 over it, 1.44\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/screens/album_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23e1a8af2ffb97d2fae11eae81373c7e75a18947fd7a65299ccc65accc93ff5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExtensionEnvironment: TooManyMethods \u2014 43 methods, declared across 2 files: src/environment.rs (39), environment/index.rs (4). The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/environment.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d8dce4dbd17994eb3ccb12a3cee3b4c90a57f546910d30e0b18a3a718827c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: desktop/track_table.dart: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 216 over it, 1.43\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/widgets/desktop/track_table.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7b9ba5437c5db0ec8acd476254c481438b733e587de29d5e885f1e1dc95fd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/library_directory_view.dart: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: _LibraryDirectoryViewState (78-955). The bar is 500 significant lines; this is 216 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/widgets/library_directory_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d77d421c6d54efca41c118ad8685537067e965ce8550c5571ca686c88d910e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_core::native_audio_analysis::estimate_spectral_cutoff: FunctionTooLong \u2014 mornye_core::native_audio_analysis::estimate_spectral_cutoff runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\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":"rust_backend/crates/core/src/native_audio_analysis.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d93ec89679312e623c7cf95b7c8924891fafcc389bdd04b5a376345ef6e2612"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _LocalAlbumScreenState: ClassTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 170 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/screens/local_album_screen.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"54677b3058da57d5335df13e400cbc17d96066a70156834bae6b974f37f4b836"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/extension_detail_page_widgets.dart: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 211 over it, 1.42\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/screens/settings/extension_detail_page_widgets.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e8e3317e5c81b25ad22ab4282d12ca102a4418cc093a33ac62fcd84a33cb50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/settings_provider.dart: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: SettingsNotifier (105-1098). The bar is 500 significant lines; this is 203 over it, 1.41\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/providers/settings_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a01d02d941637ae3adc83bf6a06a9e423782f67434d14f7f8c987f034fd16b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MusicPlayerRuntime: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 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/services/music_player_runtime.dart"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3a0d802f32b677966f812dde7aec629be39ec6b3f9648047bbf8f29586cc65"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TrackNotifier.fetchFromUrl: MethodTooLong \u2014 fetchFromUrl 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/providers/track_provider.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1136b519924e43eed24e174de1651e2238e45b789337df067733749b8b0443ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlayerQueueSheet.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/widgets/player_queue_sheet.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cc37411cfcf756fe701f5123c177d2e36624618b09f370ca43c5af9ffa2de9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Runner/CoreBackend.swift: FileTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: RustCoreBackend (191-882). The bar is 500 significant lines; this is 197 over it, 1.39\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":"ios/Runner/CoreBackend.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1c00b37ff51f9f03396039c02d344e82aa4c490ad8e595b9a7a2e18cba1b30"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlayerCompactBar.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/widgets/player_compact_bar.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cb0a204f889eccfd0ae3898270fd5180934299f5346c324bfec53519d1d0a7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExtensionNotifier: ClassTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 151 over it, 1.38\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/providers/extension_provider.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fac9859a7513b156ca9f7db7e9eb0927315c01a0096916e2861438906863e94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mornye/SafDownloadHandler.kt: 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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddda9d5daa3ba919e28a6c0e97310efd87e5cfc77cef7e3731ecae5db6288f9a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DownloadHistoryNotifier: 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/providers/download_history_provider.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed657f46b65d42ac6ebd45272cc65a6d9f4e24dc827422f2f94e2aa84b8895b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LinkMirroredPlayback: 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/services/link/link_mirrored_playback.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47c7473877b17ce235201699d0c1537e6c09def082b950fd45ff352be3da18e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SelectionBottomBar.build: MethodTooLong \u2014 build runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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/widgets/selection_bottom_bar.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1041f43ff6560b911513796756e50798042d4a3ff4e6baebc7dfeb15b78e4b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/library_settings_page.dart: FileTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: _LibrarySettingsPageState (41-906). The bar is 500 significant lines; this is 178 over it, 1.36\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/screens/settings/library_settings_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d9268e1a225c3758b4442f6a75cac53fe9f1efd8806a5c714d800c5363de74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/extension_collection_screens.dart: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 175 over it, 1.35\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/screens/extension_collection_screens.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"711079c0421b8fde50d6d0397bf3f1069729bfec4ce8d885f951af454b2a0fc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/home_tab_search_wide.dart: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 174 over it, 1.35\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/screens/home_tab_search_wide.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6ea93d33b9ce9d0e4d5cb18f7b353377d75e1a1b1323d4662cde9c215d12d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/lyrics_parser.dart: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: LyricsParser (167-861). The bar is 500 significant lines; this is 174 over it, 1.35\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/utils/lyrics_parser.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c89378fae8f5ce5cfca4dfd21cc52d35ecc10d9b791caef098560888285db0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/files_settings_page.dart: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: _FilesSettingsPageState (54-878). The bar is 500 significant lines; this is 173 over it, 1.35\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/screens/settings/files_settings_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"883d23f7d9fa365d927590c5acc15a94ccda5f7e96aca95d4d6f1951a26026da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LyricsSettingsPage.build: MethodTooLong \u2014 build runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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/screens/settings/lyrics_settings_page.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfbe1f4c154c2dcce8f545af9325a091fd394c0c285835ac723b190cf9f8207"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RustCoreBackend: ClassTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded), 52 methods. The bar is 400 significant lines; this is 134 over it, 1.34\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":"ios/Runner/CoreBackend.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced252ef05544fdfece8d49b7de4741ee3830c49a58fedee8651e4ace4bf5dd5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DownloadService: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bb35af1f44c568c4fdc36f8257711c393c6f227a2901a660e09710c8f82d0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/setup_screen.dart: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: _SetupScreenState (56-915). The bar is 500 significant lines; this is 165 over it, 1.33\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/screens/setup_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e52c64a0d0c05e66906f44c80ab515a28c4a9a10b4583cd0ae3229eeef770c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controllers/clickable_metadata.dart: FileTooLong \u2014 661 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 161 over it, 1.32\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/controllers/clickable_metadata.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0c2f6a435375051340f6150c0a01df4be9ba801cad37e3b1340183f9867771"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppSettings.AppSettings: MethodTooLong \u2014 AppSettings 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/models/settings.dart"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcaf255c95b6dd5eb022b486cd7aca2420c80a6f7f60eb0b62e1e7019d7eb97a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AlbumScreenState._buildAppBar: MethodTooLong \u2014 _buildAppBar 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/screens/album_screen.dart"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afbaaacc17e32796ac7e1be9a5da4ca505b19d01556a78f63fd7feaa4df6faa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_core::native_audio_analysis::analyze_automix_pcm: FunctionTooLong \u2014 mornye_core::native_audio_analysis::analyze_automix_pcm runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/core/src/native_audio_analysis.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"414347f47e9057726df9134552f6e3a9b03b3995d94590eb55e7bdb139a6d2ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/client.rs: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 157 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":"rust_backend/crates/network/src/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ae835b7d32c6e3e74d2c1e7d6e4fb38c2686a8a95e89bc26fda7e5f6c3ab53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/settings.dart: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: AppSettings (48-755). The bar is 500 significant lines; this is 156 over it, 1.31\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/models/settings.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f94c81d653228bcc544d98359751af094a6820e544daa608d52235112533332"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArtistScreenSkeleton.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/widgets/animation_utils.dart"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed29ff8dd47d596ba0fd9a4e0407cabbfb8e3c00e43bae927446c1cd17fdebcc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LyricsShareCard.build: MethodTooLong \u2014 build runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/screens/lyrics_share_screen.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ea6e4cb2616e1cdbfd504296e20bc45c4b143db3d3d0c92dce229f63a44794"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ExtensionsPageState.build: MethodTooLong \u2014 build runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/screens/settings/extensions_page.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba4c5127b18d15ca393fa2210d1e3a06704c331cf806d6c809360c64432206f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AudioAnalysisCardState.build: MethodTooLong \u2014 build runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/widgets/audio_analysis_widget.dart"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91a605886cc0cfddd7b0ce44ab9fa5088f20ac9a3d1d3b0c40455ed272f0d95"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AlbumRowViewState.build: MethodTooLong \u2014 build runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/widgets/desktop/track_table.dart"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b853da7e9c2e18e1beccd9ce73c75fe68cdcb400355eb57c95e861cfbaaf1b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MornyeGlass.build: MethodTooLong \u2014 build runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/widgets/mornye_chrome.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cff97ebe73fc26af0a62050ecc44c1baa328626cb33420a5c05d994f721a839"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_core::tags::write::ape::edit: FunctionTooLong \u2014 mornye_core::tags::write::ape::edit runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"rust_backend/crates/core/src/tags/write/ape.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b3eaff12ec813b882d354c8ae3a6cf2281080e6d9a97c1b0b19c1c34aa8573"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/library_collections_provider.dart: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: LibraryCollectionsNotifier (21-871). 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/providers/library_collections_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8617f121586e94b5cf75e2165d11faf294cad52b97f5308de4cfe50f1e7d26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mornye/MainActivitySafScan.kt: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 145 over it, 1.29\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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b8f4ed01dbf6f19ca95d8e7a884fcf044054da51754d396bd65fe1c80bb0e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetworkStorageService._request: MethodTooLong \u2014 _request 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/services/network_storage_service.dart"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bb53cc672707707315e7476e869fa1141f28f2a68d684e90076259ffa11f25"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LyricsParser: ClassTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded), 18 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/utils/lyrics_parser.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd00ffea2a24d16ef86615ff540ed69f0a33e807e59d8a5fccfd4c9a3828332"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LyricsParser._parseTtml: MethodTooLong \u2014 _parseTtml 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":"lib/utils/lyrics_parser.dart"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e104249faedfcabbf32d90ab6fdfb7fd5e95481620346329de698d6ade8bcaa7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppStateDatabase: ClassTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 111 over it, 1.28\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/services/app_state_database.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1543d8d27da4be95d2b7a19825fb74d5d27f7998811d404e34159026d8fced87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/downloaded_album_screen.dart: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: _DownloadedAlbumScreenState (73-889). The bar is 500 significant lines; this is 138 over it, 1.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/screens/downloaded_album_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ac4dbcb12a3bbae9aec7dffd33cc96433c6af1853220a4aa8d0c6fbf8c63d2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NotificationService: ClassTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 110 over it, 1.28\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/services/notification_service.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9670141bdeb9051647c2f2828613ceb25f7d6f53855efe41e4ca8c4844915f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/link_client_controller.dart: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: LinkClientController (222-883). The bar is 500 significant lines; this is 137 over it, 1.27\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/services/link/client/link_client_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28eae45e4a55360d0ba130cc6804c71c893b57e455281ea538b4027351d2822"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BackupService: ClassTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 109 over it, 1.27\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/services/backup_service.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a46951b8db2517887897efc1d0ce0447dfb224eb3b8f7bd0e4865c9551a1bc6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FFmpegConversion: ClassTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 109 over it, 1.27\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/services/ffmpeg_conversion.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee900e70b7eff323172027af848c603ab16171f73b196a4daf8959e2449d21d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: link/link_protocol.dart: FileTooLong \u2014 635 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 135 over it, 1.27\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/services/link/link_protocol.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b2c062636809ce10662ce1636487ee27adbcef5cf8dc59057f6149a9c303f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MetadataAutofillService.enrich: MethodTooLong \u2014 enrich 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/services/metadata_autofill_service.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7437f7842dd2220fcf4f4fe44271f15c4d57ebd8dcade092aec5370759ac03c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetworkStorageService.parseListing: MethodTooLong \u2014 parseListing 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/services/network_storage_service.dart"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"905b30fdfeacb42a4f690c5d62db5aa04c6b622d1b127061eae5ca736536c712"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/home_tab_widgets.dart: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 134 over it, 1.27\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/screens/home_tab_widgets.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8767cb71522760f5393292071bbd5f5b71c3313dcb005e4bf450fe6f91c50cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/audio_info_sheet.dart: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 134 over it, 1.27\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/widgets/audio_info_sheet.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe88d9dcb5bdbd6a6f884f0b25f5d3296a6f4f0cca6b1f875bb22d94794dbbf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppStateDatabase: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\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/services/app_state_database.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df1ede9bfe3ed6e15d33b46b52278e531c608de7f566ee1bb6e5cc0484793d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NetworkStorageService: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\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/services/network_storage_service.dart"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"38964100292ddde8b3758e2aba5fddb543519a0f675f42bbc46be95db1f8c23d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Runner/AppDelegate.swift: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 133 over it, 1.27\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":"ios/Runner/AppDelegate.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c53fc4d52f02438f600cda06e6b06863ab84c504d5387dd0a7168e83f70681"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/backup_service.dart: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: BackupService (157-802). The bar is 500 significant lines; this is 133 over it, 1.27\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/services/backup_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d9cb5a61c1487cf4265add34fd1ae3ad187feb4cbb4e498288d3fb42db5980"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TrackItemWithStatus.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/screens/home_tab_widgets.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5327048affd58f34b123196b06e3c75b5a7da5b233cb36c0b4f98c70f66900a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LyricsParser._parseLrcOrPlain: MethodTooLong \u2014 _parseLrcOrPlain 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/utils/lyrics_parser.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb93849edf3bb2f139804811a3b50e6bd0cce8b8a5f7b50755588da58e5058ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DesktopMenuBarState._buildMenus: MethodTooLong \u2014 _buildMenus 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/widgets/desktop/desktop_shortcuts.dart"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"59aecac0a99b69f11999e8b611a637bbd3a69400d55aa6501d5cbb1f069f0f70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_core::tags::write::id3::read_frames: FunctionTooLong \u2014 mornye_core::tags::write::id3::read_frames runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/core/src/tags/write/id3.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ffa1e13ff6c545bf527343e5cb9cc5b098b8345c777387d3b84ae79865193b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/local_library_provider.dart: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: LocalLibraryNotifier (151-786). The bar is 500 significant lines; this is 126 over it, 1.25\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/providers/local_library_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da885bb3ed6960df7be1e83db8a2c06f5f20eb075e418079624653e813273dfd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MornyeSelectionPillState.build: MethodTooLong \u2014 build runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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/widgets/mornye_selection_pill.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e201bc83f6a6ff328d940d8878d364976c404399a394f31257029352a7e6aeb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/autoplay_taste.dart: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 119 over it, 1.24\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/services/autoplay_taste.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c475b9f9899bee16ab80c533c822f68c814932469dcf756a0ddea00ad9b7f669"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/concert_detail_screen.dart: FileTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: _ConcertDetailScreenState (44-843). The bar is 500 significant lines; this is 117 over it, 1.23\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/screens/concert_detail_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7803e4a4099cbaa1aead5c83e5b368aac1a2657a21d6c280bb50240c6062ba74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/lyrics_ai_client.dart: FileTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 116 over it, 1.23\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/services/lyrics_ai_client.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb537747b1a00e178c452bb87fb90ba705d4d958af7ba6c584e1cbb890a2f8bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ArtistLoadingScaffold.build: MethodTooLong \u2014 build runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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/screens/extension_collection_screens.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ba1124454ba9c6b15bd0e7e997e4816acd2f347be93b937c9e507516569dcd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LyricsDraft.parse: MethodTooLong \u2014 parse runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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/utils/lyrics_draft.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b5c84c33abccb8bd9ccf7aefefe85eec9cfc76174946fe0e53728a31adb337"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HistoryDatabase: ClassTooLong \u2014 490 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 90 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/services/history_database.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03600eca0bac0f75f61e077708484060a8ce553290b382fe2bee5a1559e6468"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LinkClientController: ClassTooLong \u2014 490 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 90 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/services/link/client/link_client_controller.dart"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee30f16bb2a4ae3912901b8991fa6679b58cd3f28b8381cc5ef3a714a6bce07"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AccountFormDialogState._field: MethodTooLong \u2014 _field runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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/controllers/extension_action_forms.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92aad19ee1ffd06e52c74c658a2f46dad5f65df1eba6c6170559188a1764787"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/main.dart: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 109 over it, 1.22\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/main.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9b7d0917cfe5c8a8896b3266ae5cb21018e2995aba6f4c2d89358cddfa6e8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/track_metadata_edit_autofill.dart: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 109 over it, 1.22\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/screens/track_metadata_edit_autofill.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d2c1bc248ee84d0368e5777381964008752ac31f30eca3689b1349f6be6625"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalLibraryNotifier: ClassTooLong \u2014 487 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 87 over it, 1.22\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/providers/local_library_provider.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d649461dbdc2cae658d84a19a3b3d31475e29216bf60a2e55a73e388823902"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/download_service_picker.dart: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 107 over it, 1.21\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/widgets/download_service_picker.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c3ceec60f0e63ee893776342f585fc2f12a5ba92fb512a53dd05e48a94b664"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _MornyeLibraryScreenState: ClassTooLong \u2014 484 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 84 over it, 1.21\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/screens/mornye_library_screen.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadf9ffb674352ff797396d7bc3091abaeacfe633683019feabadec4f40da11d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LyricsAiTranslationPageState.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/screens/settings/lyrics_ai_translation_page.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f32a396d9e8ffcf854ebbc931076d130700a8a19a52280398506003151f444"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FFmpegConversion.convertAudioFormat: MethodTooLong \u2014 convertAudioFormat 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/services/ffmpeg_conversion.dart"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23fd80c3fce5fedcbe72c611fae18c9c1a10c4ebaf4fac9af3b4bda3bf5dc50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/lyrics_share_screen.dart: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 104 over it, 1.21\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/screens/lyrics_share_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ad573974ebb617b94f7a5f05f2759c1c0d9a9d7390904690064f518acb02f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: link/link_transfer_tile.dart: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 104 over it, 1.21\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/widgets/link/link_transfer_tile.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6258df21591ab0ec9281b3ef4357ccf8dffe586394bebc2d433e409488c80f07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/equalizer_widgets.dart: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 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/screens/equalizer_widgets.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de1f24a2b264a1678791bb94964a9db0212d7017b0cdd2aa8205fed964c4679"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HistoryDatabase: 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/services/history_database.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c3c6a7c186b551389e7ec55717e51cb1874f53aa0821cbf8b1aa5828c98a9f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NotificationService: 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/services/notification_service.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8c66e1ccb8e6ea2b1a0bdfdc85c3ea6ac225451e11ec661b9ed65b8253b524"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _PlaybackSettingsPageState: ClassTooLong \u2014 480 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 80 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/screens/settings/playback_settings_page.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"147573dd157d793b2070a7ba86298c880c854ad8fde2497e8589659e91176b10"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppDelegate.invokeOsMethod: MethodTooLong \u2014 invokeOsMethod 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":"ios/Runner/AppDelegate.swift"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d82989d627f70fb3a0e5a1d5c9a05e83487981c9c2bd2266784b73367f032f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LinkCollectionSyncStore._write: MethodTooLong \u2014 _write 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/services/link/sync/link_collection_sync_store.dart"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7895c2906643232b7df71911ad6157009dcb32c2db97ad3aadcb61fb0240c098"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LinkHistorySyncStore.apply: MethodTooLong \u2014 apply 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/services/link/sync/link_history_sync_store.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47d5665008613f2255c17105e98f5ac4a1b107c9c436ea6b1bfea3631e76f61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExploreFeaturedSection.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/widgets/explore_featured_section.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbadcc7cdd07472230a8f9c0aad0bc6edbec8a0be80313d19a903fb86435afe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/files.rs: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). 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":"rust_backend/crates/extensions/src/files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b97e1072a5edc17b2bf471887660767184f375172775036f2b7ebb05a2b66fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/player_lyrics_word_sweep.dart: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 95 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/widgets/player_lyrics_word_sweep.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"683f646d5523dbc313957906cff21f08ffc076329978697c8b031b2c450fc658"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ArtistScreenState._fetchDiscography: MethodTooLong \u2014 _fetchDiscography 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/screens/artist_screen.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"924855df710c602254f08adc41535930acc251acbfee31fa559bc2422e364ea2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MornyeArtistHeader.buildSlivers: MethodTooLong \u2014 buildSlivers 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/widgets/mornye_artist_header.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"276d8ec298dc90f1b8be78e2fb97df0251d3cf0368b0d92b630fa4ae883540a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SignedSessionClient.signed_fetch: MethodTooLong \u2014 signed_fetch runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/extensions/src/signed_session/fetch.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"534c623a4aebf86ed403a1edb812d573165704e3ee4d0f5238e5025182f5c1ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_mobile::native_lyrics::lrc::parse_lrc: FunctionTooLong \u2014 mornye_mobile::native_lyrics::lrc::parse_lrc runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/mobile/src/native_lyrics/lrc.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a363c8daca8a3a4a38ec1dcc37ac68a3958294594063dc9d5319636067b8f9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/music_player_automix.dart: FileTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: _MusicAutoMix (10-750). The bar is 500 significant lines; this is 94 over it, 1.19\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/services/music_player_automix.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fa36e4d142909729cde940919d9d552d2fd58fc1e11c6fde7a00ff7eb609aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_extensions::file_transform::transform: FunctionTooLong \u2014 mornye_extensions::file_transform::transform runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/extensions/src/file_transform.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a66232a66b7a5df2017b44e3617f6f246f153cb38e2d3790a45b16557cd5c16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_mobile::native_lyrics::ttml::parse_ttml: FunctionTooLong \u2014 mornye_mobile::native_lyrics::ttml::parse_ttml runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/mobile/src/native_lyrics/ttml.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a25606062c85cb9b370bcac812695133bd3a8440c4955cc245a910812ae8ae"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LibrarySchema: ClassTooLong \u2014 471 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 71 over it, 1.18\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/services/library_schema.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e0ac41c0278044a60ea94a86f74e2bf2ec44d5535c73171adc56ba5352b57a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/local_album_screen.dart: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: _LocalAlbumScreenState (78-844). The bar is 500 significant lines; this is 88 over it, 1.18\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/screens/local_album_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef30d8717ffc1f924f6fecd9c86c1bb198c42219c1e2ba132a7a8ecd0f4d9836"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LyricsTranslationController.translate: MethodTooLong \u2014 translate runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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/providers/lyrics_translation_provider.dart"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c786e2f296e2f2097a8da75615c7077f320dfe63dcbecf0e01921926cc3df3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MainShellState._mobileScaffold: MethodTooLong \u2014 _mobileScaffold runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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/screens/main_shell.dart"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"915bef3b4aae8eecc2fed97e7df0fa222c73dbf7ed6abc9fea7cd92df7923b61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controllers/batch_track_actions.dart: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 84 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/controllers/batch_track_actions.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94fb060892a950bfd7e603799b2b1c13320508157a1fc1d0ff1888d3bef693f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _QueueTabState: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 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/screens/queue_tab.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"67000a853b9f096b9b24a6a13e4ece343d175224860a489426efc3450cf8915c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LastfmService: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 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/services/lastfm/lastfm_service.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd16db6819fd840e496577e472eb2b459788fae4bb977cd9699eb3ad81d6236d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MediaLibraryBrowser: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 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/services/media_library_browser.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c948265af2929e62a38e1faf3b84e46e01f6e542cb47de6f32aed11041c898eb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Backend: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 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":"rust_backend/crates/desktop/src/backend.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"553d5db7f06e97113978eb740cd8dcdb4a7003cefd166f221592e6db8e644ad1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: link/link_library_actions.dart: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 81 over it, 1.16\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/widgets/link/link_library_actions.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40200cc1f2a8e3f2d8143e37cb26cca0b93bec10e549126964b1d490d8d9f626"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ExtensionItem.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/screens/repo_tab.dart"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce8710ed6cd5c63d45bb1fd6162bb2cccc24a4cbdcc97394c1cceef54944cec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_extensions::download_host::register: FunctionTooLong \u2014 mornye_extensions::download_host::register runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/extensions/src/download_host.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c159df50bfecacbbcf88267074058c01a9414d3bcaef03e9bef7d88dadb2058"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/network_storage_subsonic.dart: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded), about 70% of them inside a single declaration: SubsonicClient (235-788). The bar is 500 significant lines; this is 79 over it, 1.16\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/services/network_storage_subsonic.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb7382c1d1c993d8fefe295eca070f9c6cc0a6ea09efce2699e8590d420a249"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/lyrics_ai_translation_page.dart: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 78 over it, 1.16\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/screens/settings/lyrics_ai_translation_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6503f171b18e7dbd7239db9d8e856a264105fcaca3e32e790b47094440cb382"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _NetworkStorageScreenState: ClassTooLong \u2014 461 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 61 over it, 1.15\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/screens/network_storage_screen.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea0642e98f82b3ccb6ae9c156fe32fe76c87cde2911b1c2fb5e9054265eafbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/extension_provider.dart: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: ExtensionNotifier (32-818). The bar is 500 significant lines; this is 76 over it, 1.15\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/providers/extension_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f373bde09dc2508de917cacfa59e5529b0fffbb9706aec6426ff6d40b352e59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MusicAutoMix._prepare: MethodTooLong \u2014 _prepare 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/services/music_player_automix.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d0bcacaf4a23ad1ef498ba869a47f0b9d75b2fb5eb30948e26b35584724dcf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopSidebar.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/widgets/desktop/desktop_navigation.dart"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a255d0f1728cc677a34a150e5291c1bcd71299db26b227793eb4f6155ecbaa2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_core::tags::write::mp4::edit: FunctionTooLong \u2014 mornye_core::tags::write::mp4::edit runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/core/src/tags/write/mp4.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a01b00c527090529fc33ee1c029dcc6bf32af5c3cf8bad1213defedb760e6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/tutorial_screen.dart: FileTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 72 over it, 1.14\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/screens/tutorial_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6014c68ae64a0acafd60c54bcb0d2e7f5953d4b5a20078df142e047d73040eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/playback_settings_page.dart: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: _PlaybackSettingsPageState (48-654). The bar is 500 significant lines; this is 70 over it, 1.14\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/screens/settings/playback_settings_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa023c95d84b38e5c78574256cae262e487b43cf86cae1643babf3a0db7ca22"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DownloadRun._run: MethodTooLong \u2014 _run runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e0b9c48e1ac9b0df4a2d9f9e1cd66d4d868ceaebaa7f7a13ad3a22d12d2af8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetworkOfflineNotifier.save: MethodTooLong \u2014 save runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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/providers/network_offline_provider.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0efbf83751bf277dd5e9d219bfd38b018d9a39ff2614595531fe6e9b25a0b08"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LinkDesktopSettingsPage.build: MethodTooLong \u2014 build runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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/screens/settings/link_desktop_settings_page.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef5dce81becab4433f86cfca301c0afe78b95195e3a88e415fc8122d73f8160"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ApkDownloader.downloadApk: MethodTooLong \u2014 downloadApk runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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/services/apk_downloader.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2debec66e6a799906ba321474c0ce119dc58ee00d2d2d6d8d8ec41025a49ba54"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BackupService.writeBackupArchive: MethodTooLong \u2014 writeBackupArchive runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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/services/backup_service.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba8e56e0c5c0eca75439b62b77456b8473fe48f7264df6629a1ed90f6423698"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AutoMixSettingsState.build: MethodTooLong \u2014 build runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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/widgets/automix_settings.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e242b266f10c432c817884dd8da5e13cf933756b2a1375509b7fac9e92409c59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopInspector.build: MethodTooLong \u2014 build runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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/widgets/desktop/desktop_inspector.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a699bd2c12d5325d2dd6e1d9e53e17233383150b58ba2618ead7102098383dc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: repo/extension_details_screen.dart: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: _ExtensionDetailsScreenState (29-629). The bar is 500 significant lines; this is 68 over it, 1.14\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/screens/repo/extension_details_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f440901cfc2f201f149b3dfd8f544b0b0127447f2a6d53051191902a3b0503"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/native_library.rs: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 68 over it, 1.14\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":"rust_backend/crates/mobile/src/native_library.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23e8b6f1ae161e0639ae71823e55174b95d1f9c6052d0af7411de4dd9358065"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/media_kit_playback_deck.dart: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded), about 73% of them inside a single declaration: MediaKitPlaybackDeck (230-832). The bar is 500 significant lines; this is 67 over it, 1.13\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/services/media_kit_playback_deck.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e6352097f904fb1a13b7b034369023c56f062c80eaa9ac58d23d133c1fccd6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LibraryCollectionsNotifier: 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/providers/library_collections_provider.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad688ed5aca37b1c95c2daa40ad1f785ac7943ba078b8a5be64a35a00536e14"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _NowPlayingScreenState: 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/screens/now_playing_screen.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa627d840eb952c9c593af4fdea461a0588004ca4e75729adfea1c9594f40dcb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _SyncedLyricsViewState: 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/widgets/player_lyrics.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a92f5279199973936e546d2b2cde973b1765b15864845841cf780fd27238cc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _RepoTabState: ClassTooLong \u2014 453 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 53 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/screens/repo_tab.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"97dc0ad8bdfa793b0cf0efa762905f6299068ba5d1b4d2734e19dc08895f7db1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/catalog.rs: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 65 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":"rust_backend/crates/link/src/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bce10d0f6c1d69112c69cb60956f9c63596d2fe1baa7bcbd2406621b88180d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_mobile::native_listing::execute: FunctionTooLong \u2014 mornye_mobile::native_listing::execute runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/mobile/src/native_listing.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"761605970e215cf2feafb266db904c3bdef5c4a4f1f3926eaebfb1512585cae4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/mornye_library_screen.dart: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: _MornyeLibraryScreenState (53-732). The bar is 500 significant lines; this is 61 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/screens/mornye_library_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df30b6e5b4f204369862f3f8d8020a6b94d72123509ac26c1d038db1e7f41814"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/history_database.dart: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: HistoryDatabase (103-772). The bar is 500 significant lines; this is 61 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/services/history_database.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4739975c3a30938039176ab0cb7c56a6cac30ee6c629bca7aa445aed1a6092d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tags/write.rs: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 60 over it, 1.12\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":"rust_backend/crates/core/src/tags/write.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6d3f447713aaa4801a186658c2da299ac8b1cb2bf2055f39e4528044778fe5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LibraryDirectoryViewState._buildFolder: MethodTooLong \u2014 _buildFolder 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/widgets/library_directory_view.dart"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"74281c3d4df7445824fc47c0fafeb9f54eb18e5a89a87c79da20d47627069f81"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_mobile::native_backup::import: FunctionTooLong \u2014 mornye_mobile::native_backup::import runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/mobile/src/native_backup.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29c4e1ae2dc4de4d3a3054c74eed815be5e2b0cd852fd630a4da262e50b183f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/extension.dart: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 57 over it, 1.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/models/extension.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c147449f1a3f0bde5f6a43448d4744aeb72e16d27728e102e9c2fb76ef9e9ee5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AudioplayersPlaybackDeck: ClassTooLong \u2014 445 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 45 over it, 1.11\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/services/music_playback_deck.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"add0e66ae2e52f6d045c792808d89cbeee6762309a7ace2c3869a2ee0217b57a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _AudioAnalysisCardState: ClassTooLong \u2014 444 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 44 over it, 1.11\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/widgets/audio_analysis_widget.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba3f88c76c078246a4aaa46c6344d651f136acac33e50be1de10e64ba405cbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: desktop/desktop_now_playing.dart: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 55 over it, 1.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/widgets/desktop/desktop_now_playing.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdce150363ab7a5f6de790e699147168bef91f11512ae55cd4764176ab70152"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DownloadService.onStartCommand: MethodTooLong \u2014 onStartCommand 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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd499b9b869639abaffddd4d07c08ce7c884664675076a555ea857a5b1ea8cf7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DownloadedAlbumScreenState._buildAppBar: MethodTooLong \u2014 _buildAppBar 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/screens/downloaded_album_screen.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"074e117d26acfdfb49f2a07839a7b897ac7e9f25a2f8c1ff7fcd4c32c2ad4e13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SetupScreenState.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/screens/setup_screen.dart"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb98aa9d247fde9e954e031a69ed40a20187ad39d30ca4d48a92f65e4718b22"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Health.run_check: MethodTooLong \u2014 run_check runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/extensions/src/backend/health.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b36fba8fa6556ef3d91cbf96e8c83aa0bfbff8e1fcd5d4dfc659d5acc79a5ad"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LinkPhoneCatalogs: ClassTooLong \u2014 442 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 42 over it, 1.11\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/services/link/desktop/link_phone_catalogs.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67f09ed8f43c2f0bc96bdc53c1ee8e2426ce9171005d93dcd02012b1495a24e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MornyePlayerLayout: ClassTooLong \u2014 442 significant lines (blank, comment-only and punctuation-only lines excluded), 4 methods. The bar is 400 significant lines; this is 42 over it, 1.11\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/widgets/mornye_player_layout.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1293fe37fb01ea1ce54cf8ea06f8a1ae708b3d7813b06ab83e4c6ca91c7ba6bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controllers/local_track_batch_actions.dart: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 51 over it, 1.10\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/controllers/local_track_batch_actions.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c086a2648393d2f70ffbfdebf01a978cb1f49829cafe5c58cf4066ecae1e1e07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/download_queue_state.dart: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 51 over it, 1.10\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/providers/download_queue_state.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b211964861d0a0776a941113d860ab71670c4bb4a05e27c31f559638606f526"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/environment.rs: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: ExtensionEnvironment (4 blocks, 80-650). The bar is 500 significant lines; this is 50 over it, 1.10\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":"rust_backend/crates/extensions/src/environment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbd8d560c89c9b3b469e09cb5941ea3c98fdc2810655f625b88b3537871b17a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LocalAlbumScreenState._buildAppBar: MethodTooLong \u2014 _buildAppBar 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/screens/local_album_screen.dart"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"44874fa4a00dc734f7d4c06e238c68be1614ad1c1bbec50c69a78558a5f6bf13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MornyeArtistSurfaceState.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/widgets/mornye_artist_header.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba7d55193f205b4ee714fe8c201d8cfcfa41c54030709256c60261ec5d136b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_core::tags::write::id3::edit_header: FunctionTooLong \u2014 mornye_core::tags::write::id3::edit_header runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/core/src/tags/write/id3.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e13766e2a12ccd2b5c37903a3a05f1e1ae6df188cdbfa3cadb59a81954db13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_extensions::utility_host::register: FunctionTooLong \u2014 mornye_extensions::utility_host::register runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/extensions/src/utility_host.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c8950e6f2f1ca77a7c210379369bb1405ef8db8802d8435bd3d73173b49597"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/cover.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 49 over it, 1.10\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":"rust_backend/crates/extensions/src/backend/cover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde1a0744cf28dbac33977e8f4a4c6c5a06c0797515d9341d453465fdb839443"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/music_playback_deck.dart: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: AudioplayersPlaybackDeck (157-738). The bar is 500 significant lines; this is 47 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/services/music_playback_deck.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae43ad8404424879ddc37b1b23cedb76b0643517a0116e9181a4dbc443350f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/lyrics_editor_sheet.dart: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: _LyricsEditorSheetState (116-601). The bar is 500 significant lines; this is 47 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/widgets/lyrics_editor_sheet.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80986e82b1c0f4227bed6f139691495239d00fd292d50825fe5b886c0f97d248"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/mornye_chrome.dart: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 47 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/widgets/mornye_chrome.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa09d25766512e79f173902ab475561e7e21089f1ff1c0cfcc8db5314a12d10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/mornye_context_menu.dart: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 45 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/widgets/mornye_context_menu.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4be66eae04b6befbda2a198c5ccee9cdf189abb8c9a4be6f7e8eefa69e0ff1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SpectrogramView.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/widgets/audio_analysis_spectrogram.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a949bcfb56941c32e7cad9e9206300faf3508c1979fd6191e80b35305b0af1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/music_player_runtime.dart: FileTooLong \u2014 542 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 42 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/services/music_player_runtime.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2852f87721cad0fd8380f76f9df404a7c32ac04ecaf4cba2d06f24d8382a86a3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ExtensionDetailsScreenState: ClassTooLong \u2014 432 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 32 over it, 1.08\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/screens/repo/extension_details_screen.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad118c037a25ff1cc1462e43fa1be62a1aa09540fbc777d53d003cab949aa9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibraryCollectionsDatabase.replaceDatabaseFromBackup: MethodTooLong \u2014 replaceDatabaseFromBackup 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/services/library_collections_database.dart"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1aa727f4c1638661a044631c92b128b9a49cd1cb04a7c2a6037bc71c5ae291"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_core::cue::parse: FunctionTooLong \u2014 mornye_core::cue::parse runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/core/src/cue.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc63c2d48203e22ba4b53b2367484ab6224638c2db7c73c8158e1be3f806caf2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Inner.search: MethodTooLong \u2014 search runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/providers/src/lyrics/service.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a395859014d6a792e02f49595f2fe9c14659e4ff98051ea440fe26dbb7c2b05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/mornye_player_layout.dart: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: MornyePlayerLayout (40-632). The bar is 500 significant lines; this is 36 over it, 1.07\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/widgets/mornye_player_layout.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ae71b2c2dcdbc09bf5a24d5cc5fe6301d50836c998217c013f0c5747c84a59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/track_collection_quick_actions.dart: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded), about 60% of them inside a single declaration: _TrackOptionsSheet (255-688). The bar is 500 significant lines; this is 36 over it, 1.07\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/widgets/track_collection_quick_actions.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"413f891019145edb65fa2c87d7b5c69a2f9def721702be08b5be252e59a2e610"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SearchSongCoverCell.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/screens/home_tab_search_wide.dart"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"370ac95f9b5e3defb2d68fb93472f8829bad91cc2a11353f72911156ddaa81d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ExtensionDetailsScreenState._buildInfoCard: MethodTooLong \u2014 _buildInfoCard 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/screens/repo/extension_details_screen.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce47137cfee9f45011eaefacf1111ce1fa3f83478e451751f3096fca88ff50ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LogEntryTile.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/screens/settings/log_screen_widgets.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a667c22a882d04d03f569ace809fdbaea835503fe0f78365c06f0b808e43a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SettingsTabState._buildCategoryList: MethodTooLong \u2014 _buildCategoryList 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/screens/settings/settings_tab.dart"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"776f5926d5678ce226b510d29160fa9a4d6fe38f504d0646837ffd79ab047988"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MusicGapless._prepare: MethodTooLong \u2014 _prepare 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/services/music_player_gapless.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fe95ef7d7a5b7dac15406e59630f43d5b09265c8c096d9cbbe3d6ce8034316"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/library_settings_page_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/screens/settings/library_settings_page_widgets.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b8b76b7403734fa83558df32461dd933e1f9473fd84548862bc7f623916354"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LinkMirroredPlayback: ClassTooLong \u2014 427 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 27 over it, 1.07\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/services/link/link_mirrored_playback.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa6f0eab7f28e4540450db68548a524162e1eaf93f5aff22f50d5977f4fa743"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _EditMetadataSheetState: ClassTooLong \u2014 427 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 27 over it, 1.07\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/screens/track_metadata_edit_sheet.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf682bf637023e2bc12b925b5316da842d01d8f78c25d6733aa1a3e16f3da37e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _LibraryTracksFolderScreenState: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"608578b9851fa3ca2d1bcee5829a8b9b05f0153456e59588cefeac6526a51534"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _LocalAlbumScreenState: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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/screens/local_album_screen.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed299cd9ef49814085b19405970b0cd912c9ed0086120ed4ea9771d4900c603"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _MainShellState: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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/screens/main_shell.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fc829114acc04164094a857fa7395f94d0b4bd617d6fe6f2ba41603b6b6184"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LinkClientController: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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/services/link/client/link_client_controller.dart"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d2495e6a62c956688c2c89ef0e5e5648f0724b8c9f74a44630aecc4dd428e3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LinkPhoneCatalogs: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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/services/link/desktop/link_phone_catalogs.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ea63da185deefe8611ebc20a068a8496e5643f937a0d7995db5e9438b8d076"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AudioplayersPlaybackDeck: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\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/services/music_playback_deck.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4bfa5527b0b277b174ff13e7b23d45523b25cbd26ccb538a72e876a7288814"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/app_state_database.dart: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: AppStateDatabase (30-715). The bar is 500 significant lines; this is 33 over it, 1.07\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/services/app_state_database.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcede4e5e68bcf586e2a4472c23a2a9a7df9f054bb759e2e6ebce0365d7e3af5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LinkDesktopRemote._applyLocally: MethodTooLong \u2014 _applyLocally 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/services/link/features/link_desktop_remote.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dda043dee36189f79484a256d6b904d382d684ebb7544ff27d000ce7750db3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DesktopTrackListSkeleton.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/widgets/animation_utils.dart"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab19628cc992924d11b63ed563717e879f483980587949135a0565494db5389"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LyricsOptionsButtonState._showMenu: MethodTooLong \u2014 _showMenu 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/widgets/lyrics_options_button.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca29b2782944fe1914d6c8123b8190a023aeea104617652a9f08888c6d6ac2e1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _DownloadSettingsPageState: ClassTooLong \u2014 421 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 21 over it, 1.05\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/screens/settings/download_settings_page.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"75542c2968f24f32869bfb306c045ea994fd5fdccbbcc2fae69fd9e2f6478f43"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExtensionEnvironment: ClassTooLong \u2014 420 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 4 blocks, lines 80-650. The bar is 400 significant lines; this is 20 over it, 1.05\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":"rust_backend/crates/extensions/src/environment.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c8b5e1d29aa21c17a90b68bf344c06c0e675631ad223fac7abdd279021393b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FilenameFormatEditorSheetState.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/screens/settings/files_settings_page_widgets.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"326c0e162cecad5fbd2eef3ab3bc731aba2eae041ea4fcd257c559c91d489559"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SettingsTabState._buildList: MethodTooLong \u2014 _buildList 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/screens/settings/settings_tab.dart"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"1917c62eefbad320eb3a54401da93064067b3db888b2fea6e56a959ab7464860"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mornye_extensions::download::segments::fetch: FunctionTooLong \u2014 mornye_extensions::download::segments::fetch runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"rust_backend/crates/extensions/src/download/segments.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a790b558efc871cfe533dd60374292105d14b7e22e73991981ad0e0402cb86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/ffmpeg_conversion.dart: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: FFmpegConversion (24-641). The bar is 500 significant lines; this is 24 over it, 1.05\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/services/ffmpeg_conversion.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6458bf79cde510d9663eeefe912b384153205e7f4aa7a6119cc0147c9690b7ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/selection_bottom_bar.dart: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 24 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/widgets/selection_bottom_bar.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8db0751f775f1d0dc1ae3283935dad655b467d7840ba1fafc9373f2d1f0e54"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Backend: ClassTooLong \u2014 419 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods, 2 blocks, lines 52-641. The bar is 400 significant lines; this is 19 over it, 1.05\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":"rust_backend/crates/desktop/src/backend.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc5955aeedeeb7b96eec0b3b619761057945f23788e8bb8cc4c4b12a7c30f58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/notification_service.dart: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: NotificationService (14-709). The bar is 500 significant lines; this is 22 over it, 1.04\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/services/notification_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"800e0f99499e64e76ddc24bf0078a41f5936d3490d2ca68a7252000e2f3ee036"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: library/scan.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: Backend (69-627). The bar is 500 significant lines; this is 22 over it, 1.04\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":"rust_backend/crates/extensions/src/backend/library/scan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51757dcfba8705363be0669f25184eb92448d51e56b76160903b41504127d5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: usb_audio/transport.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 22 over it, 1.04\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":"rust_backend/crates/mobile/src/usb_audio/transport.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3884caf7f1fd5dd247a6de641a02b7d42b274073b016e416baf5a1d2b2c5b2ef"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MediaKitPlaybackDeck: ClassTooLong \u2014 416 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 16 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/services/media_kit_playback_deck.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c219b5b47685e695c8f6bb2fa573f7f97c7f2ae6c3def164fc10bf79350aeb6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _MixBuilder: ClassTooLong \u2014 416 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 16 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/services/library_mixes.dart"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"349d99db291fe138057e721d9e85c888b87156c2507b119b8986f80ec00d818d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BackupService._parseArchive: MethodTooLong \u2014 _parseArchive runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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/services/backup_service.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed2b63c0234dadd99f322c1f9959fe4c929d55abb8674cbc6ae023cb81c446f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TrackInfoHeaderState.build: MethodTooLong \u2014 build runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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/widgets/download_service_picker.dart"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e880bcd89ff4d1b8b12513fba9114509f1da36b09f4f850f3a0b42713f4203"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/sqlite_helpers.dart: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17 over it, 1.03\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/services/sqlite_helpers.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec01dff56b475d0532dbabe5bce6cdad505f13a0a45b34eacc18105f51b47a4f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SafDownloadHandler: 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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45e5461579dfe41e9a9b0ce9ccedae16a957d627aa970fbef14c686b28fd316"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MusicPlayerController: 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/providers/music_player_provider.dart"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e171f530c73562a7c97dca3d9802497961a7a05049988136a71cdd4c2d586690"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DesktopDiagnostics: 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/services/desktop_diagnostics.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a256970e12cf9f46fb870b87645e6122e185e23ac8758a97e149059792ae231c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExclusiveOutputDeck: 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/services/exclusive_output_deck.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f520d2d50a4bbb6538181228537584754bc72e5732d462689ffcce123570e9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Song: TooManyFields \u2014 31 stored fields beside 4 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/link/src/catalog.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bf20b360a9b8ed44c38ff3d85be95d973019993d9c2940ad96966dd81c1d30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/about_page.dart: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 over it, 1.03\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/screens/settings/about_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f703c00110ea9cd47ece763d3906e42bd7dadd4162c9dcccba6a41129897bed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: desktop/link_phone_catalogs.dart: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: LinkPhoneCatalogs (52-708). The bar is 500 significant lines; this is 16 over it, 1.03\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/services/link/desktop/link_phone_catalogs.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f01188ffeca6b4424f7d4f0be2401af4640e9bafdfe6cf87b019636beba1dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DownloadRun._publishDeferredSafOutputOnce: MethodTooLong \u2014 _publishDeferredSafOutputOnce 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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3af2d3bb60c69ee3038086aab0f421938cdd5e5a57f85c2e435e340713b7bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibrarySchema.rebaseContainerPaths: MethodTooLong \u2014 rebaseContainerPaths 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/services/library_schema.dart"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"150241d6a849fcaccfcf27ea6072e58eb261209b6eb0739ef29bf8c536891f0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppSliverHeader.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/widgets/app_sliver_header.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae37cb118006043a562bfbd5f51e73e124bf14141e67f57f620d88ee0db66b1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/player_playback_controls.dart: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 over it, 1.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/widgets/player_playback_controls.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7ddc92a594ec69a13d162916de7cba32c9f9cbaaea052c2a9510e64d199b20"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CollectionTrackTile.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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb5b0fce34d595fbfea5d7070c90f3caf2755f4da38aee74e5236fa068c7b9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _InteractiveDownloadExampleState.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/screens/tutorial_screen.dart"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0231c42e61a65d242ee07081360e0d1c8f9c867bee7df8c56c8e2ce432d5ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _WhatsNewScreenState.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/screens/whats_new_screen.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8796229e3ab0951cca64b03a185819755f74b5263f45e9461f92c9fcde2f938"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DownloadedEmbeddedCoverResolver._extractCover: MethodTooLong \u2014 _extractCover 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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"8866ab7f693a6625cbe46a841756a51a6ae95e94df1780ff7f1623efa2e90d16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ServiceChip.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/widgets/download_service_picker.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d82da633d9c7c9f1ecafdc9678f7cfd9ca7da21708ea86b718fabb9deb6d495"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _UpdateDialogState: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 7 over it, 1.02\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/widgets/update_dialog.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9deac0d67ba5b52b27943894da9530151f96a8d538075f41ca9af3a49675b26d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SubsonicClient: ClassTooLong \u2014 405 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 5 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/services/network_storage_subsonic.dart"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2584745aa0371b9f85b0068ec6ca1039ec99587d31c25d0f943646e9092dc9ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/autoplay_personalization.dart: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6 over it, 1.01\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/services/autoplay_personalization.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1faa765686b2e15112ba2513a2d9286ddee6a49f1cb292f754bc751664fedf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime.rs: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 6 over it, 1.01\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":"rust_backend/crates/extensions/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07375e480fb08e9f81590b2ab89a2273109c0dd562040e9f9f8f0fa3ae51ccbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/appearance_settings_page_widgets.dart: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 over it, 1.01\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/screens/settings/appearance_settings_page_widgets.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6dabb5be0b2229a307e37547474ed4ddd58a10fe1ed33e16c97054abb6f916"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SearchProviderDropdown.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/screens/home_tab_widgets.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f805f61bd2119b05debf82d1f6818d98f5ad0c90f9323841adfa1bda9f8ae280"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _WhatsNewDialogState.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/screens/whats_new_screen.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"448489b36cc7d82b965ff474fdd33d4b558e0323382fe4987c0752c63f56218c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ExpressivePlaybackTransportState.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/widgets/expressive_playback_transport.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bfafc20753da5197eec6fb998816cbae1c1d2cf0bc05884bb5f551704244ef"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AudioAnalysisRunner: ClassTooLong \u2014 402 significant lines (blank, comment-only and punctuation-only lines excluded), 15 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/services/audio_analysis_runner.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9397dd93c6c0cdaef56ecd995c21c2f1d52e3790848e1745e870bf78a5c02e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/backend.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: Backend (2 blocks, 52-641). The bar is 500 significant lines; this is 2 over it, 1.00\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":"rust_backend/crates/desktop/src/backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13782b939b80e8ba59610295fdc941b723d3475d034a06c29147054d8659ddf7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DownloadMetadataEmbedding: 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/services/download_metadata_embedding.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3969185d3786786f0d297cd742e166e15353c06a73717b623890a8cfc2a5b71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): rust_backend/crates/extensions/src/backend/cover.rs:342-528 | rust_backend/crates/extensions/src/backend/cover.rs:536-568 | rust_backend/crates/extensions/src/backend/library.rs:41-55 | rust_backend/crates/extensions/src/backend/library.rs:281-304 | rust_backend/crates/extensions/src/backend/tags.rs:46-73 | rust_backend/crates/extensions/src/backend/tags.rs:82-179 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/cover.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53e8a3714a6aa62b1d5cfc06a54df6975da20a0f058a9cf3ef89ed0d329c4b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/services/history_row_mapper.dart:63-134 | lib/services/history_schema.dart:253-275 | lib/services/library_row_mapper.dart:37-68 | lib/services/library_schema.dart:350-373 \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/services/history_row_mapper.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83be0eab9dc65c30dbf1eedc42b0fb5e45c178987055b33ece6c14431cb68ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust_backend/crates/extensions/src/manifest.rs:64-285 | rust_backend/crates/extensions/src/repository/model.rs:66-124 \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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eac7100be9bff0e297f52682e266f3c5c886e07a0030da9e571444f1714d228"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): rust_backend/crates/providers/src/resolver/availability/cache.rs:171-262 | rust_backend/crates/providers/src/resolver/service.rs:109-189 \u2014 These two members are one piece of code written twice and then edited apart: 81 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":"rust_backend/crates/providers/src/resolver/availability/cache.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36a7a2170b0d3a2b99dfab171cb5e64efd51caf28abafc1766617b7f156122f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): rust_backend/crates/core/src/metadata/deezer.rs:26-26 | rust_backend/crates/core/src/metadata/deezer.rs:60-60 | rust_backend/crates/core/src/metadata/deezer/catalog.rs:54-54 | rust_backend/crates/core/src/metadata/deezer/catalog.rs:96-96 | rust_backend/crates/core/src/metadata/deezer/catalog.rs:114-114 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 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":"rust_backend/crates/core/src/metadata/deezer.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7178ff18cf1b58f15ebc5fce2efb5b3e2cdd520cca8ba3bb870f44de468d8b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (99 corresponding lines): lib/widgets/settings_group.dart:460-570 | lib/widgets/settings_group.dart:595-693 \u2014 These two members are one piece of code written twice and then edited apart: 99 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/widgets/settings_group.dart"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"06687f723067f1af5806c226ca226cc992a5880ffef5b5b62d7619e259aab8cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): lib/models/download_history.dart:190-269 | lib/models/track.dart:154-220 \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/models/download_history.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6a6159bd2b37c0c99a612c9730ccd2c2c8e55e58dbbb0834989737da300d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): rust_backend/crates/core/src/lyrics/lrclib.rs:18-18 | rust_backend/crates/core/src/lyrics/models.rs:19-19 | rust_backend/crates/core/src/lyrics/models.rs:113-113 | rust_backend/crates/core/src/metadata/deezer.rs:44-44 | rust_backend/crates/core/src/metadata/deezer/catalog.rs:73-73 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 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":"rust_backend/crates/core/src/lyrics/lrclib.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f656b2c0b94f9c84ab64ed49d7ad56d629a3795570b4db6fa6312005ee6323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): rust_backend/crates/core/src/lyrics/models.rs:169-169 | rust_backend/crates/core/src/lyrics/models.rs:177-177 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"rust_backend/crates/core/src/lyrics/models.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1af03ed80ba862901507d995e771ee893cd39af173b27099b812db6d4942226"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 1\u002B corresponding lines): rust_backend/crates/core/src/lyrics/payloads.rs:21-21 | rust_backend/crates/core/src/lyrics/payloads.rs:39-39 | rust_backend/crates/core/src/lyrics/payloads.rs:590-590 | rust_backend/crates/core/src/lyrics/payloads.rs:601-601 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 1 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":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e81f9bbed86e9572814d241bf299561dd6d3be6f104f96d2fab2cee8d231666"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): rust_backend/crates/core/src/lyrics.rs:53-53 | rust_backend/crates/core/src/lyrics.rs:73-73 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"rust_backend/crates/core/src/lyrics.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9959f7266ec07adaf30c03c00e81d00cdd99ebeaa130ac958199717795191e5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): rust_backend/crates/core/src/lyrics/models.rs:28-28 | rust_backend/crates/core/src/resolver.rs:73-73 | rust_backend/crates/core/src/resolver.rs:107-107 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 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":"rust_backend/crates/core/src/lyrics/models.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2dbcac3c6e237d61c9a5b6e9a1a131b2af302b0a645a592d4e5f0a984ccf16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): rust_backend/crates/core/src/lyrics/models.rs:50-50 | rust_backend/crates/core/src/lyrics/models.rs:63-63 | rust_backend/crates/core/src/lyrics/models.rs:151-151 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 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":"rust_backend/crates/core/src/lyrics/models.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d7c8d4914cff3b40090a6efd0b19be15ad207d9c012435afb24e6d724764f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): rust_backend/crates/extensions/src/manifest.rs:64-183 | rust_backend/crates/extensions/src/repository/model.rs:66-101 \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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be2260954b9e359147cd9d01699f03db0fa42ad44eb99a204626aadf5d21098"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (84 corresponding lines): lib/screens/settings/app_settings_page.dart:268-351 | lib/screens/settings/app_settings_page.dart:363-448 \u2014 These two members are one piece of code written twice and then edited apart: 84 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/screens/settings/app_settings_page.dart"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c4915bec341721ea0dbffbfd8d1ca8f2e0a8cde6a6ac6444a29b66dd804106"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): lib/screens/artist_screen_discography.dart:473-532 | lib/widgets/batch_progress_dialog.dart:113-187 \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/screens/artist_screen_discography.dart"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc153f7a5df4fbcf515afc89cff691fa17fc6649d94da4f682e8639545f1e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): rust_backend/crates/core/src/lyrics/models.rs:128-128 | rust_backend/crates/core/src/metadata/deezer/catalog.rs:16-16 | rust_backend/crates/core/src/metadata/musicbrainz.rs:15-15 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 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":"rust_backend/crates/core/src/lyrics/models.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fdf6405cfaf8d30957566c54b144750004107ce014c57937ae9fc550485e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 1\u002B corresponding lines): rust_backend/crates/core/src/lyrics/models.rs:186-186 | rust_backend/crates/core/src/metadata/musicbrainz.rs:29-29 | rust_backend/crates/core/src/resolver.rs:46-46 | rust_backend/crates/core/src/resolver.rs:115-115 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 1 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":"rust_backend/crates/core/src/lyrics/models.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3197d7eb7f63a8c987f74d9a4b0abeff1baf0472108ea8206f1a238647f9f3b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 1\u002B corresponding lines): rust_backend/crates/core/src/lyrics/models.rs:192-192 | rust_backend/crates/core/src/lyrics/payloads.rs:51-51 | rust_backend/crates/core/src/lyrics/payloads.rs:174-174 | rust_backend/crates/core/src/lyrics/payloads.rs:611-611 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 1 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":"rust_backend/crates/core/src/lyrics/models.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b643a6cdd9d09c5d9ae49ab95208ff66caddf9f1eb58fd07d89290908c6e2670"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): lib/widgets/library_directory_view.dart:142-193 | lib/widgets/library_search_results.dart:170-235 \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/widgets/library_directory_view.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f8928d9f47c29b89cc76d60dc5416e6f1d50e0bf487e7c73b291399c787b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 1\u002B corresponding lines): rust_backend/crates/core/src/lyrics/models.rs:10-10 | rust_backend/crates/core/src/lyrics/models.rs:36-36 | rust_backend/crates/core/src/lyrics/models.rs:87-87 | rust_backend/crates/core/src/metadata/deezer/catalog.rs:82-82 | rust_backend/crates/core/src/metadata/musicbrainz.rs:22-22 | rust_backend/crates/core/src/metadata/share.rs:16-16 | rust_backend/crates/core/src/resolver.rs:64-64 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 1 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/lyrics/models.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"403ec6a2c703701a6f0f454b109bbb80a65d2d9dbb5b0214dfbf500c08fcf39b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 1\u002B corresponding lines): rust_backend/crates/core/src/lyrics/models.rs:42-42 | rust_backend/crates/core/src/lyrics/models.rs:79-79 | rust_backend/crates/core/src/lyrics/models.rs:97-97 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 1 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":"rust_backend/crates/core/src/lyrics/models.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4092446aef0e0dce3e0d9e41215e8832d2b53f206efde7218da790602af1bd9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 1\u002B corresponding lines): rust_backend/crates/core/src/lyrics/models.rs:74-74 | rust_backend/crates/core/src/lyrics/models.rs:119-119 | rust_backend/crates/core/src/lyrics/models.rs:144-144 | rust_backend/crates/core/src/metadata/deezer.rs:69-69 | rust_backend/crates/core/src/metadata/deezer/catalog.rs:9-9 | rust_backend/crates/core/src/metadata/deezer/catalog.rs:22-22 | rust_backend/crates/core/src/metadata/deezer/catalog.rs:124-124 | rust_backend/crates/core/src/resolver.rs:121-121 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 1 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/lyrics/models.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6522988522dbceb1fd1713b70b17de4c72ddaf996cdcce7dee9bfe0511ef038d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): rust_backend/crates/core/src/lyrics/models.rs:138-138 | rust_backend/crates/core/src/lyrics/models.rs:161-161 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"rust_backend/crates/core/src/lyrics/models.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f438a6b2b9f54081ac232301d391f74a02cf8e4b2fa288fc7919e116966011"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): rust_backend/crates/core/src/metadata/musicbrainz.rs:42-42 | rust_backend/crates/core/src/resolver.rs:81-81 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"rust_backend/crates/core/src/metadata/musicbrainz.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbbc802b1f4846e15a7ebe2b550c19acfa4d2c93b569b7ff8afb69d50e4f7f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): rust_backend/crates/core/src/resolver.rs:39-39 | rust_backend/crates/core/src/resolver.rs:93-93 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"rust_backend/crates/core/src/resolver.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"378d788119c217f583a5ffa0dfdccfdd10ddfc2f1cbd6ce8260b933cc4f291dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): lib/theme/app_theme.dart:37-84 | lib/theme/app_theme.dart:86-135 \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/theme/app_theme.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b82bac233e49af09d95aa698b5db6118d389a78d5fb750db31046731705d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): lib/screens/settings/lyrics_provider_priority_page.dart:315-377 | lib/widgets/reorderable_priority_item.dart:24-98 \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/screens/settings/lyrics_provider_priority_page.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdb8f534c442921d79fecb7887f64f03e8041af0c8333738ff45834b9257c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): lib/models/extension.dart:183-236 | lib/providers/track_provider.dart:72-131 \u2014 These two members are one piece of code written twice and then edited apart: 54 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/models/extension.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f676dc738d2d38d1d8e4aaec3c0b45aad25fe19a26e5988b20d470276e3b53ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): rust_backend/crates/cast/src/media.rs:379-415 | rust_backend/crates/link/src/subsonic/media.rs:156-196 \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":"rust_backend/crates/cast/src/media.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1a8b9a36b6b54f0ce3f754e273905eb27e757e185636562d1757c46033e6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): rust_backend/crates/providers/src/lyrics/builtin/proxy.rs:49-83 | rust_backend/crates/providers/src/lyrics/builtin/proxy.rs:115-143 \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":"rust_backend/crates/providers/src/lyrics/builtin/proxy.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"597f38ac943cf7f22f504ce28f6876f9d72859c22d20c4f15203f5cadc48108c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_backend/crates/link/src/subsonic/objects.rs:77-107 | rust_backend/crates/link/src/subsonic/objects.rs:123-143 \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":"rust_backend/crates/link/src/subsonic/objects.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3f8501133f9139310efec5ece6e2f3ad42aca4a9611a70c3090f30628b9345"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lib/widgets/network_offline_actions.dart:241-274 | lib/widgets/network_upload_actions.dart:166-199 \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/widgets/network_offline_actions.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fc9f2c92a57db06ac1d39b8f95f57ab3b9bcc638f1dd9206d819cdd01b2cb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): lib/services/link/features/link_phone_library_sync.dart:357-397 | lib/services/link/features/link_phone_library_sync.dart:399-446 \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/services/link/features/link_phone_library_sync.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a70d46b014a2f462ad0b71c1829bf8afc393747c178c8abd7f6fc9a0c0636d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): lib/screens/mornye_library_screen.dart:188-231 | lib/screens/mornye_library_screen.dart:233-275 \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/screens/mornye_library_screen.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7bd6508ef690e2a1bf13f7dfdb8dea17a3c2393ec831717f835b806748ac2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): rust_backend/crates/providers/src/resolver/availability/cache.rs:359-401 | rust_backend/crates/providers/src/resolver/service.rs:240-275 \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":"rust_backend/crates/providers/src/resolver/availability/cache.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c38ee1c9192b4c622cc8700df95eefc829b16c7454684df4e1e06ba94c281fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/services/link/sync/link_sync_handlers.dart:214-238 | lib/services/link/sync/link_sync_handlers.dart:240-265 \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/services/link/sync/link_sync_handlers.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f847ad174f76d30c1cf8d30d761d311f4f84b8b09d70281a205a2578f7293f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): rust_backend/crates/extensions/src/backend/provider_metadata.rs:126-151 | rust_backend/crates/extensions/src/backend/provider_metadata.rs:162-194 \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":"rust_backend/crates/extensions/src/backend/provider_metadata.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ec9f014b71b63d4898c04a9e540814dd50265ccbcc960b29e365cc1fbeace1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): rust_backend/crates/extensions/src/download/segment_store.rs:184-209 | rust_backend/crates/extensions/src/download/store.rs:158-184 \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":"rust_backend/crates/extensions/src/download/segment_store.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b02281d54a1bbe6be42826c5d0c4247c5e742642bf2220b9ee4149fee72f38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lib/services/autoplay_ranker.dart:357-388 | lib/services/autoplay_taste.dart:708-743 \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/services/autoplay_ranker.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7b19cccc6121fd5127663ea9212503ee42b965104ceab66d7b10d3607da37b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:232-257 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:259-285 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:287-319 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"79039e16ccf0dca8b4ec6767fa015c8a53ae541fddb7e68b48da204db47ee47c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): lib/services/backup_service.dart:389-426 | lib/services/backup_service.dart:428-482 \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/services/backup_service.dart"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7f9f7596ebb281f31aa9be60cb6097f7e38fbfa115e4bf91d2fb12bdd95d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lib/screens/settings/app_settings_page.dart:140-172 | lib/screens/settings/app_settings_page.dart:174-205 \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/screens/settings/app_settings_page.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"218175199fa48eef8e2185a4bff5cbf8abc43991e93f672a6ed277e5d5047aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): lib/screens/downloaded_album_screen.dart:853-888 | lib/screens/local_album_screen.dart:806-843 \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/screens/downloaded_album_screen.dart"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"7590f5df697796430ece858d8095384c0e4af9ab8d4bdbcf38df4723ac2ba946"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/services/metadata_autofill_service.dart:318-347 | lib/services/metadata_autofill_service.dart:349-377 \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/services/metadata_autofill_service.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fe88e9367e78b892ac3eecbeceb968a6fa18215726b634d8f067b618f1418c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): lib/widgets/animation_utils.dart:268-309 | lib/widgets/animation_utils.dart:403-448 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \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/widgets/animation_utils.dart"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16f1855de3d8742227483f719b2f163d721f99d3431e3da5d4810e111f3a9aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/services/music_player_service.dart:1500-1521 | lib/services/music_player_service.dart:1523-1551 \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/services/music_player_service.dart"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"8159be7ef3aaded9bc7e2172d01efe95c5ea4f8cdbd6749164beec0de9dc840d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/services/history_database.dart:747-771 | lib/services/library_database.dart:1126-1155 \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/services/history_database.dart"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16375732ce7bdec3013a19848dd0fa31f38d34f1b76786771f1029e7551aebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/services/link/link_protocol.dart:251-269 | lib/services/link/link_protocol.dart:660-681 \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/services/link/link_protocol.dart"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c955be45b837ef3834a59fbc09f73f9c41b91aaedabd0d9887bfdd38d39434"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): lib/screens/home_tab_intro.dart:1051-1088 | lib/screens/home_tab_intro.dart:1215-1251 | lib/screens/home_tab_intro.dart:1262-1299 \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/screens/home_tab_intro.dart"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ca9414de576fbf7286e8b4d6f5f6c7ae861ef1953f920e086212ad4e1ef5ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): rust_backend/crates/cast/src/media.rs:151-168 | rust_backend/crates/desktop/src/callback_url.rs:8-29 \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":"rust_backend/crates/cast/src/media.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f776b8d2859c58066634b34f487594f8bbd3575138ddc9713286b6faae310f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/screens/network_storage_screen.dart:82-109 | lib/screens/network_storage_screen.dart:111-132 \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/screens/network_storage_screen.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c09c43a969e3448327b1865ed053b00252805440967c83ec4e7880f138b58e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_backend/crates/extensions/src/manager.rs:281-304 | rust_backend/crates/extensions/src/manager.rs:313-328 \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":"rust_backend/crates/extensions/src/manager.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7b7096cabaf2fdcad077941efe6d8dc4cce8322ef5961b13f8c38900142d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt:1647-1681 | android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt:1683-1716 \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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"294e16e70b478f627a500c894312fa3204b86173e9e6868eedf2429055c75c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/providers/explore_provider.dart:65-83 | lib/providers/repo_provider.dart:68-84 \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/providers/explore_provider.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23848cc316fa15215849546a9a6af76c63da32c350c0eee8fb8626bb70504bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/screens/settings/library_settings_page.dart:252-286 | lib/screens/settings/library_settings_page.dart:298-328 \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/screens/settings/library_settings_page.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e7a77f5c4930c44c55827a0a6c882c08c79733f0dc929f669e1b76f4015bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/screens/equalizer_screen.dart:72-90 | lib/widgets/custom_font_setting.dart:21-46 \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/screens/equalizer_screen.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25686af6fcdc0cdb59d960ed59d815523b25c7101f9d8e5ef7e3cc2b6fce699"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt:401-427 | android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt:438-468 \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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cc08a150c5a2dd37015fef6164da30a2f53d9a670d81b37a56324335fa4afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/screens/settings/library_settings_page_widgets.dart:48-58 | lib/screens/settings/library_settings_page_widgets.dart:318-329 \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/screens/settings/library_settings_page_widgets.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9188940c11e93c60ef5e0fd965190f6a5c9c6fd1b18e1e3c04bbdd9d7da20720"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_backend/crates/desktop/src/paths.rs:68-82 | rust_backend/crates/providers/src/recognition.rs:420-441 \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":"rust_backend/crates/desktop/src/paths.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db16bd6d99a61ac4a53e2bb3bfac95863425054348221cd65c89899c2ee720b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/services/link/client/link_client_library.dart:117-136 | lib/services/link/desktop/link_phone_library.dart:62-85 \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/services/link/client/link_client_library.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebef707faeee6027288950616022c5acf9d9751c67688ff6994be34408548bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/providers/library_collections_provider.dart:729-753 | lib/providers/library_collections_provider.dart:755-775 \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/providers/library_collections_provider.dart"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a32bb74663cec5dbfec2d6df6f5e1c1090f0e89dd171767abc7195b1f65e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/screens/downloaded_album_screen.dart:537-558 | lib/screens/local_album_screen.dart:496-513 \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/screens/downloaded_album_screen.dart"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0178ec2b9bb72eb2b4de41076d34aa263cdaedbfd72a3dc6518c03b4feb5c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/services/ffmpeg_support.dart:26-45 | lib/services/ffmpeg_support.dart:69-83 \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/services/ffmpeg_support.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c74f797284a4249e91d3ba8824af9b601876b4e5855193619e9a395fe89520"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/models/download_history.dart:104-142 | lib/models/library_database_models.dart:85-115 \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/models/download_history.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce1802ed85e5a8897d0377aa626a458e027b3fcf481018f93f741cca941fee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/screens/now_playing_screen.dart:1083-1107 | lib/widgets/mornye_player_favorite_button.dart:35-56 \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/screens/now_playing_screen.dart"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f521b4aae9a0831db2f4f84465d4c140dfdb5c1ab5775f24c7339768a8ae26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/services/link/link_protocol.dart:544-562 | lib/services/link/sync/link_sync_protocol.dart:333-348 \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/services/link/link_protocol.dart"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d41a06c09f29721a62262632d009300c017f114e15a92851bc9748696461dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_backend/crates/mobile/src/native_backup.rs:117-130 | rust_backend/crates/mobile/src/native_library.rs:356-369 \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":"rust_backend/crates/mobile/src/native_backup.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"380360b7476837a5321ccbc6eaddb0a1c7dc71a09a0a1c0fc81c60dbce13005f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): rust_backend/crates/mobile/src/native_backup.rs:150-170 | rust_backend/crates/mobile/src/native_library.rs:180-202 \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":"rust_backend/crates/mobile/src/native_backup.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66dba7e6470ea4f3fedfdb5cfa9d49b592024435fe1b5f439b86dce32f392ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lib/screens/home_tab.dart:1135-1164 | lib/screens/library_tracks_folder_screen.dart:1609-1641 \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/screens/home_tab.dart"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d0f99ef6b80ac7494cfc2de7aad97e3c2ec491a93fea2455a31edc4a35d12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/screens/settings/metadata_provider_priority_page.dart:9-24 | lib/screens/settings/provider_priority_page.dart:9-22 \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/screens/settings/metadata_provider_priority_page.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0667b2a5ede6dcefa73aa0623c3c55b1e95310067d6e2535328a139f7ebc349"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/screens/settings/library_settings_page.dart:406-425 | lib/screens/settings/library_settings_page.dart:445-467 \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/screens/settings/library_settings_page.dart"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f00e607028a14a810ebed636a9b9f025a21d2a649c15a42a194f9fbc239582"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): rust_backend/crates/core/src/text.rs:3-20 | rust_backend/crates/extensions/src/host.rs:261-279 | rust_backend/crates/extensions/src/redact.rs:68-87 \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":"rust_backend/crates/core/src/text.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b456c4efa237ee3e0a9dec6c14b9506806a9e2f896b78253d5a6722c93428f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lib/screens/setup_steps.dart:495-522 | lib/screens/tutorial_screen.dart:362-392 \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/screens/setup_steps.dart"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c39b32dfa993c889a17c94eb3d9bd2e181e143c06a59c64620f874b7f385fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/services/ffmpeg_metadata.dart:453-474 | lib/services/ffmpeg_metadata.dart:501-518 \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/services/ffmpeg_metadata.dart"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ae569887e18112387ea73e3a266c809563e7b63e2a2d71e3f9d404d6dfc2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/widgets/selection_action_button.dart:14-37 | lib/widgets/settings_group.dart:954-972 \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/widgets/selection_action_button.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"077085104a898b91c0b8f4e8c75d8a11b66a7191663e859120783dd714f4c499"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): lib/screens/settings/download_settings_page.dart:474-499 | lib/screens/settings/lyrics_settings_page.dart:218-249 | lib/screens/settings/metadata_settings_page.dart:188-219 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 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/screens/settings/download_settings_page.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f52e42a7fb7bb2e2c0dc393cc3014bb03e1d155a73c7e3e2082514c6d6044c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/BackgroundWorkService.kt:47-70 | android/app/src/main/kotlin/com/zarz/mornye/LinkConnectionService.kt:24-44 \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":"android/app/src/main/kotlin/com/zarz/mornye/BackgroundWorkService.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9313366996dc1e2ad11d7d5b5495521196a13ac710a6d3b5ff443c16f999245d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): lib/providers/extension_provider.dart:429-444 | lib/providers/extension_provider.dart:511-528 | lib/providers/extension_provider.dart:530-544 \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/providers/extension_provider.dart"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"a616f89273f3cdc5d46aa5b395e0305109c6bf6ecd4d678536be14a57258ebff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_backend/crates/mobile/src/native_backup/legacy.rs:46-58 | rust_backend/crates/mobile/src/native_backup/legacy.rs:74-91 \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":"rust_backend/crates/mobile/src/native_backup/legacy.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c1e31c402401f14d188708f5c15e64147ca72902410330091e7039437eb92f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/services/media_kit_playback_deck.dart:809-831 | lib/services/music_playback_deck.dart:718-737 \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/services/media_kit_playback_deck.dart"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb82277fbf46f0481692c751e4005fd3e2cf036ef34a6cd5319c43fbfba082a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): rust_backend/crates/extensions/src/download/segment_store.rs:211-224 | rust_backend/crates/extensions/src/download/store.rs:186-199 | rust_backend/crates/extensions/src/files.rs:761-775 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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":"rust_backend/crates/extensions/src/download/segment_store.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f06f743a9383814c9aca1c85f7aca81b6ccb12f384b7d6c2b6019075e98df0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): rust_backend/crates/mobile/src/native_library/path_keys.rs:69-85 | rust_backend/crates/mobile/src/native_listing.rs:167-185 \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":"rust_backend/crates/mobile/src/native_library/path_keys.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdae0e5aeb9264019e1fe9398f8dce9fde77a9ca4ead744c221d5d7331d31d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/providers/music_recognition_provider.dart:130-145 | lib/providers/music_recognition_provider.dart:147-165 \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/providers/music_recognition_provider.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb9967ba80df4fae2ab76787b2f9539276bd557739847aea63ca63537ec87af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/services/download_metadata_embedding.dart:424-455 | lib/services/metadata_persistence_service.dart:263-289 \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/services/download_metadata_embedding.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a276c635949e931e7e38f3798f7b767044c1295c1e3fa98fb7a7dcc881cad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/services/lyrics_translation.dart:692-706 | lib/services/lyrics_translation_sharing.dart:28-44 \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/services/lyrics_translation.dart"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f60e035519b84b151a2533fd5d7d1a5a1d99003737b44c6b36001aafd456da5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/models/unified_library_item.dart:42-62 | lib/models/unified_library_item.dart:64-85 \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/models/unified_library_item.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05d08d6d24d78419714ea296d9dd27198497586c028fff131567cab187e85fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/screens/extension_collection_screens.dart:574-604 | lib/screens/extension_collection_screens.dart:709-737 \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/screens/extension_collection_screens.dart"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6488a6de8c6014a68885d5e3281559706fac223875029a9a000e081c111508"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/widgets/animation_utils.dart:1621-1633 | lib/widgets/animation_utils.dart:1685-1697 \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/widgets/animation_utils.dart"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb13014e45cb54d7a4cafb1bdf74efffd3f2d3e8e6fd86c1e2373e59dcc55ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_backend/crates/core/src/isrc/native_files.rs:79-93 | rust_backend/crates/extensions/src/files/index.rs:77-91 \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":"rust_backend/crates/core/src/isrc/native_files.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed16ed67725fa4569e034e9160394eb48ddeb46485cf4e3ca0aab3e9e3a2f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/services/history_database.dart:119-144 | lib/services/library_database.dart:74-99 \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/services/history_database.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd25e13abf321b04bd2ceb5c0f102f21d0309da57cb5f61254826fccbc5dbe5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt:53-69 | android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt:71-88 | android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt:210-227 \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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81b458e46f589f611af2c83a7731364cb3c9d830348498e85b140babe51d97b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): lib/screens/settings/download_settings_page.dart:426-448 | lib/screens/settings/download_settings_page.dart:450-472 | lib/screens/settings/download_settings_page.dart:501-526 | lib/screens/settings/metadata_settings_page.dart:166-186 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/settings/download_settings_page.dart"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7793d5f13a9a88f4152558d8e127658da3fe84483716e0a903b62b3d253ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/services/apk_downloader.dart:202-216 | lib/services/backup_service.dart:484-493 \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/services/apk_downloader.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f013245e0b3d59ef0fd6a6d1b548bd1ff7f37eb5d0b129ac44d9c991affcf42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/services/link/link_protocol.dart:863-876 | lib/services/link/link_protocol.dart:903-914 \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/services/link/link_protocol.dart"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f47b7474d08b139534bbfcec5ef1762cc4935ab1e4bca14eb9b41d19942c64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/services/history_database.dart:290-306 | lib/services/history_database.dart:308-327 \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/services/history_database.dart"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9392a11fccf13d7f401c3cf937bbe1a00276499f691dbefd176281cc123e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/widgets/audio_info_sheet.dart:305-319 | lib/widgets/metadata_editor_fields.dart:17-29 \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/widgets/audio_info_sheet.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cfed684f127d8e795555145521e179cec44abafa98e2a2d810354eeefbb600"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_backend/crates/core/src/native_palette.rs:426-442 | rust_backend/crates/mobile/src/native_autoplay_taste.rs:15-28 \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":"rust_backend/crates/core/src/native_palette.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"384bb5deb3d847ec8530d0d52cbf39dfef63ce211640a726cdd7c754e4aed5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/screens/settings/log_screen.dart:123-138 | lib/screens/settings/log_screen.dart:200-216 \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/screens/settings/log_screen.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"47525247729117e8c10a2fde48db4f592360104a3c2690da6d74271ec3bd2ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/services/metadata_autofill_service.dart:379-392 | lib/services/metadata_autofill_service.dart:394-411 \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/services/metadata_autofill_service.dart"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ce14d42a6d93293d31c73524ccbef4456730c34e4eb7baea085ca44c041448"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_backend/crates/core/src/filename/template.rs:135-146 | rust_backend/crates/core/src/filename/template.rs:148-158 \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":"rust_backend/crates/core/src/filename/template.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ca0b233adf6bf219c08d31d3a76e14a09fd98b03b65eb6fbb97834a5ebf85d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/models/extension.dart:268-280 | lib/models/extension.dart:289-301 \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/models/extension.dart"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f17f5dd8b297a3c9b54fc5cac3356f6922f9c776cbf61f123aa68031f07086"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_backend/crates/network/src/client.rs:180-195 | rust_backend/crates/network/src/client.rs:199-213 \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":"rust_backend/crates/network/src/client.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"165b5e245624a56276396af478031a75a4e151b94f5da08c887574bb0e17a06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_backend/crates/providers/src/resolver/availability/cache.rs:81-92 | rust_backend/crates/providers/src/resolver/service.rs:69-80 \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":"rust_backend/crates/providers/src/resolver/availability/cache.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbbb4615a5b5d759a05ee51e8fb4f849339a022324cdc96f5b379476bd57166"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/services/backup_service.dart:116-128 | lib/services/platform_bridge/bridge_library_scan.dart:19-32 \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/services/backup_service.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce3c122551a5b6df61af7bcc98ebc57eee7ae3a99ce562dcf73b690290a09d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/services/network_storage_service.dart:434-442 | lib/services/network_storage_service.dart:444-451 \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/services/network_storage_service.dart"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f381e1633f0b865ebd3d342147bebc755aeecd37f07d389fcf9140455d354cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): rust_backend/crates/providers/src/lyrics/service.rs:115-126 | rust_backend/crates/providers/src/lyrics/service.rs:137-147 \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":"rust_backend/crates/providers/src/lyrics/service.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77463165167aac6d34ceb42f82800cf775bb0cfd361f2797d0a4151ee1600d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/providers/local_library_provider.dart:767-785 | lib/services/library_database.dart:682-698 \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/providers/local_library_provider.dart"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcd6531e0d8e1b97098590913d258ab04c4a941c3d8d0abef2206f28805ea19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:357-373 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:375-391 \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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aabead64cccb536d0e404f1613c1594b3ab05d1c8798160578632ede31e96e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/services/history_schema.dart:231-251 | lib/services/library_schema.dart:337-348 \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/services/history_schema.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"50799ef9f29359b4e8436f4571d5e041bb623af6b991a702a25677e972909f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/services/link/desktop/link_player.dart:377-396 | lib/services/link/features/link_phone_player.dart:165-182 \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/services/link/desktop/link_player.dart"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed55a1c592160a46c4b9a96932a202531df4af3f8dc49287c88109a3512798d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt:970-990 | android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerHistory.kt:7-22 \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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25438f44442c22bdd4be970e7eb92d26d496ade827f12f46ba3373de7e4fe46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt:131-143 | android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt:145-157 | android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt:159-172 \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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d0604db9d5c2dee3c7d84d45b529a3a231465e6762ad60a88fc4042712a488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): rust_backend/crates/network/src/url.rs:351-362 | rust_backend/crates/network/src/url.rs:409-423 \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":"rust_backend/crates/network/src/url.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceefed7d7659cd95bdabba01bebdaff53650784f8f55f17ff48434b3834b0d43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/services/platform_bridge.dart:634-646 | lib/services/platform_bridge.dart:2393-2405 \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/services/platform_bridge.dart"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1cac3e9f852630f2438680007343b41a1feeeae64d816e194d7d819cae91f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/models/library_database_models.dart:358-369 | lib/services/history_database.dart:66-77 \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/models/library_database_models.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"67772d5c57489e00655bd48b293bd84aac2adcc6ca27602dbbdb10ab90220606"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/screens/downloaded_album_screen.dart:825-841 | lib/screens/library_mix_screen.dart:212-224 \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/screens/downloaded_album_screen.dart"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"869dde6b3cb48b622544b89944d2f106e2e2f5643aa14e0e630b10bcef3e9734"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/services/app_orientation.dart:86-99 | lib/services/shell_navigation_service.dart:348-359 \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/services/app_orientation.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"328ad145aefde1d409598aa0f837f86dfa32dcc2c10c2d778fe6f3a8af0b5f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): lib/widgets/desktop/desktop_inspector.dart:454-468 | lib/widgets/desktop/desktop_mini_player.dart:93-106 | lib/widgets/desktop/desktop_now_playing.dart:67-82 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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/widgets/desktop/desktop_inspector.dart"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"53226bef8fa8443abf9a47690471cd7093e24e272ea2c1444fae516f18dc4f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): rust_backend/crates/core/src/fs.rs:98-113 | rust_backend/crates/extensions/src/download/store.rs:213-231 \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":"rust_backend/crates/core/src/fs.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c3124d8462f6d78bd32f552c412460bdf406aed0b1e95b39b98b96a3e03e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): rust_backend/crates/extensions/src/download/segment_store.rs:168-182 | rust_backend/crates/extensions/src/download/store.rs:141-156 \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":"rust_backend/crates/extensions/src/download/segment_store.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eb213bacd3b1471261895184df1741e4cbfe5394e1fa8320baf8e22fa15d7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/screens/home_tab.dart:1197-1222 | lib/screens/home_tab.dart:1329-1354 \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/screens/home_tab.dart"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1368fa35da502f31217f07b1b5fd7cf2e679b84ca415c7fe3c3ed75477153f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/services/lastfm/lastfm_service.dart:262-278 | lib/services/lastfm/lastfm_service.dart:430-447 \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/services/lastfm/lastfm_service.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf8e07112f21d2c98aeffd6d4816bd74b88df2e78c6784ff7f683cfe8e09cdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/services/link/desktop/link_desktop_transfers.dart:390-404 | lib/services/link/features/link_phone_receiver.dart:346-363 \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/services/link/desktop/link_desktop_transfers.dart"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"8966f7ba87a52e638caaea06d37330c8840b7c82d5c60399e8f0f7e4064bbfef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/AppCrashReporter.kt:121-129 | android/app/src/main/kotlin/com/zarz/mornye/AppCrashReporter.kt:131-140 \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/zarz/mornye/AppCrashReporter.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e41699702d3acf8eb4228595ef0e9365bbd7e70f4cde3ec4bdac3a2242c3cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/services/notification_service.dart:370-388 | lib/services/notification_service.dart:390-404 \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/services/notification_service.dart"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60e7311ef06611b485ca51e2d7845dce552bde68492289ea932f321b716f2df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): lib/screens/repo/extension_details_screen.dart:573-589 | lib/screens/repo/extension_details_screen.dart:591-607 | lib/screens/repo_tab.dart:636-652 | lib/screens/repo_tab.dart:654-673 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/repo/extension_details_screen.dart"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea248dc5d51d505e6ae24ad1fd64910def7f8d8b5930223ea395075a4853679e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/widgets/nav_destination_icons.dart:16-28 | lib/widgets/nav_destination_icons.dart:102-114 \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/widgets/nav_destination_icons.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"47016b13020733a75a8b47139532598fe9a7a83c7de63e08c2843d4be2f2a247"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/models/extension.dart:489-500 | lib/models/extension.dart:540-554 \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/models/extension.dart"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c9e60c15e70b746b5ee6b984dfe9598f90a960834a64c6a5e9ade53cde2fcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:156-164 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:196-205 \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/zarz/mornye/MainActivitySafCalls.kt"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c85cf9c92fa578ea6f4cc4f6b647ba9d04ffe5485fbe28a7a7ad3a1247bc94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/services/library_database.dart:629-639 | lib/services/library_database.dart:641-651 | lib/services/library_database.dart:666-680 \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/services/library_database.dart"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"838f197e58cd21a91b06f496e9e1f057b838ee65718d84a6517f2bbbc9dc9b77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/screens/downloaded_album_screen.dart:843-851 | lib/screens/local_album_screen.dart:796-804 \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/screens/downloaded_album_screen.dart"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"78792cebc90ed81f7044bae8d5edc2834d14327c1ed5668f1f7e0d1bb70d5519"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/widgets/desktop/desktop_mini_player.dart:115-123 | lib/widgets/desktop/desktop_now_playing.dart:96-106 \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/widgets/desktop/desktop_mini_player.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90bcb659e53ef460868b727e6e038ac3ac55eea0ee6a00d873312ded734ff86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/widgets/track_collection_quick_actions.dart:649-656 | lib/widgets/track_collection_quick_actions.dart:658-667 \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/widgets/track_collection_quick_actions.dart"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d23594b5adf04c2a6ea3326b03a11bbad0e84289f2f98664a1fcfa0733afb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): rust_backend/crates/providers/src/lyrics/service.rs:325-333 | rust_backend/crates/providers/src/resolver/availability/cache.rs:264-273 | rust_backend/crates/providers/src/resolver/service.rs:191-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 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":"rust_backend/crates/providers/src/lyrics/service.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4afb992ea56c904aa5a39b4200d180f3e2235ae7ec66e50d51e7fea907573c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/providers/download_queue_state.dart:56-69 | lib/widgets/pinned_section_sliver_list.dart:50-62 \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/providers/download_queue_state.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4359279e5793148d9bbb13fe6fe0ddee2af232b6b47e264a4d6071f453dd67a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): lib/screens/repo/extension_details_screen.dart:556-571 | lib/screens/settings/files_settings_page.dart:425-440 | lib/screens/settings/files_settings_page.dart:442-457 | lib/screens/settings/library_settings_page.dart:387-404 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/repo/extension_details_screen.dart"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"593d57acd34e69e980c2ea640058b11cd4fe7bbb8252c9b11e83f352a2864828"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/services/platform_bridge.dart:2775-2785 | lib/services/platform_bridge.dart:2809-2820 \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/services/platform_bridge.dart"},"region":{"startLine":2775}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab9c24831f492db4153bcfbcc4382b5025f2c576b054b74dfc450bb68aadb77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/widgets/duplicate_review_sheet.dart:35-45 | lib/widgets/open_on_platform_sheet.dart:19-33 \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/widgets/duplicate_review_sheet.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8668d232c5d0c1fce68d4c5e5b9f6c8bb2cf717e55c1066fecc89c8e96b1a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt:99-111 | android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt:133-144 | android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt:146-157 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ab366d48fc6e81aeb14d3d2eaf639cf8c4e10b42df78b784b575c49659ff75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/services/platform_bridge.dart:2124-2137 | lib/services/platform_bridge.dart:2139-2150 \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/services/platform_bridge.dart"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"372453e4b970169b07f90c7b9cb0c8f3988192d82d218f02cedae0e7db0362a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/widgets/animation_utils.dart:732-742 | lib/widgets/animation_utils.dart:802-812 \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/widgets/animation_utils.dart"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ade110046d4876c12f1b24a9c5d634553c213a6f804f92039d215cbc6723de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/NativeHistoryStore.kt:261-270 | android/app/src/main/kotlin/com/zarz/mornye/NativeHistoryStore.kt:339-349 \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":"android/app/src/main/kotlin/com/zarz/mornye/NativeHistoryStore.kt"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb95eeb567b72cf25e298ffb42f0562da7ed75ff7d7ad2b2d59de34cb4b7eb4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/screens/library_tracks_folder_screen.dart:1127-1134 | lib/screens/library_tracks_folder_screen.dart:1136-1145 \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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fdcc3aae75171e75a4847184687cce6690519cea2f3e8658f59b5b3d8b291a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/screens/now_playing_screen.dart:846-861 | lib/screens/now_playing_screen.dart:867-883 \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/screens/now_playing_screen.dart"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c183d2671989e185f113c018ebf3b9cb11bcc7b85ab5bb18472ad7f51000596"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/services/media_session_art_cache.dart:80-95 | lib/services/media_session_art_cache.dart:97-112 \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/services/media_session_art_cache.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3145af01733e8ce96b605b3fb8ca421197a69ddd2e091c32e103531d1112ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/models/extension.dart:610-618 | lib/models/extension.dart:634-641 \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/models/extension.dart"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b425c8865529f24ce0745aab78048288890baeaf819173ade20cf09f0e14aa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): lib/providers/download_history_provider.dart:439-446 | lib/providers/recent_access_provider.dart:129-140 | lib/services/desktop_library_watcher.dart:95-102 \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/providers/download_history_provider.dart"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a186865d402acae647e744c39b33edb54d79e83acab2b93fa63ddd85aaec7a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/screens/music_recognition_screen.dart:64-76 | lib/screens/settings/lyrics_ai_translation_page.dart:363-376 \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/screens/music_recognition_screen.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb5f0343cba0f6072e2fb42a3994a8bed4abf70d236e49de092bd894c67f063"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): lib/services/library_database.dart:565-579 | lib/services/library_database.dart:581-593 | lib/services/library_database.dart:653-664 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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/services/library_database.dart"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c36f0323022b2fa308ef7e64cfe92a6a10339895c1f4e108c787f589de20ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_backend/crates/providers/src/musicbrainz/http.rs:51-58 | rust_backend/crates/providers/src/recognition.rs:410-417 \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":"rust_backend/crates/providers/src/musicbrainz/http.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbec29ab8186d9a2f9c052b6d1a3c08d6eb4710407cd75af354145b8c679557"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/screens/queue_tab_helpers.dart:141-151 | lib/screens/queue_tab_helpers.dart:153-167 \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/screens/queue_tab_helpers.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"394e9e090cf9c31a6837ba456d3fcf94f18eab7583cb946bbac9e7756b343d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): lib/providers/recent_access_provider.dart:189-205 | lib/providers/recent_access_provider.dart:207-225 | lib/providers/recent_access_provider.dart:227-245 \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/providers/recent_access_provider.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cec1702ecff91266bfa472ef40c10a175fe13aa55ecb140e088020e6356083"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): lib/services/platform_bridge.dart:2735-2746 | lib/services/platform_bridge.dart:2748-2760 | lib/services/platform_bridge.dart:2762-2773 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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/services/platform_bridge.dart"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab88b38a8d12dd3c042e4ad275bc48cdfd681dd5e9c6afa5cf1ab128df2aee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): rust_backend/crates/core/src/tags/file.rs:17-32 | rust_backend/crates/core/src/tags/library.rs:121-134 \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":"rust_backend/crates/core/src/tags/file.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e8a97fccd0c711905304f55d2241a64d235fd7f79eaccb243272d8baf6a684"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:44-51 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:139-146 \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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8dcc73273be8ac992bb140888e6d7d855bf8072aecaa3379b38665a9971480"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/services/app_state_database.dart:117-132 | lib/services/library_collections_database.dart:243-255 \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/services/app_state_database.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e106ab130480e2324547cb73fbc25794b08124a6791e584ff38d974aff3f6bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/services/link/client/link_client_library.dart:97-108 | lib/services/link/desktop/link_phone_library.dart:46-53 \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/services/link/client/link_client_library.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"61068d4424063d437e16b211d21467187077774f0182905a29c0360fc49fa8f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/services/notification_service.dart:623-635 | lib/services/notification_service.dart:676-691 \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/services/notification_service.dart"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cd93a0cf5c30902c04e3a192e71298e29799068b4bc2439a4d8a687e22d5de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/services/link/client/link_client_library.dart:161-169 | lib/services/link/desktop/link_phone_library.dart:110-116 \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/services/link/client/link_client_library.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be48a7613ec0f6dd6378eb90a47c80ab1ac8da5169529cbf7b2623762be4b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): lib/services/platform_bridge.dart:1323-1337 | lib/services/platform_bridge.dart:1339-1355 | lib/services/platform_bridge.dart:1357-1375 | lib/services/platform_bridge.dart:1398-1412 | lib/services/platform_bridge.dart:1475-1491 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/platform_bridge.dart"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd33245c90a81bbf4c635af34afe73a2cc52f89a1f154af081e0a963d55c384e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_backend/crates/core/src/native_palette.rs:446-458 | rust_backend/crates/mobile/src/native_autoplay_taste.rs:34-47 \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":"rust_backend/crates/core/src/native_palette.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0625e6c25e9753d231729e1c3fcc506b055aa359f4d20c7b4cbd55b369fe038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_backend/crates/link/src/auth.rs:77-85 | rust_backend/crates/link/src/catalog/text.rs:54-61 \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":"rust_backend/crates/link/src/auth.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e7245d02a4ff0322bd1f463fbbdca45ad1994703759e70c531783abb8dcc3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): lib/providers/download_history_provider.dart:590-597 | lib/providers/download_history_provider.dart:599-606 | lib/providers/download_history_provider.dart:623-633 \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/providers/download_history_provider.dart"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc7080c9eaab789f0773509b4ad42862f40640f141062649fa36ab2b79fb903"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/providers/library_collections_provider.dart:399-406 | lib/providers/library_collections_provider.dart:408-415 \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/providers/library_collections_provider.dart"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe30e2e6e60465e897affc88aea68e531966e661a8aab9f3cc82c8126d70c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/services/library_collections_database.dart:739-752 | lib/services/app_state_database.dart:643-654 \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/services/library_collections_database.dart"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"b959ac7da9802c666f9fd3fba409a56b1ce823e6b0183f367ef139e35d3931eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): rust_backend/crates/providers/src/lyrics/service.rs:163-168 | rust_backend/crates/providers/src/lyrics/service.rs:170-177 | rust_backend/crates/providers/src/resolver/availability/cache.rs:99-106 | rust_backend/crates/providers/src/resolver/service.rs:82-89 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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":"rust_backend/crates/providers/src/lyrics/service.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"01aaeaf4aaea4b6f358c05fbb6d7dce547dddb3d535fdd0df1bc33a4ae2ae2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/services/history_database.dart:595-607 | lib/services/library_database.dart:1047-1058 \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/services/history_database.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"88abcf0278e853f61e49bf72baad2fbec21a451557678f750e2928dbf5f9c03f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/services/platform_bridge.dart:1297-1309 | lib/services/platform_bridge.dart:1739-1753 \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/services/platform_bridge.dart"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6719d3c3cae3afcde3af271d106fe6755b71bb3dbe5d9b067e4273fb2708eea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/services/network_offline_saver.dart:99-110 | lib/services/network_playback_cache.dart:41-52 \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/services/network_offline_saver.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"812e987f42a860fdcf196f4a8017515b6d0a21c379b107d2eb8136d05d182795"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_backend/crates/core/src/media/mp4.rs:115-124 | rust_backend/crates/core/src/tags/mp4.rs:141-150 \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":"rust_backend/crates/core/src/media/mp4.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c0658fa0115818c35919ab98589c1243bb93c39b62459d3dabb4ffe30313a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/services/audio_analysis_cache.dart:47-54 | lib/services/platform_bridge.dart:1838-1845 \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/services/audio_analysis_cache.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"21902473099283cd2152ffb013d726519a69709232e8348c2983745d17374420"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_backend/crates/extensions/src/repository/model.rs:135-143 | rust_backend/crates/extensions/src/signed_session/store.rs:86-93 \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":"rust_backend/crates/extensions/src/repository/model.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c46198bc6df13a9d498961ea0482803276f15c02b9c2b9f5f281622999fb35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/services/cast_playback_deck.dart:155-164 | lib/services/media_kit_playback_deck.dart:629-638 \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/services/cast_playback_deck.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"702a8cd2321953a924a2f8469833a0f92f5f9f05cc99f228cd354b48ca375b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): rust_backend/crates/extensions/src/backend/metadata.rs:189-196 | rust_backend/crates/providers/src/resolver/availability/cache.rs:149-156 \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":"rust_backend/crates/extensions/src/backend/metadata.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb00558bca5f2fa4e3cc91e53f5ffaead33510b5b35a95cb6b46e41ca473ab41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/screens/album_screen.dart:115-123 | lib/screens/artist_screen.dart:205-213 \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/screens/album_screen.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e965f23e0f3cb6222c8e6d8ac858168c8398eea0e664ee1cede137eba35686"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/DsdSource.kt:50-55 | android/app/src/main/kotlin/com/zarz/mornye/DsdFile.kt:127-132 \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":"android/app/src/main/kotlin/com/zarz/mornye/DsdSource.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f970663b5be395b30e6bb873bb54e7e684f5527b45a87a239e710ae788b106e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/screens/library_tracks_folder_screen.dart:574-582 | lib/screens/main_shell.dart:371-377 \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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fd3d1ad4df0f09c83226e2f7562ebc9acfbb06282eb7cfda57811c8816cab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): lib/services/link/client/link_client_controller.dart:300-304 | lib/services/link/client/link_client_store.dart:25-29 | lib/services/network_storage_service.dart:407-411 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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/services/link/client/link_client_controller.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b12a44f33c95ecdec800ffc5abbbdece051f191adc1ab4f06d29aa77c90bee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): rust_backend/crates/core/src/lyrics/lrc.rs:112-119 | rust_backend/crates/core/src/metadata/deezer/catalog.rs:25-33 | rust_backend/crates/providers/src/lyrics/builtin.rs:180-187 \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":"rust_backend/crates/core/src/lyrics/lrc.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b8d99b1254f1eb31e268c98f40aa6ea4ddc23eedaa0e2744ada00af34291ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/screens/album_screen.dart:431-442 | lib/screens/library_mix_screen.dart:127-137 | lib/screens/playlist_screen.dart:249-259 \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/screens/album_screen.dart"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b9c172358816db124bcd7a922f6c50041362f43dc93433833672ef9b64be1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): rust_backend/crates/mobile/src/network_tags.rs:270-275 | rust_backend/crates/providers/src/lyrics/builtin/ttml.rs:29-32 \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":"rust_backend/crates/mobile/src/network_tags.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a5c8eaf8599f05edbbea9ed3a528122b0b779989dd3ecde037eef8ae59d28a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): lib/screens/downloaded_album_screen.dart:179-189 | lib/screens/home_tab.dart:1571-1580 | lib/screens/queue_tab.dart:464-473 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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/screens/downloaded_album_screen.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"55be19161f30295d1b70e9e130483f57df4511183d1f87a23aead298667aa34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/services/link/client/link_client_library.dart:39-49 | lib/services/link/desktop/link_phone_library.dart:30-36 \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/services/link/client/link_client_library.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0f8a5804d2f29f5eda2b470a72c1b575d929cce6857002a44246a6877e1fb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/screens/settings/library_settings_page.dart:350-361 | lib/screens/settings/lyrics_settings_page.dart:193-202 \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/screens/settings/library_settings_page.dart"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e38c2de5332bf155ee57736ef4f013728d7f18263f83b997cfe66a7d5e120f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_backend/crates/link/src/files.rs:212-218 | rust_backend/crates/link/src/subsonic/browse.rs:356-363 \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":"rust_backend/crates/link/src/files.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"467c3d3cd5d9b858438cb488321eec348063704a9cb1f7d815bd652c38fd067c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/services/exclusive_output_deck.dart:78-85 | lib/services/media_kit_playback_deck.dart:534-541 \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/services/exclusive_output_deck.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc2484396f05764a257703260a3d30a45fa4493f0f7ecc10cdf96e3c6d44799"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rust_backend/crates/extensions/src/backend.rs:61-65 | rust_backend/crates/extensions/src/manager.rs:94-98 \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":"rust_backend/crates/extensions/src/backend.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"505170807c4eeae9e106277f77ac1c8fcefccffc3291bc3296783b028a0510ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_backend/crates/mobile/src/native_backup.rs:131-137 | rust_backend/crates/mobile/src/native_library.rs:168-174 \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":"rust_backend/crates/mobile/src/native_backup.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cb296c08471557dd307902eadc48164f5542184c0a12fc381c75a14747b63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_backend/crates/mobile/src/manager.rs:274-284 | rust_backend/crates/mobile/src/metadata.rs:30-39 \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":"rust_backend/crates/mobile/src/manager.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f263b97a0afd82529a5c385173e813ebc98ba89d4304129e8d23ffc54d894b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): rust_backend/crates/mobile/src/manager.rs:293-303 | rust_backend/crates/mobile/src/metadata.rs:47-56 \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":"rust_backend/crates/mobile/src/manager.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b9d2c2cc3c91f90cd18a80e095009aaaf51a46292439a336a85a2f86f74e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/screens/album_screen.dart:877-889 | lib/screens/playlist_screen.dart:541-556 \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/screens/album_screen.dart"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cac9d1b335dbe3c9df91d2e5073e9f6d0d27df0cd06dfff75287dfc7e99435e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/services/media_kit_playback_deck.dart:613-620 | lib/services/music_playback_deck.dart:354-361 \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/services/media_kit_playback_deck.dart"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4df575ec2bc27093aad12165e47e6a231060e4ca2e7b9f15061688456a1f66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): rust_backend/crates/link/src/catalog/parse.rs:110-116 | rust_backend/crates/link/src/subsonic/forward.rs:454-460 \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":"rust_backend/crates/link/src/catalog/parse.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a82def92c1201a6c26b7a5c7f50a2299b4f174ccd1cc3c524cd6354d2757c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/services/media_session_mpris.dart:246-253 | lib/services/media_session_smtc.dart:263-269 \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/services/media_session_mpris.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4845aae53bf4a12ea75f762b252990c4abec7e576788d159d22594888c4c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/widgets/library_directory_view.dart:133-140 | lib/widgets/library_search_results.dart:161-168 \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/widgets/library_directory_view.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c5bf86d2c62801f5c65be231280bb707c5e93eab22b98714efec387806a0ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/providers/recent_access_provider.dart:39-47 | lib/services/weekly_releases.dart:24-31 \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/providers/recent_access_provider.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d57f71e97c4a9c8e1c5a42d98bd24f23dfaf1b03a72ac5a83767928a329cbba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/services/history_database.dart:609-613 | lib/services/library_database.dart:1060-1066 \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/services/history_database.dart"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3f8a06e0c8f5c9e59a66bd109ebbd98a30a8ac27c80d7249eda79fdb103f38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/services/link/features/link_desktop_remote.dart:347-349 | lib/services/link/link_mirrored_playback.dart:616-619 \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/services/link/features/link_desktop_remote.dart"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f23f603fc977a0508ebda2242f107af9716c6bc0fd1cabae6300ad27b82d4c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/services/link/features/link_phone_library_sync.dart:329-336 | lib/services/link/features/link_phone_session.dart:87-96 \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/services/link/features/link_phone_library_sync.dart"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccefbc5ed4d699646c2628cc4a3ee61fa288c3d8ca460e60d37bd7702579b62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust_backend/crates/desktop/src/call.rs:112-117 | rust_backend/crates/link/src/types.rs:144-150 \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":"rust_backend/crates/desktop/src/call.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c3f30bcd2503fcd5498491caf4196688bce20e2a864e64324e8735e32b7ece"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust_backend/crates/extensions/src/backend.rs:290-295 | rust_backend/crates/extensions/src/repository.rs:171-176 \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":"rust_backend/crates/extensions/src/backend.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59d2499dd93dc2c353dcaf78be86c648cb34cf61b3fb0a2830c4176b546f1ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust_backend/crates/extensions/src/backend/metadata.rs:33-38 | rust_backend/crates/providers/src/deezer.rs:232-237 \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":"rust_backend/crates/extensions/src/backend/metadata.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4c5dcaa89cd2b7882e5db80228e473e7f3efdf58ea6a120dd6c5431b73f7ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): rust_backend/crates/link/src/types.rs:154-159 | rust_backend/crates/mobile/src/native_lyrics_translation.rs:27-32 \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":"rust_backend/crates/link/src/types.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"26aba2e34c85a4690a374874523f576963969e70d9f41d33c713e6f0486a8641"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/services/music_player_service.dart:2456-2460 | lib/services/remote_media_session.dart:143-147 \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/services/music_player_service.dart"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae41acb9917ee8b66a5da8e4b156d7f736b4fbf55719f121cc4471e3ad4854a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): lib/widgets/desktop/desktop_mini_player.dart:286-291 | lib/widgets/player_lyrics.dart:132-138 | lib/widgets/player_lyrics_word_sweep.dart:87-93 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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/widgets/desktop/desktop_mini_player.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07df048a629ef6d3816212c0ab651a5b571b16100c6b5a258bf6a7c3cf7412b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): rust_backend/crates/mobile/src/native_backup.rs:59-64 | rust_backend/crates/mobile/src/native_cache/unix.rs:81-86 | rust_backend/crates/mobile/src/native_collections.rs:39-44 | rust_backend/crates/mobile/src/native_library.rs:56-61 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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":"rust_backend/crates/mobile/src/native_backup.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a693603ba825c662ca33b9d43172766520198e233150d2b99517512064917be5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt:528-531 | android/app/src/main/kotlin/com/zarz/mornye/NativeHistoryStore.kt:454-457 \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":"android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fdab0514672607b0a4b95272a6fe51967582839236cd39b87ce6fa2011adaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/screens/equalizer_widgets.dart:807-810 | lib/widgets/desktop/link_text_input_dialog.dart:63-66 \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/screens/equalizer_widgets.dart"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fffc5247b9037a4ed9fed50880b11952d50f18ae180f1bcab6d03846ed3b6ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/services/link/link_client_api.dart:27-33 | lib/services/link/link_protocol.dart:854-861 \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/services/link/link_client_api.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cfc1f8c94acf6505e1daab4a685962ff4c65db07ebd0b07eb3704b51dc26ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): rust_backend/crates/link/src/subsonic/forward.rs:363-366 | rust_backend/crates/link/src/subsonic/objects.rs:157-160 \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":"rust_backend/crates/link/src/subsonic/forward.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ce417b4cf1def33bd8283242bb66bc92609c8da1f8e7e70299a28f05a03056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/screens/library_mix_screen.dart:112-115 | lib/widgets/library_directory_view.dart:109-112 \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/screens/library_mix_screen.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acd033291fd8a242b2eb6c2e5ccc30f86d30ebb9f0fbfcbd07f3a2bd08e372e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/widgets/desktop/desktop_mini_player.dart:316-321 | lib/widgets/player_lyrics_word_sweep.dart:132-138 \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/widgets/desktop/desktop_mini_player.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0710ce7dbe5c7b697d77c2eb3b3e8c597bd7519f74d972cbb059d6f5a0b78c0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/widgets/expressive_seek_track.dart:51-55 | lib/widgets/now_playing_indicator.dart:68-72 \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/widgets/expressive_seek_track.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d453040c220420a42af563c0f3cbae1f61de9b3858843c5ad5fdf0c791423485"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): rust_backend/crates/extensions/src/backend/lyrics.rs:35-47 | rust_backend/crates/extensions/src/backend/tags.rs:22-37 \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":"rust_backend/crates/extensions/src/backend/lyrics.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d970464f38e5084517c0937143d77c6706e5a25cc6deddbde9fe365a316e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/services/autoplay_taste.dart:646-671 | lib/services/listening_statistics.dart:302-317 \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/services/autoplay_taste.dart"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a2d18d49dc694e1c7b4637f5ec70ae43f1c01c8bf486f902c1996a5c7ac080"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/services/cover_store.dart:42-44 | lib/services/link/sync/link_history_artwork.dart:49-51 \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/services/cover_store.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78d741693e7ff824cdcbf019ae796a0421c479c0586bfb3e26b337f56adee68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/services/media_kit_playback_deck.dart:498-501 | lib/services/network_playback_cache.dart:312-315 \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/services/media_kit_playback_deck.dart"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5badec309f6f7832961032742f116bbe2d13eea09f9412bf2462c3e22700af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/theme/player_artwork_theme.dart:82-86 | lib/widgets/material_player_backdrop.dart:261-265 \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/theme/player_artwork_theme.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ce6d86ac75b9a3c49dd1b78544a1b0c4f56b6c47462e14ae30af73816a5236"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rust_backend/crates/mobile/src/lyrics.rs:45-49 | rust_backend/crates/mobile/src/metadata.rs:96-100 \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":"rust_backend/crates/mobile/src/lyrics.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f55331df665e28d2f5c89aadfef981f7987a49689aa7cc9614e7ec082b598af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): rust_backend/crates/mobile/src/lyrics.rs:94-98 | rust_backend/crates/mobile/src/metadata.rs:149-153 \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":"rust_backend/crates/mobile/src/lyrics.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc843f1e8de5d731ee1eb2aa04277e22431571c53a1e49426c71598590a08ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): lib/services/library_queue_store.dart:521-586 | lib/services/library_queue_store.dart:735-770 \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/services/library_queue_store.dart:521\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. 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/services/library_queue_store.dart"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b9626574f11e4a6fc092d519ca5baeeccb86eb60a62b80e2653f9ac3f6e925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): lib/widgets/network_offline_actions.dart:244-268 | lib/widgets/network_upload_actions.dart:169-193 \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/widgets/network_offline_actions.dart:244\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/widgets/network_offline_actions.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99c15199e6d181d1e22e97a86ffcb21e44047ef479c937ecaf16339b05962c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): lib/providers/download_history_provider.dart:694-716 | lib/providers/download_history_provider.dart:777-800 \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/providers/download_history_provider.dart:694\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/providers/download_history_provider.dart"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bae0dd02dfda9f3e29d02dc502d7263aa9e44f4eee35b96bd334424efa3dca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): lib/screens/home_tab.dart:641-662 | lib/screens/main_shell.dart:409-430 \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/screens/home_tab.dart:641\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/screens/home_tab.dart"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"24db1f25986502ed6e4ef4551ab02b24fa4dc3704ac8aede30e4ce85215df3b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): lib/screens/network_storage_screen.dart:1146-1167 | lib/screens/settings/link_settings_page.dart:434-455 \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/screens/network_storage_screen.dart"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e12b752fd6cf3ea26a49403daf62bfa7087994c757d1fe6bb5e4d38ff47f35b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): lib/services/link/client/link_client_library.dart:138-159 | lib/services/link/desktop/link_phone_library.dart:87-108 \u2014 before extracting anything, compare \u0060lib/services/link/client/link_client_library.dart\u0060 and \u0060lib/services/link/desktop/link_phone_library.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 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/services/link/client/link_client_library.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32800b6c13eac4aa5758f404f2b23ebc7423df3a0dae13cee46e2fc304b3b86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/screens/track_metadata_screen.dart:613-633 | lib/screens/track_metadata_screen.dart:637-657 \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/screens/track_metadata_screen.dart:613\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/screens/track_metadata_screen.dart"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"686f0bcbf92e4c23522b5a16a75a2f804845375030c1e4dae14cf239f1c30568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/screens/downloaded_album_screen.dart:392-411 | lib/screens/local_album_screen.dart:377-396 \u2014 before extracting anything, compare \u0060lib/screens/downloaded_album_screen.dart\u0060 and \u0060lib/screens/local_album_screen.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/screens/downloaded_album_screen.dart:392\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/screens/downloaded_album_screen.dart"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0977bb76f888c6d908a05b7b0638a41a05b713594d6d1237fb534ffcb90185b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/screens/artist_screen_discography.dart:514-532 | lib/widgets/batch_progress_dialog.dart:169-187 \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/screens/artist_screen_discography.dart:514\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/screens/artist_screen_discography.dart"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2652bf4772ac1db01ac99bc1d2f06e0c01ef9ec9350bd8e4745026f7348f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/screens/home_tab_search_wide.dart:586-604 | lib/screens/home_tab_search_wide.dart:863-881 \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/screens/home_tab_search_wide.dart"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaa7babb24ef04d69fb552efc66cf310d84c63c99c5b9a2908e9bead2aab031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): lib/services/link/client/link_client_library.dart:117-132 | lib/services/link/desktop/link_phone_library.dart:62-80 \u2014 before extracting anything, compare \u0060lib/services/link/client/link_client_library.dart\u0060 and \u0060lib/services/link/desktop/link_phone_library.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 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/services/link/client/link_client_library.dart:117\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/services/link/client/link_client_library.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0416c3508cf36bbe2e5166ad7c868a2c7c51dd09018b13cdf4a1e245eb4bb6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201319 lines \u00D7 2): lib/widgets/mornye_selection_pill.dart:246-264 | lib/widgets/mornye_selection_pill.dart:416-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/widgets/mornye_selection_pill.dart:246\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/widgets/mornye_selection_pill.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd094ea44ecd6f2bd263fa8035ead6ed50a00c2c7b53c34f732bee89864d8c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/screens/artist_screen_discography.dart:478-495 | lib/widgets/batch_progress_dialog.dart:122-139 \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/screens/artist_screen_discography.dart:478\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/screens/artist_screen_discography.dart"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd8f28e55a2c9dd07baa70e1cdee7c45bdcd8a75f6e5113929c74dd71a51ffc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/screens/downloaded_album_screen.dart:855-872 | lib/screens/local_album_screen.dart:808-825 \u2014 before extracting anything, compare \u0060lib/screens/downloaded_album_screen.dart\u0060 and \u0060lib/screens/local_album_screen.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/screens/downloaded_album_screen.dart:855\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060tracks\u0060 to \u0060List\u003CDownloadHistoryItem\u003E\u0060 in one and \u0060List\u003CLocalLibraryItem\u003E\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/screens/local_album_screen.dart:826\u0060 calls \u0060_selectedFlacEligibleItems\u0060, \u0060_queueSelectedAsFlac\u0060 and \u0060lib/screens/downloaded_album_screen.dart:873\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/screens/downloaded_album_screen.dart"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbe940eab848a6d667e44988a4d133f52d4abdfab81e72dcbf36351ac48d2a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/widgets/settings_group.dart:553-570 | lib/widgets/settings_group.dart:676-693 \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/widgets/settings_group.dart:553\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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/settings_group.dart"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7907ab86a9c9f8cc5930e76963285536661e8df27108a69ecf42bfcf1c12575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): lib/screens/downloaded_album_screen.dart:872-888 | lib/screens/local_album_screen.dart:828-843 \u2014 before extracting anything, compare \u0060lib/screens/downloaded_album_screen.dart\u0060 and \u0060lib/screens/local_album_screen.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/screens/downloaded_album_screen.dart:872\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060tracks\u0060 to \u0060List\u003CDownloadHistoryItem\u003E\u0060 in one and \u0060List\u003CLocalLibraryItem\u003E\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/screens/local_album_screen.dart:826\u0060 calls \u0060_selectedFlacEligibleItems\u0060, \u0060_queueSelectedAsFlac\u0060, \u0060_reEnrichSelected\u0060 and \u0060lib/screens/downloaded_album_screen.dart:872\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/screens/downloaded_album_screen.dart"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f81dee2c322b416a25626364d64cbd14d6a882d5829c9cc892b6b842909015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/screens/home_tab_intro.dart:1235-1251 | lib/screens/home_tab_intro.dart:1283-1299 \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/screens/home_tab_intro.dart:1235\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/screens/home_tab_intro.dart"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0557215ba309c47f84fefee015327ecc8557596bbd6fc41d111967eff8754bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/theme/app_theme.dart:68-84 | lib/theme/app_theme.dart:119-135 \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/theme/app_theme.dart:68\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/theme/app_theme.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3192e516b0a73f2d2b5efc027e7d232c69025d1e5de8aea6a1bb0da3cc62d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): lib/screens/downloaded_album_screen.dart:426-441 | lib/screens/library_mix_screen.dart:286-301 | lib/screens/local_album_screen.dart:428-443 \u2014 before extracting anything, compare \u0060lib/screens/downloaded_album_screen.dart\u0060 and \u0060lib/screens/local_album_screen.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/screens/downloaded_album_screen.dart:426\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/screens/downloaded_album_screen.dart"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b185bf8d1edc8ec7bf81eacb7b105dce9ab2652c6897c1aec4307da3e681294c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/screens/home_tab_search_wide.dart:507-522 | lib/screens/home_tab_search_wide.dart:648-663 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/screens/home_tab_search_wide.dart:666\u0060 calls \u0060circular\u0060 and \u0060lib/screens/home_tab_search_wide.dart:523\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/screens/home_tab_search_wide.dart"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f465bd271f07884af0242875cf353bc1aa7cd46e34c1168bfe6c93aff84f7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/screens/settings/about_page.dart:445-460 | lib/screens/settings/about_page.dart:682-697 \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/screens/settings/about_page.dart:445\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/screens/settings/about_page.dart:698\u0060 calls \u0060SettingsSearchTarget\u0060 and \u0060lib/screens/settings/about_page.dart:461\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/screens/settings/about_page.dart"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fb5765c6f438e873129d7d9e8a6db6977eedcd404316c6dc1cdc17fe11ddca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/services/link/link_protocol.dart:253-268 | lib/services/link/link_protocol.dart:662-677 \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/services/link/link_protocol.dart"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2e17b1430eea5cedf8fd2da345f0eee61fc385e80270ada9cad8f251ef5013"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): lib/widgets/mornye_player_queue.dart:247-260 | lib/widgets/player_queue_sheet.dart:190-205 \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/widgets/mornye_player_queue.dart:247\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/widgets/mornye_player_queue.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfcd9eb7a739b7c5b4a77342ff44eb35998baed8a0051d10bf5b6194186fcaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/screens/album_screen.dart:719-733 | lib/screens/playlist_screen.dart:462-476 \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/screens/album_screen.dart:719\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/screens/album_screen.dart"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bae44770fdaa1df0e312c7b25b08412a58504a9d56c55a2d23aa96fc6ffe86c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/widgets/desktop/desktop_mini_player.dart:126-140 | lib/widgets/desktop/desktop_now_playing.dart:109-122 \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/widgets/desktop/desktop_mini_player.dart:126\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/widgets/desktop/desktop_mini_player.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5886019ef914678ed0774b37b70ecce6965569e165bb9b826eeec1adbb92568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/widgets/settings_group.dart:490-503 | lib/widgets/settings_group.dart:625-639 \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/widgets/settings_group.dart:490\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/widgets/settings_group.dart"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb9f3b42af8ef00a1ee3f4b3e22a1541ccc94ac7490aff2a7a049bfc91993f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): lib/screens/extension_collection_screens.dart:461-474 | lib/screens/extension_collection_screens.dart:640-653 | lib/screens/extension_collection_screens.dart:779-792 \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/screens/extension_collection_screens.dart:461\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/screens/extension_collection_screens.dart"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda8cf5db1da28800e4fa560adcdc127deaf296eecd96982b1af13c60536a789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/providers/download_queue_provider_single_item.dart:1216-1228 | lib/providers/download_queue_provider_single_item.dart:1357-1370 \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/providers/download_queue_provider_single_item.dart:1216\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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8650bf3746cec2958c2d1ec0796a6cc50fc2862556072b00b0a35009c912fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/screens/album_screen.dart:550-563 | lib/screens/downloaded_album_screen.dart:387-400 \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/screens/album_screen.dart:550\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 after the matched lines, \u0060lib/screens/album_screen.dart:566\u0060 calls \u0060MotionHeaderBanner\u0060, \u0060headerBgImage\u0060 and \u0060lib/screens/downloaded_album_screen.dart:402\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/screens/album_screen.dart"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"713d5502dcc5d02e668e9a2150c0dcf8d82e63209795b35c9fa7aa34bb44e386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/screens/network_storage_screen.dart:96-109 | lib/screens/network_storage_screen.dart:119-132 \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/screens/network_storage_screen.dart:96\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/screens/network_storage_screen.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cd3f392bc1d7f2baf835752be991ed10073d98db410e332238b5504f656521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/screens/playlist_reorder_page.dart:120-133 | lib/widgets/collection_reorder_sliver.dart:92-105 \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/screens/playlist_reorder_page.dart:120\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/screens/playlist_reorder_page.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5387f01be0c8ccaa0f087fa56461808a76aaf15995ca4d2183f0f51123539a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/screens/repo_tab.dart:226-239 | lib/screens/repo_tab.dart:246-258 \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/screens/repo_tab.dart:226\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/screens/repo_tab.dart"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c1675e13061060dc8eb50779cc29abae24a7973d29c84e9233182de4d41dc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/screens/settings/about_page.dart:267-280 | lib/screens/settings/about_page.dart:533-545 \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/screens/settings/about_page.dart:267\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/screens/settings/about_page.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acf489e1756f32933ff6094c59bedcb653ef02777b8c2066ac0969530301813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/services/autoplay_ranker.dart:357-370 | lib/services/autoplay_taste.dart:708-721 \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/services/autoplay_ranker.dart:357\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/services/autoplay_ranker.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c863946f0f1caef244925e6887bed7a8a4afa848c4385545f60c972a00602a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/services/link/sync/link_sync_handlers.dart:218-231 | lib/services/link/sync/link_sync_handlers.dart:245-258 \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/services/link/sync/link_sync_handlers.dart:218\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/services/link/sync/link_sync_handlers.dart"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"51418ae8ad2f66a12941336be640f3eb712eaaec162abce23d9f2596b704ad29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/widgets/library_directory_view.dart:172-184 | lib/widgets/library_search_results.dart:207-220 \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/widgets/library_directory_view.dart:172\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/widgets/library_directory_view.dart:171\u0060 calls \u0060_reEnrich\u0060, \u0060showBatchConvertSheet\u0060 and \u0060lib/widgets/library_search_results.dart:207\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/widgets/library_directory_view.dart"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf41405389f6b026b4f7bb1e38311d4eb6ca380db6372f34ae20ab33fc4812a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/widgets/selection_action_button.dart:24-37 | lib/widgets/settings_group.dart:959-972 \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/widgets/selection_action_button.dart:24\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/widgets/selection_action_button.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d4bd45f062fb959180af665ecd103fcee2d9a82539a44a65724fef52b83747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/providers/network_offline_provider.dart:151-163 | lib/providers/network_upload_provider.dart:71-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/providers/network_offline_provider.dart:151\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/providers/network_offline_provider.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"32469b7e0938dbe26a9fcd7c9cce70d0c4b3fe9c0a10bc40d4141650f9145181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/screens/settings/lyrics_ai_translation_page.dart:532-544 | lib/screens/settings/lyrics_ai_translation_page.dart:653-667 \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/screens/settings/lyrics_ai_translation_page.dart:532\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/screens/settings/lyrics_ai_translation_page.dart"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2440ad4bcf85ed84b831fa2a7cff0b5bf04adfa90609b6227f94df4c1fa8b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/screens/home_tab_intro.dart:1217-1228 | lib/screens/home_tab_intro.dart:1264-1275 \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/screens/home_tab_intro.dart:1217\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/screens/home_tab_intro.dart"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd11be69266871f33bfa87a36f0623d469e4cd20e2bb5cccb85a9648e319e790"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/screens/settings/library_settings_page.dart:272-283 | lib/screens/settings/library_settings_page.dart:314-325 \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/screens/settings/library_settings_page.dart:272\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/screens/settings/library_settings_page.dart"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"aded9e16d8a1182f33e787e99210bfd0ccd13554ade84a5ebafbd5880fdc670a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/services/link/desktop/link_catalog_exporter.dart:373-384 | lib/services/link/features/link_phone_library.dart:406-418 \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/services/link/desktop/link_catalog_exporter.dart:373\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/services/link/desktop/link_catalog_exporter.dart"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"953eb4be5860ffa63f5c8b08267da3fef57d9d3e96f169f9996295ce122295e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): lib/services/music_haptics.dart:238-245 | lib/services/song_feature_analyzer.dart:53-64 \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/services/music_haptics.dart:238\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/services/music_haptics.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7394e4c35a964dc09cd4f98da30ad93a4e47cb3a89078e52f25c8d9f709ad08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/widgets/animation_utils.dart:926-937 | lib/widgets/animation_utils.dart:1004-1015 \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/widgets/animation_utils.dart:926\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/widgets/animation_utils.dart"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb5bba4b0f3b410cab90f0935de1790194fa8709152751342a8633c8444bcd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/widgets/lyrics_size_setting.dart:27-38 | lib/widgets/lyrics_size_setting.dart:101-112 \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/widgets/lyrics_size_setting.dart:27\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/widgets/lyrics_size_setting.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1720b39fc28a0f04fdce8f1163ec8feef5fe8ff47675e6f4ef9a577073982cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): lib/screens/home_tab_intro.dart:1051-1061 | lib/screens/home_tab_intro.dart:1215-1225 | lib/screens/home_tab_intro.dart:1262-1272 \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/screens/home_tab_intro.dart:1051\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/screens/home_tab_intro.dart"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"655e37385cbc8528eb55227b257b11147e8f92c6fcb941a974c8c1b231b48ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/services/ffmpeg_support.dart:35-45 | lib/services/ffmpeg_support.dart:73-83 \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/services/ffmpeg_support.dart:35\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/services/ffmpeg_support.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d485f9b4dd431e65ac51977a6d4e4b8b7586ab1b607b1629a44db60b55ba54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): lib/services/lyrics_translation.dart:695-704 | lib/services/lyrics_translation_sharing.dart:32-42 \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/services/lyrics_translation.dart"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39d0165901a638507122c7699ce1dea88d527ce2edf34edc0d098e30b5f122d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): lib/providers/extension_provider.dart:436-444 | lib/providers/extension_provider.dart:519-528 | lib/providers/extension_provider.dart:536-544 \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/providers/extension_provider.dart:436\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/providers/extension_provider.dart"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"832c03d091d30ad644c09f320c8a8f43d5bd2277868b3cc5db08326b1d6a7636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): lib/screens/settings/library_settings_page.dart:273-283 | lib/screens/settings/library_settings_page.dart:315-325 | lib/widgets/mornye_player_favorite_button.dart:44-53 \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/screens/settings/library_settings_page.dart:273\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/screens/settings/library_settings_page.dart"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c44e0e7491e779bd9396f4d5d351094563fbb6c4db8e6b573ed76d6c855180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/providers/track_provider.dart:412-421 | lib/providers/track_provider.dart:478-488 \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/providers/track_provider.dart:412\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/providers/track_provider.dart"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bb2a3c5790c824bfe45921a9924b03d89ab7956fd4efce8c368d7e75cb3d22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/screens/album_screen.dart:412-421 | lib/screens/artist_screen.dart:570-579 \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 after the matched lines, \u0060lib/screens/artist_screen.dart:580\u0060 calls \u0060toString\u0060 and \u0060lib/screens/album_screen.dart:422\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/screens/album_screen.dart"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"314b41de6f823078e7d8d16fbefbe0035c34ca7b5df7ee00a413530e252541c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/screens/artist_concerts_screen.dart:66-75 | lib/screens/concert_detail_screen.dart:175-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/artist_concerts_screen.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36e8627017780746dc2d5ebf7f1d7195b97655a9c622fc9aa224c97ee2599e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/screens/downloaded_album_screen.dart:291-300 | lib/screens/local_album_screen.dart:335-344 \u2014 before extracting anything, compare \u0060lib/screens/downloaded_album_screen.dart\u0060 and \u0060lib/screens/local_album_screen.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/screens/downloaded_album_screen.dart:291\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/screens/downloaded_album_screen.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a7216103dcc18969f6ee198a9bf2262e0a8084c204191e1397f5d972c18624"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/screens/settings/app_settings_page.dart:150-159 | lib/screens/settings/app_settings_page.dart:184-193 \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/screens/settings/app_settings_page.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/screens/settings/app_settings_page.dart:160\u0060 calls \u0060read\u0060, \u0060setSaveDownloadHistory\u0060 and \u0060lib/screens/settings/app_settings_page.dart:194\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/screens/settings/app_settings_page.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3148f1c285509901428984d0e14a6cdde0512476d85591121fc081559fe911f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/screens/settings/lyrics_provider_priority_page.dart:315-324 | lib/widgets/reorderable_priority_item.dart:24-33 \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/screens/settings/lyrics_provider_priority_page.dart:315\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/screens/settings/lyrics_provider_priority_page.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"7465907a8953efd61af3021e02688a3f0b657347c90c038d4de58c541cd3bd85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lib/services/app_orientation.dart:86-94 | lib/services/shell_navigation_service.dart:348-357 \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/services/app_orientation.dart:86\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/services/app_orientation.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7883eacc4c6cd62a7f71edfa9990619165bc693acbd267cf1e53bd7b00b35f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lib/services/library_collections_database.dart:304-312 | lib/services/library_collections_database.dart:317-326 \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/services/library_collections_database.dart:304\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/services/library_collections_database.dart"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1077ddd04187ee60d9b0e99ccfd331a11fd7b909091254a8b03f980cd468ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/services/library_queue_store.dart:670-679 | lib/services/library_queue_store.dart:735-744 \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/services/library_queue_store.dart:670\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/services/library_queue_store.dart"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9d5243a0f22eb22f2a602434f3c1ce4e424d4bb8df0a4c1f57b367f82474d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lib/services/library_queue_store.dart:1225-1234 | lib/services/library_queue_store.dart:1243-1251 \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/services/library_queue_store.dart"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1916e0a0d8207a75fe1f2fd52c8c87942753bfcf79a77a826707a7bf2c324ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lib/services/music_player_service.dart:2015-2023 | lib/services/music_player_service.dart:2064-2073 \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/services/music_player_service.dart:2015\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/services/music_player_service.dart"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c920da3721354ce8ba72d15f53cbf98d9af9f1a645a8ac10f84bee725779a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/theme/app_theme.dart:57-66 | lib/theme/app_theme.dart:108-117 \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/theme/app_theme.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bbeaf99fe7b214d1b53957ebff3dd940890f31a8b361c0f34e1fe91491af77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/widgets/metadata_editor_fields.dart:189-198 | lib/widgets/metadata_text_field.dart:54-63 \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/widgets/metadata_editor_fields.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/widgets/metadata_editor_fields.dart:188\u0060 calls \u0060circular\u0060 and \u0060lib/widgets/metadata_text_field.dart:53\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/widgets/metadata_editor_fields.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d168744bbd44c386d33df698e44dac1af3c4fe10286258ecbf734cbb8afe011a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lib/widgets/audio_analysis_info_card.dart:14-22 | lib/widgets/audio_analysis_widget.dart:474-482 | lib/widgets/audio_analysis_widget.dart:518-526 \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/widgets/audio_analysis_info_card.dart:14\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/widgets/audio_analysis_widget.dart:527\u0060 calls \u0060Center\u0060 and \u0060lib/widgets/audio_analysis_info_card.dart:23\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/widgets/audio_analysis_info_card.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e178854f7bb312ae87074fbea902fc498685d6618d5f888ecdcd62de7c7b153d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/screens/home_tab_search_wide.dart:844-852 | lib/screens/home_tab_widgets.dart:469-477 \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/screens/home_tab_search_wide.dart:844\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/screens/home_tab_search_wide.dart"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"809264f22e9a6cf12e83d0962696f1a5887e192549d17bf8d2f69b0700dd3c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/screens/library_mix_screen.dart:216-224 | lib/screens/local_album_screen.dart:785-793 \u2014 before extracting anything, compare \u0060lib/screens/library_mix_screen.dart\u0060 and \u0060lib/screens/local_album_screen.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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/screens/library_mix_screen.dart:216\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/screens/library_mix_screen.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdc51f55afcc420d1eb74cd25053c138df32eadecc5bb9be3f65dc70807012c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/screens/settings/link_settings_page.dart:224-232 | lib/screens/settings/link_settings_page.dart:238-246 \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/screens/settings/link_settings_page.dart:224\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/screens/settings/link_settings_page.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0c5cd1f60195a8aeadf752c645bfa74d06c8187a65364b020f2f4aeb6d17bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/screens/tutorial_screen.dart:416-424 | lib/screens/tutorial_screen.dart:562-570 \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/screens/tutorial_screen.dart:416\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/screens/tutorial_screen.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f32def044c292e7dc23a0ccae372f0d77ea5af405897c57d93ebaeb9a2daf68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/services/apk_downloader.dart:205-212 | lib/services/backup_service.dart:485-493 \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. 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/services/apk_downloader.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd03cf4799398e129b3177ef6651f6ba817147bf77dc252d960a54b4d40b0684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/services/history_row_mapper.dart:124-132 | lib/services/history_schema.dart:244-251 \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/services/history_row_mapper.dart:124\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/services/history_row_mapper.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ad83341ed4ef60f0607233af45acbd4f258a56a46fe57a7037929cfe9c49eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/services/history_schema.dart:82-90 | lib/services/library_schema.dart:104-112 \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/services/history_schema.dart:82\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/services/history_schema.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"255a60a80b81b0c73aa551dc8ac719104bd76ea2cc54af2fc92c1e16b2b6be2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/services/library_row_mapper.dart:59-67 | lib/services/library_schema.dart:364-372 \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/services/library_row_mapper.dart:59\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/services/library_row_mapper.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e829c8da4869cc59e63c062b7f41eceef81361379895c05de938829677470ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/services/link/desktop/link_player.dart:352-360 | lib/services/link/features/link_phone_player.dart:205-213 \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/services/link/desktop/link_player.dart"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd5638deefd4db4695310331dcae512dfd00e48aca59880da82799894105d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/widgets/library_directory_view.dart:145-153 | lib/widgets/library_search_results.dart:175-183 \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/widgets/library_directory_view.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/widgets/library_directory_view.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2197b6270607c4bf801acc7b13b2c95173033616121fd6b93c80bfcba06f3ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/screens/tutorial_screen.dart:417-424 | lib/screens/tutorial_screen.dart:563-570 | lib/widgets/download_service_picker.dart:622-629 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/tutorial_screen.dart"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b951e77e3c9a597d985880347c1f3155f9f2d08bfa538661b67e146d844cf8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/providers/download_history_provider.dart:739-746 | lib/providers/download_history_provider.dart:802-809 \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/providers/download_history_provider.dart"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0a1a92a7f5b63f1d42aa41fe5dc50ed9386c5bcaf69f1263586ae01bc80aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/screens/main_shell.dart:623-630 | lib/screens/main_shell.dart:640-649 \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/screens/main_shell.dart:623\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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/main_shell.dart"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d761acf0a3cd0c3fd643c6e16cf3cf1c90879647a1af9bbcc79241122e4a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/services/link/features/link_phone_library_sync.dart:358-365 | lib/services/link/features/link_phone_library_sync.dart:400-407 \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/services/link/features/link_phone_library_sync.dart:358\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/services/link/features/link_phone_library_sync.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c99ee1900103d4cb697d6e2a4b0baff3051f325cc7da5a54dc74b624f1e7ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/models/extension.dart:269-275 | lib/models/extension.dart:290-296 \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/models/extension.dart:269\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/models/extension.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed2aa7f5325c35ab240e65723a3f8be659ba04de161622ceee049c3cb1b2fc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/screens/artist_screen.dart:332-338 | lib/screens/artist_screen.dart:381-388 \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/screens/artist_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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/artist_screen.dart"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd4098c646c271b70f34d0e2572d79cf2afe78836ec27208941cf37cbdf4c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/services/history_row_mapper.dart:75-81 | lib/services/history_row_mapper.dart:97-103 \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/services/history_row_mapper.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"045670ffe1818cbddf9faca63c590b0c7a3402ffb30be4115da391332d395dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/widgets/audio_quality_badges.dart:178-184 | lib/widgets/audio_quality_badges.dart:190-196 \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/widgets/audio_quality_badges.dart:178\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/widgets/audio_quality_badges.dart"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"141a0a586b0bee7e09a3593cd68a3ceb2a768bf0149cf550b767c289bad16ecf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/widgets/extension_row.dart:48-54 | lib/widgets/extension_row.dart:59-65 \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/widgets/extension_row.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9a970d44a4673b5bc97bac609abe2ab6407bb34b92824069d01fa4af93a79f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/widgets/playlist_picker_sheet.dart:266-272 | lib/widgets/playlist_picker_sheet.dart:321-327 \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/widgets/playlist_picker_sheet.dart"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f2690c048e2436ae177e6a443b86f04063a34092b13b56b3f642671fe2d72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): lib/services/history_row_mapper.dart:114-119 | lib/services/history_schema.dart:267-272 | lib/services/library_row_mapper.dart:59-64 | lib/services/library_schema.dart:364-369 \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 all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/history_row_mapper.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a235e40e8dec83894fbadc19ead6549405bc53dc38e9dcedd427dc03f43c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): lib/screens/downloaded_album_screen.dart:830-835 | lib/screens/library_mix_screen.dart:216-222 | lib/screens/local_album_screen.dart:785-791 \u2014 before extracting anything, compare \u0060lib/screens/downloaded_album_screen.dart\u0060 and \u0060lib/screens/local_album_screen.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 88 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/screens/downloaded_album_screen.dart:829\u0060 calls \u0060_selectedUnifiedItems\u0060 and \u0060lib/screens/library_mix_screen.dart:215\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/screens/downloaded_album_screen.dart"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bac680fa14f7a674f17bce81b8327ac5b4fa1b27c538e0662cf7451e65e6ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/models/extension.dart:123-128 | lib/providers/repo_provider.dart:70-75 \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/models/extension.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"38186c3cc9591c343619a6cbf514387b6e739df71784699e98c9c12439287f97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/screens/album_screen.dart:164-171 | lib/screens/extension_collection_screens.dart:451-458 \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/screens/album_screen.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d4551bfd8799cce118f23e527a1673faac7355e11333de72c8a18deda4d7d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/services/autoplay_ranker.dart:285-292 | lib/services/autoplay_taste.dart:637-644 \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/services/autoplay_ranker.dart"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dc2907041a19a4934d21daee8a577a00c272814d43d10c3a73c087bfcaca4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/services/link/client/link_client_library.dart:110-115 | lib/services/link/desktop/link_phone_library.dart:55-60 \u2014 before extracting anything, compare \u0060lib/services/link/client/link_client_library.dart\u0060 and \u0060lib/services/link/desktop/link_phone_library.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/services/link/client/link_client_library.dart:107\u0060 calls \u0060_scan\u0060 and \u0060lib/services/link/desktop/link_phone_library.dart:52\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/services/link/client/link_client_library.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"254b8afe031eaa40dbd938500f2d648485645e7f2df4c4e9fd468633bfec48a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/services/link/desktop/link_desktop_host.dart:356-362 | lib/services/link/features/link_phone_options.dart:79-85 \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/services/link/desktop/link_desktop_host.dart"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfb051ad31309f71929c93c9435b5bad9a9511bf475376c0ac1478b03b210d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/services/link/features/link_phone_receiver.dart:120-125 | lib/services/link/features/link_phone_sender.dart:130-135 \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/services/link/features/link_phone_receiver.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d71dc7b56fe70cfe6eb4660123e720aaf4fbca4af63f3dd7b3774ab56112481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/services/media_kit_playback_deck.dart:723-729 | lib/services/music_playback_deck.dart:220-225 \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/services/media_kit_playback_deck.dart"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1afadfc918f5359e08e03dd5bb5c691d2692330ba1643246598617f4e388f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/services/media_session_mpris.dart:117-122 | lib/services/media_session_smtc.dart:140-145 \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/services/media_session_mpris.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"afafee38a30be527a561c911f41e78ab12270341a3a1e597382c375093cc132e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/widgets/desktop/desktop_inspector.dart:470-477 | lib/widgets/desktop/desktop_now_playing.dart:84-91 \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/widgets/desktop/desktop_inspector.dart"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8168efb08b02c137304882ad48ff8a20bedfc16dae851e03ba603cee1cb8e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/widgets/expressive_seek_track.dart:42-49 | lib/widgets/now_playing_indicator.dart:59-66 \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/widgets/expressive_seek_track.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdef9d79d55056a5a0e92bf6003df2ab7f4d826e941f7955d57a3ae47921f3d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/widgets/library_directory_view.dart:126-131 | lib/widgets/library_search_results.dart:154-159 \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/widgets/library_directory_view.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b234d0b58d2046e8c47ff71b62f710507bfecdb262a6c40d8e6fec41b951594a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/widgets/lyric_blur.dart:182-187 | lib/widgets/settled_blur.dart:205-211 \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/widgets/lyric_blur.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb4cafcce2f3fb39ec4b3a81a90c0e1e02ee0e130d1bcd3a3a426c26bf63034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/widgets/now_playing_indicator.dart:44-50 | lib/widgets/overflow_marquee.dart:42-48 \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/widgets/now_playing_indicator.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d79742c12971c70db067cc0628578b4c81cc905ed94ececefc16f315233845b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): lib/services/app_orientation.dart:68-72 | lib/services/app_orientation.dart:74-78 | lib/services/app_orientation.dart:80-84 | lib/services/shell_navigation_service.dart:330-334 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/app_orientation.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f3642d56270d5720e14b5b04313564f5b3fc9c5db23f3d5068bc3d3adc96fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): lib/widgets/desktop/desktop_player_bar.dart:416-420 | lib/widgets/desktop/desktop_player_bar.dart:547-551 | lib/widgets/mini_player.dart:480-484 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/desktop/desktop_player_bar.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd75be2021bc0185cdd3de117fe27ef83af15ea9517ad485e37a1a975f57d9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/widgets/nav_destination_icons.dart:80-86 | lib/widgets/selection_bottom_bar.dart:222-228 \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/widgets/nav_destination_icons.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"950e097e42981d08c90568c1ceb82ea136907d54f9f664da6502860fd8200646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/services/ffmpeg_conversion.dart:425-429 | lib/services/ffmpeg_conversion.dart:505-509 \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/services/ffmpeg_conversion.dart:425\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/services/ffmpeg_conversion.dart"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"289bfc11c35d509c96da91108624a9099ed41285605c9885180f15183accf059"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:189-209 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:599-619 \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 \u0060android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c9d0e9b3cfc51cb9f5cee247d7adb24e774a24ef799460c500919487318772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:270-285 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:304-319 \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 \u0060android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:270\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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"593624acba36e52e4bcea53f50fba925d2f458fbaad452e27c211dfcb595b81f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:234-244 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:671-681 \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 \u0060android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:234\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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"349050db939624d27303c6b224eec72b999522c6e71cd8967860c61e6fb572d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:214-223 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:631-640 \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 \u0060android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:214\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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8863bdea57871f2c892ef7864e1e2f8e6dcc23a96865a800ef9caabecd20b12d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:588-597 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:620-629 \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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f71b7398f5ee885ff26184871b451eddb20ba2bc071876b40b7865c10c6dc04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:737-746 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt:825-834 \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 \u0060android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt: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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de43986d6883933f4c19747aa0ccb302a95b6608d8d6c29db3c74f701e9d94c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android/app/src/main/kotlin/com/zarz/mornye/AppCrashReporter.kt:125-129 | android/app/src/main/kotlin/com/zarz/mornye/AppCrashReporter.kt:135-140 \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 \u0060android/app/src/main/kotlin/com/zarz/mornye/AppCrashReporter.kt:125\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":"android/app/src/main/kotlin/com/zarz/mornye/AppCrashReporter.kt"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6e5a9d9dc67bc7f6d961db4076a4a718a5a404cf88906bf9fd9b1a38732cef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:233-237 | android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt:260-264 \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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c0928af72f8f78cd7caf95aff3497f30b7ae04a291668c8c5cb73d40162ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ios/Runner/AppDelegate.swift:111-119 | macos/Runner/AppDelegate.swift:11-19 \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":"ios/Runner/AppDelegate.swift"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"197a3202aa04ce9df6b154cbfcb55b49e107c83c94b217b05680057f1e067d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_backend/crates/cast/src/media.rs:400-415 | rust_backend/crates/link/src/subsonic/media.rs:181-196 \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 \u0060rust_backend/crates/cast/src/media.rs:400\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":"rust_backend/crates/cast/src/media.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"6621f69431148432853472f451801992ac32c92113665f8cba40d17b8257c8db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): rust_backend/crates/extensions/src/backend/provider_metadata.rs:290-305 | rust_backend/crates/extensions/src/lyrics.rs:119-134 \u2014 before extracting anything, compare \u0060rust_backend/crates/extensions/src/backend/provider_metadata.rs\u0060 and \u0060rust_backend/crates/extensions/src/lyrics.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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":"rust_backend/crates/extensions/src/backend/provider_metadata.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"df611da440c14b7ae96c77ef20128cab4fea15cbfc6260150700af59bdf67424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): rust_backend/crates/core/src/isrc/native_files.rs:29-38 | rust_backend/crates/extensions/src/files/index.rs:29-42 \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 \u0060rust_backend/crates/core/src/isrc/native_files.rs:29\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":"rust_backend/crates/core/src/isrc/native_files.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f42e0fb11a37b65ebc5e32709095d1c70ae690ec0889a2894df5498af9ce596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): rust_backend/crates/extensions/src/backend/downloads.rs:131-145 | rust_backend/crates/extensions/src/backend/provider_metadata.rs:293-305 | rust_backend/crates/extensions/src/lyrics.rs:122-134 \u2014 before extracting anything, compare \u0060rust_backend/crates/extensions/src/backend/provider_metadata.rs\u0060 and \u0060rust_backend/crates/extensions/src/lyrics.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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 \u0060rust_backend/crates/extensions/src/backend/downloads.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/downloads.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50c06a4d1418973bb2731c0c3470258563d096ecd19507cd65f04151696ea51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_backend/crates/extensions/src/backend/provider_metadata.rs:140-151 | rust_backend/crates/extensions/src/backend/provider_metadata.rs:183-194 \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 \u0060rust_backend/crates/extensions/src/backend/provider_metadata.rs:140\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":"rust_backend/crates/extensions/src/backend/provider_metadata.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd75fc68816e79b1a91f326e8f28af9320af320b1c99b82790e55dcb708f1c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): rust_backend/crates/core/src/tags/write/riff.rs:130-140 | rust_backend/crates/core/src/tags/write/riff.rs:204-214 \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":"rust_backend/crates/core/src/tags/write/riff.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd10ba27bbcadd95bb770ad6ab8c8f65b33a5f6897f647f8faf0d8327ea3907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): rust_backend/crates/desktop/src/paths.rs:71-82 | rust_backend/crates/providers/src/recognition.rs:430-441 \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 \u0060rust_backend/crates/desktop/src/paths.rs:71\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":"rust_backend/crates/desktop/src/paths.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd1486f26259a85125df2524f49f6e950ead69ec838a0f9f57b9f1d755bc0e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): rust_backend/crates/extensions/src/download/segment_store.rs:193-202 | rust_backend/crates/extensions/src/download/store.rs:167-177 \u2014 before extracting anything, compare \u0060rust_backend/crates/extensions/src/download/segment_store.rs\u0060 and \u0060rust_backend/crates/extensions/src/download/store.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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 \u0060rust_backend/crates/extensions/src/download/segment_store.rs:193\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":"rust_backend/crates/extensions/src/download/segment_store.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5561f17c377076a149eba6c296649a1d6b05d22529ce7814a8e57e145a9d58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): rust_backend/crates/core/src/text.rs:5-13 | rust_backend/crates/extensions/src/host.rs:263-272 | rust_backend/crates/extensions/src/redact.rs:71-79 \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 \u0060rust_backend/crates/core/src/text.rs:5\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":"rust_backend/crates/core/src/text.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5aebf443008a8bb4d0c93d06340ed53f613403d6064d4d61bea7a0115fd2e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_backend/crates/core/src/tags/write/id3.rs:116-128 | rust_backend/crates/core/src/tags/write/mp4.rs:54-63 \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 \u0060rust_backend/crates/core/src/tags/write/id3.rs:116\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":"rust_backend/crates/core/src/tags/write/id3.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5c99f973a8b8dcd6c97e266b40bff339f7734765d1cd7e772a1e830b888518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): rust_backend/crates/extensions/src/manager/postprocess.rs:148-157 | rust_backend/crates/extensions/src/manager/providers.rs:127-132 \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 \u0060rust_backend/crates/extensions/src/manager/postprocess.rs:148\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":"rust_backend/crates/extensions/src/manager/postprocess.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71372e055a94ecbef25a33e2e59ced29ac7518a6c44b26ab6e856c7c3f41a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_backend/crates/extensions/src/signed_session/fetch.rs:32-41 | rust_backend/crates/extensions/src/signed_session/fetch.rs:49-58 \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":"rust_backend/crates/extensions/src/signed_session/fetch.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ddeb90bd343b5321d2f743b04d51dda8e1bbf9554fb846deeefd8ebe4100cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): rust_backend/crates/mobile/src/network_tags.rs:104-113 | rust_backend/crates/mobile/src/network_tags.rs:417-425 \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 \u0060rust_backend/crates/mobile/src/network_tags.rs:104\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":"rust_backend/crates/mobile/src/network_tags.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"640aa1c306ecfc75f757ceebe0783e344fd1676e94381add8b7b3ed92b9b6664"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_backend/crates/extensions/src/download_host.rs:13-21 | rust_backend/crates/extensions/src/download_host.rs:155-163 \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 \u0060rust_backend/crates/extensions/src/download_host.rs:13\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, \u0060rust_backend/crates/extensions/src/download_host.rs:12\u0060 calls \u0060register_segments\u0060, \u0060clone\u0060 and \u0060rust_backend/crates/extensions/src/download_host.rs:154\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":"rust_backend/crates/extensions/src/download_host.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"312df46cd2124f68a59f113c641ff2cbb2bcb3d2311a638e2349ec78dd0a338e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_backend/crates/providers/src/resolver/availability/cache.rs:215-223 | rust_backend/crates/providers/src/resolver/service.rs:136-144 \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 \u0060rust_backend/crates/providers/src/resolver/availability/cache.rs:215\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":"rust_backend/crates/providers/src/resolver/availability/cache.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b4212d334bc152f10ed5c5dac036ba440318c8b905182d1d809a60a525446c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): rust_backend/crates/extensions/src/backend/cover.rs:345-352 | rust_backend/crates/extensions/src/backend/cover.rs:539-546 | rust_backend/crates/extensions/src/backend/library.rs:44-51 | rust_backend/crates/extensions/src/backend/library.rs:284-291 | rust_backend/crates/extensions/src/backend/tags.rs:49-56 | rust_backend/crates/extensions/src/backend/tags.rs:85-92 \u2014 there are 6 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 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/cover.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"20844d34ec5a20ff6eafa638f7c7b0b68ff92ee1e5a78bbd9ddadc0814a34d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_backend/crates/extensions/src/download.rs:231-238 | rust_backend/crates/extensions/src/download.rs:363-370 \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 \u0060rust_backend/crates/extensions/src/download.rs:231\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. 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":"rust_backend/crates/extensions/src/download.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f315e2b6b663ce019ef54e6946bc7f15fbef7ec9c21375c49e88f1a9bf19d355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_backend/crates/mobile/src/native_library/path_keys.rs:72-79 | rust_backend/crates/mobile/src/native_listing.rs:170-177 \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 \u0060rust_backend/crates/mobile/src/native_library/path_keys.rs:72\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, \u0060rust_backend/crates/mobile/src/native_listing.rs:179\u0060 calls \u0060push_str\u0060 and \u0060rust_backend/crates/mobile/src/native_library/path_keys.rs:80\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":"rust_backend/crates/mobile/src/native_library/path_keys.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f94a8b46d32331acb3abc1b8eace3625776fac7354f7ad5a84c53b581e01c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_backend/crates/providers/src/musicbrainz/http.rs:27-34 | rust_backend/crates/providers/src/resolver/http.rs:30-37 \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 \u0060rust_backend/crates/providers/src/musicbrainz/http.rs:27\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":"rust_backend/crates/providers/src/musicbrainz/http.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fa12567566e65df285542a9696c73918d12f5fefaead414c9cded5603f324b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_backend/crates/core/src/native_audio_analysis.rs:154-160 | rust_backend/crates/core/src/native_audio_analysis.rs:171-177 \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 \u0060rust_backend/crates/core/src/native_audio_analysis.rs:154\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":"rust_backend/crates/core/src/native_audio_analysis.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c867bb8567513a86a80e2c125e1b1d6c18962e3435555c3d515cfe0f5c463487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_backend/crates/core/src/native_palette.rs:427-433 | rust_backend/crates/mobile/src/native_autoplay_taste.rs:16-22 \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":"rust_backend/crates/core/src/native_palette.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa0369daed378d0187d5fefdfe5f2300e6e9311af99d50407a24ccdf31a65d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_backend/crates/core/src/tags/containers.rs:180-186 | rust_backend/crates/core/src/tags/write/id3.rs:224-230 \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 \u0060rust_backend/crates/core/src/tags/containers.rs:180\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":"rust_backend/crates/core/src/tags/containers.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a582d441e322b671aa4eae66bc899afbf6eb620c93247ae8cf6f76d529b69f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust_backend/crates/extensions/src/download.rs:458-463 | rust_backend/crates/extensions/src/signed_session/protocol.rs:541-547 \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 \u0060rust_backend/crates/extensions/src/download.rs: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":"rust_backend/crates/extensions/src/download.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"f544f74f3fc255c87c3a13080a4a0948a0b4ac4949c1f6e95760fa093f4c96e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_backend/crates/extensions/src/download/segment_store.rs:185-191 | rust_backend/crates/extensions/src/download/store.rs:159-165 \u2014 before extracting anything, compare \u0060rust_backend/crates/extensions/src/download/segment_store.rs\u0060 and \u0060rust_backend/crates/extensions/src/download/store.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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":"rust_backend/crates/extensions/src/download/segment_store.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba42bc093f513b0635ec851e81de159c1a9d19283d16c1784eb7f64ca0d017b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_backend/crates/extensions/src/manager.rs:290-299 | rust_backend/crates/extensions/src/manager.rs:315-324 \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":"rust_backend/crates/extensions/src/manager.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dbd3a4fcbf590e6fb01dfdec0136590c21166c86a1f5abd8da43b26be0b556"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_backend/crates/mobile/src/usb_audio/transport.rs:112-118 | rust_backend/crates/mobile/src/usb_audio/transport.rs:127-133 \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":"rust_backend/crates/mobile/src/usb_audio/transport.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"342c5f7704543eec92d54931d846751acf26fd529458c773c04d21c72afe4b87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_backend/crates/network/src/url.rs:206-212 | rust_backend/crates/network/src/url.rs:330-336 \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 \u0060rust_backend/crates/network/src/url.rs:206\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_backend/crates/network/src/url.rs:213\u0060 calls \u0060is_empty\u0060, \u0060clone_from\u0060 and \u0060rust_backend/crates/network/src/url.rs:337\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":"rust_backend/crates/network/src/url.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f525ef33296f2df4aac3e0d04e611f5f76920968286245d9cb2e3569971f26a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): rust_backend/crates/providers/src/lyrics/http.rs:68-74 | rust_backend/crates/providers/src/lyrics/lrclib.rs:30-35 \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 \u0060rust_backend/crates/providers/src/lyrics/http.rs:68\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":"rust_backend/crates/providers/src/lyrics/http.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"298d2ee18a90a946335b4447d0289bb8fcfaafd95dea36632b9878beed74b1d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_backend/crates/core/src/lyrics/payloads.rs:400-405 | rust_backend/crates/core/src/lyrics/payloads/ttml.rs:35-40 \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 \u0060rust_backend/crates/core/src/lyrics/payloads.rs:400\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":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"4177c56258eed29d608271ae75fa17c52cd7c28a6074f7f3b5438bc0cb581cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_backend/crates/extensions/src/binary.rs:41-46 | rust_backend/crates/extensions/src/download/chunked.rs:344-349 \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 \u0060rust_backend/crates/extensions/src/binary.rs:41\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":"rust_backend/crates/extensions/src/binary.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8e30ba61620e3c2be7e6aaee033743c39810d17939eea68abe2bb3364251e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): rust_backend/crates/extensions/src/download.rs:329-338 | rust_backend/crates/extensions/src/download/chunked.rs:195-204 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_backend/crates/extensions/src/download.rs:339\u0060 calls \u0060checkpoint\u0060 and \u0060rust_backend/crates/extensions/src/download/chunked.rs:205\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":"rust_backend/crates/extensions/src/download.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c895dc0be8c4cb39e2aabfde386ec5e7da9ce80812b591aab7e055dab32a82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_backend/crates/providers/src/resolver/availability/cache.rs:100-106 | rust_backend/crates/providers/src/resolver/service.rs:83-89 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/providers/src/resolver/availability/cache.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc62f25fe18edd7ea16fe91e22728817537d3a2959162e3e64ddb1d8013a863"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_backend/crates/core/src/tags/write/mp4.rs:140-144 | rust_backend/crates/core/src/tags/write/mp4/ac4.rs:230-234 \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 \u0060rust_backend/crates/core/src/tags/write/mp4.rs:140\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":"rust_backend/crates/core/src/tags/write/mp4.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"daad3f177e00a83d3cb7649a91b814ab0b89638feb47fbc1169180dd4c9fa4e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_backend/crates/extensions/src/download/segment_store.rs:64-68 | rust_backend/crates/extensions/src/download/store.rs:59-65 \u2014 before extracting anything, compare \u0060rust_backend/crates/extensions/src/download/segment_store.rs\u0060 and \u0060rust_backend/crates/extensions/src/download/store.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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 \u0060rust_backend/crates/extensions/src/download/segment_store.rs: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":"rust_backend/crates/extensions/src/download/segment_store.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a7cd15eaa0fd4fc959714488648873f5c6605175ef266ef99b07e485a29de7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_backend/crates/extensions/src/download/segment_store.rs:212-217 | rust_backend/crates/extensions/src/download/store.rs:187-192 \u2014 before extracting anything, compare \u0060rust_backend/crates/extensions/src/download/segment_store.rs\u0060 and \u0060rust_backend/crates/extensions/src/download/store.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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":"rust_backend/crates/extensions/src/download/segment_store.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94ba1671792f93d5308559c94131665e65c98acbf7ba9fce7a6393956b40286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): rust_backend/crates/providers/src/musicbrainz.rs:241-243 | rust_backend/crates/providers/src/resolver/availability/cache.rs:266-270 | rust_backend/crates/providers/src/resolver/service.rs:193-197 \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 \u0060rust_backend/crates/providers/src/musicbrainz.rs:241\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060rust_backend/crates/providers/src/resolver/availability/cache.rs:271\u0060 calls \u0060drop\u0060, \u0060shutdown\u0060 and \u0060rust_backend/crates/providers/src/resolver/service.rs:198\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":"rust_backend/crates/providers/src/musicbrainz.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34f416a1f3db22e01b1a246f25ff6eb208bec7fb88a53318e5692dcbb587d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_backend/crates/core/src/metadata/deezer.rs:142-149 | rust_backend/crates/core/src/metadata/deezer/catalog.rs:144-151 \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":"rust_backend/crates/core/src/metadata/deezer.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2ea3c1c4182517b0d06f27353b856291bf88e5dd70e61111e440b4cb86b145"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_backend/crates/mobile/src/cancellation.rs:52-56 | rust_backend/crates/mobile/src/progress.rs:39-43 \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":"rust_backend/crates/mobile/src/cancellation.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d794dea5cfdf933a968b5fc34d5ba8d16d028234f67881cbb1052361b0e0d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_backend/crates/mobile/src/lyrics.rs:27-34 | rust_backend/crates/mobile/src/metadata.rs:5-12 \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":"rust_backend/crates/mobile/src/lyrics.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc16dfc4ccbd5362cffadc3bebdec2b2c72b6a6f6f319be4e6465a5341ffd128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_backend/crates/mobile/src/native_backup.rs:138-142 | rust_backend/crates/mobile/src/native_library.rs:204-208 \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":"rust_backend/crates/mobile/src/native_backup.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"39833d832e6f32c90993344b03dc7b19a746ad073e6c12b92105f628dd56fde8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_backend/crates/mobile/src/native_library/path_keys.rs:29-34 | rust_backend/crates/mobile/src/native_listing.rs:152-159 \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":"rust_backend/crates/mobile/src/native_library/path_keys.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff32e61fa7b56bbeeb2b6e4bb301f9bd934cc8b1281f117dcc49861bc0613c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_backend/crates/providers/src/lyrics/builtin/proxy.rs:53-60 | rust_backend/crates/providers/src/lyrics/builtin/proxy.rs:117-124 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060rust_backend/crates/providers/src/lyrics/builtin/proxy.rs:50\u0060 calls \u0060spotify_id\u0060, \u0060is_empty\u0060 and \u0060rust_backend/crates/providers/src/lyrics/builtin/proxy.rs:115\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":"rust_backend/crates/providers/src/lyrics/builtin/proxy.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9398f9e66bd414e618ece06a7e6b4e085828af129af78c0c552b3f6f0bac9e96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): rust_backend/crates/mobile/src/data_jobs.rs:184-191 | rust_backend/crates/mobile/src/network_tags.rs:315-322 \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":"rust_backend/crates/mobile/src/data_jobs.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daec2250f3e0234d65b5a4ba22f938fd4eb99a92deb36dc6f40e502a6baea64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): rust_backend/crates/extensions/src/host.rs:183-189 | rust_backend/crates/extensions/src/host.rs:192-198 \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 \u0060rust_backend/crates/extensions/src/host.rs:183\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":"rust_backend/crates/extensions/src/host.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c47423668a1c24b2b61ac373038062cbcfd4067e9c47f105e6c319a4cf866d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_backend/crates/extensions/src/download/segment_store.rs:43-48 | rust_backend/crates/extensions/src/download/store.rs:37-42 \u2014 before extracting anything, compare \u0060rust_backend/crates/extensions/src/download/segment_store.rs\u0060 and \u0060rust_backend/crates/extensions/src/download/store.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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 \u0060rust_backend/crates/extensions/src/download/segment_store.rs:43\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":"rust_backend/crates/extensions/src/download/segment_store.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9786b60410bb94b6531d65ab61209e1921cbdf7fb9728381d927a8ff855b7e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): rust_backend/crates/extensions/src/backend/provider_metadata.rs:281-286 | rust_backend/crates/extensions/src/lyrics.rs:104-109 \u2014 before extracting anything, compare \u0060rust_backend/crates/extensions/src/backend/provider_metadata.rs\u0060 and \u0060rust_backend/crates/extensions/src/lyrics.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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 \u0060rust_backend/crates/extensions/src/backend/provider_metadata.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/provider_metadata.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd3ad58255c26e0abdccac3f550682f7193c447dbb2c598d1eba658476d5a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_backend/crates/core/src/native_palette.rs:246-254 | rust_backend/crates/core/src/native_palette.rs:257-265 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060v\u0060 to \u0060\u0026[i64]\u0060 in one and \u0060\u0026[f64]\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":"rust_backend/crates/core/src/native_palette.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"824755d9595b5f9dd788912ddc553052d0754d0a18bed8ef8618a5a9fff47bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): rust_backend/crates/extensions/src/manifest.rs:108-116 | rust_backend/crates/extensions/src/manifest.rs:126-134 \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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6af783b8f3f8b4b625f639022dc12fbb339072aeb0ee71e046ad7afebb6007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): rust_backend/crates/link/src/subsonic/objects.rs:36-40 | rust_backend/crates/link/src/subsonic/objects.rs:95-99 \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":"rust_backend/crates/link/src/subsonic/objects.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceac4c87cdae184a1fd9d25d25f8688daf4df945dbe21df711f4f2200b00c563"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): scripts/check_backend_apk.py:172-180 | scripts/check_backend_ios.py:233-241 \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":"scripts/check_backend_apk.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9e29143b595bb2aecc013dd788da24765e8df981dccea8acb94024c57f45a3"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project mornye-mobile: mornye-mobile has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"776c3fe0c82cc0dbe16756da576276d9f5221e901b07f06a21e6732476a9fdd9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mornye-core: mornye-core: abstractness 0.02, instability 0.00, distance 0.98 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"843648ad643f1e9ce423f25b0cb1e074e1672d14ee3982b015e195e160da03ed"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mornye-network: mornye-network: abstractness 0.05, instability 0.00, distance 0.95 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8d715824ea43b4a81d0f9f0330f3eca2912b8ae4ef07f91c52808353209558c9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LibraryCollectionsDatabase (LCOM4 25): LibraryCollectionsDatabase\u0027s methods fall into 25 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 25 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/services/library_collections_database.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a1d6872f100021d4c627ea20f40562b43c975d8cc3e318bc1cdc0a38e447ea"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LibraryDatabase (LCOM4 21): LibraryDatabase\u0027s methods fall into 21 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 21 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/services/library_database.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2282831311b0ff7d477c662e1abf6a7945695f3582bd0b34cca4073f21cfe9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AppStateDatabase (LCOM4 20): AppStateDatabase\u0027s methods fall into 20 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 20 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/services/app_state_database.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"825bf47e9afd8fb4b3839dfd5d1c95b4d4a0180076f5951f01febdcfda46c648"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HistoryDatabase (LCOM4 13): HistoryDatabase\u0027s methods fall into 13 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 13 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/services/history_database.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d382e9ba83f389be2d4070aa264ad8c952125307ceb2d0ae3cda56a115f15a33"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MusicPlayerController (LCOM4 10): MusicPlayerController\u0027s methods fall into 10 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 10 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/providers/music_player_provider.dart"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32d070b0b0f7c9a9c33c2edeb982fe0fc9b814aa2f17cb7ed2d366fcb792a6d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NowPlayingRoute (LCOM4 10): NowPlayingRoute\u0027s methods fall into 10 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 10 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/routes/now_playing_route.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"11510d3ad211ffb49850d294f9047122f3e299537963a8ab9f1242ae805d0199"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DownloadQueueNotifier (LCOM4 8): DownloadQueueNotifier\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/providers/download_queue_provider.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c7d861827dff25d1799be7b657a5e5c1b9fe20ccb4b682c9292fd1215bae0c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _HomeTabState (LCOM4 7): _HomeTabState\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/screens/home_tab.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"90de4aae246d228733079375978ad6948a36c21d630ea655a0e62de69cdf127a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CastPlaybackDeck (LCOM4 7): CastPlaybackDeck\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/services/cast_playback_deck.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a851c033521bca93bbf30300f603410effd68495bcd9df2a9f65460faa03c0e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PlaybackDependencies (LCOM4 7): PlaybackDependencies\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/services/music_player_runtime.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dc695500d49b887aa26781e17430662fb5a5ba6888fc942c40598c675f8374"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _RemovedQueueIndex (LCOM4 6): _RemovedQueueIndex\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/providers/download_queue_state.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1e5dd94bf2d640215a5cc6cc58eed52a49aba6b8c61692c175887e9b55953b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RepoNotifier (LCOM4 6): RepoNotifier\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/providers/repo_provider.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4064571c62ca1ace341b094ca2d16c574e1d1d4187505bb493a7c749276dbf3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _LibrarySettingsPageState (LCOM4 6): _LibrarySettingsPageState\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/screens/settings/library_settings_page.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f5ae76ad01f14841e25360bc697510629c7b4084d6b6d8e541028d8b88d2a0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _TrackMetadataScreenState (LCOM4 6): _TrackMetadataScreenState\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/screens/track_metadata_screen.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3180e6cd42046cf831483c1a932fe07bc2ddb6c47f0d23c1a4260675a5a82e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TrackNotifier (LCOM4 5): TrackNotifier\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/providers/track_provider.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"926f64323f0f2c79eb0ce96913307d0195b22fd9d29db719909176cea0f3f7c7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _QueueTabState (LCOM4 5): _QueueTabState\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/screens/queue_tab.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d96341e034907b72d02edb8fb900156e33c88868bbc0cd9d3ea05b5055f1258"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DesktopDiagnostics (LCOM4 5): DesktopDiagnostics\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/services/desktop_diagnostics.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3193f69e9eea653e9f3486efa648b73c3101602cbb7827999bac73a7ea9bd5a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DesktopUpdater (LCOM4 5): DesktopUpdater\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/services/desktop_updater.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a9c9e5ba2eac93175956d6ede0c213616896372024b17639a952491009bc30"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MprisPlayerObject (LCOM4 5): MprisPlayerObject\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/services/media_session_mpris.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"479b2c8e3d2986c12ea981f0de2599197357eb19b84902dda0013a0d431a6662"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RecordMicrophone (LCOM4 5): RecordMicrophone\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/services/music_recognition.dart"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5024993db8cc64354fc5dd2f122edf2df8f1b9125b6687936f24bea136f1e23"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _AppRefreshIndicatorState (LCOM4 5): _AppRefreshIndicatorState\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/widgets/app_refresh_indicator.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c25bb7bd1738b566fe9b3783119de59c603d2be09d5e4e6910e96e4394cede2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _DesktopShortcutsState (LCOM4 5): _DesktopShortcutsState\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/widgets/desktop/desktop_shortcuts.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"11790e92ae0689dc36e4962c05d747a3453c6ac0af1744801a36058251a3f973"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _LiquidMenuGlassState (LCOM4 5): _LiquidMenuGlassState\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/widgets/mornye_context_menu.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb073069ea1223942be17a0caaa93429464a3cb0dd0d3aae1b3a6260bfebc30"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DownloadHistoryState (LCOM4 4): DownloadHistoryState\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/models/download_history.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fb25675be4f751405476c1f8e21b9bc6128b3b46e95e07f8b2594a8cef6bc4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _IndexedQueueMap (LCOM4 4): _IndexedQueueMap\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/providers/download_queue_state.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11a8c458320581337ff7cd6ac12fa642f7fda299f614bb8ec74a882656e0127"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExtensionNotifier (LCOM4 4): ExtensionNotifier\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/providers/extension_provider.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce4738f51e186a9fe11bd7214a11f1c91b0aba0fbf60a77716e84b058d0c402"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _MainShellState (LCOM4 4): _MainShellState\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/screens/main_shell.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7467a4255e84407bc11ffe7f79c2610397b2f6313764ad4d90accdcc1f196e5f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _EditMetadataSheetState (LCOM4 4): _EditMetadataSheetState\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/screens/track_metadata_edit_sheet.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacd53c41cdf0f6487749e000cfab4d9bdaa6e2d41bf64488a9d5165aed49f89"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FfiBackendTransport (LCOM4 4): FfiBackendTransport\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/services/backend/ffi_backend_transport.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc385c653ca133d20807b002652d44e02f1dd4ab0f6a7d02f5a9f5d64516ef6f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BackupBundle (LCOM4 4): BackupBundle\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/services/backup_service.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed8295452556313cd8cbad1c8cade0b983a59d02ed4224cb0afeb3753904b3f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LinkPhonePlayback (LCOM4 4): LinkPhonePlayback\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/services/link/desktop/link_phone_playback.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"81065fafe11112659d0731acd507f79669b253deea282aff7fb72af5a49bb05d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MediaKitPlaybackDeck (LCOM4 4): MediaKitPlaybackDeck\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/services/media_kit_playback_deck.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d6d7d605829f012067b2a8039f0f7f1e574922b8364f9223fd89c5ffb51121"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ChunkedList (LCOM4 4): ChunkedList\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/utils/chunked_list.dart"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"92517343628e238194ec6ff3775267574979fe1621ca502b73bbf0097fd4750d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _AndroidKeyboardLifecycleState (LCOM4 4): _AndroidKeyboardLifecycleState\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/widgets/android_keyboard_lifecycle.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2949a9b99e39366ebd9c2dfba09951f2b269adff0f3015806832d71e31fa0e8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _MaterialContextMenuRoute (LCOM4 4): _MaterialContextMenuRoute\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/widgets/desktop/context_menu.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6412c95601eebbcff12e32063b7613d59949879d2e1a87e23111714e0b27a151"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _SyncedLyricsViewState (LCOM4 4): _SyncedLyricsViewState\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/widgets/player_lyrics.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e14afe4cfea84c9c246b9f380fcfdc039068dee5860c68dfa2064aa3acf54bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/now_playing_screen.dart: lib/screens/now_playing_screen.dart changed 103 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in _NowPlayingScreenState._buildPlayer at line 311. 35 of those changes were fix/bug commits, and the other 68 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/now_playing_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/screens/now_playing_screen.dart"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"31287070a87b7133cb697b4cd6c8ba7dc22c05d721c4a9c09a3d484c2a0c42a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/home_tab.dart: lib/screens/home_tab.dart changed 74 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in _HomeTabState.build at line 769. 21 of those changes were fix/bug commits, and the other 53 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/home_tab.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/screens/home_tab.dart"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc80daa7ae3b8cd4ad705ff771e2749c682e9b822d05955fee884f20b02b2db4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt: android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt changed 80 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in MainActivity.configureFlutterEngine at line 464. 5 of those changes were fix/bug commits, and the other 75 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"07901d97d1566a942ed344ca39be905ca1d2f2ba1919eb73b93491f189c2ba16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/music_player_service.dart: lib/services/music_player_service.dart changed 98 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in MusicPlayerHandler._loadIndex at line 1733. 44 of those changes were fix/bug commits, and the other 54 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/music_player_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/services/music_player_service.dart"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bc8b7e2ad8009c7e6c228a39b821244d905cd68ab95a9f621f188bf905a8e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/queue_tab.dart: lib/screens/queue_tab.dart changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in _QueueTabState.build at line 524. 19 of those changes were fix/bug commits, and the other 57 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/queue_tab.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/screens/queue_tab.dart"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad4886b1545283039b8e235185f64d8dd6d648c57b7579a1d65ee65d921b478"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/providers/download_queue_provider_single_item.dart: lib/providers/download_queue_provider_single_item.dart changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in _DownloadRun._handleDownloadSuccess at line 607. 17 of those changes were fix/bug commits, and the other 25 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/providers/download_queue_provider_single_item.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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2cbe61cc9eaad9947fd191e5bda67a20547f323058db696f77058e64511c39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/platform_bridge.dart: lib/services/platform_bridge.dart changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in PlatformBridge._ensureBackendEventHandler at line 454. 27 of those changes were fix/bug commits, and the other 52 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/platform_bridge.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/services/platform_bridge.dart"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dc1f9bcbaa0914924a908d6f9b498bae87a482ff026220f987d2790338995d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/playback_settings_page.dart: lib/screens/settings/playback_settings_page.dart changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in _PlaybackSettingsPageState.build at line 148. 5 of those changes were fix/bug commits, and the other 30 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/playback_settings_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/screens/settings/playback_settings_page.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc35724b9c3073b72fc9172af196270c4527ef8f5e52556b688c00360ad8d100"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/library_tracks_folder_screen.dart: lib/screens/library_tracks_folder_screen.dart changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in _LibraryTracksFolderScreenState._buildAppBar at line 902. 10 of those changes were fix/bug commits, and the other 32 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/library_tracks_folder_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/screens/library_tracks_folder_screen.dart"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbdc56001289c5a1ff5c8780fcb0171a43aa61a9f724d0d6c1a30e12783f6d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/library_settings_page.dart: lib/screens/settings/library_settings_page.dart changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in _LibrarySettingsPageState.build at line 469. 11 of those changes were fix/bug commits, and the other 29 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/library_settings_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/screens/settings/library_settings_page.dart"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fc50bbf7e2eaa7569763ea3a8d17f6deaf9575dc63f17f081f2301b3e8eb61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt: android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in MainActivitySafScanKt.scanSafTree at line 120. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fc42357450739258fd0f5af69dd3b9191bdd0223f63225ccf58de5ca8cc410"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/music_player_automix.dart: lib/services/music_player_automix.dart changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in _MusicAutoMix._start at line 288. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/music_player_automix.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/services/music_player_automix.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b02b4dd6810a5c4ecdb87585e8ad06f7826448254053798f1edb9beabc894f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/player_lyrics.dart: lib/widgets/player_lyrics.dart changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in _SyncedLyricsViewState._buildLyrics at line 888. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/player_lyrics.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/widgets/player_lyrics.dart"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"237af4406aef04cb07337d1b725ba19291a46dbc8b2d4d38a9ddbb8150a77bf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mornye_chrome.dart: lib/widgets/mornye_chrome.dart changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in MornyeGlass.build at line 214. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mornye_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/widgets/mornye_chrome.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9273baf7db7fe0e33808d5e969c495f9ba4ff76cecce749995bf0c5ebc527f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/main_shell.dart: lib/screens/main_shell.dart changed 67 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in _MainShellState._handleBackPress at line 596. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/main_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/screens/main_shell.dart"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baa2a4bae4bf3e9f671fb58a707a74a9be654fb2feafd984c2b0f1b3ce01c2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/network_storage_service.dart: lib/services/network_storage_service.dart changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in NetworkStorageService.parseListing at line 1135. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/network_storage_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/services/network_storage_service.dart"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb4b0e7c5850b5ab7a7e4648677646893648df96237180b643fcf1427531c67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/Runner/CoreBackend.swift: ios/Runner/CoreBackend.swift changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in RustCoreBackend.invokeApplication at line 643. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- ios/Runner/CoreBackend.swift\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":"ios/Runner/CoreBackend.swift"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5168fbfd1d10f2331a7aa113ec8e03514b8825c5970cca131925704ecce20f78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/Runner/AppDelegate.swift: ios/Runner/AppDelegate.swift changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in AppDelegate.invokeOsMethod at line 532. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- ios/Runner/AppDelegate.swift\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":"ios/Runner/AppDelegate.swift"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5502c4ecec5a7b965e6de4e918f6345b107f0017e4eda14eec86b5847cb79d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/artist_screen.dart: lib/screens/artist_screen.dart changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in _ArtistScreenState._buildPage at line 634. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/artist_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/screens/artist_screen.dart"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffdd294541906843976145ce3eadaaf1d429dc4ab498b9a518d56d4ab513541"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/library_database.dart: lib/services/library_database.dart changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in LibraryDatabase.updateAudioMetadata at line 957. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/library_database.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/services/library_database.dart"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"108c3f6648f76db8865314046fe805a0edc5a7d2ddb148f94fcde5c2bf12f8da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/providers/download_history_provider.dart: lib/providers/download_history_provider.dart changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in DownloadHistoryNotifier._inspectOrphanedEntries at line 854. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/providers/download_history_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/providers/download_history_provider.dart"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd25ca17e5416a231f5958955339adf5263898e547a3b0243a339ee8b283461c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/providers/settings_provider.dart: lib/providers/settings_provider.dart changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SettingsNotifier._runMigrations at line 300. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/providers/settings_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/providers/settings_provider.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5914e053da55372391bb459b660bbd14af4b493b9e4da8c75180e1c629080e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mini_player.dart: lib/widgets/mini_player.dart changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in _MiniPlayerBodyState.build at line 206. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mini_player.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/widgets/mini_player.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b073fdecc6edacda6b13dc68cf3107b5884ef62415c47bfa9c4263ea12242638"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt: android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in NativeDownloadFinalizer.finalize at line 88. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb787879123a233e0936c9b8218ca83c0c93b725ff6131b001094fe24cd7eca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/network_library_scanner.dart: lib/services/network_library_scanner.dart changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in NetworkLibraryScanner._scan at line 122. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/network_library_scanner.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/services/network_library_scanner.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"055dc561c824c12299d15ac0fda5864789c71b58999f3f7c90f775e1835541b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/library_search_results.dart: lib/widgets/library_search_results.dart changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in _LibrarySearchResultsState._buildSlivers at line 753. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/library_search_results.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/widgets/library_search_results.dart"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"6878bedac34fc8c1156559731cdabcbdf0d60d63ed090972faaeb14b80fb7ce0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/network_storage_screen.dart: lib/screens/network_storage_screen.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in _NetworkStorageScreenState.build at line 318. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/network_storage_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/screens/network_storage_screen.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66b523fbd8802c47fe3b23e5bc5addcc768f4e8da8277079dc4cefa6b5ef077"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/album_screen.dart: lib/screens/album_screen.dart changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _AlbumScreenState._buildAppBar at line 522. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/album_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/screens/album_screen.dart"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"22faa20718925ff938ff77097a8a989ddfeb0143be89abd8085c74e93e0f6107"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerMedia.kt: android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerMedia.kt changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in NativeFinalizerMediaKt.embedBasicMetadata at line 239. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerMedia.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerMedia.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b7a2ac031ead906b21659491e8170410d587ef3ecf962d013b6d2ccfd1c018"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/extension_detail_page.dart: lib/screens/settings/extension_detail_page.dart changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in _ExtensionDetailPageState.build at line 85. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/extension_detail_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/screens/settings/extension_detail_page.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff0b57417871ade63b20c6ec2d9921c9a44557a528ee78530256b892bb28710"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/library_queue_store.dart: lib/services/library_queue_store.dart changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in LibraryQueueStore._queueAlbumUnionSql at line 588. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/library_queue_store.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/services/library_queue_store.dart"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd73879e495c6718bc99624e662eca80f7d55c4d3b7945ffc650d2eedd4572e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/downloaded_album_screen.dart: lib/screens/downloaded_album_screen.dart changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _DownloadedAlbumScreenState._buildAppBar at line 355. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/downloaded_album_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/screens/downloaded_album_screen.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b30210ba6543a13678f335ff18adddc15f7a5ba72b1b09fddf87bdd3c9d59f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/player_playback_controls.dart: lib/widgets/player_playback_controls.dart changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in PlayerPlaybackControls.build at line 63. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/player_playback_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/widgets/player_playback_controls.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9592e5ecf2c227d9935f27edd881c0978dff1a3ffbc8f5d69fdc779298eedc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mornye_player_layout.dart: lib/widgets/mornye_player_layout.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in MornyePlayerLayout.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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mornye_player_layout.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/widgets/mornye_player_layout.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad14a3cbb82eda0136a655f8dc79c34c01fc4d5debf7210f2652dfa885cd238"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/extensions/src/backend/downloads.rs: rust_backend/crates/extensions/src/backend/downloads.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in Backend::plan_download at line 168. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/extensions/src/backend/downloads.rs\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":"rust_backend/crates/extensions/src/backend/downloads.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67d5f9235e52fa3563d8679d4c3838e01ca6f82aaf77ad043bc940b8a1bbb8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/backup_service.dart: lib/services/backup_service.dart changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in BackupService._parseArchive at line 614. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/backup_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/services/backup_service.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7428249d497538339a7742e05b320bb0497a075843f02c1f925d7532b3377839"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/home_tab_widgets.dart: lib/screens/home_tab_widgets.dart changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _SearchProviderDropdown.build at line 8. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/home_tab_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/screens/home_tab_widgets.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"81232ca05e93ac79fcad8303fccca1abc0ee29cc68522312de5e6a02a3f1ebc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/providers/local_library_provider.dart: lib/providers/local_library_provider.dart changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LocalLibraryNotifier._loadFromDatabase at line 277. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/providers/local_library_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/providers/local_library_provider.dart"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0409b1a8eb875bd697b412bd49b3afa558ca7fa57f86233f213c7d3adb4d6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/files_settings_page.dart: lib/screens/settings/files_settings_page.dart changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in _FilesSettingsPageState.build at line 125. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/files_settings_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/screens/settings/files_settings_page.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"abec3d99174106405734e36c583846261f05b79da3a167da7c332b953296c138"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/mornye_library_screen.dart: lib/screens/mornye_library_screen.dart changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in _MornyeLibraryScreenState.build at line 309. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/mornye_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/screens/mornye_library_screen.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08e62a770e768a77bfdfa7f65eeeb4820d8edbc6c5ed85ea5eecc8abc45b5b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/home_tab_intro.dart: lib/screens/home_tab_intro.dart changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _HomeContinueListeningCardState.build at line 672. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/home_tab_intro.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/screens/home_tab_intro.dart"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"1793a1c980504cef7a95c19dd59d78ff8574b26471b961d615ab0f5b2845b12a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/album_detail_header.dart: lib/widgets/album_detail_header.dart changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in AlbumDetailHeader._buildAppBar at line 334. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/album_detail_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/widgets/album_detail_header.dart"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"659c1a3a63d17ba480edb18d9cf8a0f122808581d0d632794287d697f081c0f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/settings_tab.dart: lib/screens/settings/settings_tab.dart changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in _CategoryRow.build at line 1000. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/settings_tab.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/screens/settings/settings_tab.dart"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5320d7a1cacd17e8411d60c91599946ecb61abee54df33b151612705910226"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/track_metadata_edit_sheet.dart: lib/screens/track_metadata_edit_sheet.dart changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _EditMetadataSheetState._save 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/track_metadata_edit_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/screens/track_metadata_edit_sheet.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c770cf17922cd0f0766631e40da078d2d3bb2d12e046440b7d7cdf51a1e3a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mornye_artist_header.dart: lib/widgets/mornye_artist_header.dart changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _MornyeArtistSurfaceState.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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mornye_artist_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/widgets/mornye_artist_header.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc28178f96b79ffd5cc954cd8d53b35cfbb382ed0042993d057c4b99739ad1ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt: android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in DownloadService.processConcurrentNativeRequest at line 1067. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"6439c675933457292e6efe0e6f15955f6497e262bb9c5378d96d6cddb1092e3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mornye_bottom_bar.dart: lib/widgets/mornye_bottom_bar.dart changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in _MornyeBottomBarState.build at line 158. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mornye_bottom_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/widgets/mornye_bottom_bar.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b9c4740c2b13c8d8d30f4e1b3176216bfd4dcb147a12a9174b301be580e748"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/providers/track_provider.dart: lib/providers/track_provider.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in TrackNotifier.fetchFromUrl at line 167. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/providers/track_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/providers/track_provider.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccffd02b5f6f22b5d694d4c736ab9e3c4a4c089a319fbc814ad0f008fad0fe7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/music_player_gapless.dart: lib/services/music_player_gapless.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in _MusicGapless._prepare 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/music_player_gapless.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/services/music_player_gapless.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f434ece65555f84f64a88213db1a30f94372d955adb84f6151fc9bf58bde522"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/features/link_remote_playback.dart: lib/services/link/features/link_remote_playback.dart changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in LinkPlaysOnDesktop.build at line 35. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/features/link_remote_playback.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/services/link/features/link_remote_playback.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b79c742e82c27af79c6176b788e7f35394ccb39271b217bdb990da8802b79c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/history_database.dart: lib/services/history_database.dart changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in HistoryDatabase.updateFilePath at line 622. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/history_database.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/services/history_database.dart"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"344e0148e766366da4c6a71ed63d87dfdc9df66f3cac918fcfbde243108fd1fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/setup_screen.dart: lib/screens/setup_screen.dart changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in _SetupScreenState._selectDirectory at line 411. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/setup_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/screens/setup_screen.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"569925d94b69bcaa3bd9574ffd8d7f457ee00a3b8931f50d6656d586c3494e2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/desktop/link_desktop_host.dart: lib/services/link/desktop/link_desktop_host.dart changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in LinkDesktopHost.exportCatalog at line 1024. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/desktop/link_desktop_host.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/services/link/desktop/link_desktop_host.dart"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"03400047ccf4c892b80e1e8d76a9d1401a6162c8a9967f7e11c2baad86dcf813"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/utils/lyrics_parser.dart: lib/utils/lyrics_parser.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in LyricsParser._parseTtml at line 645. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/utils/lyrics_parser.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/utils/lyrics_parser.dart"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce6623d367f678ecdc4140402966a193117d182c2fdf1c6568b0575e6ff39f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/repo_tab.dart: lib/screens/repo_tab.dart changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _ExtensionItem.build at line 941. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/repo_tab.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/screens/repo_tab.dart"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"504824f009bc4cb50bdd5d64f1e153f255e50da21b517c42e10afc3bfb586bc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/download_settings_page.dart: lib/screens/settings/download_settings_page.dart changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _DownloadSettingsPageState.build at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/download_settings_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/screens/settings/download_settings_page.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0848e588681d9e6830fc208ed7818b633f5d18a498d1f7292cb0127649bf0401"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/download_metadata_embedding.dart: lib/services/download_metadata_embedding.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in DownloadMetadataEmbedding.embed at line 86. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/download_metadata_embedding.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/services/download_metadata_embedding.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed1363c47a0cd9328771c708f80141d5afcfb39087fe36a070ed50bb5c62b25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/desktop/track_table.dart: lib/widgets/desktop/track_table.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in _TrackTableRowViewState.build 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/desktop/track_table.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/widgets/desktop/track_table.dart"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a6ba83e797f35773800de619c7d9d46d38da447035ca33fa6cf0f8dc5b9e46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/music_playback_deck.dart: lib/services/music_playback_deck.dart changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in AudioplayersPlaybackDeck.resume at line 570. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/music_playback_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/services/music_playback_deck.dart"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed816908229c43914e2bafe4b4023fa88e6e55c0ba125efa18736294f1f3c24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/audio_info_sheet.dart: lib/widgets/audio_info_sheet.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in _AudioFacts._output at line 689. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/audio_info_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/widgets/audio_info_sheet.dart"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7852878f3b65ff6bbf2d89214cc806c34eda97a94451a73d5a3bfba7898419d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt: android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in SafDownloadHandler.handleSafLocked at line 94. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3491a6c379e03625f641a82512f7301932191770496d284e0cbc8c047a96b4f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/track_collection_quick_actions.dart: lib/widgets/track_collection_quick_actions.dart changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _TrackOptionsSheet.build at line 264. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/track_collection_quick_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/widgets/track_collection_quick_actions.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"885b74cf3edd3edb2aa98754be75f7858be71ed46fd1c24916226ed70bcec181"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/extensions/src/manager/providers.rs: rust_backend/crates/extensions/src/manager/providers.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in ExtensionManager::provider_operation_value at line 206. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/extensions/src/manager/providers.rs\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":"rust_backend/crates/extensions/src/manager/providers.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4a8107727625c2aaa3a890c425dccb8b29f38240b3dc4d52807412435a7a3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/settings_group.dart: lib/widgets/settings_group.dart changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SettingsSwitchItem.build at line 595. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/settings_group.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/widgets/settings_group.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2309c8bd023df77031076d1d4c9ecfc6b79d05c0ac879f962d41d09d5876f9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/track_card.dart: lib/widgets/track_card.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in TrackCard._buildCard at line 174. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/track_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/widgets/track_card.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea5c1e0557b4d6557a13dc041a080f0b6fc05fe874ba7898d9f4943ea5ced80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/extensions/src/backend/library/scan.rs: rust_backend/crates/extensions/src/backend/library/scan.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Backend::scan_library at line 366. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/extensions/src/backend/library/scan.rs\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":"rust_backend/crates/extensions/src/backend/library/scan.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15d8a7c24490ec6a05d03c542f8afdcccb5658ec639288558b21b59d82ba1f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/extensions/src/backend/cover.rs: rust_backend/crates/extensions/src/backend/cover.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Backend::cache_cover at line 331. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/extensions/src/backend/cover.rs\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":"rust_backend/crates/extensions/src/backend/cover.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9f6f9945569a8cdd7ad8a21b15468581018908030cd5b385dddc0cfbbc6263"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/library_collections_database.dart: lib/services/library_collections_database.dart changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in LibraryCollectionsDatabase.replaceDatabaseFromBackup at line 1167. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/library_collections_database.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/services/library_collections_database.dart"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abcf2983d5c0e67b40dcab6e03af8a33d6447f7cef752529e155b3cf07a6e00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/rust/kotlin/com/zarz/mornye/RustCoreBackendApplication.kt: android/app/src/rust/kotlin/com/zarz/mornye/RustCoreBackendApplication.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in RustCoreBackendApplicationKt.dispatchApplication at line 9. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/rust/kotlin/com/zarz/mornye/RustCoreBackendApplication.kt\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":"android/app/src/rust/kotlin/com/zarz/mornye/RustCoreBackendApplication.kt"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f70e70b7a9bbd1d16c1359a252421fe80576ae7ef8041f486b9e5098a859d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/material_player_layout.dart: lib/widgets/material_player_layout.dart changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in MaterialPlayerLayout.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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/material_player_layout.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/widgets/material_player_layout.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"707dd34bf32e90df30c4dadda1856c33f51d0cca3a759384b3a5290e9d997542"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt: android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in MainActivitySafIoKt.extFromFileName at line 62. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56deaef5bf5ca63e6a90452e55551dcd3fc4c113f300faec7309d540498fe23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/desktop/desktop_navigation.dart: lib/widgets/desktop/desktop_navigation.dart changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DesktopNavigationRail.build at line 600. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/desktop/desktop_navigation.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/widgets/desktop/desktop_navigation.dart"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fe2cb2221a73d42aecc236c121d5e37a5ff1daf66298894ef689947dbad087"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/log_screen.dart: lib/screens/settings/log_screen.dart changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in _LogScreenState.build at line 292. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/log_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/screens/settings/log_screen.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c85153cd8b41aa91cffcfe58ee3bcc5db7496f9e3ddb1030b92775ee995e2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/desktop/desktop_shortcuts.dart: lib/widgets/desktop/desktop_shortcuts.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in _DesktopShortcutsState._run at line 119. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/desktop/desktop_shortcuts.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/widgets/desktop/desktop_shortcuts.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3646b4949f730f57d5584ea72fc37518d2b0f7eda74edba5a9601442c543d3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/mobile/src/data_jobs.rs: rust_backend/crates/mobile/src/data_jobs.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in mornye_mobile::data_jobs::execute at line 54. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/mobile/src/data_jobs.rs\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":"rust_backend/crates/mobile/src/data_jobs.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32ca57e1d9ce10d6d5f1413b65fb0fdbd9a56d9dbdfc820732afb724bf0366e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/playlist_picker_sheet.dart: lib/widgets/playlist_picker_sheet.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _PlaylistPickerSheetContentState.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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/playlist_picker_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/widgets/playlist_picker_sheet.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4c1b281c0de139e6feaf1059b99645d36ddebd110aa2ba902d901dbc888120"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/music_player_autoplay.dart: lib/services/music_player_autoplay.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _MusicAutoplay._fill at line 506. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/music_player_autoplay.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/services/music_player_autoplay.dart"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb97756fb4834daa21d8d1051a67c8bc4cddbb16ece32201f17e90b0622be3fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/lyrics_settings_page.dart: lib/screens/settings/lyrics_settings_page.dart changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LyricsSettingsPage.build at line 26. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/lyrics_settings_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/screens/settings/lyrics_settings_page.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10b74ae2ea7256fdf1c137f5159889a0a7d1271a88dae793f91f53249c5987b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/downloads.rs: rust_backend/crates/core/src/downloads.rs changed 3 times in last 90 days, max cyclomatic complexity 108 in DownloadRequest::update at line 68. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/downloads.rs\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":"rust_backend/crates/core/src/downloads.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ffbf36e789773ecb73ce39a647f8935f0ab8330afcf41b8e7fab273cd4a687"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/desktop/desktop_player_bar.dart: lib/widgets/desktop/desktop_player_bar.dart changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _TrailingControls.build at line 831. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/desktop/desktop_player_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/widgets/desktop/desktop_player_bar.dart"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f206d010dc83faa6b7348843a71291088f3bb78b915a5132e42b52efc4b3058"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/audio_analysis_widget.dart: lib/widgets/audio_analysis_widget.dart changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _AudioAnalysisCardState._analyze at line 234. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/audio_analysis_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/widgets/audio_analysis_widget.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b62e616fbbcbf7fd5820fb0f1f116cadccf03e6a5552bea01396bc717c22361"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mornye_landscape_player.dart: lib/widgets/mornye_landscape_player.dart changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in _MornyeLandscapePlayerState.build at line 112. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mornye_landscape_player.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/widgets/mornye_landscape_player.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bbe6c64e0249d025ec63d2b6b2d1e02e1198b21e1c67c0fa942ab0a022a192"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/downloaded_embedded_cover_resolver.dart: lib/services/downloaded_embedded_cover_resolver.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in DownloadedEmbeddedCoverResolver._runPersistentCacheMaintenance at line 894. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/downloaded_embedded_cover_resolver.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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6423bcea27f68bcac683ebc0af84837f5618e0cf672333024ea3b1a62d4e33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/network_storage_subsonic.dart: lib/services/network_storage_subsonic.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in SubsonicClient.cachedCover at line 553. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/network_storage_subsonic.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/services/network_storage_subsonic.dart"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea133aa69ba945bba3053f2eacd66a9134db98bca72ca34fbe2829315680f146"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/controllers/player_metadata_controller.dart: lib/controllers/player_metadata_controller.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in PlayerMetadataController.load at line 193. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/controllers/player_metadata_controller.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/controllers/player_metadata_controller.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0140b91364ed378985ef87c6c5bf4c30574eb9c8b44cde4e42d11a4d1f464d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/download_service_picker.dart: lib/widgets/download_service_picker.dart changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _ServiceChip.build at line 416. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/download_service_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/widgets/download_service_picker.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f696b6c38ca52f8cce7c329afe3e4a66d831a4b7b6bec3619b777b4121c5411"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/app_bottom_sheet.dart: lib/widgets/app_bottom_sheet.dart changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in AppSheetOption.build at line 607. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/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/widgets/app_bottom_sheet.dart"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf3ab584fd0a218ed52dc80190cf9d588d13381f5150123bafeb79968ced3b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/lyrics_translation.dart: lib/services/lyrics_translation.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in LyricsTranslator.translate at line 367. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/lyrics_translation.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/services/lyrics_translation.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b0daf7d3b0d1b3e49d010ced65a2245b1693d97412a44fc87c8c3b065ad461"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/link_protocol.dart: lib/services/link/link_protocol.dart changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LinkPhoneSong.toJson at line 660. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/link_protocol.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/services/link/link_protocol.dart"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"b714d94f5c196ed4c8734313a653acebe5b67bc9443a7698707efe5fdb9df11c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/tags/write.rs: rust_backend/crates/core/src/tags/write.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in mornye_core::tags::write::flac_header at line 303. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/tags/write.rs\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":"rust_backend/crates/core/src/tags/write.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7513ed4a299daedbc945888e4449f6664d6df18f5e761c147940e7b494c12a36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mornye_context_menu.dart: lib/widgets/mornye_context_menu.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in MornyeContextMenu._action at line 678. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mornye_context_menu.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/widgets/mornye_context_menu.dart"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bd32a70afe12f9e683007fb49da75ccc9f8e4333032ed260fe172626718188"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/update_dialog.dart: lib/widgets/update_dialog.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _UpdateDialogState.build at line 246. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/update_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/widgets/update_dialog.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d255f062625553de4cddcc1307ce844fa4de33f0150da1dcb0766aaaa48ea1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/providers/extension_provider.dart: lib/providers/extension_provider.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ExtensionNotifier.restoreFromBackup at line 698. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/providers/extension_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/providers/extension_provider.dart"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbe2a2f7151d6a0f54d67335c4aabcecbb1758644bd80177b43b8a716e863ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/providers/explore_provider.dart: lib/providers/explore_provider.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ExploreNotifier._restoreFromCache at line 339. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/providers/explore_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/providers/explore_provider.dart"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66deb8f83b194e07c3e20ca0b3049b7c9b2f880c86cb229ea7e903ffcd8071d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/desktop/link_desktop_ops.dart: lib/services/link/desktop/link_desktop_ops.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in LinkDesktopOps.runCommand 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/desktop/link_desktop_ops.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/services/link/desktop/link_desktop_ops.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fb989acc33d574a79ea9ebde0a0cad5708eed6eb312910dca38f2bafe57335"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mornye_selection_pill.dart: lib/widgets/mornye_selection_pill.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in _MornyeSelectionPillState.build at line 157. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mornye_selection_pill.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/widgets/mornye_selection_pill.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c0639c77747b22963c228e628a3743f6aa169ae3137e9bf7ffbd1e244e5ff0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mornye_player_queue.dart: lib/widgets/mornye_player_queue.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in MornyePlayerQueue.build at line 18. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mornye_player_queue.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/widgets/mornye_player_queue.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"443ff686aa0b289c834a88ba392c92534262ff4b638ab307ce0bca7017b69750"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/library_schema.dart: lib/services/library_schema.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in LibrarySchema.rebaseContainerPaths at line 487. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/library_schema.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/services/library_schema.dart"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78876f0817f902299a135a3e93cfe9e174002f51b6d0f946bba7f8531bc7e3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/providers/playback_provider.dart: lib/providers/playback_provider.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in PlaybackController.playTrackList at line 160. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/providers/playback_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/providers/playback_provider.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c17c86d90adcc5cf34cc896cb336fd78525870c7031f1046f29010a05ae959"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/backup_restore_page.dart: lib/screens/settings/backup_restore_page.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _BackupRestorePageState._restoreBackup at line 96. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/backup_restore_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/screens/settings/backup_restore_page.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d4c5e101675d5ed9ac51b46cbe2ec1f361bae19e26b25638bc4423cfd68bf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/extensions/src/repository/model.rs: rust_backend/crates/extensions/src/repository/model.rs changed 5 times in last 90 days, max cyclomatic complexity 42 in RepoExtension::deserialize at line 66. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/extensions/src/repository/model.rs\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":"rust_backend/crates/extensions/src/repository/model.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45694b8d95f6f30e3ec4e9991b27834a58316a3752da7f3ed698703d4d4ec54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/providers/lyrics_translation_provider.dart: lib/providers/lyrics_translation_provider.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in LyricsTranslationController.translate at line 351. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/providers/lyrics_translation_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/providers/lyrics_translation_provider.dart"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e3e84c5c4b8231ce5f1e688d5475a7560747ddec5776bb4ea640e33fbd66cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/models/theme_settings.dart: lib/models/theme_settings.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ThemeSettings.== at line 181. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/models/theme_settings.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/models/theme_settings.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2efeebbd66630e2c69eebe65833474e9d7210829ca399ddfc5f26ee8e27307"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/expressive_playback_transport.dart: lib/widgets/expressive_playback_transport.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _ExpressivePlaybackTransportState.build at line 72. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/expressive_playback_transport.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/widgets/expressive_playback_transport.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f65fef9884a1b8abf27b2b500ca2c10d1666c5c78e69901757931ec388273f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/playable_media.dart: lib/services/playable_media.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PlayableMedia.toMediaItem at line 130. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/playable_media.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/services/playable_media.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"816138f806d008b85ff9be23dced4e6e0eb3becdaa4ebfb5c22a3dd4e792616e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mornye_artwork_contrast.dart: lib/widgets/mornye_artwork_contrast.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in _MornyeArtworkContrastState._sample at line 134. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mornye_artwork_contrast.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/widgets/mornye_artwork_contrast.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de6dfdaeabf382bf7ff2ddba246ea058c6214010498ce037ace7746e0147522"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/apk_downloader.dart: lib/services/apk_downloader.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in ApkDownloader.downloadApk at line 18. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/apk_downloader.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/services/apk_downloader.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86cddf4f9c9c2c9dbdffccb45ec9a68392e6686c99b5c5f65e53436cdf414c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/lyrics/payloads.rs: rust_backend/crates/core/src/lyrics/payloads.rs changed 11 times in last 90 days, max cyclomatic complexity 18 in PaxLine::update at line 39. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/lyrics/payloads.rs\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":"rust_backend/crates/core/src/lyrics/payloads.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"096ccf3d98f3bf196490ee8eb43ec3da9e333b79aea4e0d64bed9f344f33e7aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/extensions/src/manifest.rs: rust_backend/crates/extensions/src/manifest.rs changed 4 times in last 90 days, max cyclomatic complexity 48 in ExtensionManifest::deserialize at line 64. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/extensions/src/manifest.rs\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":"rust_backend/crates/extensions/src/manifest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e986ef64fa30b2fc762ac7e6ed304491fc2beb266cf4448063f9de483571f01c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/link_mirrored_playback.dart: lib/services/link/link_mirrored_playback.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in LinkMirroredPlayback._resolve at line 435. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/link_mirrored_playback.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/services/link/link_mirrored_playback.dart"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f1629f456f076a676cc4497bb94ceed12186e36e358f3c733909a508a56913"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/mobile/src/native_library.rs: rust_backend/crates/mobile/src/native_library.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in mornye_mobile::native_library::import 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/mobile/src/native_library.rs\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":"rust_backend/crates/mobile/src/native_library.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb421c8d86995d0f6db94a45f7e0c3b2bf77508a6463856655034dc36c9e20fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/network_metadata_service.dart: lib/services/network_metadata_service.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in NetworkMetadataService._load at line 196. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/network_metadata_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/services/network_metadata_service.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c428393be91a6615976cbbd4af64a7586d4dc3e8a999f8e572c7b42d0331b486"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/media/hires.rs: rust_backend/crates/core/src/media/hires.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in mornye_core::media::hires::check_file at line 198. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/media/hires.rs\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":"rust_backend/crates/core/src/media/hires.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"466b1c4eafd50dee49efb09034e8f7809b05393e16e491a5e3c5c9c337837945"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/motion_header_banner.dart: lib/widgets/motion_header_banner.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _MotionHeaderBannerState._initialize at line 119. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/motion_header_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/widgets/motion_header_banner.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79a559f90783c337d2533117c5776f619c4034e66fe5abab560fa01103f0837"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/listening_statistics_screen.dart: lib/screens/listening_statistics_screen.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in _ListeningStatisticsScreenState._summarySlivers at line 299. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/listening_statistics_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/screens/listening_statistics_screen.dart"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e32236c2f5313dfa4dae668999ee53736f40bd374c68c133df127a204ee6a80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/client/link_client_controller.dart: lib/services/link/client/link_client_controller.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in LinkClientController._updateDiscovery at line 530. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/client/link_client_controller.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/services/link/client/link_client_controller.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e86e96223c2eafbc73cbf690a10ac64f43b5b5a31e6108f8e74d27c58bc4ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/cache_management_page.dart: lib/screens/settings/cache_management_page.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _CacheManagementPageState.build at line 346. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/cache_management_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/screens/settings/cache_management_page.dart"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4241c371b5465038f3e6e4c5a6464fb872b01ed879b0d5ffe05ba25e265c7e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/autoplay_personalization.dart: lib/services/autoplay_personalization.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in AutoplayPreferenceModel._features at line 147. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/autoplay_personalization.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/services/autoplay_personalization.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ccefa5db219cf247ef68bd604297ec8ae79804139e8f0d873781fcc6f96a76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/donate_page.dart: lib/screens/settings/donate_page.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _MonthlyDonationGoalCard.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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/donate_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/screens/settings/donate_page.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"38605a04a038773a1fc67595545835b1fcff2b69fa0813acc3cd5835166ed679"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/link/link_devices_sheet.dart: lib/widgets/link/link_devices_sheet.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LinkDevicesSheet.build at line 95. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/link/link_devices_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/widgets/link/link_devices_sheet.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee04ea91c0e8c45c495691e38d38ebcf23e8ea821a3ce0c7308e61fd6951b90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/utils/lyrics_timeline.dart: lib/utils/lyrics_timeline.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LyricDisplayLayout.LyricDisplayLayout at line 11. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/utils/lyrics_timeline.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/utils/lyrics_timeline.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"064b422f599cc280416bbec0deb568e0a7db4420f3d69d49031188b4527c4ef6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/tags/library.rs: rust_backend/crates/core/src/tags/library.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in mornye_core::tags::library::read 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/tags/library.rs\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":"rust_backend/crates/core/src/tags/library.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56992fa58434c8d41d595d5040c7f00edd6a007c432a195830fe33abbcd0112"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/desktop/desktop_inspector.dart: lib/widgets/desktop/desktop_inspector.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DesktopInspector.build at line 145. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/desktop/desktop_inspector.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/widgets/desktop/desktop_inspector.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d48db59290b0eb3fecf65a6792ba6ce4e7596d23367e047afb019c16bbf3cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/desktop/link_phone_catalogs.dart: lib/services/link/desktop/link_phone_catalogs.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in LinkPhoneCatalogs._page at line 181. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/desktop/link_phone_catalogs.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/services/link/desktop/link_phone_catalogs.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4759754ca8969a2a8c1ce1fed3058fdc6f41236329ea1a73b9b8813ae4b683c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/SafFileInspection.kt: android/app/src/main/kotlin/com/zarz/mornye/SafFileInspection.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in SafFileInspectionKt.inspectSafFiles at line 90. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/SafFileInspection.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/SafFileInspection.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2400df989f15405d8971ed745756fa23eb47306db62b6fd92538612584604e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/cover_store.dart: lib/services/cover_store.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CoverStore.file at line 153. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/cover_store.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/services/cover_store.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62b8c6a6c130744af81575245559528aad1499d6c805d9d21693cc6144ccd73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/batch_convert_sheet.dart: lib/widgets/batch_convert_sheet.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _BatchConvertSheetState.build at line 83. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/batch_convert_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/widgets/batch_convert_sheet.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ba9a5587277b112b3c9e8d68af85aff87134f5428bda18aaedc464737a24b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/playback_seek_slider.dart: lib/widgets/playback_seek_slider.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _PlaybackSeekSliderState.build at line 88. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/playback_seek_slider.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/widgets/playback_seek_slider.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a498ff5a46021347a891abb55145e14cc7e5798c2d43a8cd25fbac26b602de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/providers/download_queue_state.dart: lib/providers/download_queue_state.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in DownloadQueueLookup.withoutIndex at line 437. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/providers/download_queue_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/providers/download_queue_state.dart"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b2c19de3146e3494b38c8e2c6106de1139ca5bdc1621e04bab42786cf24922"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/extensions/src/backend/reenrich.rs: rust_backend/crates/extensions/src/backend/reenrich.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Backend::resolve_reenrich_request at line 215. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/extensions/src/backend/reenrich.rs\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":"rust_backend/crates/extensions/src/backend/reenrich.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff3322406c5bbf77e10841ca5aa4172f1085959573b42c27a13a03d2ba5e05b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/cover_download_service.dart: lib/services/cover_download_service.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in CoverDownloadService.saveRemoteCover at line 18. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/cover_download_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/services/cover_download_service.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93f14e452422eec31bbefb6dda08e05eaee0667290f8fea34355f3677cacdae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/app_state_database.dart: lib/services/app_state_database.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AppStateDatabase.getPendingDownloadQueueRows at line 325. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/app_state_database.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/services/app_state_database.dart"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"822655e23e960434a8d8a9d9c78198231546a39b3bef90dd11a9fe99426d3c41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/features/link_handoff.dart: lib/services/link/features/link_handoff.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LinkHandoff._sendQueue at line 393. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/features/link_handoff.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/services/link/features/link_handoff.dart"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"0271c49a5970c05d75c30e18854544cef7985d42b47837d9025125922b1920f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/app_alert_dialog.dart: lib/widgets/app_alert_dialog.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in AppAlertDialog.build at line 240. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/app_alert_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/widgets/app_alert_dialog.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e9b53064ddb008f09f6d32f2e886a9bbd79532b4cb5c6ca22cce2a0a4b2a56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/desktop/link_player.dart: lib/services/link/desktop/link_player.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in RuntimeLinkPlayerPort.snapshot at line 247. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/desktop/link_player.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/services/link/desktop/link_player.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff033395d6a675415db2f26f2c0aecff8c523a4ad3a62ddc0ba5681eb43ce72f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/UsbBitPerfectPlugin.kt: android/app/src/main/kotlin/com/zarz/mornye/UsbBitPerfectPlugin.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in UsbBitPerfectPlugin.onMethodCall 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/UsbBitPerfectPlugin.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/UsbBitPerfectPlugin.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4abba26c89aa24d121dfec098a51d56f31bcf69f745062b8e708a28fd626458"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/mobile/src/native_listing.rs: rust_backend/crates/mobile/src/native_listing.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in mornye_mobile::native_listing::execute at line 8. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/mobile/src/native_listing.rs\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":"rust_backend/crates/mobile/src/native_listing.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5a4f1074a5bb5803bde489eba22a970a253fe16ddcaa784f94f0527539984c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/automix_analysis.dart: lib/services/automix_analysis.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in AutoMixPlan.create at line 240. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/automix_analysis.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/services/automix_analysis.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"722e3e056f3863abc722a8ac214587ee5dd1e327c450c6b5e5a505f988ea8e82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/concert_detail_screen.dart: lib/screens/concert_detail_screen.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _ConcertDetailScreenState._materialPage at line 446. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/concert_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/screens/concert_detail_screen.dart"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba47ea09d089e80b5840ad0c6d7fda874918a48826c82968ce49bff247687c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/features/link_desktop_remote.dart: lib/services/link/features/link_desktop_remote.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in LinkDesktopRemote._applyLocally at line 211. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/features/link_desktop_remote.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/services/link/features/link_desktop_remote.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"037ddd8310b2c06f91aaa3657f356ee32bde0e35752a91ac7ec219ac3c14998f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/UsbDirectPlayback.kt: android/app/src/main/kotlin/com/zarz/mornye/UsbDirectPlayback.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in UsbDirectPlayback.command at line 81. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/UsbDirectPlayback.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/UsbDirectPlayback.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e48b9c49bfc2612cf5150b2f1fcdf1dafc0beac86947db09c24c46fba8ece73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/download_file_finalizer.dart: lib/services/download_file_finalizer.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in DownloadFileFinalizer.autoConvert at line 194. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/download_file_finalizer.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/services/download_file_finalizer.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacc8492cbfd00a65e2c87a949ee1705d5df89043abd230b7509fbb9deaa5931"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/network/src/client.rs: rust_backend/crates/network/src/client.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in NetworkSession::execute_stream at line 519. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/network/src/client.rs\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":"rust_backend/crates/network/src/client.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"5311131d39baa9792366522878de0b45cad019e3ed2fc6b3f9e22fed17a82a21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/update_checker.dart: lib/services/update_checker.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in UpdateChecker.checkForUpdate at line 335. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/update_checker.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/services/update_checker.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f609ebac9788e40feb24b33dd358c7cb8f046545f3e05edb4f69dfc342ff7862"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/library_settings_page_widgets.dart: lib/screens/settings/library_settings_page_widgets.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in _LibrarySourceSettingsItem.build at line 167. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/library_settings_page_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/screens/settings/library_settings_page_widgets.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb301cdf90c99aa869b1d7f38f5497468d3e5ea5e95a5ad978935d56751b403"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/exclusive_output_deck.dart: lib/services/exclusive_output_deck.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ExclusiveOutputDeck._switchTo at line 94. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/exclusive_output_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/services/exclusive_output_deck.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fd6cd2a7d22d67210df4e54ad9422378b18eb18e65fdf06a24b886a8f2a06a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/audio_metadata_mapper.dart: lib/services/audio_metadata_mapper.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in AudioMetadataMapper.convertToId3Tags at line 336. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/audio_metadata_mapper.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/services/audio_metadata_mapper.dart"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66b63d30522d570e992a405a2a64fe43054a8de4f889fb7127b92f099048eff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/app_search_field.dart: lib/widgets/app_search_field.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in AppSearchField.build at line 53. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/app_search_field.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/widgets/app_search_field.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca5dfd49e59c35d2a7f3f97b60725438e1ee21085da149d9449bb4ad2431fc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/mobile/src/native_library/path_keys.rs: rust_backend/crates/mobile/src/native_library/path_keys.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in mornye_mobile::native_library::path_keys::build at line 233. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/mobile/src/native_library/path_keys.rs\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":"rust_backend/crates/mobile/src/native_library/path_keys.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b873a3472b02fb2857673ab94ba9565edb270c2ebd7541516fb2fa717cf9487"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceSnapshot.kt: android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceSnapshot.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in DownloadServiceSnapshotKt.pollNativeWorkerProgress at line 311. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceSnapshot.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceSnapshot.kt"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b3996093561357e401b37982e26abb9700432a60ac1d40795ad3fc1cf3f534"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/lyrics/lrc.rs: rust_backend/crates/core/src/lyrics/lrc.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in mornye_core::lyrics::lrc::with_metadata at line 193. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/lyrics/lrc.rs\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":"rust_backend/crates/core/src/lyrics/lrc.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f88771aea138c75402ac1d709011a9117eaad099b646895ee5a44597ceb4bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/metadata_persistence_service.dart: lib/services/metadata_persistence_service.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MetadataPersistenceService._saveLocal at line 111. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/metadata_persistence_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/services/metadata_persistence_service.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8770504ff9551bdaed4efc86f2985ecc0f4d848673e4f263c7076c9f4f3e88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/desktop/link_phone_sources.dart: lib/services/link/desktop/link_phone_sources.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in LinkPhoneSources.onMessage at line 424. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/desktop/link_phone_sources.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/services/link/desktop/link_phone_sources.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fb747ca1cb524addf289c18aec86681849853afc2db144825d9f59e1b3062b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/ffmpeg_conversion.dart: lib/services/ffmpeg_conversion.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in FFmpegConversion._convertToLossless at line 360. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/ffmpeg_conversion.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/services/ffmpeg_conversion.dart"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eeceadc4bc6e589f15a1d3ab674aac1fc220f677f33cb5d5cdce2a57ec569fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/metadata/reenrich.rs: rust_backend/crates/core/src/metadata/reenrich.rs changed 2 times in last 90 days, max cyclomatic complexity 56 in Request::update at line 40. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/metadata/reenrich.rs\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":"rust_backend/crates/core/src/metadata/reenrich.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a0d7484610374a45a5a3d73bdebdf93a1092915dd387698685cec5a7d7d56e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/lyrics_provider_priority_page.dart: lib/screens/settings/lyrics_provider_priority_page.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _LyricsProviderPriorityPageState._getLyricsProviderInfo at line 201. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/lyrics_provider_priority_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/screens/settings/lyrics_provider_priority_page.dart"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"21394e8a9ba193f3e5e9354f39d6f0b119cfc5a2e33afbb0b83edc3d44ee6d83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mornye_player_artwork.dart: lib/widgets/mornye_player_artwork.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _MornyePlayerArtworkState.build at line 35. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mornye_player_artwork.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/widgets/mornye_player_artwork.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1479967aed3e64eee712f5ade8e1d0406d739b7cc584e1eb8d43f65a0aa8626"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/features/link_phone_session.dart: lib/services/link/features/link_phone_session.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in LinkPhoneSession.apply at line 226. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/features/link_phone_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/services/link/features/link_phone_session.dart"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa3d8a17a8639d8f6fa50cbd75a341486a90f290749f08b4b2532d7ff0c9cee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/listening_rewind.dart: lib/services/listening_rewind.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ListeningRewind.compute at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/listening_rewind.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/services/listening_rewind.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f48a23f1b277cffd5d43bdcf4508910b10f901b2f8ffb1fc029e1254ad5741"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/library_track_selection_bar.dart: lib/widgets/library_track_selection_bar.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in LibraryTrackSelectionBar.build at line 47. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/library_track_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/widgets/library_track_selection_bar.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb7f7af0a5c4017005f2e272d62458e56866e93508b2971e53a8307cc6682b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/replaygain_service.dart: lib/services/replaygain_service.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ReplayGainService._writeLocalTags at line 135. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/replaygain_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/services/replaygain_service.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c26bd5f45ec77c312c8005ad4551de51587229ca55f83763bea111c740c07ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/home_tab_search_wide.dart: lib/screens/home_tab_search_wide.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _SearchCoverCell.build at line 804. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/home_tab_search_wide.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/screens/home_tab_search_wide.dart"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8333ab52fe6d8c0bc9b1f2c1ba95fd7f27e734effdd27af2d24a4c07bd14a8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/automix_analyzer.dart: lib/services/automix_analyzer.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AutoMixAnalyzer.analyze at line 119. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/automix_analyzer.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/services/automix_analyzer.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"02acce56a1eca5df3034e04e873debf7e9ee56d150e23724d6701f16b41f2fff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/link/src/subsonic.rs: rust_backend/crates/link/src/subsonic.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in mornye_link::subsonic::dispatch at line 138. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/link/src/subsonic.rs\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":"rust_backend/crates/link/src/subsonic.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd02437982537fb32450d4c5c52b8da36db63002dc916ea771fb7349b049132"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/audio_output_button.dart: lib/widgets/audio_output_button.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _AudioOutputButtonState._showPicker 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/audio_output_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/widgets/audio_output_button.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"909526922b418d46172545146aa60e750cd4e156dbb8d03491a0fb6b56883dfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/download_container_finalizer.dart: lib/services/download_container_finalizer.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in DownloadContainerFinalizer.finalize at line 27. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/download_container_finalizer.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/services/download_container_finalizer.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6177e99954dbb11a07b286f841028cf986704a57bd7090df861ee49f5e1f589"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/app_crash_banner.dart: lib/widgets/app_crash_banner.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _AppCrashBannerState.build at line 30. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/app_crash_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/widgets/app_crash_banner.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb410981c203c8a0349e451e6e7bad7d5af14c7955ad032768d0c73aa324b3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/tags/write/riff.rs: rust_backend/crates/core/src/tags/write/riff.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in mornye_core::tags::write::riff::edit at line 6. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/tags/write/riff.rs\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":"rust_backend/crates/core/src/tags/write/riff.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea179e6abaf15a10ca9e9fd52afe431fd60d0845019d626ed5133a14c45f3f4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/history_schema.dart: lib/services/history_schema.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in HistorySchema.upgrade at line 82. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/history_schema.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/services/history_schema.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f327f2aa79ce37b7cf794579aaceaa31096cbf7d263ef881151875c5b1aa8c39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/ffmpeg_metadata.dart: lib/services/ffmpeg_metadata.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in FFmpegMetadata.embedMetadataToM4a at line 325. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/ffmpeg_metadata.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/services/ffmpeg_metadata.dart"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"382c9df80f7e091fd1516a2c01d37f8ec6dc25edfca8dcb841f525728674934e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/link/link_library_actions.dart: lib/widgets/link/link_library_actions.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in LinkLibraryJobRow.build at line 654. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/link/link_library_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/widgets/link/link_library_actions.dart"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"3888ea9709cd6f4fbc232a3115d6e7eaffd8abcb404d1da0829358d80a0fa400"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/app_choice_chip.dart: lib/widgets/app_choice_chip.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in AppChoiceChip.build at line 27. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/app_choice_chip.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/widgets/app_choice_chip.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcba2310a45f6a5506bf24d049967a3528937443a6489867e6cc0153199c24b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/music_haptics.dart: lib/services/music_haptics.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in MusicHapticsAnalyzer.analyze at line 274. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/music_haptics.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/services/music_haptics.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8260a3ff84c77c2b3097b31b0a297083295c654bd86eaf0be4267e7f691f337"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/extensions/src/download/segments.rs: rust_backend/crates/extensions/src/download/segments.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in mornye_extensions::download::segments::fetch at line 256. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/extensions/src/download/segments.rs\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":"rust_backend/crates/extensions/src/download/segments.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bec0a869042c10badd53c5440d645aacfab429f0daee45b9814444c56451872"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/tags/containers.rs: rust_backend/crates/core/src/tags/containers.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in mornye_core::tags::containers::ogg_packets_until at line 245. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/tags/containers.rs\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":"rust_backend/crates/core/src/tags/containers.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"701e7b7aeb03b6b6590e2c1a2e1224414eff429119e9ee30fb34d7a8557576f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/automix_effect_renderer.dart: lib/services/automix_effect_renderer.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AutoMixEffectRenderer.render 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/automix_effect_renderer.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/services/automix_effect_renderer.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16e00598e9c237927e1dfa8490a286036eb0589fb8b62ce914c423aca483f58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/tags/file.rs: rust_backend/crates/core/src/tags/file.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in mornye_core::tags::file::read_metadata at line 34. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/tags/file.rs\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":"rust_backend/crates/core/src/tags/file.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94e0e045ffa180a69a0ea299c1cc8505f3d793f0608a6b533a351051fda0b11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/link_desktop_settings_page.dart: lib/screens/settings/link_desktop_settings_page.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in LinkDesktopSettingsPage.build at line 35. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/link_desktop_settings_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/screens/settings/link_desktop_settings_page.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c31cfc33e946665c06fc4a8335b67b099e8685f3bc157f339b9bf55714e5ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/hires_check_card.dart: lib/widgets/hires_check_card.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in _HiResCheckCardState.build 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/hires_check_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/widgets/hires_check_card.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2012c521bd95347fdebed0b838570d7997cff35fb64c9a197bc92e049fb53dcf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/extensions/src/host.rs: rust_backend/crates/extensions/src/host.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in mornye_extensions::host::register at line 16. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/extensions/src/host.rs\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":"rust_backend/crates/extensions/src/host.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3518da5dd4d6ea4b4ef212461edbce17f8e683f3598bb6b1cd1f67d53494d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/playback_feedback.dart: lib/widgets/playback_feedback.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _PlaybackFeedbackState.initState at line 31. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/playback_feedback.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/widgets/playback_feedback.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c3894ded7ddd1ce4ffa290c08961056553412acb011231d03282c865ae90f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/lyrics_options_button.dart: lib/widgets/lyrics_options_button.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _LyricsOptionsButtonState._showMenu at line 217. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/lyrics_options_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/widgets/lyrics_options_button.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"618c56cb7969917621f3453bdccde8b66ecc372225e153df68dbc17d0e3dddbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/providers/src/resolver/http.rs: rust_backend/crates/providers/src/resolver/http.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ResolverHttp::execute 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/providers/src/resolver/http.rs\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":"rust_backend/crates/providers/src/resolver/http.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c251536053b850ddf64682e86387fc8d34bdfd3b8629a3dc792612d0c09a08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/audio_analysis_runner.dart: lib/services/audio_analysis_runner.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AudioAnalysisRunner._getMediaInfo at line 415. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/audio_analysis_runner.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/services/audio_analysis_runner.dart"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"253cc1b385466fa7eeefa9c5f17e928ac56717586bf15ddac038d3b4a730ba14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/whats_new_screen.dart: lib/screens/whats_new_screen.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _WhatsNewScreenState.build at line 133. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/whats_new_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/screens/whats_new_screen.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a97e0ae11212c81cbc5fa829aec1e5948c56f8e65c077c3b1b22c348851f45b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/mobile/src/usb_audio/transport.rs: rust_backend/crates/mobile/src/usb_audio/transport.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Session::run at line 536. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/mobile/src/usb_audio/transport.rs\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":"rust_backend/crates/mobile/src/usb_audio/transport.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc5f91ff57517c68d32a7566976cabb3dc34b6b6107653909c9cd6e6e628a23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/com/zarz/mornye/ImpellerCompatibility.kt: android/app/src/main/kotlin/com/zarz/mornye/ImpellerCompatibility.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ImpellerCompatibilityKt.shouldDisableImpeller at line 68. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/ImpellerCompatibility.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/ImpellerCompatibility.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ef56413ee25168cfa747e9db886bea13a739cec78fc69f4ff10fcd907c45ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/metadata/deezer/catalog.rs: rust_backend/crates/core/src/metadata/deezer/catalog.rs changed 2 times in last 90 days, max cyclomatic complexity 32 in FullAlbum::update at line 54. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/metadata/deezer/catalog.rs\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":"rust_backend/crates/core/src/metadata/deezer/catalog.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0823e330f37a47dbab467fe31619007bb911676f8740b9c8c63fd6676e99e4b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/mornye_playback_button.dart: lib/widgets/mornye_playback_button.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _MornyePlaybackButtonState.build at line 117. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/mornye_playback_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/widgets/mornye_playback_button.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a16c43320bc1d94b135cec77919b00e4386a991f11450889ed1542f666f86ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/metadata/deezer.rs: rust_backend/crates/core/src/metadata/deezer.rs changed 2 times in last 90 days, max cyclomatic complexity 30 in Track::update at line 26. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/metadata/deezer.rs\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":"rust_backend/crates/core/src/metadata/deezer.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9683b0c0b8a462481237206dba9e5e84d3579dcad2f30d14dfc0ec88bf47c0b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ios/Runner/DownloadProgressSubscription.swift: ios/Runner/DownloadProgressSubscription.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in DownloadProgressSubscription.poll 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- ios/Runner/DownloadProgressSubscription.swift\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":"ios/Runner/DownloadProgressSubscription.swift"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead3c058b3b6d32a4dbc515b1a81aa0bb159a55e1a366eb6f1def3fae22e77e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/app_content_card.dart: lib/widgets/app_content_card.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in AppContentCard.build at line 40. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/app_content_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/widgets/app_content_card.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e24835804a76684a9afa9b01bfc641065e58d38a28849985c5e796fb80ddb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/desktop/link_web_covers.dart: lib/services/link/desktop/link_web_covers.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in LinkWebCovers._run at line 431. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/desktop/link_web_covers.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/services/link/desktop/link_web_covers.dart"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca6f251509e7eb8aa275a2a90cab5fb3c5cb4949e355371f44bc482fcb92709"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/screens/settings/lyrics_ai_translation_page.dart: lib/screens/settings/lyrics_ai_translation_page.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _LyricsAiTranslationPageState.build at line 55. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/lyrics_ai_translation_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/screens/settings/lyrics_ai_translation_page.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9405a528f7fb517024f2a848523af6ce0467a4a6e9ff52efa51ee5144124f718"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/app_action_button.dart: lib/widgets/app_action_button.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in AppActionButton.build at line 34. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/app_action_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/widgets/app_action_button.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a99913624b017b192466f757f5fccaf9ee4eda1af33fa93026374942950ec6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/desktop/desktop_downloads_button.dart: lib/widgets/desktop/desktop_downloads_button.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in _DesktopDownloadsButtonState.build at line 64. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/desktop/desktop_downloads_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/widgets/desktop/desktop_downloads_button.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"efab49fcb9a32652c82f00076a4226159cbf0c394c9f7729ae3be50eb0317ec2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/providers/src/lyrics/builtin.rs: rust_backend/crates/providers/src/lyrics/builtin.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in BuiltinLyricsClient::fetch_once 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/providers/src/lyrics/builtin.rs\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":"rust_backend/crates/providers/src/lyrics/builtin.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a715ff6360a9a334429f53d4f35c8eff50e6c0ce5e1df639f390583e7b7c43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/lyrics_translation_sharing.dart: lib/services/lyrics_translation_sharing.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in SharedLyricsTranslation.fromJson at line 46. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/lyrics_translation_sharing.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/services/lyrics_translation_sharing.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37dd4b506684ee6f7e67470050cb3a96fc826cdae07de670e29bc617283e1e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check_backend_ios.py: scripts/check_backend_ios.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in check_backend_ios.audit at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- scripts/check_backend_ios.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":"scripts/check_backend_ios.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c373f7e90c9ae441ec22821055d2794aef03d70602f73897bd3328e59234b85a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/core/src/lyrics/lrclib.rs: rust_backend/crates/core/src/lyrics/lrclib.rs changed 2 times in last 90 days, max cyclomatic complexity 20 in LrcLibResponse::update at line 18. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/lyrics/lrclib.rs\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":"rust_backend/crates/core/src/lyrics/lrclib.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74f8ad0338033f970ab6223be6d57f8bc0c883462731309ae78bb8402719d09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/link/src/ws.rs: rust_backend/crates/link/src/ws.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in mornye_link::ws::session at line 244. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/link/src/ws.rs\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":"rust_backend/crates/link/src/ws.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19798f33323bf21d6713f707bfd50b6d8416f494b76503fa901320e2e357758"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/services/link/features/link_save_offline.dart: lib/services/link/features/link_save_offline.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LinkOfflineSaver.save at line 354. 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/features/link_save_offline.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/services/link/features/link_save_offline.dart"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"a895f0f1b1a17593a7f593f258373e1d4480d4fa5b9985bc82fad89f45d84e84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rust_backend/crates/extensions/src/package.rs: rust_backend/crates/extensions/src/package.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ExtensionPackage::open 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/extensions/src/package.rs\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":"rust_backend/crates/extensions/src/package.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d391a5541cbe4507ee15b327fb0ed505412e05a349760d7fc6aab545efdec6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/widgets/desktop/hover_play_button.dart: lib/widgets/desktop/hover_play_button.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in _DesktopHoverPlayButtonState.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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/desktop/hover_play_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/widgets/desktop/hover_play_button.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6996f09bc4f7d57b08714706d7067d7aeded6283f0eaeba9fe0bb1ab8222e3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/services/notification_service.dart: lib/services/notification_service.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 12 (its worst body is NotificationService._details at line 310), 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): size notification mark for the status bar\u201D; \u201Cfix(link): sync playback modes and restore queue covers\u201D; \u201Cfix(notifications): handle Linux launch callbacks and contain queue alerts\u201D; \u201Cfix(library): recover interrupted scans and stale notifications\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/notification_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/services/notification_service.dart"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"de84d98381ec6e738adac01c2bf76e04064ab49035837ddb8e0c001ea005c56a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/services/link/sync/link_sync_protocol.dart: lib/services/link/sync/link_sync_protocol.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 13 (its worst body is LinkHistoryEvent.fromJson at line 209), 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(link): exchange missing listening statistics covers\u201D; \u201Cfix(link): keep a song\u0027s network cover when a peer\u0027s edit comes back\u201D; \u201Cfix(link): sync collection songs without network cover references\u201D; \u201Cfix(link): sync no loopback artwork from older statistics\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/sync/link_sync_protocol.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/services/link/sync/link_sync_protocol.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"919baaf6aaffadbd91939d062ea6613f1c00b68b2ff475cf3655d77dd02451ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/services/library_native_adapter.dart: lib/services/library_native_adapter.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 LibraryNativeAdapter._import at line 213), 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(library): keep scanning when a row has no scan time or is invalid\u201D; \u201Cfix(library): prune stale NAS rows outside failed scan paths\u201D; \u201Cfix(desktop): report the desktop platform to native jobs and logs\u201D; \u201Cfix(library): retry transient SQLite locks before scan transactions\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/library_native_adapter.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/services/library_native_adapter.dart"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eaaee07596d68964292c0a6cfda580bb73aaf3e2c430cc2ce8a496c101b12a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust_backend/crates/core/src/tags.rs: rust_backend/crates/core/src/tags.rs 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 10 (its worst body is mornye_core::tags::read_tags at line 259), 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(library): read Opus tags with large artwork\u201D; \u201Cfix(downloads): trust the audio bytes over a provider\u0027s FLAC label\u201D; \u201Cfix(library): index songs whose tags fail to parse\u201D; \u201Cfix(metadata): read tags and covers from MP4 files named opus\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/core/src/tags.rs\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":"rust_backend/crates/core/src/tags.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11741fd9bb4872f0fc62cc7fff964a8ad051443a3dc2da8dba5326cff640733"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/widgets/audio_quality_badges.dart: lib/widgets/audio_quality_badges.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 2 (its worst body is ExplicitTrackTitle.build at line 94), 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): align Material screens with the design guide\u201D; \u201Cfix(ui): show Dolby Atmos as a compact logo\u201D; \u201Cfix(ui): align explicit badges with track titles\u201D; \u201Cfix(ui): align metadata and wrap track badges\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/audio_quality_badges.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/widgets/audio_quality_badges.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f9848ae71a0d2785df5643139c81636e8f81d0d28acc8ca07d56d1b4bbb153"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/screens/settings/keyboard_shortcuts_page.dart: lib/screens/settings/keyboard_shortcuts_page.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 14 (its worst body is KeyboardShortcutsPage.build at line 19), 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(desktop): keep Escape on the page and record every destination\u201D; \u201Cfix(desktop): hide window controls in fullscreen\u201D; \u201Cfix(desktop): list full screen and borderless shortcuts\u201D; \u201Cfix(desktop): steady pull to refresh on macOS and add Cmd\u002BR\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/screens/settings/keyboard_shortcuts_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/screens/settings/keyboard_shortcuts_page.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e085985cae2924e21c99f0d451172eaf60646fc26cdccbe5269ddc5d2309c1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/services/link/desktop/link_catalog_exporter.dart: lib/services/link/desktop/link_catalog_exporter.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 6 (its worst body is LinkCatalogExporter.export at line 351), 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(link): export web cover copies as webCoverPath\u201D; \u201Cfix(link): use a web cover copy only for songs without a picture\u201D; \u201Cfix(link): serve desktop web-only covers from a lasting Link folder\u201D; \u201Cfix(link): show a downloaded song\u0027s cover when a phone plays 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/desktop/link_catalog_exporter.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/services/link/desktop/link_catalog_exporter.dart"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"770ca8024e7db95854583f9a636311c90d066742136860f06d46342cac80dfb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust_backend/crates/mobile/src/library_metadata.rs: rust_backend/crates/mobile/src/library_metadata.rs 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 9 (its worst body is mornye_mobile::library_metadata::read_library_metadata_from_descriptor at line 87), 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(covers): key library thumbnails by 128-bit SHA-256\u201D; \u201Cfix(library): index songs whose tags fail to parse\u201D; \u201Cfix(metadata): preserve original artwork resolution for SAF files\u201D; \u201Cfix(android): preserve remote SAF descriptors for audio and artwork\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/mobile/src/library_metadata.rs\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":"rust_backend/crates/mobile/src/library_metadata.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda07f8867d87cbf76fde9fd821cfaf16519aa78726f622718d23134fab9b336"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/services/media_library_browser.dart: lib/services/media_library_browser.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 13 (its worst body is MediaLibraryBrowser.queueFor at line 571), 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(player): look for the cover provider again after a failure\u201D; \u201Cfix(player): show local covers in Android Auto browse lists\u201D; \u201Cfix(player): keep stored loopback covers out of the Android Auto browser\u201D; \u201Cfix(library): keep scanned songs unplayable while Local Library is off\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/media_library_browser.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/services/media_library_browser.dart"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38169559f85ffa705398978d69c2fdbcf278442fc0b1440d36c3a5202c5c30a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: rust_backend/crates/link/src/subsonic/covers.rs: rust_backend/crates/link/src/subsonic/covers.rs 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 11 (its worst body is mornye_link::subsonic::covers::sniff at line 410), 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(link): rank web cover copies after every other cover\u201D; \u201Cfix(link): key extracted cover pictures by their audio file\u201D; \u201Cfix(link): fall back when a listed cover file is gone\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- rust_backend/crates/link/src/subsonic/covers.rs\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":"rust_backend/crates/link/src/subsonic/covers.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b172d7523c504c13ad2ed15060d70694dfa2349d76524ef8b264ed75843dc9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/providers/recent_access_provider.dart: lib/providers/recent_access_provider.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 14 (its worst body is RecentAccessNotifier._loadHistory at line 142), 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(covers): keep temporary player covers out of Loved and recents\u201D; \u201Cfix(recents): preserve early edits during history loading\u201D; \u201Cfix(home): clear recent activity permanently\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/providers/recent_access_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/providers/recent_access_provider.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cdf94c2bff6e30d9b3870bfa0d7988a2fd4f0375256b0375ef2f1382921bb4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/widgets/explore_featured_section.dart: lib/widgets/explore_featured_section.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 ExploreFeaturedSection.build at line 19), 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(home): run Material desktop Home across the whole pane\u201D; \u201Cfix(home): anchor track menus to their source cards\u201D; \u201Cfix(ui): resolve album titles and show Home explicit badges\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/explore_featured_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/widgets/explore_featured_section.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0695bb6fbd816bce343c3d3e2282d55e4d17d574d99c87cfe191299070b150af"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/widgets/lyric_gap_indicator.dart: lib/widgets/lyric_gap_indicator.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 13 (its worst body is _LyricGapIndicatorState.build at line 41), 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(lyrics): slow instrumental dot pulse\u201D; \u201Cfix(lyrics): pulse instrumental dots in unison\u201D; \u201Cfix(lyrics): pulse instrumental countdown dots\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/widgets/lyric_gap_indicator.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/widgets/lyric_gap_indicator.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"150d0d291aa406004dbb67a0adf322ab5a67bc4af4633e384cded2f33dbdb531"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: macos/Runner/AppDelegate.swift: macos/Runner/AppDelegate.swift 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 5 (its worst body is AppDelegate.application at line 22), 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(macos): keep one instance for debug builds too\u201D; \u201Cfix(macos): give the Window menu the system tiling items\u201D; \u201Cfix(desktop): report crashes only with evidence and keep one macOS instance\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- macos/Runner/AppDelegate.swift\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":"macos/Runner/AppDelegate.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5110066e8190fa3715d23859e477b182369340d27551a3d57c3dfa094abfaa55"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/services/link/features/link_phone_library.dart: lib/services/link/features/link_phone_library.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 8 (its worst body is LinkPhoneLibrary._build at line 393), 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(link): send a phone\u0027s large embedded covers shrunk\u201D; \u201Cfix(link): fetch covers of downloaded phone songs on the desktop\u201D; \u201Cfix(link): keep a phone\u0027s song list until its Library changes\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/features/link_phone_library.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/services/link/features/link_phone_library.dart"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"165b47286691efa4e18a1654b9b30b22a0c686d5e1685056f0522e6400bb4157"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: android/app/src/main/kotlin/com/zarz/mornye/CoverContentProvider.kt: android/app/src/main/kotlin/com/zarz/mornye/CoverContentProvider.kt 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 6 (its worst body is CoverContentProvider.openCover at line 83), 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): close a cover descriptor on any failed check\u201D; \u201Cfix(android): show local covers in Android Auto\u0027s queue view\u201D; \u201Cfix(android): check cover names per folder and serve the opened file\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/com/zarz/mornye/CoverContentProvider.kt\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":"android/app/src/main/kotlin/com/zarz/mornye/CoverContentProvider.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"af694bc1d8d254ada3fd0094ea8b96ebfd15425e507de8077300bf79975299f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/services/music_player_covers.dart: lib/services/music_player_covers.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 13 (its worst body is _MusicCovers._show at line 99), 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(covers): keep a stored tag cover when a read has none\u201D; \u201Cfix(covers): keep desktop covers fresh and drop removed tag covers\u201D; \u201Cfix(covers): show a known tag cover and fetch changed covers on 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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/music_player_covers.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/services/music_player_covers.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1f6496b33ff93366daf6e1028e2aa7f2fc5d0e0b9b6470d6f0a99864271f62"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/services/link/desktop/link_phone_playback.dart: lib/services/link/desktop/link_phone_playback.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 2 (its worst body is LinkPhonePlayback.send at line 37), 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(link): show stored covers on mirrored playback\u201D; \u201Cfix(link): hold seek position until the playing device confirms\u201D; \u201Cfix(link): resolve phone artwork on desktop and refresh late covers\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-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 19:09:37 \u002B07:00\u0027 --until=\u00272026-11-07 19:09:37 \u002B07:00\u0027 --full-history --no-merges -- lib/services/link/desktop/link_phone_playback.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/services/link/desktop/link_phone_playback.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b53e8e506363a9ceed8f4c4ebe1e75d68ec76f07618c0c33618fa0d6f9f7ac4"}},{"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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 4 of 19 project(s) overshoot their size bounds, lowering Project Cohesion to 5.8/10. The most over is \u0060(repository root)\u0060 (250683 LoC, 1262 module-visible types across 27 directories). 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":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","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":"3c3430604656563bb5c7107d3e64bf9778cbbc92eccb1208ea486f56f44dd35a"},"properties":{"commitSha":"ac9141f167a68b017a6a24d671093f0df2d891d6"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"f28272c81576713d7ba0fe0b9d7536ee9549bb34f99c20e9c5d38f454a2ee091"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"ce03149def57ce0b5f3ec7a04394a472d579d57e8c2c464b2bc0a6079269883d"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"e95ed0baeb184f73b8226da7d72e94bcadc47c8342ab7619e5374f776a6dfcb6"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"ef59d40af8e4ad6f6c34faa99ab390e4e5d78a844bcee494b32c7e2fb8f8a562"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"6600bdc1a190dd96b47b0aa92e1e2ef0280058ab195b385d4f56a66044977da3"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"91cc768d7debd5910decd7ad64ffdd0e21dafc247456abe7e5fb6943753d617a"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"b3f49598a4bd972af7d86561ed31312a38a516936ff13aa87f82e0a4daa26bf6"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"73514371790ad2b3777325d1d0559e4889a165db07f5b9e44fee9adb557ef0f7"},"taxa":[{"id":"CWE-926","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":"dfd50d431f1b39b180a101a300cc2575d203265db4bd1a3281fb591bb3c22dc6"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","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":"3fd4f1accbb3c6829904312b507e6004918d63f2c360e1cc17aa3c288e4b3c67"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.2.0","advisory":"RUSTSEC-2025-0134","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"01b0a03cde5b177781aebdb51f31a56c1a56478e4a181107a665e7620a9a661e"},"properties":{"dependency":{"package":"basic-toml","version":"0.1.10","advisory":"RUSTSEC-2026-0374","reachability":{"kind":"unknown"}}}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: now_playing_screen.dart \u2194 mornye_landscape_player.dart: \u0060lib/screens/now_playing_screen.dart\u0060 (context screens) and \u0060lib/widgets/mornye_landscape_player.dart\u0060 (context widgets) sit in DIFFERENT parts of the tree yet change together 77% of the time (10 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00606d017634\u0060 feat(player): make automatic fullscreen lyrics optional; \u0060c489960b\u0060 feat(player): let the Now Playing menu hide the volume slider; \u00600914e7d9\u0060 feat(mornye): restore liquid glass with continuous draggable navigation \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/now_playing_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3d0d337054f16264945238067e8e88fbf2e37c4147e95f162ce237b68956e8"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: MainActivity.kt \u2194 AppDelegate.swift: \u0060android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt\u0060 (context android) and \u0060ios/Runner/AppDelegate.swift\u0060 (context ios) sit in DIFFERENT parts of the tree yet change together 60% of the time (52 of the 86 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 52 shared commits counted here, the most recent 3 are \u00606e964bb2\u0060 feat(player): open audio files and folders directly; \u0060ca950dc3\u0060 refactor(android): remove backend switches that became constants (at that commit the file was still \u0060android/app/src/main/kotlin/com/zarz/spotiflac/MainActivity.kt\u0060); \u006011c6cf99\u0060 feat(player): synchronize music haptics with local playback (at that commit the file was still \u0060android/app/src/main/kotlin/com/zarz/spotiflac/MainActivity.kt\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"659cdb9143a8fe61583db0ee66c0c7ee16e06df9921fb620fea2d67a7bb453ca"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: queue_tab.dart \u2194 audio_conversion_utils.dart: \u0060lib/screens/queue_tab.dart\u0060 (context screens) and \u0060lib/utils/audio_conversion_utils.dart\u0060 (context utils) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006005415d96\u0060 refactor(screens): unify album header, selection UI, and batch engine; \u006054246481\u0060 feat(audio): add dither and resampler options for lossless conversion; \u00605dc0980c\u0060 l10n: localize audio conversion labels and confirmations \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/queue_tab.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b19adcdfab8b8134d4765bd945da1ae6cb6b3744932d9ca11e9c388bae1e8d9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: settings.dart, playback_settings_page.dart, settings_search_catalog.dart: 3 files \u2014 \u0060lib/models/settings.dart\u0060, \u0060lib/screens/settings/playback_settings_page.dart\u0060, \u0060lib/utils/settings_search_catalog.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/models/settings.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b1b29b7d9fb0c19dc2520724633d4def6845289f22cbef7b493227e376a551"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: queue_tab.dart \u2194 batch_convert_sheet.dart: \u0060lib/screens/queue_tab.dart\u0060 (context screens) and \u0060lib/widgets/batch_convert_sheet.dart\u0060 (context widgets) sit in DIFFERENT parts of the tree yet 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060e97ecf38\u0060 Use more specific MediaQuery methods to reduce unnecessary rebuilds (\u2026; \u006061f62363\u0060 fix(convert): make convert bottom sheets draggable and scroll-controlled; \u006054246481\u0060 feat(audio): add dither and resampler options for lossless conversion \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/queue_tab.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd292de9496c2b551a59385c6d06247fae2902c831d991a51044085c193fa63e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: album_screen.dart \u2194 track_collection_quick_actions.dart: \u0060lib/screens/album_screen.dart\u0060 (context screens) and \u0060lib/widgets/track_collection_quick_actions.dart\u0060 (context widgets) sit in DIFFERENT parts of the tree yet change together 53% of the time (9 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060da528689\u0060 chore(link): drop imports the Link actions now export; \u0060091efe24\u0060 feat(link): add the Devices sheet and desktop actions on phones; \u006018ee7700\u0060 refactor: make ClickableArtistName single-line with ellipsis \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/album_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df57cf1fbc0b136cfc607995c5f58cf9539d4c18013c0958cd6a6622ac054b6"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: local_album_screen.dart \u2194 audio_conversion_utils.dart: \u0060lib/screens/local_album_screen.dart\u0060 (context screens) and \u0060lib/utils/audio_conversion_utils.dart\u0060 (context utils) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006005415d96\u0060 refactor(screens): unify album header, selection UI, and batch engine; \u006054246481\u0060 feat(audio): add dither and resampler options for lossless conversion; \u00605dc0980c\u0060 l10n: localize audio conversion labels and confirmations \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/local_album_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e84c50dcda2aa85245c78a34be69a36313abce32ad944701c6d9b23ffd7a768"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: downloaded_album_screen.dart \u2194 audio_conversion_utils.dart: \u0060lib/screens/downloaded_album_screen.dart\u0060 (context screens) and \u0060lib/utils/audio_conversion_utils.dart\u0060 (context utils) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006005415d96\u0060 refactor(screens): unify album header, selection UI, and batch engine; \u006054246481\u0060 feat(audio): add dither and resampler options for lossless conversion; \u00605dc0980c\u0060 l10n: localize audio conversion labels and confirmations \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/downloaded_album_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b363b16e4ccd27f9e2654254ad0ad7ce060b5011c584849413c9ae3a92e6c1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: album_screen.dart \u2194 playlist_screen.dart: \u0060lib/screens/album_screen.dart\u0060 and \u0060lib/screens/playlist_screen.dart\u0060 change together 77% of the time (66 of the 86 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 66 shared commits counted here, the most recent 3 are \u0060b336075b\u0060 perf(library): match collection history keys once per page data; \u0060d58565d2\u0060 feat(library): suggest songs under albums, singles and playlists; \u0060da528689\u0060 chore(link): drop imports the Link actions now export \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/album_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"100651a99c5f9631d7d312eac61c13106c45417ecb6709fc3b7ff87d5e020d34"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: downloaded_album_screen.dart \u2194 local_album_screen.dart: \u0060lib/screens/downloaded_album_screen.dart\u0060 and \u0060lib/screens/local_album_screen.dart\u0060 change together 71% of the time (59 of the 83 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 59 shared commits counted here, the most recent 3 are \u006090e662b3\u0060 feat(library): upload local songs to network storage; \u0060ac93828a\u0060 refactor(covers): show screen covers through the shared helper; \u0060d58565d2\u0060 feat(library): suggest songs under albums, singles and playlists \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/downloaded_album_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afb028dd0ee80e77d35179972eaa7c155633b28155f5267e90d5288bf0673bd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: download_settings_page.dart \u2194 metadata_settings_page.dart: \u0060lib/screens/settings/download_settings_page.dart\u0060 and \u0060lib/screens/settings/metadata_settings_page.dart\u0060 change together 70% of the time (7 of the 10 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 \u006078f60e75\u0060 refactor: push plain material pages through pushPage; \u0060101740d8\u0060 refactor(settings): move download, metadata and files pages to shared\u2026; \u006037466432\u0060 fix(settings): keep final controls clear of floating playback bars \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/settings/download_settings_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc4247db7507e86ad6494110db6c8bb13b645e093e57d00d8042bf56af56e50"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: files_settings_page.dart \u2194 metadata_settings_page.dart: \u0060lib/screens/settings/files_settings_page.dart\u0060 and \u0060lib/screens/settings/metadata_settings_page.dart\u0060 change together 60% of the time (6 of the 10 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 \u006078f60e75\u0060 refactor: push plain material pages through pushPage; \u0060101740d8\u0060 refactor(settings): move download, metadata and files pages to shared\u2026; \u006037466432\u0060 fix(settings): keep final controls clear of floating playback bars \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/settings/files_settings_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e8053bc47482cb542ea1714d9668a47be5d59b18295a4bfea8a50e9c20237b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: app_settings_page.dart \u2194 appearance_settings_page.dart: \u0060lib/screens/settings/app_settings_page.dart\u0060 and \u0060lib/screens/settings/appearance_settings_page.dart\u0060 change together 55% of the time (6 of the 11 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 \u00603687e183\u0060 refactor(settings): use the shared section slivers and confirm dialog; \u006037466432\u0060 fix(settings): keep final controls clear of floating playback bars; \u0060736cfcd0\u0060 feat(settings): connect custom Material settings rows \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/screens/settings/app_settings_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e221bbb8e0f0bba77d333c3e650ddd0a628ff0481890f10302de160e9bd0bab6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: desktop_navigation.dart \u2194 desktop_shortcuts.dart: \u0060lib/widgets/desktop/desktop_navigation.dart\u0060 and \u0060lib/widgets/desktop/desktop_shortcuts.dart\u0060 change together 53% of the time (8 of the 15 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 \u0060708efa4e\u0060 feat(mornye): Music\u0027s glass inspector, player actions and Home text; \u0060d4cba0aa\u0060 fix(player): hide internal playback UI in external mode; \u0060a985ea0e\u0060 feat(desktop): expand the Material rail and list playlists in it \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/widgets/desktop/desktop_navigation.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"940a79c0dfa5e4b5c297b565e7055b5ecf03f67c18862ff3ba516d60a2d51ece"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: MainActivitySafIo.kt \u2194 MainActivitySafScan.kt: \u0060android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt\u0060 and \u0060android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt\u0060 change together 53% of the time (10 of the 19 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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; 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 \u00600895e9ae\u0060 perf(android): stream unchanged CUE scans and retain metadata objects; \u0060a19a5287\u0060 refactor(android): put the SAF IO helpers on Context receivers (at that commit the files were still \u0060android/app/src/main/kotlin/com/zarz/spotiflac/MainActivitySafIo.kt\u0060 and \u0060android/app/src/main/kotlin/com/zarz/spotiflac/MainActivitySafScan.kt\u0060); \u0060ca747f8c\u0060 fix(android): release temporary media on failed SAF operations (at that commit the files were still \u0060android/app/src/main/kotlin/com/zarz/spotiflac/MainActivitySafIo.kt\u0060 and \u0060android/app/src/main/kotlin/com/zarz/spotiflac/MainActivitySafScan.kt\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42db1a77c331ad83fe7f34519f403075cd8be75ca151ff0a0725720e23f8e6f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: music_player_gapless.dart \u2194 music_player_runtime.dart: \u0060lib/services/music_player_gapless.dart\u0060 and \u0060lib/services/music_player_runtime.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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 \u00604cec4086\u0060 fix(playback): remove missing files from the active queue; \u00605f3d6fa2\u0060 fix(ios): play formats AVPlayer cannot open and skip unplayable songs; \u0060e90f5e89\u0060 feat(network): prefetch upcoming NAS songs to a local cache \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/music_player_gapless.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c7b9c0c64416b1b55301fd009911219d32913064321d8efc2bf85885cacc5f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: link_phone_features.dart \u2194 link_protocol.dart: \u0060lib/services/link/features/link_phone_features.dart\u0060 and \u0060lib/services/link/link_protocol.dart\u0060 change together 50% of the time (5 of the 10 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 5 shared commits counted here, the most recent 3 are \u0060363f5063\u0060 fix(link): delete shared phone songs from desktop; \u006074d52728\u0060 fix(link): sync AI lyrics translations across devices; \u0060faab457b\u0060 feat(link): add desktop device picker and file activity \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/features/link_phone_features.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fd7635ead61ac05bbb658bede993ef8cf20483efba1499102f52be3cd54467"}},{"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":"D36","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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider linkRemotePlaybackProvider captures autoDispose linkDesktopRemoteProvider: \u0060linkRemotePlaybackProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(linkDesktopRemoteProvider\u2026)\u0060, which is declared auto-dispose (lib/services/link/features/link_desktop_remote.dart:376). Read in build, \u0060linkDesktopRemoteProvider\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 \u0060linkRemotePlaybackProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060linkDesktopRemoteProvider\u0060 keepAlive too, make \u0060linkRemotePlaybackProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/features/link_remote_playback.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef311fb950c8454466afdd9557193506945a5b5b3ea0973e27fdd849dba95b0b"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider linkRemotePlaybackProvider captures autoDispose linkDesktopRemoteProvider: \u0060linkRemotePlaybackProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.listen(linkDesktopRemoteProvider\u2026)\u0060, which is declared auto-dispose (lib/services/link/features/link_desktop_remote.dart:376). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060linkDesktopRemoteProvider\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 \u0060linkDesktopRemoteProvider\u0060 keepAlive too, make \u0060linkRemotePlaybackProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/features/link_remote_playback.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0444a683fc8f6a9293b15ed5a9c5e7827f04d28db00dd47c450fdaf9dee4bb1f"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider linkRemotePlaybackProvider captures autoDispose linkDesktopRemoteProvider: \u0060linkRemotePlaybackProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(linkDesktopRemoteProvider\u2026)\u0060, which is declared auto-dispose (lib/services/link/features/link_desktop_remote.dart:376). Read in build, \u0060linkDesktopRemoteProvider\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 \u0060linkRemotePlaybackProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060linkDesktopRemoteProvider\u0060 keepAlive too, make \u0060linkRemotePlaybackProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/features/link_remote_playback.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"17679510ca84219bdaa4447696c732ec8c409aa40147526004bcb35a812746be"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider linkRemotePlaybackProvider captures autoDispose linkDesktopRemoteProvider: \u0060linkRemotePlaybackProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(linkDesktopRemoteProvider\u2026)\u0060, which is declared auto-dispose (lib/services/link/features/link_desktop_remote.dart:376). Read in build, \u0060linkDesktopRemoteProvider\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 \u0060linkRemotePlaybackProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060linkDesktopRemoteProvider\u0060 keepAlive too, make \u0060linkRemotePlaybackProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/features/link_remote_playback.dart"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f284a3b320006bc84aa79d871322b128d4938afbede71102ada8b23b959b95e"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider linkRemotePlaybackProvider captures autoDispose linkDesktopRemoteProvider: \u0060linkRemotePlaybackProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(linkDesktopRemoteProvider\u2026)\u0060, which is declared auto-dispose (lib/services/link/features/link_desktop_remote.dart:376). Read in build, \u0060linkDesktopRemoteProvider\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 \u0060linkRemotePlaybackProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060linkDesktopRemoteProvider\u0060 keepAlive too, make \u0060linkRemotePlaybackProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/link/features/link_remote_playback.dart"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c123b8cfbc58144ffcc64f3d41ab451eefa80e55f76e14ea7dea9d0ea56320a3"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider libraryMixesProvider captures autoDispose libraryCountsProvider: \u0060libraryMixesProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(libraryCountsProvider\u2026)\u0060, which is declared auto-dispose (lib/providers/library_counts_provider.dart:75). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060libraryCountsProvider\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 \u0060libraryCountsProvider\u0060 keepAlive too, make \u0060libraryMixesProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/providers/library_mixes_provider.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a456f1674b7af254f00ec4c7560a96df5e6560f36d8460b14110885a1c315f"}},{"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":"note","message":{"text":"Logging is not universal: Only 4/8 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060macos\u0060, \u0060rust_backend/crates/bindgen\u0060, \u0060rust_backend/crates/cast\u0060, \u0060rust_backend/crates/network\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!MediaQuery.disableAnimationsOf(context) \u0026\u0026 TickerMode.valuesOf(context).enabled\u0060 appears character-identically in 4 files \u2014 lib/widgets/app_loading_indicator.dart, lib/widgets/expressive_seek_track.dart, lib/widgets/now_playing_indicator.dart, lib/widgets/overflow_marquee.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/widgets/app_loading_indicator.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b749e1a6ab71ae16cfafba54e5c24ea9a32edca888fd1ba62222e18d496597ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!_isLoading \u0026\u0026 _isStepCompleted(_currentStep)\u0060 appears character-identically in 2 files \u2014 lib/screens/setup_screen.dart, lib/screens/setup_steps.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/screens/setup_screen.dart"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa0a21a83628cd434c8be8802d70fb7474013d44c3987ac00b15c5f190e2134"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!_ref.mounted || source == null || !source.enabled\u0060 appears character-identically in 2 files \u2014 lib/services/link/client/link_client_library.dart, lib/services/link/desktop/link_phone_library.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/services/link/client/link_client_library.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44c824718a65842a51a530af3b89842225b0e3b7dc8ef67c2f99c7c76cd840d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!await file.exists() || await file.length() == 0\u0060 appears character-identically in 2 files \u2014 lib/services/metadata_cover_resources.dart, lib/services/motion_artwork_store.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/services/metadata_cover_resources.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af2791403888b8a550ddd94b424ed6f2365af33ccfe7dbe0671d73d60d9c137"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!complete \u0026\u0026 file != null \u0026\u0026 await file.exists()\u0060 appears character-identically in 2 files \u2014 lib/services/network_library_scanner_subsonic.dart, lib/services/network_library_scanner_virtual.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/services/network_library_scanner_subsonic.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd32f3ceaacd405a40d953639cb699bc847e0f413ee89dbd97b15648326a644"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!mounted || _embeddedCoverRefreshScheduled\u0060 appears character-identically in 3 files \u2014 lib/screens/downloaded_album_screen.dart, lib/screens/home_tab.dart, lib/screens/queue_tab.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/screens/downloaded_album_screen.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"46844cceccfc59c76ca1100a33ed4a18a205d4c526eba475c7ec5180ba1e3861"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!mounted || generation != _loadGeneration\u0060 appears character-identically in 2 files \u2014 lib/screens/local_album_screen.dart, lib/widgets/audio_info_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/screens/local_album_screen.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cc10c3ac3d1a076b405f9e6f0ffde7850c0a2ab32c305bb47ee27aaa1a357c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!mounted || generation != _metadataLoadGeneration || sourcePath != cleanFilePath\u0060 appears character-identically in 2 files \u2014 lib/screens/track_metadata_screen.dart, lib/screens/track_metadata_screen_cover.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/screens/track_metadata_screen.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b394fc2161b5d503078ba723b914a7aab2e788d45f9b17f0fddfbd1ff6d4e558"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!settings.separateSingles \u0026\u0026 settings.folderOrganization == \u0027custom\u0027\u0060 appears character-identically in 3 files \u2014 lib/providers/download_queue_provider_paths.dart, lib/providers/download_queue_provider_reorganize.dart, lib/screens/settings/files_settings_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/providers/download_queue_provider_paths.dart"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1a7cef3685869728915f53323362bc097ce1c3b59c969861f6c40bb95c8616"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!success || generation != _generation || !await output.exists()\u0060 appears character-identically in 2 files \u2014 lib/services/automix_effect_renderer.dart, lib/services/music_haptics.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/services/automix_effect_renderer.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea81ea2bdc9b74aa856654fcbfaaafceff25865e4b98def6ed31ec20b82e83eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060AudioServiceRepeatMode.all || AudioServiceRepeatMode.group\u0060 appears character-identically in 3 files \u2014 lib/services/link/desktop/link_player.dart, lib/services/link/features/link_phone_player.dart, lib/services/link/link_mirrored_playback.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/services/link/desktop/link_player.dart"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f9e8b335df3513ffd92d8e037e9896aa664cffe0c3711e3a4da9f5ec4fc47c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Duration(seconds: 1) \u0026\u0026 _attempt != \u0027${handler._playRequestGeneration}:${handler._sessionQueueRevision}\u0027\u0060 appears character-identically in 2 files \u2014 lib/services/music_player_automix.dart, lib/services/music_player_gapless.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/services/music_player_automix.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc498b283fa5206ab81fd75b045963a9734ad32584a3d9de04f61eed0c2c273"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060MediaQuery.disableAnimationsOf(context) || !TickerMode.valuesOf(context).enabled\u0060 appears character-identically in 2 files \u2014 lib/screens/listening_rewind_slides.dart, lib/widgets/animation_utils.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/screens/listening_rewind_slides.dart"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fb55c24421a0b5c8b9ad5df75fb7c295663051bd93ba71013985a8a39bcd6c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Platform.isAndroid \u0026\u0026 settings.storageMode == \u0027saf\u0027\u0060 appears character-identically in 2 files \u2014 lib/services/cover_download_service.dart, lib/services/link/features/link_save_offline.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/services/cover_download_service.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc29d5ce1a6bfd2267228ae61f5e807934cade06cff3686434bcdfeb1e9db103"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Platform.isAndroid || Platform.isIOS || isDesktopPlatform\u0060 appears character-identically in 3 files \u2014 lib/screens/settings/playback_settings_page.dart, lib/services/music_player_service.dart, lib/services/platform_bridge.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/screens/settings/playback_settings_page.dart"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8148bde4bf2bf31049b379976ca2d359fbf74a757565af5fc6fe672a28b744"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Platform.isIOS \u0026\u0026 settings.downloadDirectoryBookmark.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/services/cover_download_service.dart, lib/services/link/features/link_save_offline.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/services/cover_download_service.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e4824c6433edf2bc9c6d454570982e3202222b5018c0df159c97ee7e7184aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_notificationPermissionGranted || _notificationPermissionSkipped\u0060 appears character-identically in 2 files \u2014 lib/screens/setup_screen.dart, lib/screens/setup_steps.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/screens/setup_screen.dart"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"922be250e257fe3f1c943bb912ac02a1a6fb0403968d06c7d144070e92df9ce4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_queueStartupPending || !_queueStorageReady\u0060 appears character-identically in 2 files \u2014 lib/providers/download_queue_provider.dart, lib/providers/download_queue_provider_reorganize.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/providers/download_queue_provider.dart"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dd48be2513c95a45c27a07f969a647e5c252f7363b9d839d318b80944e07e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_saving || _fetching || _fetchingMusicBrainz\u0060 appears character-identically in 2 files \u2014 lib/screens/track_metadata_edit_autofill.dart, lib/screens/track_metadata_edit_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/screens/track_metadata_edit_autofill.dart"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"f863c316ccfa4bbbd07f71b3d01c7dafd32abe14bbd81c903a58f4ace56b41ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_topTracks == null || _topTracks!.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/screens/artist_screen.dart, lib/screens/artist_screen_widgets.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/screens/artist_screen.dart"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdec411b08c231a0085740511c0a442eb18173df7cb3387a1ec21fdebbb3ae7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.albumType == \u0027single\u0027 || a.albumType == \u0027ep\u0027\u0060 appears character-identically in 2 files \u2014 lib/screens/artist_screen.dart, lib/screens/artist_screen_discography.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/screens/artist_screen.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e52ecd102c32b31e4ad19b8e8d94c5f4f1ccde51f60667152d3626c68396c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060artistName != null \u0026\u0026 artistName.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/controllers/clickable_metadata.dart, lib/screens/album_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/controllers/clickable_metadata.dart"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cadee1cd456aa5dd67ad3f38924bd94041e9f715fe6aa199c63b576b4a23c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060audioTraits != null \u0026\u0026 audioTraits.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/screens/album_screen.dart, lib/screens/extension_collection_screens.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/screens/album_screen.dart"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c156bb6f1cd291a8498324f1c2b0ba383bc93ea2ef34f271d67ce6e01f12476f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bitDepth != null \u0026\u0026 bitDepth \u003E 0 \u0026\u0026 sampleRate != null \u0026\u0026 sampleRate \u003E 0\u0060 appears character-identically in 2 files \u2014 lib/utils/audio_quality_badge_policy.dart, lib/utils/string_utils.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/utils/audio_quality_badge_policy.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95e148df39e769f11ba0fd16e13f1fd1283197a5c03d02a00aaf4360cd98229"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060box is! RenderBox || !box.attached || !box.hasSize\u0060 appears character-identically in 3 files \u2014 lib/screens/now_playing_screen.dart, lib/widgets/desktop/context_menu.dart, lib/widgets/mini_player.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/screens/now_playing_screen.dart"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97b5ba57a47eb0c97ac9849a8b9a60b47c49914ee808be35e3ca84ec0e82d60"}},{"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 86) and then rejects \u006010.0.0.0/8\u0060 on its IPv4 path \u2014 but the IPv6 decision at line 84 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/services/local_network_access.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7979019dd6a60d959a5302b379795a00d05adefd7be05e5d1a5e94574be61d4e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060coverUrl\u0060 is public, takes a document from its caller (line 531) and hands it to \u0060fromValue\u0060, which calls itself at line 539 (\u0060fromValue\u0060) with a piece of \u0060value\u0060 (and at line 545) \u2014 and nowhere in \u0060fromValue\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 \u0060fromValue\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/metadata_autofill_service.dart"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e27b128c704e4e2aae28d9f1ec337c5fe7fa6a4a045081e35e681d6c787616"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060customSearchWithExtension\u0060 is public, takes a document from its caller (line 2226) and hands it to \u0060_canonicalizeJsonLike\u0060, which calls itself at line 740 (\u0060_canonicalizeJsonLike\u0060) with a piece of \u0060value\u0060 (and at line 744) \u2014 and nowhere in \u0060_canonicalizeJsonLike\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 \u0060_canonicalizeJsonLike\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/platform_bridge.dart"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7d24c2092b2fed529a423f550188a875e680c5b0399327a43e05a5bb973c1e"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept a CancelToken: Only 0/1 functions that make a cancellable request (Dio, AbortableRequest) accept a CancelToken or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a screen navigated away from, a disposed widget, a superseded search. Take a \u0060CancelToken? cancelToken\u0060 and hand it to the request as \u0060cancelToken:\u0060 (or hold one and cancel it in \u0060dispose\u0060); 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":"767a6f188a93a9fdcf866e430f9755aeab7ca6acdd21a1a80f8ac4ef4cc6cf7c"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without a CancelToken: _requestStoragePermission: \u0060_requestStoragePermission\u0060 calls \u0060audio.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/screens/setup_screen.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4882c3e03454207c187110590bcb90db3fc1383dcbb52a4308bc7334235f766f"}},{"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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ec6a1d387225626e07320a9767bbe165ca05b67282c4df64741e9144df28b2"}},{"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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad484706d0bfa3bc4d566156c3b02f9d43932e9fd69546b4024940cec03ccc5f"}},{"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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1a2a187c9f375dce31330dae8bc98f1816ba8be4e2571c0a1d1b4a6f3ccb57"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e76349e5f9c10a4cf23f40e5f34c8c8d30113e218275b8e3adbd3b5a654957"}},{"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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76d08ea71bc19061455886fe556edb921a97cd553091f3f5495b2006a7ec9da"}},{"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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a88f07bae365fd527889c6aef17ae26f8b7a5f7cdb5b60d91f5675574be5a6"}},{"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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0783bd3156261f45aff902ec3b517f0060bd71ac571e3616fa75676fd08740"}},{"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":"rust_backend/crates/extensions/src/prelude.js"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd41432e91834535c98540f4abc0174695c1cf1f1c70e1b4e4613257a98ce6f"}},{"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":"rust_backend/crates/extensions/src/provider.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ec291d93cacac727e16fae5996cdb59ab2ae469f38717b1117bf6d3d5d37fe"}},{"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":"rust_backend/crates/extensions/src/provider.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd18f9c226842c743098f1ab790c05c4096c316778c09e3828351ea4e02251c"}},{"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":"rust_backend/crates/extensions/src/provider.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6aa93043f460ed739dba942e054b288ea9a4e63b5f672aafcefd5615be8716"}},{"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":"rust_backend/crates/extensions/src/provider.js"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6bbe45a3a1e4553c0fc8ae9c5ef80f278fe38966838a9b081bc6568c6fbf95"}},{"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":"rust_backend/crates/extensions/src/provider.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbf03ca310a15c2744b54b0f857487d837dbc112e0934d65c904643571bd772"}},{"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/widgets/app_announcement_dialog.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8177028f18f9a654f9dbca494f4a4189a6fe67d4feb3a1a2cd0453ffd602c9"}},{"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/widgets/audio_info_sheet.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6361fbab7ad6fb0b7afde8a748942eda5fcab3848ef8538dea1cd3c15503bd4b"}},{"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/widgets/cached_cover_image.dart"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaefd27db34bad5fa38f3e6be88213f9d55ab5e169c7a515698093d8e0e0a2bd"}},{"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/widgets/lyrics_provider_picker.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce524c32034c3e8d097d61914274021578830e9c6ef5cbe5b188899d81e36b9e"}},{"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/widgets/lyrics_provider_picker.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"566865b62cb0460220316b0f1ec02f7f7257bbe8316816a67d108f86a86c5c14"}},{"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/widgets/playback_source_label.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f547b59a612d05c1cf9ff8911fadd8f35b19bdf48a1a3571ca155ef92ae8c258"}},{"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/utils/file_access.dart"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00e3e61faea56ef1dba51361a3943d63841b9bc2b1317ce8cdaf48b020f8381"}},{"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/utils/file_access.dart"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6d9132d7bc907554a000037e0c6502e7acc0b9f08ba7654c087534eff292a7"}},{"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/utils/file_access.dart"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c56d56706da871a4d9c9c14ae0d8f350ae1852ca92ffd6fd3dc6319aabf3fde"}},{"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/utils/file_access.dart"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bdc1651794250aba66b9967180c36ca0ea1a5a7f463850521270e7222f1dcb"}},{"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/utils/logger.dart"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"249e380dd3431ea6f9da3ce796130f90d980ac2b6733e9009eab216191d8af54"}},{"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/utils/lyrics_metadata_helper.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2f59f33ee53670a4006fba68a4c27cd031035f0add26478515b043a64d5fa3"}},{"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/utils/lyrics_metadata_helper.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"595caa41742ecb92a15a65b09046abcf61d5c095a553a8e13f192034c95892f7"}},{"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/utils/lyrics_parser.dart"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dd00d21cbdcc5b1981582bbef49d48023e0b6f2cf00a0fa0150db5e6e79b70"}},{"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/utils/lyrics_parser.dart"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"204c3b6585fbc4228271c9954fef27b79ffe157fc8ab30e0f237472d865e79ba"}},{"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/utils/path_match_keys.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1985c846f695c2904dc23c329bdf642483cb7dee5e4980767b2d0fe6ddedac"}},{"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/utils/path_match_keys.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3faa999b1ae93b657d94258e5320b3842c68226a80cdf6c3f9bf5f90a1dcd8d"}},{"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/utils/path_match_keys.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cf0907dbfb9e77cdbbaf544ce1a504a40d242f1cbf590ce19aee95bc6a7c9d"}},{"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/utils/path_match_keys.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ce1658c00dfea585d070ec67b58099c2e740193096c6d4b99f132b14e4751d"}},{"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/utils/path_match_keys.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1753225bacd972cb30bfd8359227c939bbe6f953e07b23d877825cebef7a633c"}},{"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/utils/playback_artwork.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6d832f7097686ad79ee4259fcd00c457e7e23e9658b7c38b3bb9c7b0571c84"}},{"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/utils/saf_display_path.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5c3d6094a42fec1e8dff5c8e95d89b9a854e6a85113ccd4413abde25680c6c"}},{"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/utils/saf_display_path.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af477008ee4b8cc1129de0c8696afa909383c3d7ed88aba474583ed971c506b"}},{"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/utils/saf_display_path.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"253b44b9badb2776a557b31da7d4b4b29da09c860e63faa752285d5bac6cb1e2"}},{"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/theme/cover_palette.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b413c60c5e592650aa01ab050bf37faa319db5496e0d24971a5673d6b0de68"}},{"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/services/apk_downloader.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d946311195ab46f7b80f79cc866ef9a06cca8ee4491dbd168a09b50d0a1516dc"}},{"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/services/apk_downloader.dart"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e4559602c117500251927afa124876dfbd9906db1358d26c28aca62b4ba494"}},{"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/services/audio_analysis_cache.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d96c032b72f808f2c1209bd3d418333f8a7b3330be80b03462a3d74112c1047"}},{"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/services/audio_analysis_cache.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadb03489e73d5af39f1194a42a244ede208d7deb4b5b6b4562b7eef1b8ad94e"}},{"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/services/audio_analysis_cache.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"122f8dffe5bc15de52f4ef18cfa9c836909628902ce0647c0ae4bfa0d3e2874e"}},{"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/services/audio_analysis_cache.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9289f0dbe9dc894e6549aaebb466bb5a20c3b6791b0187962d28c8d20b0784"}},{"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/services/audio_analysis_cache.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cabca65fa919ab3b6f30fd92d3dd5ad02dfb02309fdd7b004eaef0d4fbdf700"}},{"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/services/audio_analysis_runner.dart"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c840be5d5aa57e790c78d2aa83d565429f50a1c2f5699a99fc249a438298821d"}},{"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/services/audio_analysis_runner.dart"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eb4c1bc5fbf0b20166cc6a5cf7532cec5928aebbabd639a17ede16e6b8c6d5"}},{"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/services/audio_analysis_runner.dart"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c9e68a279ac3835a7270545d014c67edcb553a84483df9658e0fe15a20da17"}},{"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/services/audio_analysis_runner.dart"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3188001fc0f798a1564218d31961642d0a02b9f4466150cdd3fc6ea1f9d2f3e0"}},{"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/services/audio_analysis_runner.dart"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22de417cfc856adb5a5f5762a928897febe1697cc2f51b19a50539a9ff1e7d8"}},{"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/services/audio_analysis_runner.dart"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf6ba9a47c25aa1fd6501d94b2450d29f2563176c17009f5eb2001355d3c511"}},{"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/services/audio_file_open_service.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1570595fc88038fbfaa29cd3120bb497f4ec8ac96cd2fa6f8205f92289069170"}},{"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/services/automix_effect_renderer.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"21614600ff290624c5975e730756e83d2aacaaa3c0c9be4304e99c0478329dbe"}},{"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/services/backup_service.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a21d7acf0163cba0e166f5e9cf4c139d69183c4ca3e009f9735c39f661203c"}},{"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/services/backup_service.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a552106b750f787f68ca1d0a6d7811745042fca8de4c4d1364ecba2df39abdf3"}},{"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/services/backup_service.dart"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"594143a9c66b78d95aa4bd1bd7fdbd7185713abfeaab566f8c2584dc8e40c38b"}},{"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/services/backup_service.dart"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2acda7e671cc4015a25a0c687398dfa77489af527b48c07ae071dade0dcab93"}},{"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/services/cache_maintenance_service.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"688428036100ae66d4a88b6020c150758d5ab8c821fad94bc86a1f15b518d47c"}},{"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/services/cache_maintenance_service.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fe8a37dfbd32aa1b97b8ed36c20e5633161f18aa9ca774a02ebfd170da477f"}},{"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/services/cache_maintenance_service.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"762adbe7b3b54e6c3d9cf6b94a82eb7512f1799189b1a1288283ceb1b069cdd0"}},{"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/services/cache_maintenance_service.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eb524f930f0c88f7aea1964528745fcf0644ba826860719a02ca0891ec24eb"}},{"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/services/cover_cache_manager.dart"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9579f3bbcf3e5459ac50133fbc77dcb8d287ec8c4d3b6c4cbb0c035c4e2e34bd"}},{"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/services/cover_cache_manager.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5129ec05992d6a5b228282f882a613f735634dac1f56a0de4eea4c2027f8e8"}},{"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/services/cover_cache_manager.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"045586f532a249bee2e0e9e8873dc735418a4dc963ec176f7885ee006db52b6d"}},{"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/services/cover_download_service.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c157b33db70ed4e0ecbbbd8d793749ec8eea1fd615e4839b57f40a245783ac"}},{"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/services/desktop_diagnostics.dart"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b689cadb985e031a83715d914ab97d1efbd84b14d4f599405486b57854e5f3"}},{"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/services/desktop_updater.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6432d49857d76ff282db957a00224b6d0135055898a1599f10502933408076d"}},{"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/services/discord_artwork_resolver.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"888ad6e33332b1cb6811999d0d0787751f6f400d70d51d666aa68fa9caccea3f"}},{"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/services/discord_presence_service.dart"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4b1a0eb878e1a15461c53ba8d85c519746c7f45c2c079729c5273fd6f98afa"}},{"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/services/discord_presence_service.dart"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e104cd04e6a83540e23deddcc26d41fcf793865603cc2bf0af5793ba4d5d7c"}},{"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/services/download_queue_codec.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"02adf5b00ff28a031222dba1aab9c1ce4b51a7e1f365c131fe2f8f3bdb92af69"}},{"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/services/download_saf_file_replacer.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4863cd8f41b8ad09cf51426e89c8830725bd79bcb971f89908f1dd3c9d22570"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6702b8ede9fd997d6ac1bea201d3ddccac93c2566775447bc507650e36cc99"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4145c376aa988bf61b06946e78c3a273ff4101b06ac7cc5c4df5d8f2e53a4329"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cc5fb87b7648e3713a316c52236b1beaab8c81636d3aef56bdf6c2bff63c9f"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcffa96fe385436793e437cb5f289647b76bf097fd1a1e46d3cdd00a36ee97ca"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"e804715d8320cb1e97a73f516182bca025b2bf78948026e7bef282c530cbffcb"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe64cc03100116e448ce5c55a02e42de3f87151fd8e42167ff6a0265c4082c21"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6682136f41795d76de14a249e6ec96f8cac6dc92e6c0c71fa1b214538ad4f2"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1afefc1eee8823c81dd0263e0770216ac03749a52d68401c3c043f925d61d8"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"a452c32ed14b11ca6d5a1404b9d0ab2c7721109485bc75fe72dcbafe90bc95e8"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa067f97a070b2960bce781431ca5b22b4d55fe5c93bfbd558bd4ef454840598"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ac602aa8440bd494712847eaf535994af580a60c7b1e19fc6bc69956255e73"}},{"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/services/downloaded_embedded_cover_resolver.dart"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce83e85b6bc78b1bc1173eeb4344e47056ba035032298731a01302e70c6f485c"}},{"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/services/extension_storage_service.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"991bf30b08933ddf566ade160637556685a7f88492340eaef47bff639c91075e"}},{"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/services/ffmpeg_decryption.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3c0cbe115799c7abb6537aeb030a64676eb40d5219c112d4af383a125f4399"}},{"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/services/ffmpeg_probe.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f4014a2bb9d2120da15c4cb89738acf42a7d95797394c1e03230adb8a76a7e"}},{"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/services/ffmpeg_reenrich.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c4f6073de4c409a3ee11334012704728a72d8e6c59cdad2ccceef2efb205ea"}},{"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/services/ffmpeg_reenrich.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8b6de5ad19a428057c4b2c6a690ca89a6114f9530788101024dc8f5f2834b4"}},{"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/services/ffmpeg_reenrich.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d8828e8e761b958df271033388570d13f1c409b237e59fe07c7ccfa619fcbd"}},{"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/services/history_database.dart"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"853c86aff64cbe99e35532c9baf27fc4b737385f031a3947f6908f247f98d1cb"}},{"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/services/library_cleanup.dart"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e454342f0cb92e60877d0990b977c87d5d970659874ebc995908b0da6f37ef71"}},{"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/services/library_collections_database.dart"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"37194088059e8a94527726c776211ebcf7a1205dc521319d3e8af27f802dc641"}},{"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/services/library_collections_database.dart"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8d54135f43a282ac889398e7c9f596eaed0cbda24b46c9399bc62877fa5965"}},{"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/services/library_collections_hydration.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cab5a6a56f6f7506ab095568bcce9d13900b46f1432e2979c312079a7739f9e"}},{"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/services/library_collections_hydration.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"181add6f1b55a3fce9cb37e40ad3c301d165ac47289e8120077cc67b6cbcdb92"}},{"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/services/library_collections_hydration.dart"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bddd25ae8ccafd5c380d5483c4d6b33e24a06f94513bba09705db20c612b26e"}},{"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/services/library_directory_index.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f178767442de825b4a786e4a69f80a2eecce3ccde046714da2a7dea2000afbe5"}},{"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/services/library_mixes.dart"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb5f4fc1f12718ab8b091264d0121a6cfc9b104279195e4e11a7e00cfd89405"}},{"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/services/library_reorganizer.dart"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a1a231a3e0f0211725c0e1af975cd481a908f9ce5a2603948d1e9f966d398b"}},{"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/services/m3u_playlist_service.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaeff437a33791712972c033ab74112cb50899f8ee1948118a9a3c78a2dc3c3"}},{"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/services/media_library_browser.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d5945c0eba5759ad2b21cc880270b6a9bb701a2e967a4dedf1fc12d666a343"}},{"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/services/media_library_browser.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"710f0630bb650fb19a22617cc1b501e99270f3b4bd92624ec884ff87bec40fae"}},{"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/services/metadata_autofill_service.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"20152cbb26e726adc40a159b0b2aaea6c89751264d1f76a4896f318596ed9472"}},{"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/services/metadata_cover_resources.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"21eb3f97a645417c46b992d23df4cf04b0fdc9515402aab6d03a219985c48774"}},{"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/services/metadata_cover_resources.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8717c7365e118ef385f0f82859d0a649e0740f8e4db3b3558948c170a74880ef"}},{"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/services/metadata_cover_resources.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c03bbbfae8b4781d8cd88a7b7a7cb5c0e82a6e67b066a37fd0756bb84edd16"}},{"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/services/metadata_persistence_service.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e9d0f160efb8b43887ec4283ebea695e7afb43d2804ea8d1027ff0af210701"}},{"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/services/motion_artwork_proxy.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c798e3dcc685ecd09745e5b6ebd4db7d19e6216bd120092765a223bd352b2b"}},{"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/services/motion_artwork_store.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"532677839755814675bbbe5e3ea844a89eae3961c4e28ad0ebc3dc83e5a48293"}},{"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/services/motion_artwork_store.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2545baa272d9f066e38040d57391e951d9f4625b6affd7aed48ac9b892038a90"}},{"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/services/music_player_autoplay.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4d3a33f60a62365e8bbf2e9bdd2323b803f47498fb0803ffd12618a07ad0bc"}},{"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/services/music_player_prefetch.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fd344124b3d63eb3b4dc85be6f4a9512ec9120b85183bd6bb004b062d31e0a"}},{"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/services/music_player_prefetch.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6544e6e84182ee8d4c7d2c0e9160cf0d034728b3f6e762b2f4e6e1376578fb20"}},{"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/services/music_player_prefetch.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e596538509b7c351e8e471e3e4c7d309e9224198bfa8bbad16a30732add069"}},{"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/services/music_player_prefetch.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a672de0ef85ee82c2cddff99dc454f43f8e628d717381ec335025daa4e36a5"}},{"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/services/music_player_runtime.dart"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b2fe981befe586658babd70b82e6dc1350dd73d06fb9893c858cf0ccf82a2a"}},{"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/services/music_player_service.dart"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8f80d7dc153c4d0f170c492541cbf6315de6bec93f64948addd5a4d21898b3"}},{"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/services/music_player_service.dart"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d115dbac36ddf912b844ed36b589b4f662eacc76ce5fdad083b437bf8304fa7e"}},{"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/services/music_player_service.dart"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e333d9199b544291aec1afd21d6dcef937652f644d2826a20f023a39b31d21b"}},{"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/services/music_player_service.dart"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"4477d246577452983d1899d66620e1a830f3ecde83ffb9e21dec47d1bceafc69"}},{"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/services/music_player_service.dart"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b9b6051f2789432dda1128818fd9644f8130c0b6680caca76b4e0689756dba"}},{"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/services/music_player_service.dart"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42b4154d352975597bd4833710910d020739941159c785f7f196e6cb96db9c4"}},{"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/services/music_player_service.dart"},"region":{"startLine":2696}}}],"partialFingerprints":{"codehealthFindingId/v1":"804b1a5e7cffa875fd79ff222fd3030565b8e432e7ac7b19b4e6d7b5e016528c"}},{"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/services/music_recognition.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac61c496d809bb64bf118c004e407ee422e5e67432ac6aa463348c7a9faf0749"}},{"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/services/network_library_scanner.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c346c7db01cc27a022e17e4da00707adaf1bdc39240df66bba66f96e809e85b"}},{"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/services/network_library_upload.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c44690bcb3fc490482564a1d2b7f09bc60fee6fd346dd10a220dc9dfdaeafc"}},{"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/services/network_metadata_service.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca779b1927c5a1e4f6052ea73d6e5479604d54c84a9b40c2839059bb64085c9a"}},{"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/services/network_metadata_service.dart"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c32e7fd89b9bc95d7456c95e0c50451bb05845c9aa8f26d1c552d34a87e0b2"}},{"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/services/network_playback_cache.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b2bab7aef57a6fb1e951bc639fbcee10b8e236065565a928c1c123c4a9a659"}},{"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/services/network_playback_cache.dart"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e665e630def11be382b5b620127a1c6d0bcc9fa3fb71dc474b0b2cb845f18205"}},{"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/services/network_playback_cache.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fa6e9fdecb01e8eb76d4608c001499b47f1ecc5a03583c8d3e42e5bcd24077"}},{"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/services/network_storage_delete.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf003472ed874dbb5b324e2074cddb7b0b1d524532e22504a2112d3e53ff0f1"}},{"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/services/network_storage_delete.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0322cef15ac0130cc469cf14c883a0bb58f3f11c9f6dba65eeb29d084ea248f7"}},{"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/services/network_storage_service.dart"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf43b65a7e889953d73d1049bf5903d8d7d438c5903f438021fc903626fc1d7"}},{"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/services/network_storage_service.dart"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6d09f159b9d7ee2d9a6ecc30befb2ed3fa5a807ea131d9a4a75057ebdcca9e"}},{"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/services/network_storage_service.dart"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbe74bda3801aea5d546e1c94a5397b89f1f5f5f5f384be01c54495d3389250"}},{"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/services/network_storage_service.dart"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa27e98f7368640fccc779ca1f238ea6b54b27e8673581a8398dbf9e20d8ca4"}},{"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/services/network_storage_service.dart"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d3ebd728f57ba702ff823c9411d6453ce2ae1e059d7b20c7b2d68dd40c23cb"}},{"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/services/network_storage_service.dart"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"3732f5f44d48a4f9a48e0941b8471800c3cf648e0049146b1ab183787e8ca489"}},{"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/services/network_storage_service.dart"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"0909293c91d1cd58628b59210ddb4a82c869348fce1a276e720e1b58471e5663"}},{"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/services/network_storage_service.dart"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"62786cf0081241ccc9e9b3d04ee0c30068621e11719f4b5c3611e22ed256ddd5"}},{"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/services/network_storage_service.dart"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1de222ed3b7595902d835fa2f6c0fd3d51bd99d4e21e49139c599f2a57e593"}},{"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/services/network_storage_service.dart"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"a336065e2453249d1cbb60a5685fb0b0d1df0b5e8226277afeff90ce5893a41a"}},{"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/services/network_storage_upload.dart"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29534c87660f62e349f34f138cffe6e63d7b58b565a0b0912d30efe93287141"}},{"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/services/network_storage_upload.dart"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc1edfc693e8e0cf506025d20efa572dfa1f29a249442f244d138f100a69e89"}},{"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/services/platform_bridge.dart"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e65c5c79f4e40ae0b9a9551151b77c2e3328d95a1982e064c49672dc50e915e"}},{"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/services/platform_bridge.dart"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce194b52672ea056e8ca88f60d896ff4c7456f53c402355814ebb32bb0ed24cf"}},{"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/services/platform_bridge.dart"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a4193937476744a0fe545d312e26fc976c85bef6ae68f8c8f690ad096df407"}},{"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/services/platform_bridge.dart"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5195b8383b0d18efc6c6a32195c12eee996cbaf616cd773e122f6dbd46017b"}},{"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/services/platform_bridge.dart"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"95013ed3f509e772cfceacaa71cea3422ed33bc305417b11168a99e2ffaaf8ee"}},{"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/services/platform_bridge.dart"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"3223ab8e32e0485cf980b0a52a785ab56a9686f4417defd8a7ac9be8bb8460b0"}},{"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/services/platform_bridge.dart"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99f7c6ec73da8da282a0e3843d76811630d91e24e708b259d65a78ca6432143"}},{"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/services/platform_bridge.dart"},"region":{"startLine":2718}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7caed32acded99dfeb3c153c1972780c4ad8d3d0476feea385d986bffb0953"}},{"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/services/playlist_cover_store.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aec3106710307fee71dbcfeec08bb70b8ef6552da162225dad45a1e9462df9"}},{"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/services/replaygain_service.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"646cfec16704f3a91d92195eee71960d12acbe85198167c9733ee1bc8caabcd6"}},{"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/services/song_analysis.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"21adf501c2a41c6aac094df6c4362ee3b3feb1d8eabec697283abe9f788c3f76"}},{"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/services/song_analysis.dart"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb74eb8fc58337fa71c73bc8d77555827e3c48dde21305e288e387dc3f979fd"}},{"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/services/link/link_cover_shrink.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d741103ead0e66387f60c81d72e07933915405f47e0e06e82fa906e8b18de12"}},{"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/services/link/link_playback_details.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3b831d1608530d58326a7b713dfe69ac23f2a87b52a5425337b77766f13dab"}},{"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/services/link/link_playback_details.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1d2beb288287317aab7692c798aaa07bff1edd20d0ce1fdada91d5cb1c88f2"}},{"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/services/link/link_playback_details.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58f7230782d3a4bee9b47f7585a5c8571bf4ca27a7dabaca8eb72092a06b3fe"}},{"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/services/link/sync/link_sync_handlers.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"adebca24a4f7985cf441481e0eb539abf2067915d634d912e6592faa90b8cbb3"}},{"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/services/link/features/link_handoff.dart"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9cff4840e0cbad6acb5d81ad020049e557e87ceb71f271752af40ab87e06bc"}},{"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/services/link/features/link_phone_library.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ae07f437c7741a2c3dcc933722e276269e54d9663294586988b3e2dd53999"}},{"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/services/link/features/link_save_offline.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"45744a9958b742486bda9e6d5c90a7618cb6705a5b01666f435282b3a98d60e2"}},{"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/services/link/features/link_save_offline.dart"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"8956105c2190975d946171b00e83aa23554db3e00174945f8c66675f15b21cd4"}},{"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/services/link/desktop/link_catalog_exporter.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd204dc1b3b350da9b9a08def2bb1cb143b48447e16da0a13b5b17f456fc0c2"}},{"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/services/link/desktop/link_catalog_exporter.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"684963273ab406dc06e944a86071cbea3206412af3116f6eedc33fc9984e6a22"}},{"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/services/link/desktop/link_web_covers.dart"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc65756d6442328f4916771e6d9526fa0b507ea6bc24709c4731fb9f64d7b97f"}},{"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/services/lastfm/lastfm_service.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"495a8e79e515296dd99bb8563251a8d1febb30f6a0bbd47f8e4039f0a6e16a04"}},{"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/services/lastfm/lastfm_service.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"609eda4f89cf12f8f664e1d2bb6dae88a915428c91332f0afc874db58a0b4927"}},{"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/services/lastfm/lastfm_service.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"94925774b9cee65add291bb862892680d288f4dff23a40253d76ff930be9db03"}},{"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/services/lastfm/lastfm_service.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea1e833da91d37ff78c1c21722573cb253dad4c6ea70f58b216a841ceee614e"}},{"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/services/lastfm/lastfm_service.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63b5b63b6e2d261dc977abf6100e08b38fdd19596c4e62159e38235ef262f3b"}},{"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/services/lastfm/lastfm_service.dart"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cf789301cd8a7392f882fe9615b1a32200cb9337ef2d1831358a30ddf95a54"}},{"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/screens/artist_screen_discography.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5b27e78eafdf7ce13a4c878b8ba764f5b2aa83d5148201e620dae46be9c7ed"}},{"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/screens/home_tab_import.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d713ec97addef8c199dbd7290444a200e4c57d9a5ec2e1098f10bc3e1cd1f0"}},{"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/screens/music_recognition_screen.dart"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd493db6c441129aa759f01ac9174213dc8be6cb5b5875946327b661408ad086"}},{"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/screens/queue_tab_filter_widgets.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9c9c9097617693d23f51ef796c63c9bfe5f962cd5c7a588ebb0e0921c4f2b6"}},{"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/screens/track_metadata_convert.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6a8f735a6c675e8b3bb75222ea43455e5dabf93bf14db37dd1ca32a7d5d128"}},{"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/screens/track_metadata_convert.dart"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"2808de984e2a9d0f95287223a6f29d5f6dab1ffabdf76bbb43babba51b036a68"}},{"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/screens/track_metadata_convert.dart"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf3f28ef8c92dd97a21691e8b50fd2bcc3fdc12f97332915bbf4a9f7b5c05a5"}},{"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/screens/track_metadata_convert.dart"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a76c171f2798615b5284dd1a1b92f19c3a9b0e74b9ec70dba3162a00845b5f8"}},{"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/screens/track_metadata_convert.dart"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eee3062f60b78d9697690388f41b2a4ab5969c0b8ccb1b7c88aca35c5e4c5a2"}},{"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/screens/track_metadata_lyrics.dart"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a97000733cce5021757ec523eb4cd02e01e6164123360649f41e050885669c"}},{"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/screens/track_metadata_lyrics.dart"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad447756054027304c7b6adabc53be9e72f78d4f82466b4f2bc63629bd8b85ba"}},{"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/screens/track_metadata_lyrics.dart"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"671319cd9edcd1d6c66a6559a37cfdacd44b2a0909f2022f327af28ddc63a8ec"}},{"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/screens/track_metadata_lyrics.dart"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acad92884a52d262093307a56268250c6aee7ab1cf65d30803eed33fc0aeeeb"}},{"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/screens/track_metadata_lyrics.dart"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"582c45b06c3da6aae8c10119ed47762fe70c0a314d41d4fb6826a7e7b44d681b"}},{"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/screens/track_metadata_lyrics.dart"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"d165ac66dfd79c0a820a90d4ac3e4bf1b9ee0c473309831f152793f95ec74c3b"}},{"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/screens/track_metadata_lyrics.dart"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4697675696a39577c432ef9088f4d1e2946c276f897555037be4e594b329a04"}},{"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/screens/track_metadata_screen.dart"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"7404f3b375cf75b6106e1eba7ec63ed8fd3e24160e7d3fea467fbe2309c0a559"}},{"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/screens/track_metadata_screen.dart"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"d200590f7ed5d55e5971fb73e06df6c25349bf2dc6d561de49603f76d598a252"}},{"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/screens/track_metadata_screen_cover.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"930917b6b5a2637dc49d28ccf68ad36ec7854582c465adf3add905d1707a3e08"}},{"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/screens/track_metadata_screen_cover.dart"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7c3ecf82c6824a3b5ef80c073e49711b7a6fff370181716d77877fd45bbbef"}},{"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/screens/settings/cache_management_page.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"610673619bcfbc00b8348f9cdb706093922861a38d4f87a5bfda703a5bf352e7"}},{"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/screens/settings/files_settings_page.dart"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"391d457880bc382f03f1430b6a03d22f4a0fcfaac87c2161df6527dd6a9b9691"}},{"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/screens/settings/files_settings_page.dart"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"083d989c674b5863d566b12d72c5a642110c2dc975f4433a3305cf323d83b82b"}},{"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/screens/settings/library_settings_page.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca3098711e6312ec00836ec89653b5893c83a2ca403d9a32a735fb6e61b1a57"}},{"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/providers/download_history_provider.dart"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a05afd93d80891b1f7d6d7f110d826ebee340a123b12e732495e047c162e7f"}},{"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/providers/download_history_provider_maintenance.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68daa765ab5271850345fe0931cdb030e5c046f872036b55e616e1f1b0ba6b2"}},{"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/providers/download_history_provider_maintenance.dart"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f09e1c936c557960bf10512a2ed91f10a9388d785732ba46885cd392e94ac8d"}},{"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/providers/download_queue_provider_finalization.dart"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba914365931d02201c551401e9143581db54987c4e7e9dbcf60cae8ef7ed621"}},{"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/providers/download_queue_provider_native_worker.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cab8ceddda5970a98cf46602b0bea8d423e7a61ca4bffc7dd1c362e41dd5fe"}},{"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/providers/download_queue_provider_native_worker.dart"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"800a257bec0176b14763982f0be53e962040a1e57bbdae5964f707f38d1a7fc6"}},{"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/providers/download_queue_provider_native_worker.dart"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bb8579f8a424b104325718252dab7f93e152520f2415af93fcf91ff99de355"}},{"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/providers/download_queue_provider_paths.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f62c130c571de05679c3d3a01d79268071dc25b1be70b157ad5f09bfdcb75c"}},{"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/providers/download_queue_provider_paths.dart"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"442850a26eb85266034c55449e36ce80d92c194eb50e606c0e7bf490476de385"}},{"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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a96b7f64459461fbb0b8fd7cdacfa50476ab232137b485db96886dbe3d3fe1"}},{"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/providers/download_queue_provider_single_item.dart"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"820ff550e6c1153c937594b3c25bc257584ff68560ca8eb5b27bfd06fcc6141e"}},{"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/providers/extension_provider.dart"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"df71d43e699670564b995fd7228a7db5f27855b5c15fad509ac8d63803bd8f10"}},{"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/providers/extension_provider.dart"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"69aec915302c54dfb830fb4f6fcd011ef013fac739fdc679a1f358990f5a5bae"}},{"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/providers/extension_provider.dart"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff82bac2facf1a96d27c9607a2b6e8cc2d0ce240f8156fa624212c22926c9c4"}},{"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/providers/library_mixes_provider.dart"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"6639c21aab8f6bbe04d26cd9f60a0d5edee4985b36460606cd62d01623e43730"}},{"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/providers/local_library_provider_scan.dart"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d5791ba1872d5995c933278a15b89df20610ac918037a348972c841b029876"}},{"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/providers/local_library_provider_scan.dart"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fdceb3e7e95589ad8ab09814177ef1fbbdedd1dee71e70c963ebe83c885de1"}},{"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/providers/local_library_provider_scan.dart"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd449b96378ec061ec81ba71a1b8c2307a4b996ce5a84a1b1a055398d6f5f55a"}},{"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/providers/local_library_provider_sources.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0950133c8dbf8388914659cc70b6dfaac2ca75e2f7346fbd5da046e9c82cab6b"}},{"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/providers/local_library_provider_sources.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7e4bb9e1dbb8bdff661adfe4491bb949b761eeb2793db03bd849080db14c35"}},{"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/providers/local_library_provider_sources.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"359b8e99484acc0dde114bba6eb630ed0d50aac54b2c3036c3b133b789878d9f"}},{"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/providers/music_player_provider.dart"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c80b6a1583db1f7a096a55bb8e875b1bf25720142323062827a857395a1bb78"}},{"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/providers/preview_player_provider.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da8ae9304e24b33d66cd6d9be6586c96ff649f180eecd1ba06e1e06d40d7555"}},{"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/providers/recent_access_provider.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"99573ecbc76a0218f09f3ba7eb9b5a5a76e353a10cc506345ed4e5a376f7715c"}},{"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/controllers/batch_track_actions.dart"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"4639c85b28dd49037c952d333712f2f36fd2724394afa4af4828f2aa217d1052"}},{"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/controllers/batch_track_actions.dart"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c39afdda0ea8a9cf73c241e432c096dfd86cc675294edead026a26ecc82e7c0"}},{"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/controllers/batch_track_actions.dart"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"45439bf193059e2cdb1e820017f072a6fe10630ad2fd9985516a89aeb86dacc3"}},{"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/controllers/batch_track_actions.dart"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e81e4e6faed465db9dd8dd963447abefff3b3c4d8e328dcd1375d5a2eee582d"}},{"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/controllers/local_track_batch_actions.dart"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9458d878329f21f2591cf76674d79bee5abb28bf8596e2db5fa01b593b804fd"}},{"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/controllers/queue_library_refresh_policy.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b330145e127ec3d6f9cc5d768a33691117129200b59238ee8f65609d9a84149"}},{"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/controllers/queue_library_refresh_policy.dart"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2e49ad9002033b544623bcf12ed3061afb1e425b9180b4fdf8883b7934e7c1"}},{"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":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efc0735dc2113b5e7e4135c290651f9a022a5c7571b5df11e4baf8f15a2f004"}},{"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/LinkNowPlaying/LinkNowPlayingExtension.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e884eedd7520a0b18557f2c1a5d70fa7a7ebf3f137bc06aeed42c77bc0ed40c9"}},{"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":"android/app/src/rust/kotlin/com/zarz/mornye/RustCoreBackendApplication.kt"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"745a103d83efbae2d8a1f37aa2bac86a1198d6333c532e0beb4a3d72241d46ae"}},{"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":"android/app/src/rust/kotlin/com/zarz/mornye/RustCoreBackendApplication.kt"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e85bf7bcf4f63b79e76445baaccb168dc76877d10ad5a3671a91548d651a11"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/AppCrashReporter.kt"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b6d80273d4167f91be61d3198dea092f045a675d44ad54adbafa8991553e22"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/CoreBackend.kt"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c6c37f0375bcd5819be8749b829cb0a48be61026d64dfe2d9a36c206f8c819"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/CoreBackend.kt"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b510b348aaf243f4aeecacf658599627883d647080c396feb956113c5366d84"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"a727c4579ecb05ec9cacb8458a7115471e8fa09abde34509e4efa37a2aa55aa2"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb6b39352d00d70d9bb07fe9f5194a05024a4d31ee533d41865950777c235b2"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"30be5196dbde446984b6ae452a467a6ce83c84a69ad1d4450b4389bc503c513a"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73be410ce1a389f7adc01a0e14fb61815d50cee360ac57fb3aba7381226dd2d"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"09346fb6c8eefe4f4b9e35b628f6441160fcc499bf10cc017fcec0bada5839bc"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"e043bd3b7f56880fce9b5d1cd2026a6840eafffb39ee9e1a4191c07af6931951"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ab119a69999a8ae28f11f0f38635203fd4be4ce38714bc3049b1d099cc84ee"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f892fbf89eb4c3e676ab67b871853b8e7030835180246d9f0da80b3953e3ab4"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b30e4e976fe3841c1362acccc695384525f5f3c924cdb2e16abf984dc6e6d3"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef01586cf21532cf27708102283f7a5cc2bddeeffbfcba57fa293cd8523d87e"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9b30265826880bf6d18150ab891c559f102340230f6bf00108b3fe4bb8764a"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"a092cf842c4088eac3a273e9f031600982a13d7a68dbbab15e2a711261ddf4b3"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e09e4dee12e306e2c62c2209f2f945b89916d61a99e62f16e3e3e5e21e64707"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"9323216f9510b4866c6f81d321836716399bed4c4d12c4a3218c3a55ff7868f3"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceNetwork.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63d5cbfdf3feda5cdbc6e21c93f9d5f2122decf2434ea0fbdeead32ad1c76e0"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceNetwork.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"77314b1e2500246303b0ae6a62d29716a97c3a3589a5e82df44954d43dd944e2"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceNetwork.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb6e6d262873ce643d3e9febac90e5ca057c3fa06624ce84e5de9c292e3220b"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceReplayGain.kt"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3c17db62e8b29318738ab34b9724f973dc92449cd09a9b42df32996c84608f"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceSnapshot.kt"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d1211be58d174cf37b98c2e8496cc3f5b8bc0b55907f11ada082d9b7a2ad93"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceSnapshot.kt"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c5c837bb4bd78dd476b01f5a32423252e323311ddfad52764fefe8c13da6cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e: 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":"android/app/src/main/kotlin/com/zarz/mornye/ImpellerCompatibility.kt"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b033c4dc4fed91124cde4400ea07a538c887aeada80e03f8141b4851defbf7a"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bbeb3fddb72b615b34f2a29375a689984fc158777d7b1f874dfd27e9d8eba8"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe245dc15824e42d95155f7a5e23103b5f42e3453e8fdabaaf9249c99da08de"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e77ed6d3a3267e29005c9854a2dc5f469b1bc0c97cc90487a55a120f524fe7"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f8f2f3f069fcde1b8eb35e7b37b94f7b4fdde67e3a29204591bcd599c2ef10"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivity.kt"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc9700ad828ddfbcec972b5c431bccaa629a5487fbc8fb69fd0bd0f35df207b"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityInstallState.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f66ff5a3a3a60154cfb589a552bbbaa0213710026862b34d887c6eaf398ebfc"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityInstallState.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da50f975ce9c418b21d03192d0f583cf068134c473accef2c0f7cda557fbf20"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1190e1a0a2b19710241b18dbbaea0f0accfce1233d7566d0739d268e222073d0"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa87b617b900db03725195cbb7bb32d3423ab5f8cad0758046f37afb4b83c203"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"314e46ada37133d19493a7ae553962b9365c2a867e960458a6b9edc4a9bd4349"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d572faa1c56d68d88ff789ae0b7ac1cffa91b248edb363480a18b1d85c387c9"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7497b5f0641c4ff3b38c00f3263cc1396b15553940e769a1bafd3334c0c703d4"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e76904e82f31e94fc4718bd29108e75d237672b639e8dcc31ba7a456262dab"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityMetadataCalls.kt"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8735680520b15d61f98c8c6cdb4d80f56748308933e6d0de7e3b4c85cb3115d3"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivityProgressStreams.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6dac642c4d8689cf6181f1e881e3b4f89aaa97e2295a0941e10bf2af3cd469"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafCalls.kt"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37c4395cbdb0f53811e5b61abe040b6570df660e4b6d9b5026c438fbef69e86"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abd3ba001f85340fc6cd6209fb95d1ad4417a2a498f2e4a0fb9457781f78394"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9e1d3fcc805a5c68f4d0f1ad96d8f96701fa039bb22266257d666108a10cf7"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29444ac731eb30b12d7eb530453610eb07d20a2a7c09294e54cfb8052ec5bcd"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c48b443ce84c6e7844984c28f8703d746e05352f218869ee31dd2e66c85ce0"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2b72186945b1a60d93f03c8976394aed29873319f2350d8f38264ee48d5fd9"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e0ee0fecaf137efff4ef21d6e57598fdcd1a16bfe4102bcb7dfa356e297374"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b71649e7fe531e4f8f1516c5e7456f27bdadd67b68b5d70c92c26c67bea9c9"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"c413bb4d9023f60840a01c66aaa6b84462e72efeff29abde926ffcc07315a426"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2df3fd34f855d062aa818fd03c3375daa10cd0903eb0aa8e2669d0953ddc8dd"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"592fc3551a994bd43dcd678192c86246e0b9af462af83468b7ca0a338fab5036"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafIo.kt"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7a69d9d382b8367d6de3a3a5579c5ee2f5834267194e6c3e6db29956ae1eda"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafLeases.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c6e4df86a63072f9bdce8ccd3965c8c1f7697ff8b697e3aed04519dcb849a1"}},{"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. On a teardown path letting it propagate is not an option (throwing out of \u0060close()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafLeases.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0e2657b8161875893e7dcb451d2a1aae9a399a8d7c2eeaeb30e0bddd31bba2"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c7b485f77ad5bd5ed58b41c330ebf93c782e3af601a0c631b3768781cd8ee3"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb8bd25a021ff1c84c4280c46ff78d563b5bb218805de4a28112e6e6bd5e7d3"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07662bcda2dc461617a4f507d4257502ca767aa1f05975a0fffaa3e62d81887"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"885eb805052b87d9e076ef2d8bf96cb8a0269896b5dc460d033a5a361e2f2cac"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12f6684ee8c35c984e1f549f5dbc2e362aef64aa50ea1a68dc59ab63f8e6251"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a3146518fd10f42f641339bd59d1743b25778cee82e14aadadcc7002609292"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b28115f0e7f778c77394dc8c6f4a5f84dadd609242f4928f1a2fec937093f3"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafScan.kt"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"f539ea92b42d468ff4a2cfa95c49fdc2c3851f6985341e5775b031db71c8b498"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySafTreePicker.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f57c4694ab32e1182a9e14017ce665d241632a0b5d0193df4dda53fc48473e"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/MainActivitySmallChannels.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1b0b63cabf4e9f6a17100c7a2626ad448425d6a4f781ed03654ef6b305678f"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd2f41f03ec71ac0bc43243d8669b66e0afb10f0ee89a2b67efc41998989139"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeDownloadFinalizer.kt"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c090caeae96a3806592a7daa006ede3dc9a6f907cf6239bcc6b83a7e7551be7"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerDecrypt.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"592efbe3a1880b9d9c61c90e9a1cddbfa79a99d0cb13fd6b6b09a8fc2d9e320a"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerFFmpeg.kt"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"60662dbaa77c973a29156cc9580b042046c6203de040fda51f29a6a4788a0c85"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerFFmpeg.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8382b72ca0982fc4ed25a77e6086105d27d575fcc0859d21ab54c440edad377d"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerMedia.kt"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c93841ecac89484858b754efb5f7b8a39fe7d9fa4e9c870c5df65b02628f8c8"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeFinalizerMetadata.kt"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cc318738b829492050d2e10c9b52f4d5e55c10a04bc3c6a0c4729b28cf83e7"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeHistoryStore.kt"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"55353e2744f3e7784d2cf3295d19a6b0d4d04f4441c11f6e99a9e90b20b6dd8a"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeHistoryStore.kt"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5d6223362b56793e5881f10064f503b1efc58afc1e8f4d2fe834b8d46dcfa9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Throwable)\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":"android/app/src/main/kotlin/com/zarz/mornye/NativeHistoryStore.kt"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"1542de118212b4b4e010dcc350bba5b94bba7c6448fbf9d36fb7993221bbabea"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeHistoryStore.kt"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab482f437520fe0a7bb26703313713a2d5f81b959451e2beb0d2907813b24294"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeMediaWorkspace.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a79b91ad46240afdd9df6643f9a0a27ba8396db7a0001be0154a61b97861a0"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/NativeMediaWorkspace.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca5d03a12ac8ec46e6af9e93fd3bf81d421528fb286a8a48b322a542db8da04"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafBatchQueries.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c519965e7b4e26ee620b35d574457579423e9a3b8ec026cea806e98ccace06b9"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafCueLookup.kt"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cce8dfec5210729548ac3e92fa4f20a69533492d789e59914de1cf53f306dd"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafCueScan.kt"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac7b8031317e81c5f939505f82c8eb00469b04c162e86e5ee452b7bd4f45046"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafDocumentLookup.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5d8ac53b6699e65cac5d25d12c7ad3e4db14f00be288b935a85a6ba74f1766"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"18834a36d39d88c9f168e55f9df0b50ae45936e0782f5a1bd582ef93f7bfeea4"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4426308468d549025569ee6f27a886b2ea1d7eb3d0aee9aef55827c693243d2"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36cddda30930d4f99b9945b8449fbd3aeb57ddbf6de92564fc840e3ded6433a"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f23c433466895b13d98a7998ddc4a4763f2c5aef69f943f073d6d19fe4fd661"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30f5e71ff7ff22c8a16ee2f994be671c7453cf2c938bbd3af499d402f22a762"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88822c56e256fc8291f7c30340ed23054188b13a221b04dae603eb29cef8f8e"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafDownloadHandler.kt"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a19d72ec2facaa6723318ca6fb59e23e1a96f56b893c6ff28c191e05514605c"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafFileInspection.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0177718931ecacd7c0605d57beab9a97447f7a8a0365b67abb251846601254"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafFileInspection.kt"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"910bd6d6ad1117d0be639cb25ee24f28da6336020d63900eab29c7382ed723c1"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafFileInspection.kt"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd97e12b63021762b8ab6bcb161c1bd7333b93f62fd4f43155c9d9011dacfee"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafFileInspection.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6c18a34c363bb1988268e239a88e72d412767bf8ce73cd68fc3fde0c9f213c"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafFileInspection.kt"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f44571b6aa748f5441cbc03d290b9735658a7d0cdab59cd89a9acc6a348afa7"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafScanCheckpoint.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58cbd7fa661c0ed2aab083c516c2ea6ca3682726ec775db334f022201cf5130"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafTreeListing.kt"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b8d1f8e1edf1cfee9a4d3c8f41e084db8cababfac52e30237369de3d10f8fa"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafTreeListing.kt"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6b4a1c04a9608c066a6b763f6457abb0b08388f950a5be331e74b5e58d352d"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafTreeListing.kt"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"530088db1014467d70c8fe7058263bfc4f99e091acb624aa2cd5f37145b13e43"}},{"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":"android/app/src/main/kotlin/com/zarz/mornye/SafTreeListing.kt"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51c8744f8140e1020e96ec0c980cf1478d52d3d14ef8d767e7301f4594b6edc"}},{"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 Rust code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_lyrics_translation.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"350264caa6ba61482dd891b08bdeb22c3b3701a0bfa3d0f0979267dcc63ce7a6"}},{"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 Dart code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/services/lyrics_ai_client.dart"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b19a095f4d884d8acd47f559c5a89e7b479c47508fca9497b49f3b6d65dbe3b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseNativeWorkerRunId\u0060 swallows every exception into \u0060\u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c23ce701f629dee4e9cd8c5d356f609d9bfc6a3dac1a342092425743d882fcf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060nativeWorkerConcurrency\u0060 swallows every exception into \u00601\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"3083adbe81fda8d8baae2ac10aa6c17c4786becd3d9824137b4107cc9888a864"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060nativeRequestProviderKey\u0060 swallows every exception into \u0060\u0022default\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b5b9e7c9f5d9b6e3c2c15164c91f5b1b34dbb7358fcb0012b4aeb9c49716bb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060nativeRequestProviderConcurrency\u0060 swallows every exception into \u00603\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/DownloadService.kt"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a88297d9521ada5a7c18ed1915492ce0c2ca8085fda26493351a125d192ad0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readNativeWorkerRunIdFromSnapshotFile\u0060 swallows every exception into \u0060\u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceSnapshot.kt"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9768d52d0a27e905d39fe0ff51f8e36f955476dd87640503174168819426c707"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060pollNativeWorkerProgress\u0060 swallows every exception into \u0060emptySet()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/DownloadServiceSnapshot.kt"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47aebd8aa45d4bc055027bc93a5e8148153f46a8d96e057bc7a3eaaba948d22"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getGpuRenderer\u0060 swallows every exception into \u0060\u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/zarz/mornye/ImpellerCompatibility.kt"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bc4cbe1f5205d63470b35dfa16356940bef9e9a1300d0149bf922127bc6dc9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_getTrackCacheSizeSafe\u0060 turns every thrown error into \u00600\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/screens/settings/cache_management_page.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9372408522a1cd9ab74bce6e5406a3f97160d8e689496569bbfdfbb7a1b891d3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_read\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/services/link/client/link_client_store.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e726cf2762c0c8fcef0cb3e41f491f4674e251ab8493c140bc79ff395d863e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read\u0060 turns every \u0060Err\u0060 into \u0060Ok(String::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/isrc/native_files.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b60d5f079dd1623f03a7dbbc1e35ddf23b88d39782804b9caae1aa342cdc88"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060clock_duration\u0060 turns every \u0060Err\u0060 into \u00600.0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/core/src/lyrics/matching.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"888110bf0cd8f2feca133f818785bda20e07f1e5fb20e192d5c4c89dd3e50571"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060fallback_status\u0060 turns every \u0060Err\u0060 into \u0060\u0022unknown\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/backend/health.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9521111b51c8809b841353f751d04c526a18b89079517df6a0843ad513f9b0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read\u0060 turns every \u0060Err\u0060 into \u0060Ok(String::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/files/index.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8006a8ea4534eca53bd381edd4900ecd0145b950317125edc510c8dc9f6a19f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060total_length\u0060 turns every \u0060Err\u0060 into \u0060-1\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/download/chunked.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df4292be62ce30d6ad9fc55648675566c26336e14544fd71ec018859f58601f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060duration\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_lyrics/text.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c65552287bd42aed441248ecbe9e2973b459134c785b5c18fb8b2ba909c9bd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060romanization_words\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/mobile/src/native_lyrics/text.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e72246f36a95fe178403faee8e7921b0fce0d73b815494f8046ad0d3f51132"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lowercase.contains(\u0022warning\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lowercase.contains(\u0022warning\u0022)\u0060 also satisfies \u0060lowercase.contains(\u0022warn\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust_backend/crates/extensions/src/logging.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b1bea2034b7d0f0416f430fafe9dcf1eddd3a1fda3d02dd5682ef80a0ccc86"}}],"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-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-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-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.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-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-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-926","guid":"0d9b5579-5549-555a-8a97-f9cc14f3ad4a","name":"Improper Export of Android Application Components","shortDescription":{"text":"Improper Export of Android Application Components"},"helpUri":"https://cwe.mitre.org/data/definitions/926.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":"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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_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":"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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"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":16,"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."]}]}