{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"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":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"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":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"DM10","name":"One transaction, one aggregate","shortDescription":{"text":"One transaction, one aggregate"},"helpUri":"https://codehealth.canine.dev/dimensions/DM10"},{"id":"DM11","name":"Constructible invalid state","shortDescription":{"text":"Constructible invalid state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM11"},{"id":"DM2","name":"Strongly-typed ids","shortDescription":{"text":"Strongly-typed ids"},"helpUri":"https://codehealth.canine.dev/dimensions/DM2"},{"id":"DM9","name":"Scattered domain decisions","shortDescription":{"text":"Scattered domain decisions"},"helpUri":"https://codehealth.canine.dev/dimensions/DM9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"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":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"NowPlayingScreenKt.NowPlayingContent (cyclomatic 213): NowPlayingScreenKt.NowPlayingContent has cyclomatic complexity 213 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"184c6f7c52dce31627945d549162ade19e1b7f10fa7168dec3d5e6971c1535ff"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeScreenKt.HomeScreen (cyclomatic 121): HomeScreenKt.HomeScreen has cyclomatic complexity 121 (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":"app/src/main/java/com/mica/music/ui/screens/home/HomeScreen.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9222b2b528b7305875560044a40030f615707c5dd46c08186ad35a9c458a1e8d"}},{"ruleId":"D1","level":"warning","message":{"text":"NowPlayingLyricsExpandedKt.ExpandedLyricsPanel (cyclomatic 83): NowPlayingLyricsExpandedKt.ExpandedLyricsPanel has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/NowPlayingLyricsExpanded.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46e046640da240957984faa64eb973fdb9a7471b767e566f58b026f3c5cb76c"}},{"ruleId":"D1","level":"warning","message":{"text":"SmbBrowserPaneKt.SmbBrowserContent (cyclomatic 81): SmbBrowserPaneKt.SmbBrowserContent has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/home/SmbBrowserPane.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef728769bb6adf6ffc30f3e65a5720564e32baaee5895b971458f5bc0d46322d"}},{"ruleId":"D1","level":"warning","message":{"text":"SafAutoSyncPipeline.executeObservedSnapshot (cyclomatic 62): SafAutoSyncPipeline.executeObservedSnapshot has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9c8191a735606c4c2c815d498c615b02a600af4fad0dee99bede8686d879dc"}},{"ruleId":"D1","level":"warning","message":{"text":"PlaybackRuntime.createPlayerListener (cyclomatic 44): PlaybackRuntime.createPlayerListener has cyclomatic complexity 44 (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":"app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd54c30f79d1f04c764495b5a91ab84d2d1bd7f190781182d018a5c38d2336ce"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryScanEngine.performScanLocked (cyclomatic 43): LibraryScanEngine.performScanLocked has cyclomatic complexity 43 (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":"app/src/main/java/com/mica/music/data/library/LibraryScanEngine.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48380f29b44ea27a9b05f70089f8018ae083975e2519d4ee9911116b278106b"}},{"ruleId":"D1","level":"warning","message":{"text":"NowPlayingCoverSectionKt.NowPlayingCoverSection (cyclomatic 43): NowPlayingCoverSectionKt.NowPlayingCoverSection has cyclomatic complexity 43 (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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4cbf4dc4c127cead96ee375f279579cebb30e95aa050f138a14e21b11b77a5"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryAutoSyncQaProfileService.onStartCommand (cyclomatic 42): LibraryAutoSyncQaProfileService.onStartCommand has cyclomatic complexity 42 (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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a68426a5fbc0e0d919265cbbca94403a33ce5cfb4dcaa8d2e696222c9edf63"}},{"ruleId":"D1","level":"warning","message":{"text":"DeviceAutoSyncPipeline.executeInternal (cyclomatic 41): DeviceAutoSyncPipeline.executeInternal 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":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3bd653adad1769c0cb404b146b1cb0b8ea61c87637bcf2fbd0378076ce9627"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsScreenKt.SettingsScreen (cyclomatic 38): SettingsScreenKt.SettingsScreen 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":"app/src/main/java/com/mica/music/ui/screens/settings/SettingsScreen.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edd2c342dcd6c0b9025df108c53aa772993ba136814363c56e59bf358f9d6c8"}},{"ruleId":"D1","level":"warning","message":{"text":"HybridQaPlaybackReceiver.onReceive (cyclomatic 35): HybridQaPlaybackReceiver.onReceive 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":"app/src/debug/java/com/mica/music/media/HybridQaPlaybackReceiver.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8643752550911fe443a036b029ca6aa9d1b7dbdbaa2ac6fa04a070e5939c29cf"}},{"ruleId":"D1","level":"warning","message":{"text":"SongCoverKt.SongCover (cyclomatic 35): SongCoverKt.SongCover 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":"app/src/main/java/com/mica/music/ui/components/SongCover.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d536e3de4cc9bd9d26f6cdb693a9c7e9bc3be19f032f2a666a3722abb6deee4"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeLibraryStatsKt.resolveLibraryStatsBarModel (cyclomatic 32): HomeLibraryStatsKt.resolveLibraryStatsBarModel 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":"app/src/main/java/com/mica/music/ui/screens/home/HomeLibraryStats.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"24be60bb111ef2025fccbd40f8c8f3aaa2d6908a31387734a0d8de180378016d"}},{"ruleId":"D1","level":"warning","message":{"text":"SongChangeDiagnostics.changedFields (cyclomatic 31): SongChangeDiagnostics.changedFields has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/SongChangeDiagnostics.kt"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12bf66c08b68929f96e4385bb9f53578e37bc4e0142a21e1d597c9587501dbf"}},{"ruleId":"D1","level":"warning","message":{"text":"PlaybackQueueSheetKt.PlaybackQueueSheet (cyclomatic 31): PlaybackQueueSheetKt.PlaybackQueueSheet has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e357fc8d332afef886d49a5e4db6f2283a77f50768297e93223c77df9e5843"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayerPageLayoutEngine.computeFrame (cyclomatic 31): PlayerPageLayoutEngine.computeFrame 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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"736b9330fe260d4e06e1a0bd57f8c4c33d7408889e0f8d9d2768a1f74777acfc"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationLyricsCoordinatorKt.buildExternalLyricsLine (cyclomatic 30): NotificationLyricsCoordinatorKt.buildExternalLyricsLine has cyclomatic complexity 30 (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":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"672392e9e0231ecb5c8120203bd0bc1243c34230f2a2368f39ebdeef7522c239"}},{"ruleId":"D1","level":"warning","message":{"text":"CustomPlayerLowerPanelKt.CustomPlayerPagePanel (cyclomatic 30): CustomPlayerLowerPanelKt.CustomPlayerPagePanel 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":"app/src/main/java/com/mica/music/ui/screens/CustomPlayerLowerPanel.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f8c8f80cbc25e3be0528cd027b4902fe6eb2006c0f4e7b00a68195abceb326"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsCloudPanelKt.LyricsCloudPanel (cyclomatic 30): LyricsCloudPanelKt.LyricsCloudPanel 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":"app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e320e3b93bc858a6798b72d00686a33b18ffa694ab99d31787b0d368332545b"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteMusicSettingsPanelKt.RemoteMusicSettingsPanel (cyclomatic 30): RemoteMusicSettingsPanelKt.RemoteMusicSettingsPanel 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":"app/src/main/java/com/mica/music/ui/screens/settings/RemoteMusicSettingsPanel.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7868e655df9aa5c791f843e8655044ac12a99b8bb0eb1262bf17f700531dd10"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryAutoSyncQaReceiver.onReceive (cyclomatic 28): LibraryAutoSyncQaReceiver.onReceive 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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b40f522d217975d75f130d4292dac552b4ff71069bbcbecfdd02695bec7cde5"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayerPageLayoutEngine.computeCoverFrame (cyclomatic 28): PlayerPageLayoutEngine.computeCoverFrame 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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"925e935c8349b28a78c6a21941c360711fdcef024246052a61d7dfb548b2e57d"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationLyricsCoordinator.reconcile (cyclomatic 26): NotificationLyricsCoordinator.reconcile 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":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e466a887849a8681de64361175b1f832af2cf4b0ad849d141ac8cd74ce973c19"}},{"ruleId":"D1","level":"warning","message":{"text":"LetterLyricsPrototypeKt.LetterLyricsPrototype (cyclomatic 26): LetterLyricsPrototypeKt.LetterLyricsPrototype 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":"app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec429c3fc28710bb03216c8d3c9fedead6c4baf59c16da4e9cc6b83a2dcb5e29"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryAutoSyncQaReceiver.runDeviceAuthorityGate (cyclomatic 25): LibraryAutoSyncQaReceiver.runDeviceAuthorityGate 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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"915310b634116e5a22fd3f1b65114ad4f7542085975f85d46de05f3788ca93b7"}},{"ruleId":"D1","level":"warning","message":{"text":"FolderScanner.loadDrafts (cyclomatic 25): FolderScanner.loadDrafts 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":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14684f8e6e9855f29817a61010d2016b5cf9c0a73f601ccf5be7504774a7a90"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsSanitizer.isBinaryGarbage (cyclomatic 25): LyricsSanitizer.isBinaryGarbage has cyclomatic complexity 25 (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":"app/src/main/java/com/mica/music/data/scanner/LyricsSanitizer.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afe7c55fa3573b47b0d8c9726c2c9b422348c047304d6ef260834d2f8b77d8f"}},{"ruleId":"D1","level":"warning","message":{"text":"LandscapePlayerPolicyKt.playerViewportPlan (cyclomatic 25): LandscapePlayerPolicyKt.playerViewportPlan 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":"app/src/main/java/com/mica/music/ui/screens/player/LandscapePlayerPolicy.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bdad7c3fd7b48dd6ed489066d7b50801d494809b9a23c32bd6eb0e6725a88f"}},{"ruleId":"D1","level":"warning","message":{"text":"DeviceShadowObjectProbeExecutor.execute (cyclomatic 24): DeviceShadowObjectProbeExecutor.execute 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":"app/src/main/java/com/mica/music/data/library/DeviceShadowObjectProbeExecutor.kt"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"260b1f181e37c2602f801e2fd5046e421f201b01ff2c88ebc4df766352ae6216"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanProfilerKt.reusableCachedSong (cyclomatic 24): ScanProfilerKt.reusableCachedSong 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":"app/src/main/java/com/mica/music/data/scanner/ScanProfiler.kt"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dbed384869a27356aa2e7849b6c7bfcc337a0f264e952e2726f73711dfefca"}},{"ruleId":"D1","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.beginGenerationPcm16Probe (cyclomatic 23): UsbSk02DescriptorPrototypeReceiver.beginGenerationPcm16Probe has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: UsbSk02DescriptorPrototypeReceiver.onReceive (cyclomatic 30) 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"5513c86465e220a5f318c3aec83b3383ddb7d5eb6d61cf2cca34868f16e78782"}},{"ruleId":"D1","level":"warning","message":{"text":"DescriptorProbe.parse (cyclomatic 23): DescriptorProbe.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. This is NOT this file\u0027s highest cyclomatic complexity: UsbSk02DescriptorPrototypeReceiver.onReceive (cyclomatic 30) 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"0502d7e4f302234b1c9c4a9a4990aec045d4c6972a54bcb3648940172e85f602"}},{"ruleId":"D1","level":"warning","message":{"text":"NowPlayingCoverRenderersKt.StandardCoverRenderer (cyclomatic 23): NowPlayingCoverRenderersKt.StandardCoverRenderer 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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverRenderers.kt"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea9c9f653e1ed0db4dd59da57377e04f132f140d8776f024114643c44b89d9f"}},{"ruleId":"D1","level":"warning","message":{"text":"FolderScanner.observeTargetedMetadata (cyclomatic 22): FolderScanner.observeTargetedMetadata 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":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2784600429bba3892cf8c53366e1d0aa48dd4484920c2a55978e26632e67a88"}},{"ruleId":"D1","level":"warning","message":{"text":"MediaStoreScanner.loadDrafts (cyclomatic 22): MediaStoreScanner.loadDrafts 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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d90fac04045d60d6e3dd367a6f5f9175beccef80faf287c32c4b8e50497b645"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsDisplayKt.LyricLineBlock (cyclomatic 22): LyricsDisplayKt.LyricLineBlock 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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4292a0c09178bd1b13d8f2968b288ee0694faf757178f692a38b691bdf38179c"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayerScreenAppearanceKt.rememberPlayerScreenAppearance (cyclomatic 22): PlayerScreenAppearanceKt.rememberPlayerScreenAppearance 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":"app/src/main/java/com/mica/music/ui/theme/PlayerScreenAppearance.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0b310d8a7feefb5bebfe16a8f3dac33248e52409062bf5a5383121e5622da"}},{"ruleId":"D1","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.decodeMediaProbe (cyclomatic 21): UsbSk02DescriptorPrototypeReceiver.decodeMediaProbe 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. This is NOT this file\u0027s highest cyclomatic complexity: UsbSk02DescriptorPrototypeReceiver.onReceive (cyclomatic 30) 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"15422ca4bf6caffa11fc316c474088feee1a8bd4ea37446c85bdbac65895a8d9"}},{"ruleId":"D1","level":"warning","message":{"text":"DeviceShadowMembershipAuditor.audit (cyclomatic 21): DeviceShadowMembershipAuditor.audit 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":"app/src/main/java/com/mica/music/data/library/DeviceShadowMembershipAuditor.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30775592ae8ac31b9deff2d6c4b03f5ebed66c308f60dd1e5d2e7c3a5fd8b4a"}},{"ruleId":"D1","level":"warning","message":{"text":"CoverFlowCarouselView.updateCurrentIndex (cyclomatic 21): CoverFlowCarouselView.updateCurrentIndex 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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04547c8acfba1f5317b6911ed70806c87cb309961e9f4424ae2fb2bcde386e6"}},{"ruleId":"D1","level":"warning","message":{"text":"StarMapSceneProjector.project (cyclomatic 21): StarMapSceneProjector.project 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":"app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40fe590d5c6879fb08b9668aeda6d5ec5c551751da22e620db0eee73f5855a2"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryCacheLoader.loadCachedLibrary (cyclomatic 20): LibraryCacheLoader.loadCachedLibrary 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":"app/src/main/java/com/mica/music/data/library/LibraryCacheLoader.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b79049094050c7512b0e8a34f7efd5973155d05ed641e6c601219fceafb3a09"}},{"ruleId":"D1","level":"warning","message":{"text":"SmbFolderLibraryIndexer.discover (cyclomatic 20): SmbFolderLibraryIndexer.discover 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7277e78d5f9da3b9f09a28bbe9226289afcb35c0d273480cf5399a210c9ada22"}},{"ruleId":"D1","level":"warning","message":{"text":"BrowseGroupDisplaySheetKt.BrowseGroupDisplaySheet (cyclomatic 20): BrowseGroupDisplaySheetKt.BrowseGroupDisplaySheet 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":"app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabbd7edfe5ee338597339babe65438580c30bd5e2d7c52ed65f5ebc437e3a3b"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayerLowerPanelKt.PlayerLowerPanelSection (cyclomatic 20): PlayerLowerPanelKt.PlayerLowerPanelSection 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":"app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanel.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fc4df1ee422a36d66e28a9acbfeca79151246295f5e7dd5b6a33e567687d52"}},{"ruleId":"D1","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.beginPcmUsbProbe (cyclomatic 19): UsbSk02DescriptorPrototypeReceiver.beginPcmUsbProbe 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. This is NOT this file\u0027s highest cyclomatic complexity: UsbSk02DescriptorPrototypeReceiver.onReceive (cyclomatic 30) 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"873734e00aa6addd8b508eda249c2f317f0c4a2e22c4c059e5d5cdca43319ac0"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbeddedLyricsReader.parseId3TagAt (cyclomatic 19): EmbeddedLyricsReader.parseId3TagAt 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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce756c43e8f34b0752ee6d035133116ce5cabe9dc12a69d310643f2ce585b3fb"}},{"ruleId":"D1","level":"warning","message":{"text":"EncoderSettingsReader.parseId3TagAt (cyclomatic 19): EncoderSettingsReader.parseId3TagAt 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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc6e6341a1af7cb0a03d2a4f5f9a3d9e9975aebe11f0783882b834a5b3d1f66"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsEncoding.looksLikeMojibake (cyclomatic 19): LyricsEncoding.looksLikeMojibake 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":"app/src/main/java/com/mica/music/data/scanner/LyricsEncoding.kt"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7d30f8c3cff7011271c128d04a45085c33b13998f5825fb75a22ecb491378d"}},{"ruleId":"D1","level":"warning","message":{"text":"LyricsEncoding.scoreDecoded (cyclomatic 19): LyricsEncoding.scoreDecoded 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":"app/src/main/java/com/mica/music/data/scanner/LyricsEncoding.kt"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f3436a954e389d56f3dc7e5be74d7731016eb0ca530bfd0a2f68ebcfacce04"}},{"ruleId":"D1","level":"warning","message":{"text":"SpectrumAnalysisEngine.tick (cyclomatic 19): SpectrumAnalysisEngine.tick 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":"app/src/main/java/com/mica/music/media/SpectrumAnalysisEngine.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f4991ffe8809d221923c63c07e5303860f579f31d39cf32d7dbdb3b86b6ddd"}},{"ruleId":"D1","level":"warning","message":{"text":"MediaControllerQueueSync.planSync (cyclomatic 19): MediaControllerQueueSync.planSync 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":"app/src/main/java/com/mica/music/playback/MediaControllerQueueSync.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12e9684b35a855325401b0cb910d55103adc2fb5681994bb6b0fe7649dcf9ac"}},{"ruleId":"D1","level":"warning","message":{"text":"PlaybackErrorMapper.remotePresentation (cyclomatic 19): PlaybackErrorMapper.remotePresentation 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. This is NOT this file\u0027s highest cyclomatic complexity: PlaybackErrorMapper.toPresentation (cyclomatic 20) 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":"app/src/main/java/com/mica/music/playback/PlaybackErrorMapper.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6625acbb3fe5fe3ce5933643df969b85ec9cee10dba4c24106ec66b830beadf7"}},{"ruleId":"D1","level":"warning","message":{"text":"SongActionMenuSheetKt.AddToPlaylistSheet (cyclomatic 19): SongActionMenuSheetKt.AddToPlaylistSheet 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":"app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"6167aa868c6c606562a7478018bd6f36f4fa0fd1b41db8caea70cf375469bce8"}},{"ruleId":"D1","level":"warning","message":{"text":"ParticleCoverRenderer.render (cyclomatic 19): ParticleCoverRenderer.render 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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dcab406f4b85c1f47149c3b7085a8cc86aa571aafbd3e7e2f404f2e49ebb33"}},{"ruleId":"D1","level":"warning","message":{"text":"BlurredCoverBackgroundKt.BlurredCoverBackground (cyclomatic 19): BlurredCoverBackgroundKt.BlurredCoverBackground 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":"app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7db9448aabfeb15077f4617088202a882e987bf8df4d96cffa8cb26905d094e"}},{"ruleId":"D1","level":"warning","message":{"text":"UsbKernelDriverReconnectOwner.reconnectLocked (cyclomatic 18): UsbKernelDriverReconnectOwner.reconnectLocked 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbKernelDriverReconnectOwner.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"11507fdd147c6205961cf470bcbc3ae4b1488d47a93b8304244412ba6b31c3fd"}},{"ruleId":"D1","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.beginSustainedPcm16Probe (cyclomatic 18): UsbSk02DescriptorPrototypeReceiver.beginSustainedPcm16Probe 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. This shape REPEATS in the file: one other method here (UsbSk02DescriptorPrototypeReceiver.beginSilentPcm16Probe) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: UsbSk02DescriptorPrototypeReceiver.onReceive (cyclomatic 30) 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"44027e6212f7c9c49247244e4752b879f16249b4b95d1132d02530e723effce0"}},{"ruleId":"D1","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.beginSilentPcm16Probe (cyclomatic 18): UsbSk02DescriptorPrototypeReceiver.beginSilentPcm16Probe 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. This shape REPEATS in the file: one other method here (UsbSk02DescriptorPrototypeReceiver.beginSustainedPcm16Probe) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This is NOT this file\u0027s highest cyclomatic complexity: UsbSk02DescriptorPrototypeReceiver.onReceive (cyclomatic 30) 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ea5e4255e2daa55d0e903ef73fd8a96cea657688af3b0544645a0fb3739cc3"}},{"ruleId":"D1","level":"warning","message":{"text":"SafUnknownFingerprintDebtPlanner.plan (cyclomatic 18): SafUnknownFingerprintDebtPlanner.plan 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":"app/src/main/java/com/mica/music/data/library/SafUnknownFingerprintDebtPlanner.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85e03bd2d0b9c3525d78bef633a196e5b4ab93ec14a82573fc2fc2d64f24fd6"}},{"ruleId":"D1","level":"warning","message":{"text":"SmbDirectoryBrowser.list (cyclomatic 18): SmbDirectoryBrowser.list 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbBrowser.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfc07d75a7d80027b517b58d9bc58839190a3b7aa7b1503f14a90b6a5fbc40d"}},{"ruleId":"D1","level":"warning","message":{"text":"WebDavSourceSync.scan (cyclomatic 18): WebDavSourceSync.scan 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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d758ec9024ace0c867a2d725023f08c48f6fedf7bea96e3e99221dd8cff14ca"}},{"ruleId":"D1","level":"warning","message":{"text":"WebDavSeekableByteSource.readAt (cyclomatic 18): WebDavSeekableByteSource.readAt 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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavSeekableByteSource.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0993d5fb7b225ecb225b948e8e51d334240468f09bc6fd25fe7c8981b96b2d"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultUsbOutputCoordinator.executeEffect (cyclomatic 18): DefaultUsbOutputCoordinator.executeEffect has cyclomatic complexity 18 (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":"app/src/main/java/com/mica/music/media/UsbOutputCoordinator.kt"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b18805e697dca8713a0e2057f3d154374a6aadcb0acd6bca29c32a8d300902"}},{"ruleId":"D1","level":"warning","message":{"text":"PlaybackStatusKt.resolvePlaybackStatus (cyclomatic 18): PlaybackStatusKt.resolvePlaybackStatus has cyclomatic complexity 18 (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":"app/src/main/java/com/mica/music/playback/PlaybackStatus.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5706a6046b253fb8d39aebfda067b896ab7a36ba42fad2f67a1fc751e19ed86"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayerSheetHostKt.PlayerSheetHost (cyclomatic 18): PlayerSheetHostKt.PlayerSheetHost 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":"app/src/main/java/com/mica/music/ui/components/PlayerSheetHost.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b68133ac018a636fe89aebdf1efc36a03ff0f51fb0edcede234ceebb2ff605"}},{"ruleId":"D1","level":"warning","message":{"text":"SongRowKt.SongRow (cyclomatic 18): SongRowKt.SongRow 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":"app/src/main/java/com/mica/music/ui/components/SongRow.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfe93d5aff2a198e3e5c75cf230512dad0c67c3126c584334729c3faac425cc"}},{"ruleId":"D1","level":"warning","message":{"text":"LetterLyricsPrototypeKt.buildLetterPages (cyclomatic 18): LetterLyricsPrototypeKt.buildLetterPages 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":"app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dff1c5dbeacd2440ca7347b9c60fea71090a2b1c5130fab214419d2d10750b2"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeTopBarKt.resolveTopBarTitle (cyclomatic 18): HomeTopBarKt.resolveTopBarTitle has cyclomatic complexity 18 (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":"app/src/main/java/com/mica/music/ui/screens/home/HomeTopBar.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7d58d3d590fe1fa13d384a966c95108eeb60233069456be7cbd064c5d6b555"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsLyricsPanelKt.LyricsSettingsPanel (cyclomatic 18): SettingsLyricsPanelKt.LyricsSettingsPanel 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":"app/src/main/java/com/mica/music/ui/screens/settings/SettingsLyricsPanel.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ed289915e5baea7d390c05b3ddef93abb0da216d59e48da36d9c5fbc1ad577"}},{"ruleId":"D1","level":"warning","message":{"text":"UsageTutorialScenesKt.TutorialSortScene (cyclomatic 18): UsageTutorialScenesKt.TutorialSortScene 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":"app/src/main/java/com/mica/music/ui/screens/tutorial/UsageTutorialScenes.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"08783f5aeeb6c65fa250be68b998afb7c7f544c138f832b560373bdd01253774"}},{"ruleId":"D1","level":"warning","message":{"text":"MicaPlaybackWidget.provideGlance (cyclomatic 18): MicaPlaybackWidget.provideGlance has cyclomatic complexity 18 (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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"251e3d76b3d20cbc994ca91d77c68044045370ed8b699fbf42c4b1f174577db4"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryQueueSyncPolicy.plan (cyclomatic 17): LibraryQueueSyncPolicy.plan 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":"app/src/main/java/com/mica/music/LibraryQueueSyncPolicy.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e6854846a344aa223970edece4260781e9939f2294b440e24657a636023aea"}},{"ruleId":"D1","level":"warning","message":{"text":"SafAutoSyncPipeline.executeInternal (cyclomatic 17): SafAutoSyncPipeline.executeInternal 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":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e540da4bca5629f52a34a01b5f6a53fa1a4aeebf9b2988685166f2b07216434d"}},{"ruleId":"D1","level":"warning","message":{"text":"SmbBrowserKt.naturalFileCompare (cyclomatic 17): SmbBrowserKt.naturalFileCompare 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbBrowser.kt"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c8368c51a311c6141222496dd542ef3f0991916a0a377e733d1735833f8655"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioMetadataProbe.probeTrack (cyclomatic 17): AudioMetadataProbe.probeTrack 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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b7acb91d0e26bcc98610fa1a01942d54fe98a8a986b8e79a5ad8fa860af65f"}},{"ruleId":"D1","level":"warning","message":{"text":"DeviceShadowCanonicalCatalog.changedAspects (cyclomatic 17): DeviceShadowCanonicalCatalog.changedAspects 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":"app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"537fa290ff7a677b2bd866a0d51713f0a2b636952e00c8c9cb9edb66a94c3056"}},{"ruleId":"D1","level":"warning","message":{"text":"DsdMetadataReader.readId3PictureAt (cyclomatic 17): DsdMetadataReader.readId3PictureAt 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":"app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9239896ac98ae52a3671d470dc142a7df5b72386db6b5cee71b6adb002dc6812"}},{"ruleId":"D1","level":"warning","message":{"text":"MicaMediaService.attachPlaybackStackOwners (cyclomatic 17): MicaMediaService.attachPlaybackStackOwners 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":"app/src/main/java/com/mica/music/media/MicaMediaService.kt"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaabf802b9089c3bf7be739171489c8f24cdbb80cff5d0e65ae7741a199720e"}},{"ruleId":"D1","level":"warning","message":{"text":"CustomPlayerLowerPanelKt.CustomPlayerEditChrome (cyclomatic 17): CustomPlayerLowerPanelKt.CustomPlayerEditChrome 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":"app/src/main/java/com/mica/music/ui/screens/CustomPlayerLowerPanel.kt"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bdb1d3a0b6f72c2e49eaa5928d1fb14036d0e9977efa3c58a46e113e549a49"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeSortSheetsKt.HomeSortSheets (cyclomatic 17): HomeSortSheetsKt.HomeSortSheets 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":"app/src/main/java/com/mica/music/ui/screens/home/HomeSortSheets.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a09628eec0d3e64f279bc5595dad56a9bf77733f7e7390326fa045c5332420"}},{"ruleId":"D1","level":"warning","message":{"text":"PhotoStackTransitionView.drawProgressStrip (cyclomatic 17): PhotoStackTransitionView.drawProgressStrip 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":"app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f82ced9558683e5b70ffd97e926e9b44f089b518d79e088fb73ef50f92cf89"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteMusicSettingsPanelKt.RemoteSourceDialog (cyclomatic 17): RemoteMusicSettingsPanelKt.RemoteSourceDialog 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":"app/src/main/java/com/mica/music/ui/screens/settings/RemoteMusicSettingsPanel.kt"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e7cc0851af16d5c366e72918a9808ebf958d244db0920c34370491bfa7d8d3"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryAutoSyncQaPickerClickService.tryClickIsolatedPicker (cyclomatic 16): LibraryAutoSyncQaPickerClickService.tryClickIsolatedPicker 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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaPickerClickService.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecdddf78f84b11a0683772e4c596e71288ce229be35fab163299eaf10169b01"}},{"ruleId":"D1","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.beginIsoFeedbackProbe (cyclomatic 16): UsbSk02DescriptorPrototypeReceiver.beginIsoFeedbackProbe 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. This is NOT this file\u0027s highest cyclomatic complexity: UsbSk02DescriptorPrototypeReceiver.onReceive (cyclomatic 30) 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd69893ac9d5e8499a9aa208edc23b47e9e0722472a5937123cdb0444f7a9be"}},{"ruleId":"D1","level":"warning","message":{"text":"SafRetryPlanningLoader.load (cyclomatic 16): SafRetryPlanningLoader.load 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":"app/src/main/java/com/mica/music/data/library/SafRetryPlanningLoader.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"846ba2822ae70497f0b3a2afcb830bcd1b7e2539cf2750c79f95ae925abe2a1c"}},{"ruleId":"D1","level":"warning","message":{"text":"SafShadowCanonicalCatalog.changedAspects (cyclomatic 16): SafShadowCanonicalCatalog.changedAspects 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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2991c40bf59c53959c98d7d59a859ec90d7a17fafbc71db13ea3620554f92611"}},{"ruleId":"D1","level":"warning","message":{"text":"LrcParser.parseEntries (cyclomatic 16): LrcParser.parseEntries 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":"app/src/main/java/com/mica/music/data/scanner/LrcParser.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"be129cf805c637bae40a04cdbd50b409d18a0fc261b8e770be56989fb17d483e"}},{"ruleId":"D1","level":"warning","message":{"text":"MediaStoreScanner.loadExtendedAudioFileDrafts (cyclomatic 16): MediaStoreScanner.loadExtendedAudioFileDrafts 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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"768f1d3face8d5bbf1ecf9d4c7f13d0a6e8444da6a1b3b3661ffbe2fe78b612a"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanProfilerKt.requiresAudioTrackProbe (cyclomatic 16): ScanProfilerKt.requiresAudioTrackProbe 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":"app/src/main/java/com/mica/music/data/scanner/ScanProfiler.kt"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5026f5467d81873463e747f78281b6a462d1268240b1c017fb7448e7e51ce49c"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationLyricsCoordinator.start (cyclomatic 16): NotificationLyricsCoordinator.start 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":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3727f9cc86c51999da939241d6e17589b35ebcc32b5ec021b194342399552c04"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationLyricsCoordinator.ensureLyrics (cyclomatic 16): NotificationLyricsCoordinator.ensureLyrics 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":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4f8c25ac700226e4ba2f502bf231cd7dd77fb602e1b317c8c0f145ef3ccef7"}},{"ruleId":"D1","level":"warning","message":{"text":"PlaybackRuntime.bootstrapQueueFromPersistedSnapshot (cyclomatic 16): PlaybackRuntime.bootstrapQueueFromPersistedSnapshot 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":"app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c51ad716ca9b0fb7ac35660674a8a0714822f2a21bad0ff99ec668a372ed7"}},{"ruleId":"D1","level":"warning","message":{"text":"PlaybackRuntime.setQueue (cyclomatic 16): PlaybackRuntime.setQueue 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":"app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba819b9fe7beaba7ebc9220a28c1c96db1218386149688dd29809ad07da9f98"}},{"ruleId":"D1","level":"warning","message":{"text":"EqualizerCurveEditorKt.EqualizerCurveEditor (cyclomatic 16): EqualizerCurveEditorKt.EqualizerCurveEditor 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":"app/src/main/java/com/mica/music/ui/components/EqualizerCurveEditor.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b389ccb7b778c938a125e1c7f2416fd3e0371b70d371dffca5f4c39e1fa30b5"}},{"ruleId":"D1","level":"warning","message":{"text":"SongActionMenuSheetKt.LandscapeSongActionMenu (cyclomatic 16): SongActionMenuSheetKt.LandscapeSongActionMenu 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":"app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2622425bd7b0a833049ffbb15e30c6ee50735ef54e9d7ff5fe47673fb8618a8e"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopLyricsOverlayServiceKt.DesktopLyricsOverlayContent (cyclomatic 16): DesktopLyricsOverlayServiceKt.DesktopLyricsOverlayContent 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":"app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"5effc23fb90038fcc4902aab59eb8f271783a5f3690a586409578994a2c1f062"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopLyricsOverlayServiceKt.ExternalLyricsLineText (cyclomatic 16): DesktopLyricsOverlayServiceKt.ExternalLyricsLineText 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":"app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c893ccfdfb5f5bc3dda5b57a1e5209fcb029d38105660eaa6fb573fa6f4733"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeBrowseContentKt.HomeBrowseContent (cyclomatic 16): HomeBrowseContentKt.HomeBrowseContent 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":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a948d81dd141a117a6d21dcbcd500173dcde1e6d084cfe5e4c94d4d2dc8ad8"}},{"ruleId":"D1","level":"warning","message":{"text":"PlayerPageStateKt.rememberPlayerPageUiModel (cyclomatic 16): PlayerPageStateKt.rememberPlayerPageUiModel 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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageState.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"65870796f474a17774c1234b71177b0f76aec678d4f979a6e942fc5fca19c351"}},{"ruleId":"D1","level":"warning","message":{"text":"PinchZoomMath.settleTarget (cyclomatic 16): PinchZoomMath.settleTarget 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":"app/src/main/java/com/mica/music/ui/zoom/PinchZoom.kt"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f5a6050ac52749ba692a06509a8d87666b3596db9c987f7898bf501adafec0"}},{"ruleId":"D2","level":"warning","message":{"text":"NowPlayingScreenKt.NowPlayingContent (cognitive 330): NowPlayingScreenKt.NowPlayingContent has cognitive complexity 330 (threshold 15). Drivers by points: if/else 171 (234 pts), boolean chains 87, match/switch 7 (9 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9a095826f7980f55d443397475ebb49666e180d4258ba31a0d0414a0166b64"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeScreenKt.HomeScreen (cognitive 143): HomeScreenKt.HomeScreen has cognitive complexity 143 (threshold 15). Drivers by points: if/else 91 (101 pts), boolean chains 34, match/switch 7 (8 pts) (nesting depth added 11). 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":"app/src/main/java/com/mica/music/ui/screens/home/HomeScreen.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5de42709766b458efcf8f6a26000c24547693d7f4b8bdccf061c41f59c8318"}},{"ruleId":"D2","level":"warning","message":{"text":"NowPlayingLyricsExpandedKt.ExpandedLyricsPanel (cognitive 126): NowPlayingLyricsExpandedKt.ExpandedLyricsPanel has cognitive complexity 126 (threshold 15). Drivers by points: if/else 71 (95 pts), boolean chains 22, loops 4 (8 pts), match/switch 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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingLyricsExpanded.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e491ceaf3be5215c18383511078f05aafcf8557d49d8f042fa44ee8c590e726"}},{"ruleId":"D2","level":"warning","message":{"text":"SmbBrowserPaneKt.SmbBrowserContent (cognitive 119): SmbBrowserPaneKt.SmbBrowserContent has cognitive complexity 119 (threshold 15). Drivers by points: if/else 58 (86 pts), boolean chains 23, error handling 6 (8 pts), match/switch 2 (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":"app/src/main/java/com/mica/music/ui/screens/home/SmbBrowserPane.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d92091b23d96a5660572f06b0c6afa15bae605ac588e4806826ef30b977b00"}},{"ruleId":"D2","level":"warning","message":{"text":"SafAutoSyncPipeline.executeObservedSnapshot (cognitive 91): SafAutoSyncPipeline.executeObservedSnapshot has cognitive complexity 91 (threshold 15). Drivers by points: if/else 50 (72 pts), boolean chains 15, error handling 1 (2 pts), match/switch 2 (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":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fd9fef26040b646a3934b68b2b062f33c3fbc47eba7776ec5b7b1b2686e054"}},{"ruleId":"D2","level":"warning","message":{"text":"NowPlayingCoverSectionKt.NowPlayingCoverSection (cognitive 67): NowPlayingCoverSectionKt.NowPlayingCoverSection has cognitive complexity 67 (threshold 15). Drivers by points: if/else 42 (51 pts), boolean chains 15, loops 1 (nesting depth added 9). 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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d092397cc30ac52d4c514386a8389d17eab63c24995408a756f3ceb90dfbdc46"}},{"ruleId":"D2","level":"warning","message":{"text":"LetterLyricsPrototypeKt.LetterLyricsPrototype (cognitive 56): LetterLyricsPrototypeKt.LetterLyricsPrototype has cognitive complexity 56 (threshold 15). Drivers by points: if/else 39 (52 pts), boolean chains 3, 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":"app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4706cfa15c8100b1cf5ce0fd9735358195bb4eb998ad347003847eab5e179b"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryScanEngine.performScanLocked (cognitive 54): LibraryScanEngine.performScanLocked has cognitive complexity 54 (threshold 15). Drivers by points: if/else 34 (40 pts), boolean chains 12, error handling 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":"app/src/main/java/com/mica/music/data/library/LibraryScanEngine.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1197d5a895411d8552f48d34cc872b8099310d395614aad7ecd686ef3485b93"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaybackQueueSheetKt.PlaybackQueueSheet (cognitive 54): PlaybackQueueSheetKt.PlaybackQueueSheet has cognitive complexity 54 (threshold 15). Drivers by points: if/else 36 (47 pts), boolean chains 6, match/switch 1 (nesting depth added 11). 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":"app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9be3e32da74d72fa7df21f06be4e314b7872a45f2450ddf35dd529f557bcb8e"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeLibraryStatsKt.resolveLibraryStatsBarModel (cognitive 54): HomeLibraryStatsKt.resolveLibraryStatsBarModel has cognitive complexity 54 (threshold 15). Drivers by points: if/else 25 (41 pts), match/switch 5 (9 pts), boolean chains 4 (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":"app/src/main/java/com/mica/music/ui/screens/home/HomeLibraryStats.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cde1cb6ea2c734d5d5f830af5e03436f674172f42d7c3e8a7b67b4df38d0599"}},{"ruleId":"D2","level":"warning","message":{"text":"DeviceAutoSyncPipeline.executeInternal (cognitive 50): DeviceAutoSyncPipeline.executeInternal has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (36 pts), boolean chains 9, match/switch 3 (5 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":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7118bf17481fe668fbf24d1f8d152044895c2f86965fc2b3217b92351daa50a"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaybackRuntime.createPlayerListener (cognitive 50): PlaybackRuntime.createPlayerListener has cognitive complexity 50 (threshold 15). Drivers by points: if/else 34 (39 pts), boolean chains 11 (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":"app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f386b78da873749e20559540d04f173ce8751cf0e6536a5ab3f6a76fcac748"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryAutoSyncQaReceiver.onReceive (cognitive 48): LibraryAutoSyncQaReceiver.onReceive has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (26 pts), error handling 9 (19 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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"777d811977eeb51b8406215825dfcc17699a9c424ab2f7288bb64061f49e4eae"}},{"ruleId":"D2","level":"warning","message":{"text":"HybridQaPlaybackReceiver.onReceive (cognitive 44): HybridQaPlaybackReceiver.onReceive has cognitive complexity 44 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 6, error handling 2 (3 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":"app/src/debug/java/com/mica/music/media/HybridQaPlaybackReceiver.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c90e33106b7ac537e05551c5ea06e481d65c510842552f8bdcc5737ffc8ea9c"}},{"ruleId":"D2","level":"warning","message":{"text":"SongCoverKt.SongCover (cognitive 44): SongCoverKt.SongCover has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (29 pts), match/switch 6 (8 pts), boolean chains 7 (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":"app/src/main/java/com/mica/music/ui/components/SongCover.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d799448bc9dfb0702ad28d9f4c21d2cf326c87b264386cdefab3835c8939e9"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaStoreScanner.loadDrafts (cognitive 42): MediaStoreScanner.loadDrafts has cognitive complexity 42 (threshold 15). Drivers by points: if/else 26 (34 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5b868a1d1348f0ecdf4b2be7cf94f07bd25d6639280bfcc796f0d5dbe85c74"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsCloudPanelKt.LyricsCloudPanel (cognitive 42): LyricsCloudPanelKt.LyricsCloudPanel has cognitive complexity 42 (threshold 15). Drivers by points: if/else 31 (33 pts), boolean chains 8, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cac6ccfd4dcd1aa316d646979f8e3a705d9701977653cdf340ba99fdc4c5ea7"}},{"ruleId":"D2","level":"warning","message":{"text":"WebDavSourceSync.scan (cognitive 41): WebDavSourceSync.scan has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 3 (7 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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd11f4c24c8c716fc6395def10be16f4513b69b9996c23619b10e1ef1e515b9"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerPageLayoutEngine.computeCoverFrame (cognitive 41): PlayerPageLayoutEngine.computeCoverFrame has cognitive complexity 41 (threshold 15). Drivers by points: if/else 26 (28 pts), boolean chains 8, match/switch 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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cf0bf7f413bfdda8c525f3f5de63a5dcaef9161ee90ec6d1681b5a474b174e"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.decodeMediaProbe (cognitive 39): UsbSk02DescriptorPrototypeReceiver.decodeMediaProbe has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 4, loops 2, 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"be40cb893175622a07d2d022a74cad2a54c946f32f40cddd23feec24475a0efc"}},{"ruleId":"D2","level":"warning","message":{"text":"SongActionMenuSheetKt.AddToPlaylistSheet (cognitive 39): SongActionMenuSheetKt.AddToPlaylistSheet has cognitive complexity 39 (threshold 15). Drivers by points: if/else 31 (37 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10aed3f709e706383702f39e19b62709a5def46798dfeef266c6a09d5d9c904"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomPlayerLowerPanelKt.CustomPlayerPagePanel (cognitive 39): CustomPlayerLowerPanelKt.CustomPlayerPagePanel has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 4, loops 1 (2 pts), match/switch 2 (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":"app/src/main/java/com/mica/music/ui/screens/CustomPlayerLowerPanel.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b48d654925707a8eb304aed261b541f2f7a6f215c6911d2a0958a46bbaef8df"}},{"ruleId":"D2","level":"warning","message":{"text":"DescriptorProbe.parse (cognitive 35): DescriptorProbe.parse has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 5, match/switch 1 (2 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f185a93f23eac7b8e390f17779b40a0114655f5e92458ec95b0372bdba8966"}},{"ruleId":"D2","level":"warning","message":{"text":"SmbBrowserKt.naturalFileCompare (cognitive 35): SmbBrowserKt.naturalFileCompare has cognitive complexity 35 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 5 (13 pts), boolean chains 6 (nesting depth added 18). 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbBrowser.kt"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff8e4c81d0f8d623a06cacff24e1aceffdc27edb9186e41d23526c80314a5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationLyricsCoordinator.reconcile (cognitive 35): NotificationLyricsCoordinator.reconcile has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 11 (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":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"8379300e9dd70b7046f1f1fc05133efca523f31b03a0cae0484254e9bd7e9058"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerPageLayoutEngine.computeFrame (cognitive 35): PlayerPageLayoutEngine.computeFrame has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 19, if/else 14, match/switch 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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"784524752de4459c485ff21c27dab9ee07fc2197691de74cdbcf4a4218135b48"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteMusicSettingsPanelKt.RemoteMusicSettingsPanel (cognitive 35): RemoteMusicSettingsPanelKt.RemoteMusicSettingsPanel has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 4, match/switch 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":"app/src/main/java/com/mica/music/ui/screens/settings/RemoteMusicSettingsPanel.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9101720246bacce9ca8fd9a23d432d695fdc89dc5e7ffa0ddb8a37439aebc874"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsScreenKt.SettingsScreen (cognitive 35): SettingsScreenKt.SettingsScreen has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 7, match/switch 4 (7 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":"app/src/main/java/com/mica/music/ui/screens/settings/SettingsScreen.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bce57214f12f1ea981b0e32d75142d611c77dd9db96e980c1900d79bc1de94"}},{"ruleId":"D2","level":"warning","message":{"text":"SmbFolderLibraryIndexer.discover (cognitive 34): SmbFolderLibraryIndexer.discover has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 4, error handling 1 (2 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb12d106a22758db8d81a0293a00220495eed7fbe94a7f247f596707e58f07c"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationLyricsCoordinatorKt.buildExternalLyricsLine (cognitive 33): NotificationLyricsCoordinatorKt.buildExternalLyricsLine has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 7, match/switch 5 (7 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":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11a1c3296669db217f1365563837a8d153ef72f74be109af8a339e035b66290"}},{"ruleId":"D2","level":"warning","message":{"text":"BlurredCoverBackgroundKt.BlurredCoverBackground (cognitive 32): BlurredCoverBackgroundKt.BlurredCoverBackground has cognitive complexity 32 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f253730a31d231320e6462913fa25e5802a9e200884a85312002cb817dcc2f68"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedLyricsReader.parseId3TagAt (cognitive 31): EmbeddedLyricsReader.parseId3TagAt has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 4, match/switch 2 (4 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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e23d74b5302652575703f8e97a4ec0eb15cfed3409cdc7887e8aced2a5b8cd"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomWallpaperStackBlur.blur (cognitive 31): CustomWallpaperStackBlur.blur has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 7 (11 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":"app/src/main/java/com/mica/music/ui/theme/CustomWallpaperStackBlur.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade0b1e58da6ba7bb4724667c3a97d7768bfff07ffabc8c3da4f10c2f96bbf9f"}},{"ruleId":"D2","level":"warning","message":{"text":"StarMapSceneProjector.project (cognitive 31): StarMapSceneProjector.project has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 6, loops 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":"app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3af408e9da26f68bc203f82a48112e8f3d329bc7096188ee4b45e10cec46f4"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryAutoSyncQaReceiver.runDeviceAuthorityGate (cognitive 30): LibraryAutoSyncQaReceiver.runDeviceAuthorityGate has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 16, if/else 9 (12 pts), error handling 1 (2 pts) (nesting depth added 4). 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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfd391c36569f07668ca67ddd8a51fba7d150eeaa81a51a9a5f695b5ebe9ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"SongChangeDiagnostics.changedFields (cognitive 30): SongChangeDiagnostics.changedFields has cognitive complexity 30 (threshold 15). Drivers by points: if/else 30. 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":"app/src/main/java/com/mica/music/data/SongChangeDiagnostics.kt"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37ee9d0787f3194bcf7064d02dd54384d65410fbde9638e30225ea39db5b2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectrumAnalysisEngine.tick (cognitive 30): SpectrumAnalysisEngine.tick has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 6 (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":"app/src/main/java/com/mica/music/media/SpectrumAnalysisEngine.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4402c89f9c9f1c38d8265869274aad5ea0f9e8d3cb2acaf3b9c0f5c1d1dd5611"}},{"ruleId":"D2","level":"warning","message":{"text":"NowPlayingCoverRenderersKt.StandardCoverRenderer (cognitive 30): NowPlayingCoverRenderersKt.StandardCoverRenderer has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21 (22 pts), boolean chains 7, 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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverRenderers.kt"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5ce7b011a551aaa62e57dad5010ec3c3477582e8ce2f1f1cbdf413f4c9e014"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerLowerPanelKt.PlayerLowerPanelSection (cognitive 30): PlayerLowerPanelKt.PlayerLowerPanelSection has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanel.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a35298aba71db9fd22dee43a757ca4bb092b321cf65dcae1275b70e48f2107"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaStoreScanner.loadExtendedAudioFileDrafts (cognitive 29): MediaStoreScanner.loadExtendedAudioFileDrafts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 1 (2 pts), error handling 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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e95cb5b52a3522ac428ae7a4c3192b7022d7b40ad0077d25e017ede80fb61cf"}},{"ruleId":"D2","level":"warning","message":{"text":"SongRowKt.SongRow (cognitive 29): SongRowKt.SongRow has cognitive complexity 29 (threshold 15). Drivers by points: if/else 25 (27 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/SongRow.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ae9804a1c57234af68af117400ec98eac674969334cd43e488397c69885758"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerPageStateKt.rememberPlayerPageUiModel (cognitive 29): PlayerPageStateKt.rememberPlayerPageUiModel has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24 (26 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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageState.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a539672992c3d2d23aca80b5e8e9290a2df83da350357f2bc502a4b509c5ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"EncoderSettingsReader.parseId3TagAt (cognitive 28): EncoderSettingsReader.parseId3TagAt has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, match/switch 2 (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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e76fce4f53714261a30eb084c2a0bf5820c8044ce8559625262a682aeca529c"}},{"ruleId":"D2","level":"warning","message":{"text":"FolderScanner.loadDrafts (cognitive 28): FolderScanner.loadDrafts has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, match/switch 2 (3 pts), error handling 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f3670f1827db32dc56287747f554f569c1252f116c8fad5f0969bacaf1d819"}},{"ruleId":"D2","level":"warning","message":{"text":"SleepTimerSheetKt.SleepTimerSheet (cognitive 28): SleepTimerSheetKt.SleepTimerSheet has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23 (27 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":"app/src/main/java/com/mica/music/ui/components/SleepTimerSheet.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0b641b132c878b92a2f56564b51f37dc97717fc97fe328299778cf756f725b"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeSortSheetsKt.HomeSortSheets (cognitive 28): HomeSortSheetsKt.HomeSortSheets has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 5, 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":"app/src/main/java/com/mica/music/ui/screens/home/HomeSortSheets.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c7fe7523beef0273dc1c96533e3c0fbee4d4a6be53eee80d401d7251d8cfdd"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverFlowCarouselView.updateCurrentIndex (cognitive 28): CoverFlowCarouselView.updateCurrentIndex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 6, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"26944a2782770fae370dae68394fe13ed9b3b776f9f181ee1d7aea3550d9b2cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ParticleCoverRenderer.render (cognitive 27): ParticleCoverRenderer.render has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, 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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c39c3dfe737f9aa59d8571be0368ad3cb1046ad54482ed8915c4c307919a16e"}},{"ruleId":"D2","level":"warning","message":{"text":"PhotoStackTransitionView.drawProgressStrip (cognitive 27): PhotoStackTransitionView.drawProgressStrip has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6, 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":"app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aad5fa99e5309c0714475f8c5223d295824f65c2d085c9072a4cbd99da705f"}},{"ruleId":"D2","level":"warning","message":{"text":"UsageTutorialScenesKt.TutorialSortScene (cognitive 27): UsageTutorialScenesKt.TutorialSortScene has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 7 (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":"app/src/main/java/com/mica/music/ui/screens/tutorial/UsageTutorialScenes.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c74beaf7b9d77030c44af08a7ad3c619af1700c741c50262dacd3cde8927564"}},{"ruleId":"D2","level":"warning","message":{"text":"DsdMetadataReader.readDff (cognitive 26): DsdMetadataReader.readDff has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (6 pts), loops 2 (4 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":"app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57d5f615245b03a04b91ae5a33e19c30a6461d5c27bcefeff5950b80c8f0239"}},{"ruleId":"D2","level":"warning","message":{"text":"FolderScanner.verifyMissingObjectsBounded (cognitive 26): FolderScanner.verifyMissingObjectsBounded has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), error handling 2 (4 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":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"50233012e16cdf0f254ed88c9e114cf34485ea732a8f2fc1725734c3820255c6"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsDisplayKt.LyricLineBlock (cognitive 26): LyricsDisplayKt.LyricLineBlock has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 7, match/switch 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"447f3bac58158fa9c98820882ed50adb3d804e6a00632c6745f97d418ca97a60"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopLyricsOverlayServiceKt.ExternalLyricsLineText (cognitive 26): DesktopLyricsOverlayServiceKt.ExternalLyricsLineText has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 2, 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":"app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aeb947033f68c6fa09888a96b29ed778d659c68ef58782d5382e4b27f2a1eff"}},{"ruleId":"D2","level":"warning","message":{"text":"PinchZoomKt.pinchZoomGesture (cognitive 26): PinchZoomKt.pinchZoomGesture has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/zoom/PinchZoom.kt"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d5bef82d98add5944c44f51440e4ce6b44d555014c87bf27515cbc97f00d97"}},{"ruleId":"D2","level":"warning","message":{"text":"LrcParser.parseEntries (cognitive 25): LrcParser.parseEntries has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 7, 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":"app/src/main/java/com/mica/music/data/scanner/LrcParser.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3108ae95e0012513f048974c005ea3ef34a54b9ab06bd55c347224e9fd516c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanProfilerKt.reusableCachedSong (cognitive 25): ScanProfilerKt.reusableCachedSong has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 8 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/ScanProfiler.kt"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c5d5600819ad70d08a6f6ad7ccc552f4c3e2e4762a45122ee23e08ad17662e"}},{"ruleId":"D2","level":"warning","message":{"text":"TtmlLyricsParser.renderParagraph (cognitive 25): TtmlLyricsParser.renderParagraph has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (8 pts), match/switch 3 (6 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":"app/src/main/java/com/mica/music/data/scanner/TtmlLyricsParser.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea8958d5e43315be36c7a1bd3e3a4dfdfddab6ca2b937f96c50e2a00432d222"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaControllerQueueSync.planSync (cognitive 25): MediaControllerQueueSync.planSync has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 7 (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":"app/src/main/java/com/mica/music/playback/MediaControllerQueueSync.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb071bf8abf4444c3b5567fbbf07c0725575faf6c3bc325ccb9eae1df16e5d93"}},{"ruleId":"D2","level":"warning","message":{"text":"BrowseGroupDisplaySheetKt.BrowseGroupDisplaySheet (cognitive 25): BrowseGroupDisplaySheetKt.BrowseGroupDisplaySheet has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, match/switch 3 (6 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":"app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bea832b1c73afc23cb9219f594cc60aeb36cf9d9112171aac236a6d0ac5ad01"}},{"ruleId":"D2","level":"warning","message":{"text":"DeviceShadowObjectProbeExecutor.execute (cognitive 24): DeviceShadowObjectProbeExecutor.execute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, match/switch 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":"app/src/main/java/com/mica/music/data/library/DeviceShadowObjectProbeExecutor.kt"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"81488ac5f4eda986d14f31a384545a5452833483941711e04e483d25b677780a"}},{"ruleId":"D2","level":"warning","message":{"text":"DsdMetadataReader.readId3PictureAt (cognitive 24): DsdMetadataReader.readId3PictureAt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, match/switch 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":"app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2233d2a0d3084e546744fd641b989e669a840125957463dfa6360d12878342"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaybackRuntime.setQueue (cognitive 24): PlaybackRuntime.setQueue has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e930d74f93d0891bb682db54f781c364684e6b1a9076a02e9f60d61be081fb86"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerSheetHostKt.PlayerSheetHost (cognitive 24): PlayerSheetHostKt.PlayerSheetHost has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (21 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":"app/src/main/java/com/mica/music/ui/components/PlayerSheetHost.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f44dbed2c869d83ac81caafb441cdf430798cb3c8668ce587ffa2142e3457d"}},{"ruleId":"D2","level":"warning","message":{"text":"SongActionMenuSheetKt.LandscapeSongActionMenu (cognitive 24): SongActionMenuSheetKt.LandscapeSongActionMenu has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"26375ab5e6d11c6d40825f57205c743f6c58e1a6babd1247d34af662f80c9582"}},{"ruleId":"D2","level":"warning","message":{"text":"PinchZoomMath.settleTarget (cognitive 24): PinchZoomMath.settleTarget has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"app/src/main/java/com/mica/music/ui/zoom/PinchZoom.kt"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0c9c57057b9ac427936f50223b7de36f82ebd705101c4be33626a471f00700"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.probeHighResDecodeFormat (cognitive 23): UsbSk02DescriptorPrototypeReceiver.probeHighResDecodeFormat has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, match/switch 1 (2 pts), error handling 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bf17b1bea436bf99928d21e6ebc75f695a7bdf756e43f35ba9f936bd5a291f"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryFollowupConsumer.drainBatchLocked (cognitive 23): LibraryFollowupConsumer.drainBatchLocked has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, match/switch 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":"app/src/main/java/com/mica/music/LibraryFollowupConsumer.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b486620f6f7b1fc404e96b903686f642bb0b8dddf00153dc8e992a3138c839c8"}},{"ruleId":"D2","level":"warning","message":{"text":"MicaMediaService.attachPlaybackStackOwners (cognitive 23): MicaMediaService.attachPlaybackStackOwners has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/media/MicaMediaService.kt"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6c9258c614156ded92ed3681a8a4ad301211b152901b98b75e2847e9adebe2"}},{"ruleId":"D2","level":"warning","message":{"text":"SongActionMenuSheetKt.SongActionMenuSheet (cognitive 23): SongActionMenuSheetKt.SongActionMenuSheet has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 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":"app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d44221754b84f46472addc5db911dec2bdab4fc74789862fb5727990dc562b0"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopLyricsOverlayServiceKt.DesktopLyricsOverlayContent (cognitive 23): DesktopLyricsOverlayServiceKt.DesktopLyricsOverlayContent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80d02fb4a1428d98cd0ed1fc3051b75da4c450d3dff53c97de8fd99308e3079"}},{"ruleId":"D2","level":"warning","message":{"text":"LandscapeCoverFlowLyricsTransitionKt.landscapeCoverFlowImmersiveDragInput (cognitive 23): LandscapeCoverFlowLyricsTransitionKt.landscapeCoverFlowImmersiveDragInput has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, 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":"app/src/main/java/com/mica/music/ui/screens/LandscapeCoverFlowLyricsTransition.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a246a06cb3aa20c2672aabfb63698e13e004e23b340e5711a83fa260df828596"}},{"ruleId":"D2","level":"warning","message":{"text":"LetterLyricsPrototypeKt.buildLetterPages (cognitive 23): LetterLyricsPrototypeKt.buildLetterPages has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 6 (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":"app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eeab8f14c9a3570404d3bf0ab74f778153f29dddb3ffa59641c4cd3ad2f6a3"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.beginGenerationPcm16Probe (cognitive 22): UsbSk02DescriptorPrototypeReceiver.beginGenerationPcm16Probe has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 12, if/else 10. 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"0155c18794507cbbb0b93dd01f3ee00c385bb81e3c3dfad74cc4bbbc67f0046e"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryCacheLoader.loadCachedLibrary (cognitive 22): LibraryCacheLoader.loadCachedLibrary has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 10. 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":"app/src/main/java/com/mica/music/data/library/LibraryCacheLoader.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01fba51c911426b1d4149d4019a9be77356d2e61870d15e295beea683f710a2"}},{"ruleId":"D2","level":"warning","message":{"text":"SafAutoSyncPipeline.executeInternal (cognitive 22): SafAutoSyncPipeline.executeInternal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, error handling 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"498c0fc751108a7100f84231c2639cf322d361f46408d37d8244a1bf5a9175f5"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioMetadataProbe.probeTrack (cognitive 22): AudioMetadataProbe.probeTrack has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 3 (4 pts), boolean chains 2, 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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb5843ab0807623d736e6ed0dd4cffa2e0b7c963177956436b0587c22a2f24d"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaybackRuntime.bootstrapQueueFromPersistedSnapshot (cognitive 22): PlaybackRuntime.bootstrapQueueFromPersistedSnapshot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, match/switch 1 (3 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":"app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e50dc134fa35a0c3c1af49a95c412c3dc89dd8706a9a5dd3a5cf9ade06baf9"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerSpectrumStripKt.PlayerSpectrumStrip (cognitive 22): PlayerSpectrumStripKt.PlayerSpectrumStrip has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 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":"app/src/main/java/com/mica/music/ui/components/PlayerSpectrumStrip.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43e3725262659c0501555ead69de0d3fa9c877930f8b486bfcb910b1da1dc44"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsLyricsPanelKt.LyricsSettingsPanel (cognitive 22): SettingsLyricsPanelKt.LyricsSettingsPanel has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (19 pts), match/switch 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":"app/src/main/java/com/mica/music/ui/screens/settings/SettingsLyricsPanel.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6381a4d356bdb43aa5d73488a89f05983fa580714b76d9e4f13549a55c5b38"}},{"ruleId":"D2","level":"warning","message":{"text":"RainGlassRenderThread.run (cognitive 22): RainGlassRenderThread.run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 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":"app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00517df0ab28775aef5397d831e8697665683f1825e47c96fc04fc8313b2dc4"}},{"ruleId":"D2","level":"warning","message":{"text":"SmbDirectoryBrowser.list (cognitive 21): SmbDirectoryBrowser.list has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 6 (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":"app/src/main/java/com/mica/music/data/remote/smb/SmbBrowser.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7290aa046942efbef44aa81e18fe78c1ff31e25dd9a993d7df988d86b4190d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"ApeHeaderReader.read (cognitive 21): ApeHeaderReader.read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 4, 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":"app/src/main/java/com/mica/music/media/ape/ApeHeaderReader.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8f4d950ba352def8fbd8aa5afa1d1c1a0a8257b280adebb1e94fa687a56fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"EqualizerCurveEditorKt.EqualizerCurveEditor (cognitive 21): EqualizerCurveEditorKt.EqualizerCurveEditor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 2, 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, 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":"app/src/main/java/com/mica/music/ui/components/EqualizerCurveEditor.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc2d4a51178480c9af51d7d092c25d01a5a91769ef6571558f1f4088bd4b5ed"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsDisplayKt.KaraokeLyricLineText (cognitive 21): LyricsDisplayKt.KaraokeLyricLineText has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 2 (3 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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"46109b95466883c1656a04d26fe958e70d9092657270901ecaceeba7e88001d2"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaybackQueueSheetKt.QueueSongRow (cognitive 21): PlaybackQueueSheetKt.QueueSongRow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20 (21 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":"app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4bdb4e4e289e736d905a1b110a0ba573e4cb2f3189e357fc9197266b1df79b"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryQueueSyncPolicy.plan (cognitive 20): LibraryQueueSyncPolicy.plan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, match/switch 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, 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":"app/src/main/java/com/mica/music/LibraryQueueSyncPolicy.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"89223b41acb6ae8f26c427d753cc39dd3b62a22b1db1788ada8b273955c81f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"SmbSourceSync.scan (cognitive 20): SmbSourceSync.scan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 2 (3 pts), error handling 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9b4c6a8d2ff2cf2a81b184e22cd1de22e1b1b74923356abcf9c522551eae5f"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaStorePresenceInventory.loadAudioRows (cognitive 20): MediaStorePresenceInventory.loadAudioRows has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 2, match/switch 1 (2 pts), 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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a975964cbfe92fcc2060b8d970cf7c33d2966f25dcdf8de6dd551c3ccd0eb75"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaStoreTrackedPresenceInventory.loadAudioRows (cognitive 20): MediaStoreTrackedPresenceInventory.loadAudioRows has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 2, match/switch 1 (2 pts), 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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"be920b5bed886b515da12b2833b062d8e654a0999a2b932affc61e08a6adf8d5"}},{"ruleId":"D2","level":"warning","message":{"text":"LetterLyricsPrototypeKt.drawLetterColumn (cognitive 20): LetterLyricsPrototypeKt.drawLetterColumn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 1 (2 pts), match/switch 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":"app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eef54e6bfab91647d7bb9937a9bedc4fe686ed2bedde7f03915651b8a8643bd"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteMusicSettingsPanelKt.RemoteSourceDialog (cognitive 20): RemoteMusicSettingsPanelKt.RemoteSourceDialog has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, boolean chains 9. 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":"app/src/main/java/com/mica/music/ui/screens/settings/RemoteMusicSettingsPanel.kt"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccd88f88a95b03cdc37867ae0aebf013eb63ce93bf2b13146b003dd440b342d"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryAutoSyncQaReceiver.runExternalProviderPayloadGate (cognitive 19): LibraryAutoSyncQaReceiver.runExternalProviderPayloadGate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, error handling 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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc958ecaf88a81af75250ddf70114f71be8eb43c62fafc0045930ad30ee14f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.beginPcmUsbProbe (cognitive 19): UsbSk02DescriptorPrototypeReceiver.beginPcmUsbProbe has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0de74dca5d1230f6f1de45664e78aa3f0fc43620b8d1d4c41034a5f209d2e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"SafMassDeletionConfirmationPlanner.plan (cognitive 19): SafMassDeletionConfirmationPlanner.plan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 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":"app/src/main/java/com/mica/music/data/library/SafMassDeletionConfirmationPlanner.kt"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d68ebf8cceb6f50b1541af7b74fd0322c80c286fdc6be3a8043335e8e2773d8"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadAheadSeekableByteSource.readAt (cognitive 19): ReadAheadSeekableByteSource.readAt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/remote/SeekableByteSource.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8b715df7b15823c44ec0e55d570545624f380d6e2a3d1758cb432f106752e7"}},{"ruleId":"D2","level":"warning","message":{"text":"Id3FrameLister.listTagAt (cognitive 19): Id3FrameLister.listTagAt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 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":"app/src/main/java/com/mica/music/data/scanner/Id3FrameLister.kt"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dd4b7ef4a2af830de07f19ed401583947e990037a05e5f67886594274590c9"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsSanitizer.isBinaryGarbage (cognitive 19): LyricsSanitizer.isBinaryGarbage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, match/switch 1 (2 pts), 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":"app/src/main/java/com/mica/music/data/scanner/LyricsSanitizer.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9a037220e812e425e0c903539d50986300e51e46f03eb9fac5a7456e611116"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaStoreTrackedLyricsSidecarInventory.loadComplete (cognitive 19): MediaStoreTrackedLyricsSidecarInventory.loadComplete has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68fd93953ff8296655a661c6eaa54e66cde1c0551611c5de1a5bdd27336846f"}},{"ruleId":"D2","level":"warning","message":{"text":"SpectrumFft.shapeBands (cognitive 19): SpectrumFft.shapeBands has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 6 (7 pts), match/switch 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":"app/src/main/java/com/mica/music/media/SpectrumFft.kt"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7774fdfa0bb68da3f9aa2e5abbd6987bfc57e26be54469a168032462ff2eac30"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbHybridDsdRenderer.render (cognitive 19): UsbHybridDsdRenderer.render has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, error handling 1 (2 pts), 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":"app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridDsdRenderer.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9386eab8f6008c9d1e09110b012d87e84150b9d6bc2cbc957a2acbd137e5cb68"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaybackErrorMapper.remotePresentation (cognitive 19): PlaybackErrorMapper.remotePresentation has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (9 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":"app/src/main/java/com/mica/music/playback/PlaybackErrorMapper.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d6e0508327a3d6537d19ad4895fb8472c657d10689a85178b45d3a305d3383"}},{"ruleId":"D2","level":"warning","message":{"text":"SleepTimerController.startTickLoop (cognitive 19): SleepTimerController.startTickLoop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 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":"app/src/main/java/com/mica/music/playback/SleepTimerController.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c508abe6406f95902ec79fc5fc569b7065163492b2a693a3e8320f066461af27"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalLyricsSettingsPanelKt.ExternalLyricsSettingsPanel (cognitive 19): ExternalLyricsSettingsPanelKt.ExternalLyricsSettingsPanel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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":"app/src/main/java/com/mica/music/ui/screens/settings/ExternalLyricsSettingsPanel.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95fa0830fa575a1868071a5436d776c8ae2d65ba4584b07458b1533dba342bf"}},{"ruleId":"D2","level":"warning","message":{"text":"MicaGradientKt.gradientColors (cognitive 19): MicaGradientKt.gradientColors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (nesting depth added 6). 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":"app/src/main/java/com/mica/music/ui/theme/MicaGradient.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7b7d88cb1b8bf88d7842a16c5a7d8875ef27a92cd673c152b3e1ab896d89f2"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbKernelDriverReconnectOwner.reconnectLocked (cognitive 18): UsbKernelDriverReconnectOwner.reconnectLocked 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbKernelDriverReconnectOwner.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cfb714299e2769c8b53f50487585b89754651877691a82fd9eaaae84cb6346"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsCacheCoordinator.load (cognitive 18): LyricsCacheCoordinator.load has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), error handling 2 (4 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":"app/src/main/java/com/mica/music/data/LyricsDocumentMemoryCache.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14a4602193b5cc7c0f34a6ddf834522677ef39f9ffe321af8f2df067d437f15"}},{"ruleId":"D2","level":"warning","message":{"text":"ReleaseDates.compare (cognitive 18): ReleaseDates.compare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/ReleaseDate.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"97be9ebc756aa13823ca9fcfb3cd3b694873c37cfac3a83cebcb38cf7fb93563"}},{"ruleId":"D2","level":"warning","message":{"text":"LibrarySyncScheduler.onFinished (cognitive 18): LibrarySyncScheduler.onFinished has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, match/switch 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":"app/src/main/java/com/mica/music/data/library/LibrarySyncScheduler.kt"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada9336771611b89399b1a456294d36507d2ff01f5d476d47f46226be64c4225"}},{"ruleId":"D2","level":"warning","message":{"text":"WebDavSeekableByteSource.readAt (cognitive 18): WebDavSeekableByteSource.readAt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, error handling 3, loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavSeekableByteSource.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b4510b91c5ade6c85b5a04f135b25df3cf1f5d696c9117b755b18e931b0c6d"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbHybridSessionOwner.requestOpen (cognitive 18): UsbHybridSessionOwner.requestOpen has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, match/switch 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":"app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridSessionOwner.kt"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"10771fbd578babc78af772f3625cd5c9f5c3f3309edb06d4c4065468a9887444"}},{"ruleId":"D2","level":"warning","message":{"text":"SongListPanelKt.SongZoomGeometryLayer (cognitive 18): SongListPanelKt.SongZoomGeometryLayer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16 (18 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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2fe0e2c63d8b81a704b0d3fe584b14c6f67d3d37fb57df50e9a3f0598a886d"}},{"ruleId":"D2","level":"warning","message":{"text":"OwnedLyricsPositionMotion.accept (cognitive 18): OwnedLyricsPositionMotion.accept has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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":"app/src/main/java/com/mica/music/ui/screens/LyricsOwnedPositionMotion.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9087f10863608c8dbd2ed12cbfbad9456b111a8bfb027eeb28bc11c7db37ed08"}},{"ruleId":"D2","level":"warning","message":{"text":"PhotoStackLyricsTransitionKt.photoStackLyricsSwipe (cognitive 18): PhotoStackLyricsTransitionKt.photoStackLyricsSwipe has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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":"app/src/main/java/com/mica/music/ui/screens/PhotoStackLyricsTransition.kt"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24c9d85bde9da6bec0ffcf8e3ad44188608b5b0820cd4c1560ce6e53baf80ea"}},{"ruleId":"D2","level":"warning","message":{"text":"PlayerPageLayoutEngine.computeLowerLayoutPlan (cognitive 18): PlayerPageLayoutEngine.computeLowerLayoutPlan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d43318a48c590e48300f934a8abf73f9fcf2992b5137caca63726e65d23be5a"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.beginSustainedPcm16Probe (cognitive 17): UsbSk02DescriptorPrototypeReceiver.beginSustainedPcm16Probe has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 6. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (UsbSk02DescriptorPrototypeReceiver.beginSilentPcm16Probe) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b336046abfd22b29859ef650b1003c6084f34e222a7d50e85fd574ccbbc1f94"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbSk02DescriptorPrototypeReceiver.beginSilentPcm16Probe (cognitive 17): UsbSk02DescriptorPrototypeReceiver.beginSilentPcm16Probe has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 6. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (UsbSk02DescriptorPrototypeReceiver.beginSustainedPcm16Probe) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1d345bea9ad499fca5d691f7dc08f7b3ee33fade2015a458aadadfaa52175a"}},{"ruleId":"D2","level":"warning","message":{"text":"NavidromeCatalogPager.listSongs (cognitive 17): NavidromeCatalogPager.listSongs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, 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":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeCatalogPager.kt"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18f7139378516a6d33d85acb61f88e5af7b0e02fedfe1f03ee5ec901b7ee41f"}},{"ruleId":"D2","level":"warning","message":{"text":"AlbumArtCache.pruneUnreferenced (cognitive 17): AlbumArtCache.pruneUnreferenced has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 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":"app/src/main/java/com/mica/music/data/scanner/AlbumArtCache.kt"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aab75e9f59876dca15c1c1d7e33a30656f1c52a59c98353347863b5d4d846ca"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioProbeBytes.readMp4Moov (cognitive 17): AudioProbeBytes.readMp4Moov has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2294ea77d7fe44050721e3ea3d9a14633985f70d66c05d615a774421ec50a6"}},{"ruleId":"D2","level":"warning","message":{"text":"FolderScanner.collectLibraryFilesFallback (cognitive 17): FolderScanner.collectLibraryFilesFallback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 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":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"05763fd41dbd10334a2979c72e7902fdc9dd887aad1602dcee29fb2fc1b38f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"SongListPanelKt.SongZoomSceneItem (cognitive 17): SongListPanelKt.SongZoomSceneItem has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"70346c5b41ee07e539289809eb274304af3e95d934acdefcc071a72d740d7eca"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeBrowseContentKt.BrowseGroupMorphOverlay (cognitive 17): HomeBrowseContentKt.BrowseGroupMorphOverlay has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, boolean chains 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":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a8e0aba6beddd0f128fc8001bcb98d8dcb45a1193033b81dfa8bb2c83e969d"}},{"ruleId":"D2","level":"warning","message":{"text":"UsageTutorialKt.UsageTutorialScreen (cognitive 17): UsageTutorialKt.UsageTutorialScreen has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, boolean chains 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":"app/src/main/java/com/mica/music/ui/screens/tutorial/UsageTutorial.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dbbb1707e74811fdbcd2c1c6011aa1094e733b21dd1d637efdac7f8e64a3d3"}},{"ruleId":"D2","level":"warning","message":{"text":"StarMapSceneProjector.buildTransitionCandidates (cognitive 17): StarMapSceneProjector.buildTransitionCandidates has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 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":"app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c46bd8e38fa47a2b6d04ff27968b74a75718f75b4f99007c94619281810a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"StarMapRenderer.render (cognitive 17): StarMapRenderer.render has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), 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":"app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d708bb99002a93c190f6d2ac65c1b065fe881acc4d965f7ee4bf20358546a9"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryAutoSyncQaPickerClickService.tryClickIsolatedPicker (cognitive 16): LibraryAutoSyncQaPickerClickService.tryClickIsolatedPicker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaPickerClickService.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e658135f4b114b29b3133aac1104381a228aeb47fddc423893829a92d3c8dfcd"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryBrowseCoordinator.prewarmBrowseGroupCache (cognitive 16): LibraryBrowseCoordinator.prewarmBrowseGroupCache has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6 (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":"app/src/main/java/com/mica/music/data/library/LibraryBrowseCoordinator.kt"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cf0e033dba89cea0017a3219b6640b12cd5243fb3d0731c24378373dd0d2a6"}},{"ruleId":"D2","level":"warning","message":{"text":"LibraryDirtySignalObserver.refreshSafGenerationWatchLoop (cognitive 16): LibraryDirtySignalObserver.refreshSafGenerationWatchLoop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 2 (4 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":"app/src/main/java/com/mica/music/data/library/LibraryDirtySignalObserver.kt"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f4dc489826589ad74a860ab0cc831f09579cad6e6c198113af876bcba35c95"}},{"ruleId":"D2","level":"warning","message":{"text":"SafRetryPlanningLoader.load (cognitive 16): SafRetryPlanningLoader.load has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 5, loops 1 (2 pts), match/switch 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":"app/src/main/java/com/mica/music/data/library/SafRetryPlanningLoader.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83335da9f9ebd16c3f90365cdc8286357224bc61b9fdd23e8687b1182f39097"}},{"ruleId":"D2","level":"warning","message":{"text":"SafUnknownFingerprintDebtPlanner.plan (cognitive 16): SafUnknownFingerprintDebtPlanner.plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, 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":"app/src/main/java/com/mica/music/data/library/SafUnknownFingerprintDebtPlanner.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c57b3073bc09248bf54abb6aa572162dd1393951af073af1593e85725cc5fd0"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteCatalogRepository.replaceSmbFolderScopeIfCurrent (cognitive 16): RemoteCatalogRepository.replaceSmbFolderScopeIfCurrent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 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":"app/src/main/java/com/mica/music/data/remote/RemoteCatalogRepository.kt"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4646b9b390cd71f4096a1eb82287225860411677b079f504afae3ac58a9bbca9"}},{"ruleId":"D2","level":"warning","message":{"text":"DeviceShadowCanonicalCatalog.changedAspects (cognitive 16): DeviceShadowCanonicalCatalog.changedAspects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, 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":"app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"40beb7d907bb5129d1084253d4369ed93327e8808fd2b3503bf81332c16e24a7"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedLyricsReader.parseSylt (cognitive 16): EmbeddedLyricsReader.parseSylt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, 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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"029bce5e30eca293f9a30ff7cfcc144bf62c419b574c09372022be02301f9f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsEncoding.looksLikeMojibake (cognitive 16): LyricsEncoding.looksLikeMojibake has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 6, match/switch 1 (2 pts), loops 1 (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":"app/src/main/java/com/mica/music/data/scanner/LyricsEncoding.kt"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3569b9b5202b83b3dbe41cb6be8b9b299c3704b0a80b114d343a7be5f51507"}},{"ruleId":"D2","level":"warning","message":{"text":"MediaStoreScannerKt.reconcileMediaStoreFolderCasing (cognitive 16): MediaStoreScannerKt.reconcileMediaStoreFolderCasing has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa87bc2ac157a44872acc8bf8b0835cb5bcc6b9bb102ba848e86818bcbc20f49"}},{"ruleId":"D2","level":"warning","message":{"text":"Mp4LyricsReader.scanTextDataAtoms (cognitive 16): Mp4LyricsReader.scanTextDataAtoms has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 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":"app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3ca0b91be90bfa19cc0506f2c4cf8620edc887fc5d2b9a6f2ac86123f0a447"}},{"ruleId":"D2","level":"warning","message":{"text":"SafFastVerifyPlanner.plan (cognitive 16): SafFastVerifyPlanner.plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), 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":"app/src/main/java/com/mica/music/data/scanner/SafFastVerify.kt"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb9790ecc2a6be98cfd8162833c427f30a5e421f45750ab7e48666e192fa938"}},{"ruleId":"D2","level":"warning","message":{"text":"MicaMediaSessionCallback.onCustomCommand (cognitive 16): MicaMediaSessionCallback.onCustomCommand 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":"app/src/main/java/com/mica/music/media/MicaMediaSessionCallback.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a351b2f09d65fc2847535ba3e44b585aae58932e26438ff3416a5150f3605a"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultUsbOutputCoordinator.onTopologyEvent (cognitive 16): DefaultUsbOutputCoordinator.onTopologyEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/media/UsbOutputCoordinator.kt"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8422732feb5b5f11333d90e25dc7f228c8374a4a31b4e93234d4a8b8fb15f4e"}},{"ruleId":"D2","level":"warning","message":{"text":"UsbHybridDsdRenderer.runSessionAction (cognitive 16): UsbHybridDsdRenderer.runSessionAction has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts) (nesting depth added 7). 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":"app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridDsdRenderer.kt"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"11505a3078d826b2a387d03c84c22c92326e7fc05bb159fe13aee0bf6bec63a0"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaylistSongListPanelKt.PlaylistSongListPanel (cognitive 16): PlaylistSongListPanelKt.PlaylistSongListPanel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/PlaylistSongListPanel.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"414dbd115b9c0071a2bc4f8e2373ee151603db489e3945e6bbabe80f15346f54"}},{"ruleId":"D2","level":"warning","message":{"text":"SongListPanelKt.SongZoomMorphOverlay (cognitive 16): SongListPanelKt.SongZoomMorphOverlay has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, 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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4784927035ec936726a090fe3bfe90da457fb12ac90545347559a84de380a5"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomPlayerLowerPanelKt.CustomPlayerEditChrome (cognitive 16): CustomPlayerLowerPanelKt.CustomPlayerEditChrome has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 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":"app/src/main/java/com/mica/music/ui/screens/CustomPlayerLowerPanel.kt"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e46110e821887fa1ef8bb4170309c3c4f21ee80d1c2561604ebb098c35656a8"}},{"ruleId":"D2","level":"warning","message":{"text":"LyricsCloudPanelKt.CloudLyricLine (cognitive 16): LyricsCloudPanelKt.CloudLyricLine has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f25243911b46ee6e42230cddde6204abb58fb83c8e5720d629a580888abb63a"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsPlaybackPanelKt.PlaybackSettingsPanel (cognitive 16): SettingsPlaybackPanelKt.PlaybackSettingsPanel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, 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":"app/src/main/java/com/mica/music/ui/screens/settings/SettingsPlaybackPanel.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e77c5d843c9898d0a15f74335720a5dc6fda07dfa0b8809c041a5d833bc0c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NowPlayingLyricsExpandedKt.ExpandedLyricsPanel: MethodTooLong \u2014 ExpandedLyricsPanel runs 623 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 523 over it, 6.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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingLyricsExpanded.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"430fb60fa6874cab0e60810e1c08e600decbb5a7083c7f324519e71a1de06456"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SafAutoSyncPipeline.executeObservedSnapshot: MethodTooLong \u2014 executeObservedSnapshot runs 560 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 460 over it, 5.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":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d9da629d0d44fc9fb87ac24062f7dd9f7494548f47323d7b26e9dba6d4fd0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DeviceAutoSyncPipeline.executeInternal: MethodTooLong \u2014 executeInternal runs 429 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 329 over it, 4.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":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cb271d57d180f0ceb27b0b13f31fc2033712be53de3779423a8fa0455f66d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/NowPlayingScreen.kt: FileTooLong \u2014 2018 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1518 over it, 4.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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21faa8b43f9ec79810f86e01ad792cf26cb62a4702b86aa57c9a2cfc8384bdd8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LyricsPreferences: TooManyMethods \u2014 115 methods. The bar is 30 methods; this is 85 over it, 3.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/preferences/LyricsPreferences.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0049730275addb76c48e202a3b4befff8ddbed8861900b55c8fbb64a19a56f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: theme/StarMapGlBackground.kt: FileTooLong \u2014 1890 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1390 over it, 3.78\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":"app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1befe2503fee9722a7f99cf7dcc5cf5f4997376fdebf5541ad49cd427e520ba5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlaybackRuntime: TooManyMethods \u2014 112 methods. The bar is 30 methods; this is 82 over it, 3.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":"app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaa0d77801de58e7220c0325ddc46058061cb8eea3d27606e1b8e1d22d5ee1b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PlaybackRuntime: ClassTooLong \u2014 1463 significant lines (blank, comment-only and punctuation-only lines excluded), 112 methods. The bar is 400 significant lines; this is 1063 over it, 3.66\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":"app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd32f2a26f09e0f47b1239997bb379f7679d2103ac560d44ea6307dbecd280f3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LibraryAutoSyncQaReceiver: ClassTooLong \u2014 1355 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 955 over it, 3.39\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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d509e1cbdb9c0a45c9c0bfc7393760528e703c14207e0b63002ed191cb00627"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppUiSettings: TooManyMethods \u2014 100 methods. The bar is 30 methods; this is 70 over it, 3.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":"app/src/main/java/com/mica/music/data/AppUiSettings.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"36aec39ba85ceebf5fe4dc22773e5ed13be50efb41bfcf1cff689c6848d6a0d9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LibraryAutoSyncQaProfileService: ClassTooLong \u2014 1318 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 918 over it, 3.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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62d60ea989a26aaac6e011eec6db19dc00780ac4874969c3fd903b995603c40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/HomeBrowseContent.kt: FileTooLong \u2014 1625 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1125 over it, 3.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0380a7d95ddc6f0029fcccf35c1c435ec6b97a1c0a26c04e013c2c76282d45c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: playback/PlaybackRuntime.kt: FileTooLong \u2014 1551 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: PlaybackRuntime (98-2004). The bar is 500 significant lines; this is 1051 over it, 3.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":"app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a05170956a8b5271e9c94e618f5acb7697760a36e20a1a6d244f1e30ae8a84"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UsbSk02DescriptorPrototypeReceiver: ClassTooLong \u2014 1167 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 767 over it, 2.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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c1fadb9569b9e99af970ea76422f1462d7b61e331651935499bb6774bf1f03"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PhotoStackTransitionView: ClassTooLong \u2014 1137 significant lines (blank, comment-only and punctuation-only lines excluded), 71 methods. The bar is 400 significant lines; this is 737 over it, 2.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":"app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d29b02d62d0a81ef9859bd95e6aacfa4d7c4aea6af218bc525a06a118cfec70"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HybridQaPlaybackReceiver.onReceive: MethodTooLong \u2014 onReceive runs 279 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 179 over it, 2.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":"app/src/debug/java/com/mica/music/media/HybridQaPlaybackReceiver.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aeb727cd10b737b4de52adc50d29b0ec9d9da19e36b897b15bde0d7e95db82a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/LibraryAutoSyncQaReceiver.kt: FileTooLong \u2014 1387 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: LibraryAutoSyncQaReceiver (42-1806). The bar is 500 significant lines; this is 887 over it, 2.77\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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78e6a777f4c59067ef1edf4911c0b70cc83c92041d9013f491b5cd8900c4f99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/LibraryAutoSyncQaProfileService.kt: FileTooLong \u2014 1373 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: LibraryAutoSyncQaProfileService (65-1734). The bar is 500 significant lines; this is 873 over it, 2.75\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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"755bb852ea0d44940a5c0f177573f6f57bec0299e6357d5fe64028b9f3ea68e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: usbprototype/UsbSk02DescriptorPrototypeReceiver.kt: FileTooLong \u2014 1318 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: UsbSk02DescriptorPrototypeReceiver (44-1522). The bar is 500 significant lines; this is 818 over it, 2.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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d44e26cbc8919d8fd1ba358873fb80415babb80c320e7a464de01ceb790be50"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibraryAutoSyncQaReceiver.onReceive: MethodTooLong \u2014 onReceive 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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf18b4abba019c3774027b922ed12796e16c1a93bfc086991ec63959a0b4ab6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlaybackQueueSheetKt.PlaybackQueueSheet: MethodTooLong \u2014 PlaybackQueueSheet runs 250 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 150 over it, 2.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":"app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bc53fdc8fa029e7e1aaa8445b2adc15179f39d220b001a31420479fbdf2b7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/PhotoStackTransitionView.kt: FileTooLong \u2014 1226 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: PhotoStackTransitionView (100-1551). The bar is 500 significant lines; this is 726 over it, 2.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":"app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a376478c2a5206787d070f3cdffbb44af24f306e69712a2a355c2eb07218e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SettingsLyricsPanelKt.LyricsSettingsPanel: MethodTooLong \u2014 LyricsSettingsPanel 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":"app/src/main/java/com/mica/music/ui/screens/settings/SettingsLyricsPanel.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"059cd99054fa41c1bdbb6287e3ab19c8e5e65c676e056b51c70af716f2fc3286"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PhotoStackTransitionView: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 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":"app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b707a222f67eb1af1b54687e24fb604a0ec15e995c9392a26a16ae581a8f5d54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/HomeScreen.kt: FileTooLong \u2014 1171 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: val (103-1460). The bar is 500 significant lines; this is 671 over it, 2.34\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":"app/src/main/java/com/mica/music/ui/screens/home/HomeScreen.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"480fa8d958b93e57ea21609065ed25b5853cfb8cd54f672031a59bd2b528b5da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppNavigationKt.AppNavigationMain: MethodTooLong \u2014 AppNavigationMain runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.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":"app/src/main/java/com/mica/music/ui/navigation/AppNavigation.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8525b0f4b4f4b591cf82cc2709498e5383e16b1813ad331afcf174c9cc665cf2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CoverFlowCarouselView: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ef765decfd27e0299981e40d518c294c4478ff947dd744366708a38cbe2cdc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CoverFlowCarouselView: ClassTooLong \u2014 931 significant lines (blank, comment-only and punctuation-only lines excluded), 70 methods. The bar is 400 significant lines; this is 531 over it, 2.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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa3aeaa956434ef40ba2a1123cd8930c9c82660dcaed1288013728eeca61502"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scanner/AudioMetadataProbe.kt: FileTooLong \u2014 1133 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 633 over it, 2.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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b39d935a1df3c3a441df8043a70c4f12a9f475734e376770c7b4a1459ff4fcf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibraryScanEngine.performScanLocked: MethodTooLong \u2014 performScanLocked runs 224 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 124 over it, 2.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":"app/src/main/java/com/mica/music/data/library/LibraryScanEngine.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccdc1a24b3a66daa341270497f34eac7a4334bffd68709d94330d054eb2fbb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/ParticleCoverRenderer.kt: FileTooLong \u2014 1111 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: ParticleCoverRenderer (21-1035). The bar is 500 significant lines; this is 611 over it, 2.22\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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf6df03272c7f3372ba8cdc49f76f19e41deb7a488e081662f5518ad9c8371f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/LetterLyricsPrototype.kt: FileTooLong \u2014 1070 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 570 over it, 2.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":"app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d4b8b2b3831b117e323f9be52738f17ee8731501047d8258d6544f69842866"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LetterLyricsPrototypeKt.LetterLyricsPrototype: MethodTooLong \u2014 LetterLyricsPrototype 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":"app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2ded971d9f6c797e7fd5a1a03849d06aade401ccf4a1ee00308b8841a76732"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ParticleCoverRenderer: ClassTooLong \u2014 847 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 447 over it, 2.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc025f73004494278c023bb083dead3bb1eb7a6bd40d6a3014aa71cbd7b0d46b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scanner/FolderScanner.kt: FileTooLong \u2014 1055 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 555 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6399de5ef1dc639b4ba3c9f942097df974bca0410c631f9dc15592fd25582f85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlayerPlaybackChromeKt.PlayerPlaybackControlsSection: MethodTooLong \u2014 PlayerPlaybackControlsSection 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":"app/src/main/java/com/mica/music/ui/components/PlayerPlaybackChrome.kt"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f8bc3fa18a5736668d3abcc930529a441938574caf5f58ce68081487d05866"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MicaPlaybackWidget: ClassTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 425 over it, 2.06\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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c2ff0534b3675857304341a881c92bd629708b05684a525ade0e2aea6050e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExternalLyricsSettingsPanelKt.ExternalLyricsSettingsPanel: MethodTooLong \u2014 ExternalLyricsSettingsPanel runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.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":"app/src/main/java/com/mica/music/ui/screens/settings/ExternalLyricsSettingsPanel.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb060148d07ac6cda4cc00f037e8b4185483de23bcd1f122301279efbdae855"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/NowPlayingLyricsExpanded.kt: FileTooLong \u2014 985 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 485 over it, 1.97\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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingLyricsExpanded.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"331c80e5fed2ee522ce5032fddb6491d16152792bc98ed6ca9f435ce65e3c1aa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MusicLibrary: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\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":"app/src/main/java/com/mica/music/data/MusicLibrary.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5793046d79c1ce52f574b005820c82ce6f09f31168f57bcb1829feac5704008a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/CoverFlowCarouselView.kt: FileTooLong \u2014 981 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: CoverFlowCarouselView (58-1293). The bar is 500 significant lines; this is 481 over it, 1.96\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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b4f8a4484bd1c95ea1372b13c5f262b6fb110dee591550420fc61e56042c89"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SafAutoSyncPipeline: ClassTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 384 over it, 1.96\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":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c31d6b2e552ad58eceab243d090d045482169bdcc3f489f775077b90e88da7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AudioMetadataProbe.probeTrack: MethodTooLong \u2014 probeTrack runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4148e12e8cb994cce0e626ee34193cd9b6be658e83a2edc9324623db2ee043"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RemoteMusicSettingsPanelKt.RemoteMusicSettingsPanel: MethodTooLong \u2014 RemoteMusicSettingsPanel runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.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":"app/src/main/java/com/mica/music/ui/screens/settings/RemoteMusicSettingsPanel.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cc9571188243aaa9fa228aa34b27c2c1ec26fdae5f02a6647119602530bb6d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlaybackUiPreferences: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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":"app/src/main/java/com/mica/music/data/preferences/PlaybackUiPreferences.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"567a42d1a1f6bc6cfbe1c53336046559754dbe614bab0934d7ce0b07e6f2a39b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibraryAutoSyncQaProfileService.runRoomAtomicityGate: MethodTooLong \u2014 runRoomAtomicityGate 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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"22956d4faf7d7b329df41227cd675c98043583c09b0578e0645ae0c121fd9df5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibraryAutoSyncQaReceiver.runExternalProviderPayloadGate: MethodTooLong \u2014 runExternalProviderPayloadGate 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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7d4998bd4897ac53f641111eb6a43a7fb8d87d4cbd86be242f7975d33bbe54"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PhotoStackShadowPreviewScreenKt.PhotoStackShadowPreviewScreen: MethodTooLong \u2014 PhotoStackShadowPreviewScreen 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":"app/src/main/java/com/mica/music/ui/screens/PhotoStackShadowPreviewScreen.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6e27153a0e3805e62cf15ca575a4be4ccd098732e0e0e77979d3ceabfdf910"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/CustomPlayerLowerPanel.kt: FileTooLong \u2014 919 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 419 over it, 1.84\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":"app/src/main/java/com/mica/music/ui/screens/CustomPlayerLowerPanel.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d7f1a1966b91bd56ac8c24bd08521f14e94d620dbbc89143771578b8ae4c19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widget/MicaPlaybackWidget.kt: FileTooLong \u2014 916 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: MicaPlaybackWidget (58-1132). The bar is 500 significant lines; this is 416 over it, 1.83\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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5942632a3eecdbce00fa48988be04fd8a948aad01109e7870714d137f7f77266"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AudioMetadataProbe.tagLibSong: MethodTooLong \u2014 tagLibSong 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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f26e5b289c61a65d5f57327775cac920f0d9306cb58cce8b8269459f12cb45"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MicaMediaService: ClassTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 302 over it, 1.76\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":"app/src/main/java/com/mica/music/media/MicaMediaService.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e197ab4c38f9d3265cea56c08a34f5d91932c773959ecd6dccbf69fc855d5901"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LibraryRepository: ClassTooLong \u2014 691 significant lines (blank, comment-only and punctuation-only lines excluded), 46 methods. The bar is 400 significant lines; this is 291 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/LibraryRepository.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fdda57ccc1e504067368657f31517238db9f8983eac7e2a282323bc13d9cb0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UsbSk02DescriptorPrototypeReceiver.onReceive: MethodTooLong \u2014 onReceive 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"010c147853bdecca21eb7fbf8949bf088026c5a94a3be6a3cd290e7b76d96d77"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlayerPageLayoutEngine.computeFrame: MethodTooLong \u2014 computeFrame 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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c045184a02fda2dce3b904e8aa903633849704f71a387deb9d82958e3c39dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibraryAutoSyncQaProfileService.runTenKUnknownVerifyGate: MethodTooLong \u2014 runTenKUnknownVerifyGate 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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6883af7b6c69ef6494582a2ec754a7f6b222c58b39fc6c026682d8726d62bdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: library/SafAutoSyncPipeline.kt: FileTooLong \u2014 851 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: SafAutoSyncPipeline (16-985). The bar is 500 significant lines; this is 351 over it, 1.70\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":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3a45d0157879e7539d45fc9d3fe5942cef2e9ae93b7b365bd635d8a5ecda51"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibraryAutoSyncQaProfileService.runRoomPublicationTenKGate: MethodTooLong \u2014 runRoomPublicationTenKGate runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"806ffa0eba46a31c0cc67eae49f323d95daf428e331b986116eb85a84f3ab453"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CustomPlayerLowerPanelKt.CustomPlayerEditChrome: MethodTooLong \u2014 CustomPlayerEditChrome runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/CustomPlayerLowerPanel.kt"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"3810d4f8d0f2f3d6a1a2054546221fe7780e5f08dca9d65312f3aaeb6e1aec8b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SettingsUsbHybridPanelKt.UsbHybridSettingsPanel: MethodTooLong \u2014 UsbHybridSettingsPanel runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\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":"app/src/main/java/com/mica/music/ui/screens/settings/SettingsUsbHybridPanel.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4774a6f5d6a5a482e7fa3dc95f8c24b452ce9b966507d39855257d2c677f5a3f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StarMapRenderer: ClassTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 252 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f96dd3c8c07a2ed5cafe82294f2911915d94b3eb41e85e28eef92ee4db8f72"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DeviceAutoSyncPipeline: ClassTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 251 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9822f54a46f8d658b1a430ea7344a2ba0d390d70e57ff3877665e2dd1b779660"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local/LibraryRepository.kt: FileTooLong \u2014 786 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: LibraryRepository (97-984). The bar is 500 significant lines; this is 286 over it, 1.57\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":"app/src/main/java/com/mica/music/data/local/LibraryRepository.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"325ffeb1fe1924d1618ad934dd64f5a1146cd1c15d8c64e0da6c65edb707bc56"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DeviceAutoSyncPipeline.executeDeviceNoChangeRetryAuthority: MethodTooLong \u2014 executeDeviceNoChangeRetryAuthority 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":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cfa154a5d7de8fc405d4a5975e8a012262a35344ee943962aa3c12aacec63d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlayerController: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 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":"app/src/main/java/com/mica/music/playback/PlayerController.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3af0e94a76940516ef1d5a7311a58c495aa09e64a96e3b0dd82400d52b02126"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibraryAutoSyncQaReceiver.runDeviceAuthorityGate: MethodTooLong \u2014 runDeviceAuthorityGate runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec8d78519bebf53bb117f6b32bbeb1a93344c81fff7895a010981297b7fc994"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CustomWallpaperStackBlur.blur: MethodTooLong \u2014 blur runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.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":"app/src/main/java/com/mica/music/ui/theme/CustomWallpaperStackBlur.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f814ef3340b8b1cd67b3aba042b83ba6512bb63e475b91777e063effeeff6f3d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppUiSettings: ClassTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded), 100 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":"app/src/main/java/com/mica/music/data/AppUiSettings.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a47b550f1a1bbe8db5fe6a0d8bae6ed1c05f8fa6c236068877f6c6c2bea576"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LibraryRepository: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/LibraryRepository.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9926c5458b39102fa4747c162774615eb3fc9751b9053686ba2e3c153d4d310"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: media/MicaMediaService.kt: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: MicaMediaService (63-1010). The bar is 500 significant lines; this is 257 over it, 1.51\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":"app/src/main/java/com/mica/music/media/MicaMediaService.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a02fe578cadbfea354bd0d439865136b94a225a473795e23ebd7af2f4fc8cef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SoftwareEqualizer: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\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":"app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b18a9ab9e7ebd5df9fb25050a73ed3b08ebc5f37cc7c182e87f5e140e861341"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: theme/RainGlassBackground.kt: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 250 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":"app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cc224c6ac70f962b10c64e55f510ff8e9a7789ac2fd421649303fb7ba74473"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: library/DeviceAutoSyncPipeline.kt: FileTooLong \u2014 744 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: DeviceAutoSyncPipeline (16-818). The bar is 500 significant lines; this is 244 over it, 1.49\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":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2950bf3e6e81dc915eb77b7807befb69e5f4c2bb95af40ca8eaa00783c24df8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SoundFxScreenKt.SoundFxScreen: MethodTooLong \u2014 SoundFxScreen 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":"app/src/main/java/com/mica/music/ui/screens/SoundFxScreen.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e686e715280425e3888f7044fd625edc051093ef0edbc11dfc8b36f0c0023d17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NowPlayingCoverRenderersKt.StandardCoverRenderer: MethodTooLong \u2014 StandardCoverRenderer 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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverRenderers.kt"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"095e91e0e68b2268cc2e6e4dfe4771a481de5eea358f915faf5f27a88d6b9c54"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HomeLibraryStatsKt.resolveLibraryStatsBarModel: MethodTooLong \u2014 resolveLibraryStatsBarModel 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":"app/src/main/java/com/mica/music/ui/screens/home/HomeLibraryStats.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f8b1e8f4bd7d8fe784b2ee09d4f596cbfb6ba8d2aab199acc7a1d437b6d4cc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LibraryBrowse: 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":"app/src/main/java/com/mica/music/data/LibraryBrowse.kt"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc23e9f2035a1eea27677362d095750316faadb321522c75f0bbbc8d5bbe48e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibraryAutoSyncQaReceiver.runAutoArtworkGate: MethodTooLong \u2014 runAutoArtworkGate runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb75dca95e8dd1ec8e9bcf9aec8455bad20f190947623fc962b7dcf4577c612"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LetterLyricsPrototypeKt.buildLetterPages: MethodTooLong \u2014 buildLetterPages 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":"app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc539438e45fa20e78f9d9f5e0d5a41dce2e9d27b4eca5489c01b45e950c8b02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParticleCoverRenderer.render: MethodTooLong \u2014 render 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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a33852199148cdc999e3415cdf3859d201f964283a843cf43505841cb70b18"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MusicLibraryBacking: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/library/MusicLibraryBacking.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c4d506afcd007811aa908eba0e5ac2e0c914c36e6061f5a9b2ca4b6197113b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: player/PlayerPageLayoutEngine.kt: 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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"648ae4742c0a2195ee85b83d25ea4dede3a14d5b1fc9c6f542d91414da0e7a8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: overlay/DesktopLyricsOverlayService.kt: FileTooLong \u2014 708 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 208 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":"app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcce58befa7d8ac21960d5c5e516114ee174169d5e5d285b59035cf1e2a043dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SmbFolderLibraryIndexer.discover: MethodTooLong \u2014 discover runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.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":"app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae54bee95bbf2bf60ef855884f2e68a3c1c26d55e9a8be4cb24c7d6ed796d991"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MicaMainActivity.onCreate: MethodTooLong \u2014 onCreate 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":"app/src/main/java/com/mica/music/MicaMainActivity.kt"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d933fdef748750b810671bddb5c4a4ab610f1747fa5f4256b580501dd22287c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NotificationLyricsCoordinator.reconcile: MethodTooLong \u2014 reconcile 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":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9730c8eaf468d124e533f4456cba758410955814c9382021eec86c16c93eed94"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlayerPageLayoutEngine.computeLowerLayoutPlan: MethodTooLong \u2014 computeLowerLayoutPlan 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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f67d17737cd708f0a6ef1ed6192b343751588ac3499506d9102d50ab2c6748"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FolderScanner.loadDrafts: MethodTooLong \u2014 loadDrafts 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":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a99336a621606962c23ea6d132c4a78df68cd9736f2a932def0b954ef66f4ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MediaStoreScanner.loadDrafts: MethodTooLong \u2014 loadDrafts 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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce2924339812d62145bba78417070fb3294130fead0ce2cd04a501cbc1f177d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DefaultUsbOutputCoordinator: ClassTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 152 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":"app/src/main/java/com/mica/music/media/UsbOutputCoordinator.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82a1b34b8fbf6aecd82cf7cf93f5775b760719ea42e2d84315e636c8c9776eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: media/NotificationLyricsCoordinator.kt: FileTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 188 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b938b423ccb866db06e6bddc75f2f3c7c8bf487336b60e7dfbbef0d24f6def8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EmbeddedLyricsReader: 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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcff0c7c65f1bb3854fceb2944f09604f29e5e49ca4479d3b519622405917174"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParticleCoverRenderer: 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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c47f520fe3b03f38e0c59a128f5d210f8c40f19c7f6dfb79f72f96260c6be93"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SafAutoSyncPipeline.executeInternal: MethodTooLong \u2014 executeInternal 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":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"674bb17c1b948a4a562254fb536446f51c5a8f07a3231a9bad4b96154f91149e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SafUnknownFingerprintDebtPlanner.plan: MethodTooLong \u2014 plan 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":"app/src/main/java/com/mica/music/data/library/SafUnknownFingerprintDebtPlanner.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafcfbc988fcbfe8ea7b569dd93f448202dbe7653564274015327f44238308f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SongListPanelKt.SongZoomSceneItem: MethodTooLong \u2014 SongZoomSceneItem 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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec35116c18444e6c2ba8385a0bd64758b4b2e459d135060a6e846bdc70c8b5f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AboutScreenKt.AboutScreen: MethodTooLong \u2014 AboutScreen 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":"app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e5893b1ca06a2b3fd789a3a79597ed7dfd7fa1faa6bfb0bcf67eb37d600379"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: playback/ServicePlaybackStateStore.kt: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 152 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"503ce73e7adb3b51725ca945985cfef14bc0e4a19fff34bc9abc60c79ffe4e8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: preferences/LyricsPreferences.kt: FileTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 146 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":"app/src/main/java/com/mica/music/data/preferences/LyricsPreferences.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a66ca5668aed5dcbc9660805cf087faf2c91de2232613b188a6a66e90c60ce6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/SongListPanel.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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28800039c0914b39e62f718a60b5ecd09094d0f3bfa7bdee6f095a0c36bbd01a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SongSortSheetKt.SongSortSheet: MethodTooLong \u2014 SongSortSheet 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":"app/src/main/java/com/mica/music/ui/components/SongSortSheet.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3078e1b19bf5f360aaa600a973514c6c53e7ef45e3741f70db4bb862e674b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/AppUiSettings.kt: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: AppUiSettings (21-1008). 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":"app/src/main/java/com/mica/music/data/AppUiSettings.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f95682a99c7c58f1f43f020b1b117a9461af5bfe609cc93e73198908497d66"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PhotoStackTransitionHostKt.PhotoStackTransitionHost: MethodTooLong \u2014 PhotoStackTransitionHost 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":"app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionHost.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b725d1b3b485a018056e8448fe7247d85912b95fbbd36362ec8f02ba94c2f3c6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefaultUsbOutputCoordinator: 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":"app/src/main/java/com/mica/music/media/UsbOutputCoordinator.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77a1a56445228c2367b98b22fe270ee274ae5cb55028ef2cc42c52acb434244"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: media/UsbOutputCoordinator.kt: FileTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: DefaultUsbOutputCoordinator (98-837). The bar is 500 significant lines; this is 130 over it, 1.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":"app/src/main/java/com/mica/music/media/UsbOutputCoordinator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c7e1149e015f1dabcbc177ad6defa51b5e854be5461608071c801cc370d8ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UsbSk02DescriptorPrototypeReceiver.decodeMediaProbe: MethodTooLong \u2014 decodeMediaProbe 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa61c4d686a22a3395a0f4390d1ac2cec0ae5955acacf13f9da24c5b07266c79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SongDetailScreenKt.SongDetailScreen: MethodTooLong \u2014 SongDetailScreen 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":"app/src/main/java/com/mica/music/ui/screens/SongDetailScreen.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"de41d8b7dcf7d4adef749ce9289b71bee8665782c37b15efc616842418cf892a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlayerPageStateKt.rememberPlayerPageUiModel: MethodTooLong \u2014 rememberPlayerPageUiModel 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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageState.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d790385f5244d6d2d04dab47f6bf132b447a20f1f7ca3099d8b57f09342834"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/NowPlayingCoverSection.kt: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"680fa4285eeaab1193926ba272eb273357c2e69e93086c263189155e90afc9a1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LibrarySyncScheduler: ClassTooLong \u2014 498 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 98 over it, 1.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":"app/src/main/java/com/mica/music/data/library/LibrarySyncScheduler.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5502ada251c238c1183b015f963e61394168537824ee664d0f6ee82232929ecc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SafAutoSyncPublicationPlanner.plan: MethodTooLong \u2014 plan 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":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPublicationPlanner.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"767b84c7d08b827dc59b99ad5c03b64422475292ec6ceb0d1f8959a2d2d38426"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RainGlassBackdropFactory.create: MethodTooLong \u2014 create 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":"app/src/main/java/com/mica/music/ui/theme/RainGlassBackdrop.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a56774c9f27e1c4f324a54eea8ace29c8704122bb5b3dc314cd1aa556641809"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LyricsDisplayKt.LyricLineBlock: MethodTooLong \u2014 LyricLineBlock 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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c414b9c5da68c804392b79bdd48089ca65aa006ed19c79087ff7d2bf6678f33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StarMapRenderer.render: MethodTooLong \u2014 render 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":"app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b84ded932c0c7b1d0044dab56462ff628c75f46d59c7843f1edb09473405400"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlaylistStore: 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":"app/src/main/java/com/mica/music/data/PlaylistStore.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dff974089e2ff78c4f814b2a7734e66ef5cf47f5cade66ea35a0bd38201ae04"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UsbHybridPcmAudioSink: 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":"app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridPcmAudioSink.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b2a115e88211ba544086a2320bcbdd96c131f39eff9b20c94f5c34e259e552"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DynamicArtworkBackgroundView: 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":"app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackgroundView.kt"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aedee8eb05164070879dfa547e5508a8bf913cbf9d2d76c843923199fe3ca7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LibraryCacheLoader.loadCachedLibrary: MethodTooLong \u2014 loadCachedLibrary 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":"app/src/main/java/com/mica/music/data/library/LibraryCacheLoader.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e6d74a1e979696e08f87a909cdc8c3bb9557a6a31aecd67b9fb8bf7742d727"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlayerPageLayoutEngine.computeCoverFrame: MethodTooLong \u2014 computeCoverFrame 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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff97f3e885c2af7d1a69914da7fe8eff94052a5610f5d82791c1bd9b3023317d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AndroidDeviceShadowProbeDraftQueryApi.queryAudio: MethodTooLong \u2014 queryAudio runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f6fca7330aabc19ac1dfda86c2866619507cb76ac39c747a6dfa88016b7bb9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrowseGroupDisplaySheetKt.BrowseGroupDisplaySheet: MethodTooLong \u2014 BrowseGroupDisplaySheet runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"917cf893836ac2fcc1412b5803c603fb4d23552f022e365e0045d63729f36ba3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LandscapeCoverFlowLyricsTransitionKt.LandscapeCoverFlowCoverLayer: MethodTooLong \u2014 LandscapeCoverFlowCoverLayer runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/LandscapeCoverFlowLyricsTransition.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8927f15aae1d3fd7162c80d713428a86daabe522dc985331664a676b485a6f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PlaylistStore: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 67 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":"app/src/main/java/com/mica/music/data/PlaylistStore.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"462084f9d4a7d308721fd7e31c49d5863df42e11c5bbc9c12e1a2bb37ea819b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RemoteCatalogRepository: 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":"app/src/main/java/com/mica/music/data/remote/RemoteCatalogRepository.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35b5184ec9c2ad214418411eb9c565795a6ddd3ae20a078a1d72961d71c2d3c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AudioMetadataProbe: 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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7708a59fa0f9194b499797c4845e36a711a430c0c03e4e37543ce08e6611c44"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MicaCompositePlayer: 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":"app/src/main/java/com/mica/music/media/MicaCompositePlayer.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bac5ef2372194e9a8b3cc602fc50bab2060db0bd675ff9e9123b17ae81ba73"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MicaMediaService: 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":"app/src/main/java/com/mica/music/media/MicaMediaService.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8171cbaab7a78a117a88cb3175e94f3e7dc3af63e1fd34983507e30da49ac47c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SafRetryPlanningLoader.load: MethodTooLong \u2014 load 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":"app/src/main/java/com/mica/music/data/library/SafRetryPlanningLoader.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3f10cd347081af355b6c9816e44a7619cc0ed76c89eccb19a99d326b697445"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RoomLibraryStore: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. Most of these members implement data.LibraryStore (32 of 33 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":"app/src/main/java/com/mica/music/data/RoomLibraryStore.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"11781809cf3c3023fab8c30541aa3ada9519c49df1426a25c360a5cf1c29405a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AlbumArtCache: 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":"app/src/main/java/com/mica/music/data/scanner/AlbumArtCache.kt"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71c493bc5caab853abb0b897583068a6fb5be41bed14664bbe5219fe4ba8063"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NotificationLyricsCoordinatorKt.buildExternalLyricsLine: MethodTooLong \u2014 buildExternalLyricsLine runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3b7c76202651f2bb35f2f4505c545a7cbac8dd7cd281e267d843d96f72eda1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UsbSk02AudioOutput: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02AudioOutputProvider.kt"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc7a098ed6e2530e7bb4812c696a2030a7b9da592d58b8f5d823bbc98549d96"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AndroidUsbHybridControlEffects: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/media/usbhybrid/AndroidUsbHybridControlEffects.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dd1bb912566a5534f28dbc7ddd9555d92c093f9a8f142eb738657bb381d531"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MicaPlaybackWidget: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a7f0a77412e938acaa59813f7e3ddcde869ba3dd1aa2687c5a0d668c693b09"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LetterLyricsPrototypeKt.LetterPagesOverview: MethodTooLong \u2014 LetterPagesOverview 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":"app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f7defb7e820e29260d4682a676f8b24927dd36ebc5d93eee4642e4c95eb3e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scanner/MediaStoreScanner.kt: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded), about 71% of them inside a single declaration: ScanResult (28-509). The bar is 500 significant lines; this is 48 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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a402fb4bb2784f41c0a26f25c7d5558c91a4468c645a8050a0965f33341576"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: library/LibrarySyncScheduler.kt: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: LibrarySyncScheduler (68-758). The bar is 500 significant lines; this is 44 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":"app/src/main/java/com/mica/music/data/library/LibrarySyncScheduler.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"267bc8a90d319bf50ad7e9eaf74e30733d5c04c8f149b106c9106454b0bdf666"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scanner/EncoderSettingsReader.kt: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2191a1ac74e7b2b8f2f7cce7f408bbaa2f4404b5ead96fea9551b23c142fa8b5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SoftwareEqualizer: ClassTooLong \u2014 435 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 35 over it, 1.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":"app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcb879bcd3953e0d756ba955e34ae188089d4fffda58c6a46504a4da08303f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SafShadowObjectProbeExecutor.probeOne: MethodTooLong \u2014 probeOne 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":"app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec114d8b274b8494f7ef3ad61074eb54a739fd9299bdb75ad0dcc155318b558"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SleepTimerSheetKt.SleepTimerSheet: MethodTooLong \u2014 SleepTimerSheet 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":"app/src/main/java/com/mica/music/ui/components/SleepTimerSheet.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f3f38d4c386b19765309e0fcb043688de00a42b94b8acdb04082cb35bad845"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: preferences/PlaybackUiPreferences.kt: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/preferences/PlaybackUiPreferences.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c67a25b2130315a97fd64ff7dfc4961516892183ee88f92fafb0e740c2c59e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/LyricsCloudPanel.kt: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 36 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":"app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"010c7f6cb18179d7eb94f71f328cfd14fb7c7f2a6f25f21e1cadf6861f700f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SongActionMenuSheetKt.SongActionMenuSheet: MethodTooLong \u2014 SongActionMenuSheet 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":"app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32dd040390b688cf5e4e482d9a8a9e32987b50637881f9d4d1f6020b9194b11"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TestDocumentsProvider: ClassTooLong \u2014 425 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 25 over it, 1.06\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":"app/src/debug/java/com/mica/music/data/TestDocumentsProvider.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51437c377c8f35f23f3ee41e77475be5cb9c536379d72f4d17a2b70e0567482"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: theme/DynamicArtworkBackgroundView.kt: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded), about 65% of them inside a single declaration: DynamicArtworkBackgroundView (105-565). The bar is 500 significant lines; this is 31 over it, 1.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":"app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackgroundView.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ee3a0bc08df208b9d7e27f8716b598c2de13ab5134722a79f5799098d9c7d8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DeviceAutoProbePlanner.plan: MethodTooLong \u2014 plan 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":"app/src/main/java/com/mica/music/data/library/DeviceAutoProbePlanner.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1751bf8867c805b3844708c849f95788eda1917ea82e69fe9a4f0cd0be7209"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LyricsDisplayKt.KaraokeLyricLineText: MethodTooLong \u2014 KaraokeLyricLineText 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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75112a3d0c1bea68144c32385ca508483ade5c524aa527c2ae9f1a28a356080"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DeviceAutoSyncPublicationPlanner.plan: MethodTooLong \u2014 plan 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":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPublicationPlanner.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b94f85323692219b3fe9eb4d74de36dad66165590525e4da299eda7859e592"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopLyricsOverlayServiceKt.ExternalLyricsLineText: MethodTooLong \u2014 ExternalLyricsLineText 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":"app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cea930ca3f9aa1705ed3aad709680848c8753b41a5bc27488e030559e726222"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/LyricsDisplay.kt: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 21 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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac77dfa575e2eded1dd6580d3c3f3e5dfbec454df29582530cc00ed131a84db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UsbSk02DescriptorPrototypeReceiver: 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"999ca06b895da0482d6da559250b8211cba3deb4d00d3350073ea1e8c0801d77"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LibraryBrowseSettings: 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":"app/src/main/java/com/mica/music/data/preferences/LibraryBrowseSettings.kt"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8527d918ffea39bf8d4958798e6c090ac1fad140c24c853ddf39cff3d52c082c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HomeTopBarKt.HomeTopBar: MethodTooLong \u2014 HomeTopBar 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":"app/src/main/java/com/mica/music/ui/screens/home/HomeTopBar.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b4ac55a97a60738be2026afc52994f27f224280f637fb120b4f3d7c6c2d20d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StarMapSceneProjector.project: MethodTooLong \u2014 project 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":"app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef21df7b425b0309bb5490f1588a00b63e9e40cd687612d70978848816656b13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/PlaylistStore.kt: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: PlaylistStore (55-674). The bar is 500 significant lines; this is 10 over it, 1.02\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":"app/src/main/java/com/mica/music/data/PlaylistStore.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00297133768ac7190af7b430cb884be273b53020fb11ccf046ed7d29a82be1a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MediaStoreScanner.loadExtendedAudioFileDrafts: MethodTooLong \u2014 loadExtendedAudioFileDrafts 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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"baab9e4553146795157a90a891bf1fcc2db7e38264b4b50fce123ea63931fb5f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NowPlayingCoverRenderersKt.CoverFlowCoverRenderer: MethodTooLong \u2014 CoverFlowCoverRenderer 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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverRenderers.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de3c5af2231dc30bbc0b11f1db3ab506cf93eb3c32eeebd21f9257487089836"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CustomWallpaperCropDialogKt.CustomWallpaperCropDialog: MethodTooLong \u2014 CustomWallpaperCropDialog 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":"app/src/main/java/com/mica/music/ui/screens/settings/CustomWallpaperCropDialog.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e0af171ac6d3a8c9157b3eb066742ce874aed060e38b9de224f1eef14b3194"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/PlaybackQueueSheet.kt: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 9 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":"app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3164d3d402bd506ebfdc95bc782eeb7b32ac1871c63ca498d6533f896455e66f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/SongActionMenuSheet.kt: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 8 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":"app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53541e03f79cf4b489103df854557452d7dfde41f7c8f52bfc95c40de3ca6336"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/MiniPlayer.kt: 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":"app/src/main/java/com/mica/music/ui/components/MiniPlayer.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5a648811222b5b2d3bdd2328411405a22022fd0c595d96845d781a72863a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (45 shared lines): app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt:37-183 | app/src/main/java/com/mica/music/ui/components/SongSortSheet.kt:39-199 \u2014 These two members are variants of one another: 45 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b5d583b749b4f43bd0e0e76bcd12656e20ed1bb5255a21b2692356cd5729eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (42 shared lines): app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt:16-98 | app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeHttpExecutor.kt:18-91 \u2014 These two members are variants of one another: 42 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd18b2aabe08294886bdf5d57f69342d72ae30b7da07f99b9122207b0523e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt:56-141 | app/src/main/java/com/mica/music/ui/components/SleepTimerSheet.kt:77-210 \u2014 These two members are variants of one another: 33 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0f7007f2ef29bc1ef771c96c91e366590b29b77d6137faa665a04bc3b904a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (27 shared lines): app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:46-112 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt:53-128 \u2014 These two members are variants of one another: 27 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87bddd143e5fd84e8f6a6fea10265f8b9957cf5abf41969ea727840db959dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:263-281 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:721-814 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:946-1025 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1027-1108 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1146-1206 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1208-1279 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1281-1311 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9283a73e96a2dfbef94d6fab8a76d3aef2d2c6f8c6853e5970a042a22cadbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:60-228 | app/src/main/java/com/mica/music/ui/screens/EqualizerScreen.kt:169-192 | app/src/main/java/com/mica/music/ui/screens/MetadataDebugScreen.kt:169-200 | app/src/main/java/com/mica/music/ui/screens/SongDetailScreen.kt:61-227 | app/src/main/java/com/mica/music/ui/screens/SoundFxScreen.kt:243-266 | app/src/main/java/com/mica/music/ui/screens/SpatialAudioScreen.kt:38-96 | app/src/main/java/com/mica/music/ui/screens/VersionUpdateScreen.kt:47-160 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9797498d441a32a5fc488a26c8163e4188a74e651f68b7365762cffbbd2847ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:721-814 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:853-944 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:946-1025 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1027-1108 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1146-1206 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1208-1279 \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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b024072a6a9ceff3913207585cad883a59edafc92423e379296ff582da8460"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt:272-345 | app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt:351-433 | app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:110-174 | app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:176-231 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:98-222 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:227-326 \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":"app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a324404b28cae31cf74e1597b2bc9ee8d18a19423fe96a85a5e7b2bf4fae85a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:43-355 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:750-797 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:1511-1566 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:1571-1686 \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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50702913a0beedb042b38bd77471985c175a729b04e86f85e6f6732f1b49e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt:64-77 | app/src/main/java/com/mica/music/data/AppLetterSealImporter.kt:81-94 | app/src/main/java/com/mica/music/data/AppWallpaperImporter.kt:45-58 | app/src/main/java/com/mica/music/data/PlaylistCoverImporter.kt:56-68 \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":"app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b0c370b64ae128b2b0c3062f6ee3b074dc404f9f624c468c546f356019de46"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:359-395 | app/src/main/java/com/mica/music/data/remote/smb/SmbNowPlayingMetadata.kt:85-132 | app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt:303-344 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt:328-377 \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":"app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7029be7db131d79cd9745fda48379b80b24f81da8cae1595f70b522436752988"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:77-173 | app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:181-269 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:124-223 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:232-322 \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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00983d0db793dfeb0e863e42c1a7baed2a0d4b7f79612d92a2df5575ed01ccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): app/src/main/java/com/mica/music/media/ExternalMediaItemCodec.kt:32-65 | app/src/main/java/com/mica/music/media/RemoteMediaItemProvider.kt:18-48 | app/src/main/java/com/mica/music/media/RemoteMediaItemProvider.kt:50-82 | app/src/main/java/com/mica/music/media/SongMediaItemCodec.kt:69-97 \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":"app/src/main/java/com/mica/music/media/ExternalMediaItemCodec.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f41acc0743dfdb39c139282c21fd9d25767f4eecdc10dda669a8a0b21f1f5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:749-769 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:371-385 | app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:698-723 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:2067-2082 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6922d7cbb5c36cc012480619798ff3ca176b06cb0cb50cb9a3b37840354dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt:325-393 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:164-204 | app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:323-414 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:251-295 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"453a49b26d3444b8d26c6ddaea0847e9f3c9d85d24f4349a686c52511057fc43"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt:398-417 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:206-225 | app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:419-438 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:297-316 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ace9834f2733bee0b4e7068d08095fc9af72dc16fa1706f26e602924dbeadcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (143 corresponding lines): app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt:592-734 | app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt:53-197 \u2014 These two members are one piece of code written twice and then edited apart: 143 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0aa961aaa176935dc6caf9407b3c9f08259a8e2c1bfb52dc9c4dbe371c7352"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:440-515 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1557-1645 \u2014 These two members are one piece of code written twice and then edited apart: 76 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a05554530b32161ae4337d15676b9ac3d5aadaae2adb5301009c0028126634"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (91 corresponding lines): app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:516-613 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:722-812 \u2014 These two members are one piece of code written twice and then edited apart: 91 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"594c03705bfd93b11ed5d2338dadcbdd3197afd41a8d46fb1e693fc2fbf9e628"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt:77-124 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt:158-207 \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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea56f0a99c7f2241dc2ff64e78e38822ac6220e32805684d1ec15ed9af5043d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:96-153 | app/src/main/java/com/mica/music/data/scanner/Id3FrameLister.kt:35-80 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f8a79234327889b909c43857a57e099f58335ebec61d76895a6fb24b4ab02a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:812-865 | app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:867-910 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e889f2dca3536de5522b1fb5cdfbea3c3807b121fb8b228350cf6d786f72cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt:431-497 | app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt:503-558 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a481920996340fd068ec01cc9c541654ea701b79bfb1f269d6e1d1d7947deb86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt:46-106 | app/src/main/java/com/mica/music/ui/components/HiFiSeekBar.kt:33-81 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e15a5625613fb2f9ac00ead7f895e820da204633fded088bc8c11473def1efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): app/src/main/java/com/mica/music/ui/components/DirectionalTrackWipe.kt:105-173 | app/src/main/java/com/mica/music/ui/components/DirectionalTrackWipe.kt:183-250 \u2014 These two members are one piece of code written twice and then edited apart: 68 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/DirectionalTrackWipe.kt"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac40f7907c5a990266a6ada7a58c378e0d5a222235028e12ee44340f4bd4b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:338-398 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1476-1535 \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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecc80c5d966225521585ff8adc3db03effc1459724b77dab74109faffa3ff31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackgroundView.kt:625-650 | app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackgroundView.kt:658-682 \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":"app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackgroundView.kt"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d77bc6c1e1ed6b608d9f6474119fc1e9d14cc3c8a805d832ab5e5a3da1a11c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): app/src/main/java/com/mica/music/data/library/AutoSyncPublicationAuthority.kt:31-89 | app/src/main/java/com/mica/music/data/library/AutoSyncPublicationAuthority.kt:95-139 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/library/AutoSyncPublicationAuthority.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16483d2a646945c44f6a510291e8a30b3bae8e222149fbf0ac1f3eadce040a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:246-321 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:189-249 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"590c5351ea8eb48d06367549152ffce114e5a144bc9ef672857f6540cec79405"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:622-684 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:977-1028 \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":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"9027b3716d3e477776d3181bf95e2a27ea7462f1efc6a899d9b3c2ecf96d5393"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt:438-472 | app/src/main/java/com/mica/music/ui/components/NarrowBarSoftKaraokeLyric.kt:196-222 \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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf23343177d121e5b6b2ab254600547c6e259630ca66a413ba175088f010715"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:238-300 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:354-410 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c686664c0eb425e8be7b7259e25a31495647ed861fdc1169460d47dfb0dd849b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt:51-77 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt:84-111 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavStreamRequestResolver.kt:87-114 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2285dc133fb41082fabfeabcad358b9d514b215d759b66b3c6b6363ac532384"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt:20-56 | app/src/main/java/com/mica/music/data/AppLetterSealImporter.kt:21-73 \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":"app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1287b6f3708e0c50f4728f7e637c59b8d29db45b98821d01a0306d4b21612b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt:33-54 | app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt:61-82 | app/src/main/java/com/mica/music/data/remote/smb/SmbPlaybackTransport.kt:41-62 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c690a9b68bb45a8e644279e6b9f06b9d6b0dff543d72b4ea79db8a84e5a51965"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): app/src/main/java/com/mica/music/data/library/SafShadowRelationRematcher.kt:205-245 | app/src/main/java/com/mica/music/data/library/SafShadowRelationRematcher.kt:251-291 \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":"app/src/main/java/com/mica/music/data/library/SafShadowRelationRematcher.kt"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e2fb230a982e1e808c59e47b56cbc17b0bdeb52cc718035752d234c4a799cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): app/src/main/java/com/mica/music/data/local/SongEntity.kt:168-218 | app/src/main/java/com/mica/music/data/local/SongEntity.kt:220-269 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/SongEntity.kt"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f97a1b16d690a89e85b6a15e4899c26969f204b0dae10ea1ee60706d6e5bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:333-373 | app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:375-414 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4e662ff5724ddc77a25d2ae0de5eea0e05f6549c98e59291e48d768fdae38d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): app/src/main/java/com/mica/music/media/usbhybrid/AndroidUsbHybridControlEffects.kt:135-179 | app/src/main/java/com/mica/music/media/usbhybrid/AndroidUsbHybridControlEffects.kt:181-223 \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":"app/src/main/java/com/mica/music/media/usbhybrid/AndroidUsbHybridControlEffects.kt"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"1123c675436cff0d1d0c4b354577a893f4ad11b26d8dead6d1ada956690f5d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:409-447 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:485-520 \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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0ac98b89c6006769cd3d0d34200d1d16aaffa35cd9785f6d04a3b7d2c60f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:277-292 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:299-314 \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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"2546b6cbaada4d9997fca417793adeaf9518e93a3339a69a9b24f33f5b2db7aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): app/src/main/java/com/mica/music/data/remote/RemoteMediaMetadataExtras.kt:32-49 | app/src/main/java/com/mica/music/data/remote/RemoteMediaMetadataExtras.kt:51-71 \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":"app/src/main/java/com/mica/music/data/remote/RemoteMediaMetadataExtras.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfdbbb8eb5c8ee4ce2982601ea4d005b219fe1d5b47fe2eb2f510252e648263"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1223-1256 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1274-1313 \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":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9d4b84fe61440e757ee74acd99eae4e51f13307b9e6ea91c52716290790772"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:184-211 | app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:213-233 \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":"app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"312ae2d61746d629e2205c679fa41b4c51c811c7b31f2e6ed9bb0fab1445c9ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:303-322 | app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:324-345 \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":"app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"65aefa2421dd739b8837fcbe68db1a51a38c23b7a9ae7ff93338da71aacb32f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt:99-124 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt:88-113 \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":"app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2146528961a7bcbcd47f7f68c3f449af511208c8e49d0cd70d8b577183f3b61d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:765-800 | app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:808-848 \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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bc7f20b0d064b334d0bd0c5ae41dfacfd9a3e5084dfa365fa839f1f4267fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): app/src/main/java/com/mica/music/data/LibraryBrowse.kt:266-286 | app/src/main/java/com/mica/music/data/LibraryBrowse.kt:292-317 \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":"app/src/main/java/com/mica/music/data/LibraryBrowse.kt"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6841825039053837b1f005a8fdc21a720c823d46c97aff870fd0a125e7c1325"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:1153-1190 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:1275-1308 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"106cc2887cc4d843f76f2a8d7b372052aef8d0627e74467a8b8bde9b5d5b9eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:659-690 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:308-326 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ec305f48ad3f3820813e6203288504b1d11a9d8765705a53207597b47a7b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:787-805 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:1420-1438 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1aa1fc90ada15cd85f8dfeb45a6a2d8c9118a1db408c41eecad29fc974cb21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:122-149 | app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:151-176 \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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac6d8bf194375503b0929f04289b2d2da0182106f36b9067021613120af6d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:534-549 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1663-1678 \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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c42b5a560b8d45410ed5dfe146792d3b65e5c806a679878a5a4dcd71cfa3f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkRequestResolver.kt:15-35 | app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeStreamRequestResolver.kt:22-45 \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":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkRequestResolver.kt"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7409d96b8ba859c03acd48ee2a83d4a1b8bbf89d37eb3aa4cfff7d761d9fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt:65-97 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt:129-153 \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":"app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fde1d06d4e8bff1ddaf7428473a453f948d6f429d651553105f8903720e632"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:303-327 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:376-396 \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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4fd939235374934cebf0fc26929f73bf6c932c51cc8a3fdf0ec258dd80ff71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): app/src/main/java/com/mica/music/ui/theme/NowPlayingBackground.kt:94-123 | app/src/main/java/com/mica/music/ui/theme/NowPlayingBackground.kt:131-159 \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":"app/src/main/java/com/mica/music/ui/theme/NowPlayingBackground.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc6e2305d10f679c215ee723e4e8f9f354eb6d00161c57e038450e4902c8e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:658-685 | app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:694-723 \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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f29995a20a35acb73e0e69c0dc74ed0ddd4796aa865f4bd858fc5a7288db1e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt:98-127 | app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt:135-164 \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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6979f7fc0792ace512bb8dcc651b8c2bc9f83ceeac3765ae08de9f87be68cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): app/src/main/java/com/mica/music/ui/screens/LibraryAnalysisScreen.kt:204-243 | app/src/main/java/com/mica/music/ui/screens/LibraryAnalysisScreen.kt:251-280 \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":"app/src/main/java/com/mica/music/ui/screens/LibraryAnalysisScreen.kt"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"80637f2d54500bbf2a92e5292e6fe59f78cdabd67845b9291b9d5f77ef54cb34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): app/src/main/java/com/mica/music/audio/eq/EqHeadroomPlanner.kt:129-150 | app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:565-593 \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":"app/src/main/java/com/mica/music/audio/eq/EqHeadroomPlanner.kt"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f23b377b9b109a11d97d692881777beb9030983c5fac6c08dc67f50bbeb40f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:56-86 | app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:95-120 \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":"app/src/main/java/com/mica/music/ui/components/SettingsRows.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"61302cb5a251ee711145239d3eaf0a63b6ae10f3a21b6fcc2a8630d875acad99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:110-130 | app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:132-150 \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":"app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5637f30bf7de327f7a947da5ebba3b2678b8d839b9d29c09e863becd5762b456"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): app/src/main/java/com/mica/music/data/PlaylistStore.kt:115-133 | app/src/main/java/com/mica/music/data/PlaylistStore.kt:162-182 \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":"app/src/main/java/com/mica/music/data/PlaylistStore.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68f971673f8e98c602031920ba640127ebb5a6379d1993cf6c33c9ca84f3369"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:469-495 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:174-192 | app/src/main/java/com/mica/music/data/scanner/Id3FrameLister.kt:165-183 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fb260cbf3471bb547242cc31ca559430c88b6dac4b1c4c9711e7891bdc9bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:277-296 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:353-370 \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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"872209fae9da5458e94c8b0ab73440ee9b89db646361ffce76e21929c363aea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt:80-96 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt:60-76 \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":"app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f7e4118c362bf85b3b3d49e5cf42e56fe3743fe5cdbb5db333ee07189f9af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt:46-73 | app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt:323-342 \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":"app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d95231bb23e59197c30c304fddcd4633351133d51ff9cc07f0b3a4dc3cf5aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): app/src/main/java/com/mica/music/data/scanner/ExternalLyricsReader.kt:144-161 | app/src/main/java/com/mica/music/data/scanner/ExternalLyricsReader.kt:163-177 \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":"app/src/main/java/com/mica/music/data/scanner/ExternalLyricsReader.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0237a7187f6fb14ef3ea119e8c684a400ef02b35a8eedb46b7ebf99ed0af0bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt:388-404 | app/src/main/java/com/mica/music/ui/components/NarrowBarSoftKaraokeLyric.kt:226-242 | app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt:883-899 \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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f665e66275b24242ee80bc6dc700e50f8990a2b3c87cbb0592347d6cb2387f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt:52-72 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt:136-153 \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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d941c0e58a6b77ce6616c36b5af3f3b62f2a152ba2c3c0a29e623b6bbc78ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:483-523 | app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:944-971 \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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a086d463565e6b9eea0f55efb35fd8c1878676e6bfb976a1568ee2796d57392"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt:67-90 | app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt:98-121 | app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt:128-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 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\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":"app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"16be9fab30531d4055b95355a5cd7377fdac5f4206e725e654fbd4de5dab7e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): app/src/main/java/com/mica/music/data/PlaylistStore.kt:101-113 | app/src/main/java/com/mica/music/data/PlaylistStore.kt:186-200 | app/src/main/java/com/mica/music/data/PlaylistStore.kt:202-217 | app/src/main/java/com/mica/music/data/PlaylistStore.kt:337-351 | app/src/main/java/com/mica/music/data/PlaylistStore.kt:384-401 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/PlaylistStore.kt"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a452d78b0a20303da1e7233bcbb610ae58c529b189ab6de2c6cba23ca0565c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/MusicVideoHost.kt:93-106 | app/src/main/java/com/mica/music/ui/screens/player/view/VideoAlbumCoverHost.kt:179-190 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/MusicVideoHost.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47070ab76aacfdb53b051f7a01cb4c9b37c47f557c1f8758b73f76f284011a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:397-406 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:450-463 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cfce59db85a1947b285e80442f2f8b108e78324fed3823f586d91d2c04949d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:716-736 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:349-369 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"9938ca65a78cf06fca7fbba8f930e5b2afd1c9a2831faa75d41dba7c33d463ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:66-82 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:44-62 \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":"app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8390b9e4d1dd7050312636c68865c72f6bb6942a09f399237b87ecdbdcb39cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:241-269 | app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:373-400 | app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:884-906 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6827a85e3459d2db4459e10789922b659ae587470738a20aa56601ab9358fa01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:263-283 | app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:347-364 \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":"app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a52615bc76a6aa185c482600f8cdde4c9dacdb1ad3bb1e5d310b834c07500f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): app/src/main/java/com/mica/music/data/library/LibraryCatalogPublisher.kt:233-246 | app/src/main/java/com/mica/music/data/library/LibraryCatalogPublisher.kt:252-265 \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":"app/src/main/java/com/mica/music/data/library/LibraryCatalogPublisher.kt"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"44965b26a0399a95680845439c11fd8ced0e5122f43ef172cb15b7e6c6203d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:568-585 | app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:594-613 \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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13579d04a980c02e3558830e20f55dd5e73faeea9dccceacda7cc7ac47c1661"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): app/src/main/java/com/mica/music/data/local/RemoteTrackEntity.kt:51-75 | app/src/main/java/com/mica/music/data/local/RemoteTrackEntity.kt:77-103 \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":"app/src/main/java/com/mica/music/data/local/RemoteTrackEntity.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8c5b58726c39ee057ba7e118f7bf79bb912107c15fd9af29886747d0d8bcc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:22-44 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt:17-40 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fc44f2c0975b6774048c804926dec4fa98e7d672f5ff01ce0e4f7acec3719b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:443-455 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:650-662 \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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a1164caf6dc75b2ec182113ea085e984954ff0fceb37eb9c9c910d7b37813f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:868-884 | app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:933-950 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14798e31bdefb054a342846a724383bf121cc76dccac6022afb9802a66de570"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): app/src/main/java/com/mica/music/data/scanner/Mp4AtomTextReader.kt:8-26 | app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:37-56 \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":"app/src/main/java/com/mica/music/data/scanner/Mp4AtomTextReader.kt"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6db585cc05b7c0549bc038123af32d6b9a8eab42e25f54f0b24b51d9c93cef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): app/src/main/java/com/mica/music/data/scanner/CoverColorExtractor.kt:90-97 | app/src/main/java/com/mica/music/data/scanner/VideoCoverPosterPrefetcher.kt:169-180 \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":"app/src/main/java/com/mica/music/data/scanner/CoverColorExtractor.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea13ef0aa6e4a3fa3d587b698cac665a34facb582b0f6e9afbe5b4e5c96e058"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:585-591 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:696-702 \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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0511f7727cc59ab348a2d4ceabd191b77c372120f654485f83704d9a9a14d290"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:294-316 | app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:322-340 | app/src/main/java/com/mica/music/ui/screens/SpatialAudioScreen.kt:102-120 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"454e834caf940395661d4f1351c6f7a3aeffdfc64f9ae87a18e794a8fbe62535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:280-303 | app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:1038-1060 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"212678f92a479350cc979f674922fc8a588fa3080caf25d057ccd735e4f14439"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:62-83 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:54-77 \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":"app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65ffb6e03f8147e42b0ea4e94dd7fce12d3e5c926f08eb6236f31675c1a62f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): app/src/main/java/com/mica/music/data/remote/smb/SmbNowPlayingMetadata.kt:38-55 | app/src/main/java/com/mica/music/data/remote/smb/SmbNowPlayingMetadata.kt:62-76 \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":"app/src/main/java/com/mica/music/data/remote/smb/SmbNowPlayingMetadata.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddfaaf776685774981bdc445b17df360ba41d6dc65b9cc5400eea5e29e9fac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:457-467 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:636-648 \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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70582a773415b3e75c77fbefb55b9c0d470c241e3a68f4b8f8fc2e0146ec60e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:347-366 | app/src/main/java/com/mica/music/ui/screens/EqualizerScreen.kt:195-217 \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":"app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac81b9e31cf9cbe4311c858ba1f75a8fc3b7963040c83fe6e22c1c9257364d1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): app/src/main/java/com/mica/music/data/preferences/UsbSharedReturnCapabilityStore.kt:53-63 | app/src/main/java/com/mica/music/media/usbhybrid/UsbStableIdentityDigest.kt:18-29 \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":"app/src/main/java/com/mica/music/data/preferences/UsbSharedReturnCapabilityStore.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6e5b770cb998c72221038febbcc91855a74fe0b5a77f2213012c7a93a1ab53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:914-934 | app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:978-1003 \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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"3279f3f0b5d7064363d1f56a27a0bc0f739e4403a447d1434a8138cc36a5f6af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): app/src/main/java/com/mica/music/data/library/DeviceShadowCanonicalProjector.kt:188-204 | app/src/main/java/com/mica/music/data/library/DeviceShadowCanonicalProjector.kt:211-226 \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":"app/src/main/java/com/mica/music/data/library/DeviceShadowCanonicalProjector.kt"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"180bdf0932907f8d0753d86e81962cd26cdb6641279b7734d74dc27da978cfa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): app/src/main/java/com/mica/music/data/remote/RemoteFileArtwork.kt:39-47 | app/src/main/java/com/mica/music/data/remote/RemoteFileArtwork.kt:60-70 \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":"app/src/main/java/com/mica/music/data/remote/RemoteFileArtwork.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"95df807d3e04344e67e6cccf6623492cfbb6036df324514aff1d39b7dad43d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:338-352 | app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt:262-275 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt:309-322 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93909c8c63003eefabbfd1a6e9d6b8084a8d562c75578fabb657b6e6d3b8b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:846-858 | app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:860-872 \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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f14e69205c786cb65e9e918d6992d35778574d096fcf669f54d89375e24557"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:285-301 | app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:366-379 \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":"app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f8456bbcd5e22b330a13af501fb71b1a9fbb33a96a1a7d14fac7561ef9c694"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt:194-213 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavLyricsTransport.kt:54-69 \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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa873e1394b02d6350735b6aee566653ae0462153cca6ffc058943254d6bd08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): app/src/main/java/com/mica/music/ui/components/SleepTimerSheet.kt:396-404 | app/src/main/java/com/mica/music/ui/zoom/PinchZoom.kt:643-654 \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":"app/src/main/java/com/mica/music/ui/components/SleepTimerSheet.kt"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ebf16c149bdc6d0e1714ddf4d7c3f7d5bc1b6ec427914c0d372e23e352906d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt:266-279 | app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt:284-296 | app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt:301-313 \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":"app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3404669a3926c59861bd5a928a6bb38dd1e10b46bf11461a5f52304e9162414"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): app/src/main/java/com/mica/music/ui/screens/VersionUpdateScreen.kt:166-184 | app/src/main/java/com/mica/music/ui/screens/settings/SettingsUsbHybridPanel.kt:407-426 \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":"app/src/main/java/com/mica/music/ui/screens/VersionUpdateScreen.kt"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c188e5d05561204baa24cdc6a548e713e1c83d9bb82bb506c9d33010745854d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:771-786 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:387-396 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:2084-2093 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be659b267a633c04cb35a699264346583254e2962fee4b20b14423e0e66236c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt:1101-1116 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt:1120-1131 \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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3dd5ba12583ad994a677abfff578f405eca537a4c490c04dcbcf29f82a7be8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt:34-47 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt:118-131 \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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba4d82ca540a0af502cad944639944f26eb8ae8b1d81d03503adfdeda74d298"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): app/src/main/java/com/mica/music/data/local/StorageDiagnostics.kt:318-329 | app/src/main/java/com/mica/music/data/local/StorageDiagnostics.kt:377-391 \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":"app/src/main/java/com/mica/music/data/local/StorageDiagnostics.kt"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"df10b09a6030826bb03709f60110e60f7410d2396ab05b29ae52cd7118b5099b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:874-883 | app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:129-139 | app/src/main/java/com/mica/music/data/scanner/ExternalLyricsReader.kt:233-242 \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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7252c62bd014ac69888fdb95877a05d4c562bf642fcc201e6483495f11608a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): app/src/main/java/com/mica/music/imaging/MicaImageLoaders.kt:151-165 | app/src/main/java/com/mica/music/imaging/MicaImageLoaders.kt:171-182 \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":"app/src/main/java/com/mica/music/imaging/MicaImageLoaders.kt"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7f97130375fb188da1e85acbbee14d6922e3110c01dbaba70887b88c23d8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt:372-382 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:586-596 \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":"app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4c7c2fd2276ea034415f8aa3759437fb7f8d459dd85fc54413f0a71558a706"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:1500-1509 | app/src/main/java/com/mica/music/data/local/StorageDiagnostics.kt:304-316 | app/src/main/java/com/mica/music/data/scanner/AlbumArtCache.kt:230-241 | app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridDiagnosticsReport.kt:113-124 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e24e418e5402d8d53424d1d790e05a361745124a68178cfc69060d2406be49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt:157-163 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt:165-171 \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":"app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3fcb376a682d20c93b5b569085ccb972cd389194fb363171962324b5b14e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): app/src/main/java/com/mica/music/ExternalAudioOpen.kt:89-98 | app/src/main/java/com/mica/music/data/SongIdentity.kt:19-29 | app/src/main/java/com/mica/music/media/SongMediaItemCodec.kt:155-164 \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":"app/src/main/java/com/mica/music/ExternalAudioOpen.kt"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a994d9892110a1dab404150ea3be344abcbeea263a5e6e28207a9a7997baacf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): app/src/main/java/com/mica/music/data/library/DeviceShadowObjectProbeExecutor.kt:455-471 | app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt:564-581 \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":"app/src/main/java/com/mica/music/data/library/DeviceShadowObjectProbeExecutor.kt"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba72dc09cd28b63d36c49f9939b83341199b98aed4b04419fc9c3867bf3312b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeProtocol.kt:49-61 | app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeProtocol.kt:73-81 \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":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeProtocol.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d5a304e775f78b8a8528345d9e0f356302f89dc2b2ba9ceabb8549f7959ca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): app/src/main/java/com/mica/music/media/MicaCompositePlayer.kt:144-152 | app/src/main/java/com/mica/music/media/MicaCompositePlayer.kt:159-168 \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":"app/src/main/java/com/mica/music/media/MicaCompositePlayer.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2de163af3c5336d5331a0444dd62b4426bf6f6280caa1def87ae483dea56a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt:201-208 | app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt:214-221 | app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt:226-233 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7461ff21e283b045f66701e3777630274fbe954dc4cd274f92c97a72414d6a45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 6\u002B corresponding lines): app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt:305-310 | app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:577-583 | app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:593-598 | app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:600-606 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:680-686 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:688-694 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:704-709 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d0807f25b20e6a1f0abdfb9fd85f550014ab2b95ededb7a12668cd42963134"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): app/src/main/java/com/mica/music/data/AppFontImporter.kt:96-104 | app/src/main/java/com/mica/music/data/AppFontImporter.kt:106-114 \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":"app/src/main/java/com/mica/music/data/AppFontImporter.kt"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eb797c2da2f378cbe0a478dc58a1f04de72d27ff369a4468921e8fdcd3c25e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): app/src/main/java/com/mica/music/data/scanner/LyricsEncoding.kt:45-57 | app/src/main/java/com/mica/music/data/scanner/LyricsEncoding.kt:61-73 \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":"app/src/main/java/com/mica/music/data/scanner/LyricsEncoding.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ed0525b27a8c4ffcd0f1691c37691ad9c69e8f731589b7db1af153c2c72e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:1186-1200 | app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:1209-1223 \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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2752f4e5291d0329930f1208b48a7f419bb020002daf6a318d70d34d030f7438"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt:233-242 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:85-94 \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":"app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d83bb916a28b455d38f617b214d3cab04b47264b070de45fc9b3f245a221a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): app/src/main/java/com/mica/music/media/PlaybackArchitecture.kt:130-144 | app/src/main/java/com/mica/music/media/PlaybackArchitecture.kt:146-160 \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":"app/src/main/java/com/mica/music/media/PlaybackArchitecture.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f2ec5a0ade8852655a854de18a260245dfa18cdbd47b75a554925c5256001d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): app/src/main/java/com/mica/music/data/scanner/AlbumArtCache.kt:243-250 | app/src/main/java/com/mica/music/data/scanner/AlbumArtCache.kt:252-258 \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":"app/src/main/java/com/mica/music/data/scanner/AlbumArtCache.kt"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c547d39e565898a22ba64830ee9b11e605c05737b491aa69e80bec1657104b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:746-758 | app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:788-797 \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":"app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b296376ef32d948d07d2ce600d9747d0a7dd9e3392969e84cc353aaf53257ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): app/src/main/java/com/mica/music/data/library/LibraryCatalogPublisher.kt:107-113 | app/src/main/java/com/mica/music/data/library/LibraryCatalogPublisher.kt:116-125 \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":"app/src/main/java/com/mica/music/data/library/LibraryCatalogPublisher.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de396a98cb2a7f5657782a792a0e35e3905dbd70a5d4c86cb124cc13de0d031"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): app/src/main/java/com/mica/music/data/preferences/AudioOffloadPreferences.kt:76-85 | app/src/main/java/com/mica/music/data/preferences/PlaybackUiPreferences.kt:233-240 | app/src/main/java/com/mica/music/data/preferences/UsbHybridPreferences.kt:76-83 \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":"app/src/main/java/com/mica/music/data/preferences/AudioOffloadPreferences.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c4eac3140d85c627636012d7e6f8820b8fb25920c14e5c9695115e0d105f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): app/src/main/java/com/mica/music/data/library/LibraryCatalogPublisher.kt:138-155 | app/src/main/java/com/mica/music/data/library/LibraryCatalogPublisher.kt:157-170 \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":"app/src/main/java/com/mica/music/data/library/LibraryCatalogPublisher.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"329cc6731bb91dff4a0665c6027cb3818b774beb271c35c20296b63e47db0f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02AudioOutputProvider.kt:564-577 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1133-1144 \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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02AudioOutputProvider.kt"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9bd813b635b0483d61a1ff86608e25710675bd86c5bf6bfaf03e8614d04f00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): app/src/main/java/com/mica/music/ui/components/EqualizerBandBar.kt:151-159 | app/src/main/java/com/mica/music/ui/components/EqualizerCurveEditor.kt:283-291 \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":"app/src/main/java/com/mica/music/ui/components/EqualizerBandBar.kt"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"175197687241f7e4e4f400b510bccfa0b34ba94f767b08c20dc6829dd2930ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:611-624 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:2052-2065 \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":"app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caa6f4de92fb4dfec666db44b30ad6bacb605586d253aecbf28dfad47cb926f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): app/src/main/java/com/mica/music/data/local/LibraryRepository.kt:57-66 | app/src/main/java/com/mica/music/ui/components/LyricsHydration.kt:120-127 \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":"app/src/main/java/com/mica/music/data/local/LibraryRepository.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"39089c9e3b98543a01440edd79aa7ae6281f203536f428073649c94c802e6c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:1061-1078 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:560-573 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"06033b31298b286d4c45c7764f9db47c576e276a0270a2555ede832a1b200ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): app/src/main/java/com/mica/music/data/LibraryStore.kt:236-251 | app/src/main/java/com/mica/music/data/RoomLibraryStore.kt:253-264 \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":"app/src/main/java/com/mica/music/data/LibraryStore.kt"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86d3dd09c2866336ae20a3f9965b48a837ad94cdb71de305b95fb02dbeb344d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt:1646-1653 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:1786-1793 \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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"928b1f4fcdfb31a0569300392b463d9a6ef9a5920af19c24567911ee5e0a3bfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): app/src/main/java/com/mica/music/data/library/LibraryAutoSyncExecutor.kt:165-174 | app/src/main/java/com/mica/music/data/library/LibraryOperationExecutor.kt:132-141 \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":"app/src/main/java/com/mica/music/data/library/LibraryAutoSyncExecutor.kt"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e79088fbd6074b346e438a682b1a71adb06a067c97df994ec1fc53f31818fb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt:42-51 | app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt:28-38 \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":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a934cc1783f9f629c304fd84140311023b9ebb6408aafacf68372e5241a60d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): app/src/main/java/com/mica/music/data/remote/RemoteLyricsRevision.kt:54-56 | app/src/main/java/com/mica/music/data/remote/RevisionedDiskCache.kt:73-75 \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":"app/src/main/java/com/mica/music/data/remote/RemoteLyricsRevision.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c6113d873e734fbd5eb5770e3e3718ab52bdde4fca9d004a4855aae1a6adaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:745-748 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:1466-1469 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afb9b883f1b8b26d0fff230229036adcabd517470105d42df084d742b7b04e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt:126-133 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:875-883 \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":"app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c24a3ee249c6206c415f1d20441ab91b370b831a16360fdc8ae6be9fb115a3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (103 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt:618-720 | app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt:78-180 \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 \u0060app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt:618\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":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7947913e43dad74ba81d827b230075cfb6816b162e75aae872e80cb9bf96e6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (73 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1547-1619 | app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1906-1978 \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 \u0060app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1547\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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28c5dcbafac01490787fe767c51b07132d0b1e50fd19c54fedddd913cc6f9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1487-1535 | app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1830-1878 \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 \u0060app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1487\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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75c7efb217b1002ab96f71b07e3319d02d40a094d89a9e8448dc05bc01d1990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt:88-124 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt:171-207 \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 \u0060app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt:88\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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5a306395e58390faf9956000fd90b45ad47d8122a7ce4141175a6bcd004aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201336 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt:465-497 | app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt:523-558 \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 \u0060app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt:465\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":"app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb58038c5b082e0cb8dd5d0d382f3152c7fe24000fed682bcc047b1b5b1b570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201336 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:265-300 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:378-410 \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 \u0060app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:265\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ef078ae297ff6f3f50fd46f16e8088db6daec375ca408de3518823265e366e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/home/HomeScreen.kt:1214-1248 | app/src/main/java/com/mica/music/ui/screens/home/HomeScreen.kt:1268-1302 \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":"app/src/main/java/com/mica/music/ui/screens/home/HomeScreen.kt"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a64e020c1202f4c171e629af12dc2d74d9357c5ac0862f0830bb47dc7287d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:526-557 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:733-764 \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 \u0060app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:526\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":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52bac3796fb3869fc242cc6fd6f2e42847be4b2db5bdca8d6d77c3881381494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201328 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:158-185 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:864-884 \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 \u0060app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:158\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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b214dbe6b513fb74b0e2b3b1d8a1a73a511c3b4b9e9c40eca75e57f4b5aed743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/SafShadowRelationRematcher.kt:221-245 | app/src/main/java/com/mica/music/data/library/SafShadowRelationRematcher.kt:267-291 \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 \u0060app/src/main/java/com/mica/music/data/library/SafShadowRelationRematcher.kt:221\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":"app/src/main/java/com/mica/music/data/library/SafShadowRelationRematcher.kt"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"00eb00c40cee70d8c1dfc7fd9eabe71f6a5948bf777f7a3b74d89ac97afcfba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:130-154 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:179-203 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 182 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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:130\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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"00921bad66302f640d390559ec580984518d3f2d2321ebf3b538abf79ec266b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1621-1645 | app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1741-1765 \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 \u0060app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1621\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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fd14679ca920e7ffcb9e0eb44fc8dac9321b89bd2da7f71416ff5454d84d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPublicationPlanner.kt:70-93 | app/src/main/java/com/mica/music/data/library/SafAutoSyncPublicationPlanner.kt:112-134 \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":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPublicationPlanner.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcde157d3271bd1f643d73df7178da2d178b6398340fd59f97ecf28c239401c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:447-467 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:552-574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:447\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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"73327c9d3f96ee0a56f7775e1035a04b552f2da6824ae73948fa683725e11b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): app/src/main/java/com/mica/music/data/local/SongEntity.kt:190-212 | app/src/main/java/com/mica/music/data/local/SongEntity.kt:241-263 \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":"app/src/main/java/com/mica/music/data/local/SongEntity.kt"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3bffdca8cb89e712fc0481d69a6237516a6a894cbe13674dd06739cdb3f6e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:418-440 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:491-513 \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 \u0060app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:418\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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8ddd0d2acd1025f84e8e7716f22b27532650e4f61f64b4d895d017b9ba9b4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:239-261 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:355-377 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:239\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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f422982ac44c16df1ad1a00d52d7ed4ce11e93bebf983dd063b1edc980b3c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): app/src/main/java/com/mica/music/data/local/RemoteTrackEntity.kt:53-74 | app/src/main/java/com/mica/music/data/local/RemoteTrackEntity.kt:80-101 \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":"app/src/main/java/com/mica/music/data/local/RemoteTrackEntity.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"026e7bd8a22bd4d1b0533fcf26a5f91db99077c270cb49946ca341fc4b122aee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/MiniPlayerSpectrumBars.kt:128-149 | app/src/main/java/com/mica/music/ui/components/MiniPlayerSpectrumBars.kt:159-180 \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 \u0060app/src/main/java/com/mica/music/ui/components/MiniPlayerSpectrumBars.kt:128\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":"app/src/main/java/com/mica/music/ui/components/MiniPlayerSpectrumBars.kt"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2281f0676a2d98126e394e653bb81b8e68c4039fe8fc721f43b651dd59794d6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:182-201 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:233-253 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 182 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. 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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7200bf463e4f0b88b536df2e238dec287da17828224c12e9264046127739661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): app/src/main/java/com/mica/music/media/ServicePlaybackEngineCoordinator.kt:239-259 | app/src/main/java/com/mica/music/media/ServicePlaybackEngineCoordinator.kt:309-329 \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 \u0060app/src/main/java/com/mica/music/media/ServicePlaybackEngineCoordinator.kt:239\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":"app/src/main/java/com/mica/music/media/ServicePlaybackEngineCoordinator.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd51690fcbd8de8444f50a0982c17a18891c1dcd3dd49acf0994520910bb043"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201321 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:62-82 | app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:117-130 \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":"app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d181c54e742e62cab6323794598f70dd9fe49c4cf92b7f31914e410da00dc21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:495-515 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1625-1645 \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 \u0060app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:495\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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3d7dd93244956b0b110cf85b908ed7b35f130ac7defee60eddc4fb6696d7cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt:768-788 | app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt:795-815 \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 \u0060app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt:768\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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"d292476e8cd5ed3b04ce9f8b4ea52afe79d675b1758fa74e38f000c34c188445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:304-323 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:377-392 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 182 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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:304\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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"7065d3a5dd8900cfd6f8e00c4578695d7c5f6b130ce2f0dd9add7be1057640cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:160-179 | app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:206-225 \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 \u0060app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:160\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, \u0060app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:204\u0060 calls \u0060mutableStateOf\u0060, \u0060toString\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:159\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":"app/src/main/java/com/mica/music/ui/components/SettingsRows.kt"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13c6f95ccea34052a939fa2cab8dd3221c8868841ba2f9b295dafa437d66eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt:399-417 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:207-225 | app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:420-438 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:298-316 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \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 4 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c0061cdfaaa47235804010d3ebc0d490bce375179ef6f113304bb6ee9a3116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/SafShadowRelationRematcher.kt:298-315 | app/src/main/java/com/mica/music/data/library/SafShadowRelationRematcher.kt:322-340 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/library/SafShadowRelationRematcher.kt"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfa9ca11643faf641d314db6d8a3fc40d23ca0853adcfefb785c8040f913d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt:49-67 | app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeHttpExecutor.kt:52-70 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeHttpExecutor.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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 \u0060app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt:49\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 \u0060request\u0060 to \u0060RemoteHttpArtworkRequest\u0060 in one and \u0060NavidromeRequest): String = withContext(Dispatchers.IO\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":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba26acee95bc4a43da7b1d4910bdef49460de3f5f41336556f8d9cd1801c8792"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:78-96 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:125-143 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 182 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 after the matched lines, \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:145\u0060 calls \u0060sorted\u0060, \u0060chunked\u0060, \u0060idSelection\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:98\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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eeeb734d5878c587e61bf3c40cd04a780879e212934230c2f41db5cbd16afd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:102-128 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:153-178 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 182 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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:102\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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7e3147229ccf98815ef6e2fb289150e6fbcf46f5dd13b5b392ea11ac354989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:209-232 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:263-286 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 182 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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:209\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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9623bfe66f888fdf8e623c7a802c9d71d2da85837443ebaf7e588efbf2f1f6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt:41-59 | app/src/main/java/com/mica/music/ui/components/SongSortSheet.kt:44-62 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/SongSortSheet.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 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 \u0060app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt:41\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":"app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"524fa48cc75d3046a2fd72e66958fc7e5d69b80899cc645ab474d077381c34bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:252-270 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1438-1456 \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 \u0060app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:252\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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21c099407c8b47e4c8911303fabc9551264b30af6d47d8456087a1a5faf8853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1673-1691 | app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1790-1806 \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 \u0060app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1673\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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8e2e8ae2f820cc9d715cd575f49107e7cd68dfa908b78657627ab91b4c149e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): app/src/main/java/com/mica/music/data/local/SongEntity.kt:168-185 | app/src/main/java/com/mica/music/data/local/SongEntity.kt:220-237 | app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt:59-76 \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 \u0060app/src/main/java/com/mica/music/data/local/SongEntity.kt:168\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":"app/src/main/java/com/mica/music/data/local/SongEntity.kt"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6230e01d81dd7b93fbd5859b4ba4b8c6df17f5e672bd9bb805f5f58e42fc2e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:371-387 | app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt:320-336 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt:349-366 \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 \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:371\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 before the matched lines, \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt:319\u0060 calls \u0060ensureCurrent\u0060 and \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:370\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":"app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6646936c78b5d09aca78e1883a5e3b5ecd165453588454dcc224c81da2a666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:287-304 | app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:308-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 \u0060app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:287\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":"app/src/main/java/com/mica/music/ui/components/SettingsRows.kt"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"7699a703fee52b020cfb254666a9682cf6114b56df3277f90118375bc3e7aadd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt:230-247 | app/src/main/java/com/mica/music/ui/screens/SongDetailScreen.kt:151-168 \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 \u0060app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt:230\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":"app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0258723bd6f3ab5f576375f87fde31e7954b2161ec087abf571d1689a424f5ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt:271-288 | app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt:292-309 \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 \u0060app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt:271\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":"app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a63d0b9575015e42bbfceef52a4a8050f058d79c104716d58e0d18576c1ead6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/CustomWallpaperStackBlur.kt:108-125 | app/src/main/java/com/mica/music/ui/theme/CustomWallpaperStackBlur.kt:194-211 \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":"app/src/main/java/com/mica/music/ui/theme/CustomWallpaperStackBlur.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf69cf884265ef1ec19b5010f5c88929d04382cc1a364942d820429c0c9f99bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/NowPlayingBackground.kt:106-123 | app/src/main/java/com/mica/music/ui/theme/NowPlayingBackground.kt:142-159 \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 \u0060app/src/main/java/com/mica/music/ui/theme/NowPlayingBackground.kt:106\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":"app/src/main/java/com/mica/music/ui/theme/NowPlayingBackground.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e583065aa4bc334ce2e5192553c4f4ccc5c3a10d4109ff8c5587ff4d19042fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 4): app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:20-35 | app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:37-49 | app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:82-97 | app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:102-118 \u2014 all 4 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:100\u0060 calls \u0060QualityBadgeVector\u0060, \u0060Path\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:37\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":"app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea9866cd107ba96106465d77245a40bba1b0ec9d2cc8a8203d9e8ac9876b086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): app/src/main/java/com/mica/music/data/local/SongEntity.kt:187-203 | app/src/main/java/com/mica/music/data/local/SongEntity.kt:238-254 | app/src/main/java/com/mica/music/data/local/SongEntity.kt:312-328 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/SongEntity.kt"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0b6ef437977fc7d02448748fcb28444f371a438939d752276e9008820e8676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt:246-262 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:98-114 | app/src/main/java/com/mica/music/data/scanner/Id3FrameLister.kt:37-53 \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 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef22cd7f90051869ded694076eaf3220429352a91af0df039568d713c97a3c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/DirectionalTrackWipe.kt:108-124 | app/src/main/java/com/mica/music/ui/components/DirectionalTrackWipe.kt:187-203 \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 \u0060app/src/main/java/com/mica/music/ui/components/DirectionalTrackWipe.kt:108\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":"app/src/main/java/com/mica/music/ui/components/DirectionalTrackWipe.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d4d65b850a6bd302e94bed59cbfa429608c4adc152d18669dd17d574e5d2d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt:549-565 | app/src/main/java/com/mica/music/ui/components/NarrowBarSoftKaraokeLyric.kt:152-168 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt:549\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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b1dafbea5c6ebc7326737007f1603594fee4ae174c1aa836e4d249c1b0134b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:816-832 | app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:871-887 \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 \u0060app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:816\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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed5b58081a0e27b182c3eb81017c63af23567cab809dfb507685c019413c7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:292-307 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:751-765 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:1512-1526 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:1576-1590 \u2014 all 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a042804dac3ce06810a96d9d0b20d1dc903d35e392ada7e4cbcf2ef197c678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt:38-53 | app/src/main/java/com/mica/music/ui/components/FolderBrowseModeSheet.kt:28-43 | app/src/main/java/com/mica/music/ui/components/SongSortSheet.kt:41-56 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/SongSortSheet.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 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 \u0060app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt:38\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, \u0060app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt:54\u0060 calls \u0060verticalScroll\u0060, \u0060rememberScrollState\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/FolderBrowseModeSheet.kt:44\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":"app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffcc2e62a2d64ea8eaefdc45d0088680580516287f450a11a7c45ec53b1193f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:61-76 | app/src/main/java/com/mica/music/ui/screens/SpatialAudioScreen.kt:41-56 | app/src/main/java/com/mica/music/ui/screens/VersionUpdateScreen.kt:65-80 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/SpatialAudioScreen.kt\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. 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 \u0060app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:61\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, \u0060app/src/main/java/com/mica/music/ui/screens/SpatialAudioScreen.kt:39\u0060 calls \u0060collectAsStateWithLifecycle\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:60\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":"app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a121591f61abaf2b2ceec986a492225acb876673fa1e2a5fee39af5ca63f5ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt:473-488 | app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt:527-542 \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":"app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2c0de947f3e88b22362c326ad0c218e21eefc69e0c20bb272ae33f9a150ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt:75-90 | app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt:106-121 \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 \u0060app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt:75\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 \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":"app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6e6f2a393f5605853f7fd7f4a7bf35934833e67a312376ab693baebf652159"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:237-252 | app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:313-328 \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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"374347da998e1ba2d6d355b85ab4646ad5c0a0f3bc3b70679aacdf553d9056f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt:63-78 | app/src/main/java/com/mica/music/ui/components/HiFiSeekBar.kt:50-65 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/HiFiSeekBar.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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 \u0060app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt:63\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":"app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e4c2c8080a32ad04b25861ffb7e74697c890b97c57bc628a155c989631e8f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt:111-126 | app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverRenderers.kt:456-471 \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 \u0060app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt:111\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":"app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2985ea89691cdb09e581f077a0524b10c4d94e234198bfd14da3d0f79201dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/MetadataDebugScreen.kt:173-188 | app/src/main/java/com/mica/music/ui/screens/SongDetailScreen.kt:74-89 \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 \u0060app/src/main/java/com/mica/music/ui/screens/MetadataDebugScreen.kt:173\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 before the matched lines, \u0060app/src/main/java/com/mica/music/ui/screens/SongDetailScreen.kt:73\u0060 calls \u0060micaAppBackground\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/MetadataDebugScreen.kt:172\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":"app/src/main/java/com/mica/music/ui/screens/MetadataDebugScreen.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"98376f4a84d556ef30ae1257b7d0f602f899d8572f041a2f41a5c36b54eeffc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanel.kt:137-152 | app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanel.kt:284-299 \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 \u0060app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanel.kt:137\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":"app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanel.kt"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e960116daa1c99168edd4fc0e0f26c956832ebdd3284b2fc98104bfe365fb296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt:669-684 | app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt:692-707 \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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4d9107686045f628019bb5113df7bd6f7c7d66403092dc752e2e36a59a30b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:273-288 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:204-219 \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 \u0060app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a72c3acabf72565ea0a0cc2784a3f0042e41fcaa573302f967a60fd565d0451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt:669-682 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt:774-788 \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 \u0060app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt:669\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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"d510005ed68ef80c888e4100b3e639d47fb19fb86da96a5345cbbbce752305f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt:563-576 | app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt: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 \u0060app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt:653\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":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b0dd42eb7f2001f49ff6c3b2d7a963957aca29cb2816aba4514c5a2d2a90c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:259-273 | app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:515-529 \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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c9773b5a12c8c897ed567618b387c39deffef38ab20299225f99cc60907f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt:273-287 | app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:111-125 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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":"app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c8e9e79f2fef51db1cbeaea6e2a1a8cd7c6e8a4ea7e52199918744eb2df5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:31-44 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt:25-39 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:31\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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6baab5747eaaff49fbd5dd9b80ef3f8730974458c72e1b5638df3b79b3708f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridSessionOwner.kt:167-181 | app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridSessionOwner.kt:529-542 \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 \u0060app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridSessionOwner.kt:167\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":"app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridSessionOwner.kt"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1b78b786759acb3972f82b43eba48806030dc44e8e1aef2a750578d1699bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt:268-282 | app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt:330-344 \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 \u0060app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt:268\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":"app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65ce7cc86739318facb96fc6ed4b7ac0ce852c896d7cc387b5f89fd9c002cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt:293-306 | app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt:355-369 \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 \u0060app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt:293\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":"app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d970e853d4c03eea396f9caa6347bdc6cf194cc3e5b5bd9096a5b58dbd1f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:65-78 | app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:358-372 \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 \u0060app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:358\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 before the matched lines, \u0060app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:64\u0060 calls \u0060Column\u0060, \u0060weight\u0060, \u0060Text\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:358\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":"app/src/main/java/com/mica/music/ui/components/SettingsRows.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1033a355445655866066b2075de391cf8f29ca15c155a465096ef45fbf81a5c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:648-658 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1768-1782 \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 \u0060app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:648\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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb32dbf1fdf36b31b1926ae50905c978e36fea57a6139ac21b6b1e86b86f1545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt:232-246 | app/src/main/java/com/mica/music/ui/screens/NowPlayingLyricsExpanded.kt:769-783 \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 \u0060app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt:232\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":"app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e40248e5ee4dd658684492b63ae95406aa533a7f4e347842a38cf8f8770a7a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1458-1472 | app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1718-1730 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c57c0ba4ca1e01e050d52220b309276a623bc2fa67fe10257b03291ba15ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt:98-112 | app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt:121-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 \u0060app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt:98\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":"app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa682568e0a9aaf3a32ffb1b9df31be0bc0558372b516fde237aab4d893c3633"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:191-204 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:281-295 \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 \u0060app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:191\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":"app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d448f8ff7c4843896068684059d410e3c6f59556f13718615a8fc6681a7f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:659-673 | app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:695-709 \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 \u0060app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:659\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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"490d8ea90336694cb05b5c231912c3ca944d27308e6472eed1de754e031d6470"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/AutoSyncPublicationAuthority.kt:34-47 | app/src/main/java/com/mica/music/data/library/AutoSyncPublicationAuthority.kt:98-111 \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, \u0060app/src/main/java/com/mica/music/data/library/AutoSyncPublicationAuthority.kt:48\u0060 calls \u0060isNotEmpty\u0060 and \u0060app/src/main/java/com/mica/music/data/library/AutoSyncPublicationAuthority.kt:112\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":"app/src/main/java/com/mica/music/data/library/AutoSyncPublicationAuthority.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f8f71cdcaa34273f45d909e6d8c66a258c4ac1633cbbc40fc35d670ff9cd2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt:432-445 | app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt:504-517 \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 \u0060app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt:432\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":"app/src/main/java/com/mica/music/data/library/SafShadowObjectProbeExecutor.kt"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38b936977bb41da14d80b710d864e2a3b052f4bc53962c1d42cc9d834c3d7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:238-251 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:333-346 \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. 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":"app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e82e60278a6e9c4970b9a86accd327dcd0ee0f3f4212ed228dd8644b499333a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:380-393 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1190-1203 \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 \u0060app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:380\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":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b83727396feaab3e348ab012e33f08f177ac1cbec1f7808d90d0446b92f64d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:623-636 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:978-991 \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 \u0060app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:623\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":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5383c652cacbe7fda6d6d9efcb386c5be347cf0c392beaac9637540b36b2a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1960-1972 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1984-1997 \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 \u0060app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1960\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":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"b583c1aad23964afca159e7ebd596ab1ba89c5a601f1844240569e0e308273aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt:361-374 | app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt:441-454 \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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"667b10ad2cdb2b05d7ed97bd04437311677b79893c86b7b6d89c6102d6e5246c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanelMetadata.kt:173-186 | app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanelMetadata.kt:189-202 \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 \u0060app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanelMetadata.kt:173\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":"app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanelMetadata.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ce6d6881b4c9f0f17ccf32d65527e35f1f3c5fdf1c2c56d29980254a43020a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:750-762 | app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:699-712 \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 \u0060app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:750\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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"8815112321f5f86ac45890ac1476fe7ac7849a65093bf6c6f168097c48eaab77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:787-800 | app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:835-848 \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 \u0060app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:787\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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff83facd09d76c6b332a09e324de5556b38c749adf1a08827bb94e5825d0203b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt:65-77 | app/src/main/java/com/mica/music/data/AppLetterSealImporter.kt:82-94 | app/src/main/java/com/mica/music/data/AppWallpaperImporter.kt:46-58 | app/src/main/java/com/mica/music/data/PlaylistCoverImporter.kt:57-68 \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. 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":"app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"380586ad91a386b2d9bb20bc463d63a9014b7ef3c66138eb4d943589d2fd3fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1555-1567 | app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1633-1645 | app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1753-1765 | app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1914-1926 \u2014 all 4 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 \u0060app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1555\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, \u0060app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1768\u0060 calls \u0060openSongActionMenu\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1568\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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"9754131a7a0c654aaf27b6f8ba2382c533b4430685d2f6151f94fa2c7c86bf1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt:126-138 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt:195-207 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavLyricsTransport.kt:55-67 \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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab464191cfee1ba8419a0d1fef2a855544118cff83fd518faa2cc65055927935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt:362-374 | app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt:420-432 | app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt:442-454 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b38805e4aa15440fb873cb0e34c305543c77743c24b859d8bfce88d2a6909ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt:352-364 | app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:177-189 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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":"app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"97791265cb2de9ce2292324b0f20924986f89c9e8346e914b2b81be514ecd4c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt:464-476 | app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt:858-870 \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":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f799bc06e2094556be070d67d6c9f2f7e5370d0a407461a6218324f416a303"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:52-64 | app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt:385-397 \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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:52\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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"47131a1499358e8aac6e6ca2417fbb4610b984adb9f86f906ae03b1452cfb8c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt:83-95 | app/src/main/java/com/mica/music/ui/components/SongSortSheet.kt:69-81 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/SongSortSheet.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 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 \u0060app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt:83\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":"app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b616ab2f7082a3d2b27dffbc1b187575b59a68ee6d8d34ac384f1586b88b56f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt:49-61 | app/src/main/java/com/mica/music/ui/components/HiFiSeekBar.kt:36-48 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/HiFiSeekBar.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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 \u0060app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt:49\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":"app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3585e224ba2c5d8c817b4fceac3e40c83b81faef5fcfde8390feb00e0dd5d0af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:537-549 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1666-1678 \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 \u0060app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:537\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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2dd6077dfa880c521ac01df08d625a1e478c53dcc303174f25d594c961352d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt:337-349 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:170-182 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedd17475257e105d0db46745de9b0d5d1d2abfa9ca7e24edc3dbdd6ef072176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/CustomWallpaperStackBlur.kt:88-100 | app/src/main/java/com/mica/music/ui/theme/CustomWallpaperStackBlur.kt:174-185 \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 \u0060app/src/main/java/com/mica/music/ui/theme/CustomWallpaperStackBlur.kt:88\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":"app/src/main/java/com/mica/music/ui/theme/CustomWallpaperStackBlur.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"21efa169f83ab6c3b8e9afed8b29f8acea23c9dc4f3a273320e5dc7e5837f467"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:797-808 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:926-937 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1008-1019 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1091-1102 \u2014 all 4 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 \u0060app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:797\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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"410009b1062968901e360915a38bbc69da85e7630acaa0b7f77cb3a5a5ddf1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): app/src/main/java/com/mica/music/ui/screens/HorizontalClassicLyricsPage.kt:55-66 | app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1274-1285 | app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:2202-2213 \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":"app/src/main/java/com/mica/music/ui/screens/HorizontalClassicLyricsPage.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"861b80e9660a2896616e7a6f9c53fab8ca3baca2d15786e50bd4f5994426bb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt:900-911 | app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt:1014-1025 \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":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1aeebe5b597e3be425b22cc33b4056ed6652b1cac8d0bfa9f4b4eea4ec8c60a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt:41-54 | app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt:69-82 \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 \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt:41\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":"app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6648540089737bdf96d44514acf1d907e9643380a05459ba8cf77c1d1ad446e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:211-222 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:315-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 \u0060app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:211\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 before the matched lines, \u0060app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:210\u0060 calls \u0060intOrZero\u0060, \u0060coerceAtLeast\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:314\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":"app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d7a3bf1e7e06aec7153d6a26ea30b441594049b91f9f8aa5e0dcbfffdbca6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:626-639 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:665-678 \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. 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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb9b92d74715a01067034ecd9e2d0f5a772b35e800a0f0207fa81ffa2d5297d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:58-69 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:104-115 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 182 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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:58\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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f93d084e46a251b1336f7c13e8a89d0ae7a6fe053ab62b14363cb3fd7ded2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/PlayerPlaybackChrome.kt:235-246 | app/src/main/java/com/mica/music/ui/components/PlayerPlaybackChrome.kt:371-382 \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 \u0060app/src/main/java/com/mica/music/ui/components/PlayerPlaybackChrome.kt:235\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":"app/src/main/java/com/mica/music/ui/components/PlayerPlaybackChrome.kt"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e425534ffaf6e7a6a2350efa4d1cbc84e09a967c004981228fbfa6a69ac324f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:205-215 | app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:270-281 \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 \u0060app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:205\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, \u0060app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:268\u0060 calls \u0060mutableStateOf\u0060, \u0060toString\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/SettingsRows.kt:204\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":"app/src/main/java/com/mica/music/ui/components/SettingsRows.kt"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5f4fb9a4dc404ee885e539684bed45a9800e18dd0349f2ed11ace8c67b8961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt:333-344 | app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt:352-363 \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 \u0060app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt:333\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":"app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e621996e43f6b600cfe2af84993ec42299b69b843af2ba98678f77adc9491ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:299-310 | app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:327-338 \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 \u0060app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:299\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":"app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"849f6cdffc7d0e6d9587a30be95d0ad4ee03e1f7c9bf9d3aed718f9d28e33796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/PlayerPageState.kt:125-136 | app/src/main/java/com/mica/music/ui/screens/player/PlayerPageState.kt:138-149 \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 \u0060app/src/main/java/com/mica/music/ui/screens/player/PlayerPageState.kt:125\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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageState.kt"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a37a5f1e708b5d1c56cc0bc2dfb6d8f51f3f01924ac8d810ea4b4d617ad246c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:788-799 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:1421-1432 \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 \u0060app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:788\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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"b391c5a94b1340d6da0201e0bd7f4f021c5b92cb017011ca2cbadb4766364fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/settings/ArtistSplitSettingsDialog.kt:49-60 | app/src/main/java/com/mica/music/ui/screens/settings/SettingsExcludedDirectoriesDialog.kt:51-62 \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 \u0060app/src/main/java/com/mica/music/ui/screens/settings/ArtistSplitSettingsDialog.kt:49\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":"app/src/main/java/com/mica/music/ui/screens/settings/ArtistSplitSettingsDialog.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b219497fdf15039819e6f4988c3236544aed58d3a73e9c73273036fdfb04f63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:372-382 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:2068-2079 \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":"app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"236a5092ff304027a14b336814727d7d887ad90f8fe050b86d4a89eef1e055fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:548-559 | app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:637-648 \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 \u0060app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt:548\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":"app/src/main/java/com/mica/music/widget/MicaPlaybackWidget.kt"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"3add4eafdb9f7ff0a85a23666f334b1167261a796f3a9e465d5cf17ac1e278b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:70-80 | app/src/main/java/com/mica/music/ui/screens/EqualizerScreen.kt:174-184 | app/src/main/java/com/mica/music/ui/screens/SoundFxScreen.kt:248-258 | app/src/main/java/com/mica/music/ui/screens/SpatialAudioScreen.kt:50-60 | app/src/main/java/com/mica/music/ui/screens/VersionUpdateScreen.kt:74-84 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/SpatialAudioScreen.kt\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. 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 \u0060app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:70\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 before the matched lines, \u0060app/src/main/java/com/mica/music/ui/screens/EqualizerScreen.kt:173\u0060 calls \u0060fillMaxWidth\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:69\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":"app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c88c4df0535a5450dbd2cb0f26d1c273489f143ba03987c369b7cb3ad0466d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:28-38 | app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:42-52 | app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:63-73 | app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:111-121 \u2014 all 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc06b5b531ea704569061824e858b4dfe6b2d8ef7bf929880b80fe4bc72345de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:339-349 | app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt:263-273 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt:310-320 \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 \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:339\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":"app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14663392fa4cf298cb810b468dd7adf788f1aa713653ac8207327aa1a628cc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt:389-399 | app/src/main/java/com/mica/music/ui/components/NarrowBarSoftKaraokeLyric.kt:227-237 | app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt:884-894 \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 \u0060app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt:389\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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f27a1fc3e0c4a83bd996a3a32f48bb4ebb255fbabfa3dff4af951a0fc714cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:795-805 | app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowReflectionBake.kt:183-193 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:1428-1438 \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 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:795\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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b73b7b68aa03c535beac52fc7ed85c093e6d12aa849cb10e12d96ae4c66c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/src/main/java/com/mica/music/audio/eq/EqHeadroomPlanner.kt:132-142 | app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:577-587 \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":"app/src/main/java/com/mica/music/audio/eq/EqHeadroomPlanner.kt"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c31d5230272e20b1fd830eea6b20427604fe9abe8afff8ed3e5753a81c88d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/DeviceAutoProbePlanner.kt:241-251 | app/src/main/java/com/mica/music/data/library/DeviceAutoProbePlanner.kt:253-263 \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 \u0060app/src/main/java/com/mica/music/data/library/DeviceAutoProbePlanner.kt:241\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":"app/src/main/java/com/mica/music/data/library/DeviceAutoProbePlanner.kt"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80643bb65c32ab11a4bbb2b51cc71a0c8c4b54496543b7642f01815169cdd45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt:169-179 | app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt:408-418 \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 \u0060app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt:169\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":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b8d3dc4985254f5777f9ed9a73b5de59c86fb53b41bac486274ed048b0d3cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/smb/SmbBrowser.kt:168-177 | app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:259-269 \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 \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:259\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. 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbBrowser.kt"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29a2ead036d545758ba9d46c130e082948484fec503cbbe012bea367f1eaa3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/PlayerPlaybackChrome.kt:239-248 | app/src/main/java/com/mica/music/ui/components/PlayerPlaybackChrome.kt:296-306 \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 \u0060app/src/main/java/com/mica/music/ui/components/PlayerPlaybackChrome.kt:239\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":"app/src/main/java/com/mica/music/ui/components/PlayerPlaybackChrome.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa9653012fb9565652a3bd0b5a2ba4721cdc7991cde574e89a333bfe6c19f94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/home/HomeTopBar.kt:152-162 | app/src/main/java/com/mica/music/ui/screens/settings/SettingsScreen.kt:248-258 \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":"app/src/main/java/com/mica/music/ui/screens/home/HomeTopBar.kt"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9522ba5b82d8c7bbf080e8b1dfe49b696d51a898e6fb467b2dd07f0bc8b681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt:266-276 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:135-143 \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 \u0060app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt:266\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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9192007cf36187ce7b1a3b89cd8bfc9c606190c145d8a08353f9cb566b29b1a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/AnimatedTheme.kt:427-437 | app/src/main/java/com/mica/music/ui/theme/AnimatedTheme.kt:458-468 \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":"app/src/main/java/com/mica/music/ui/theme/AnimatedTheme.kt"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"69382d76dca45c12fea6ef1eb4493b2d10f7b08c8a243cdb0f802320d6a47bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:71-80 | app/src/main/java/com/mica/music/ui/screens/EqualizerScreen.kt:175-184 | app/src/main/java/com/mica/music/ui/screens/MetadataDebugScreen.kt:179-188 | app/src/main/java/com/mica/music/ui/screens/SongDetailScreen.kt:80-89 | app/src/main/java/com/mica/music/ui/screens/SoundFxScreen.kt:249-258 | app/src/main/java/com/mica/music/ui/screens/SpatialAudioScreen.kt:51-60 | app/src/main/java/com/mica/music/ui/screens/VersionUpdateScreen.kt:75-84 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/SpatialAudioScreen.kt\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. 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 \u0060app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:71\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060app/src/main/java/com/mica/music/ui/screens/EqualizerScreen.kt:173\u0060 calls \u0060fillMaxWidth\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt:69\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":"app/src/main/java/com/mica/music/ui/screens/AboutScreen.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7dff2dfb045debec0b16d9dc28e68988f086f3b75c2894b8d68eacd617a89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt:60-69 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt:93-102 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavStreamRequestResolver.kt:96-105 \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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b07638f342c9dbe852dec43ad4ee2961e337c4e46316f75e726146aa194d85b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt:50-59 | app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt:91-100 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt:90\u0060 calls \u0060elapsedRealtimeNanos\u0060 and \u0060app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt:49\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":"app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a0b88327e0570fababf69475b9d498e46bc4c0833514ffc55c900ba7352bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt:442-451 | app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt:510-519 \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":"app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b45c00d588a4c206c1ec17a7770e95912622526b860d10dfbd32bca5f48dc40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:100-109 | app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt:213-222 \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 \u0060app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:100\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":"app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ec72ab3148251decfb84a76c1f391d775ab3255f0d522fc2dad70564d6ba3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:207-215 | app/src/main/java/com/mica/music/data/scanner/Id3FrameLister.kt:193-202 \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 \u0060app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:207\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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"177b50841fd6014deda7710b51275192aab5998c554d13dc25d528ae1b561377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:287-296 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:361-370 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 182 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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:287\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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1d8f809a22bc1f8866f30269221b412d4a7a90e8dfee069724665bdf78824b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:2003-2011 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:2022-2031 \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 \u0060app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:2003\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2c10b8bd302c0eaedbcd1515748ebd34ee0d549755810714a2efa88a9844ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/home/HomeLibraryAccess.kt:63-72 | app/src/main/java/com/mica/music/ui/screens/settings/SettingsLibraryAccess.kt:40-49 \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 \u0060app/src/main/java/com/mica/music/ui/screens/home/HomeLibraryAccess.kt:63\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":"app/src/main/java/com/mica/music/ui/screens/home/HomeLibraryAccess.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b756cc9dd49914bb03529a0cd1493cf50c9c4dccf342af3fb063103c145c493"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:329-338 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:435-444 \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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:340\u0060 calls \u0060updateCurrentIndex\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:446\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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"234fd683361d4eee296c14dfa1fa15fe31d151c770ad3049383dfbd2b9860802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:719-728 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:352-361 \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 \u0060app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:719\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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9891ac6b88aecfc5613ece0b1156a6d006580c586ecc0c4470dce12f10d4561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:728-736 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:861-869 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:953-961 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1034-1042 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1153-1161 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1215-1223 \u2014 all 6 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 \u0060app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:728\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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee7e27cdbccf3f2a36a316cbcaaa12c7d5abb8f0b361e581276031bae8ea5f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:137-145 | app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:238-246 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:186-194 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:291-299 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 182 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, \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:134\u0060 calls \u0060getIntOrZero\u0060, \u0060getStringOrEmpty\u0060, \u0060getLongOrZero\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:237\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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bee928412c90218b0bef7c9ff57ad547b8419988b4124cb8a5c8b8395aed86a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt:341-349 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:174-182 | app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:346-354 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:262-270 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt:341\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, \u0060app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt:351\u0060 calls \u0060important\u0060 and \u0060app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:272\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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6963f8f56bc9b89415926083a6553eac8666d8ccd7fea017aec18e2538e1a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:19-27 | app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:61-69 | app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:101-109 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:70\u0060 calls \u0060close\u0060, \u0060moveTo\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt:28\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":"app/src/main/java/com/mica/music/ui/components/QualityBadgeVector.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"51918e0de89970a7d0f25493d3423be62bad709d087836e285a0f39a9cdaae03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt:1026-1034 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt:1037-1045 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f94267ddc3af45fd7bf882cc344e761b97f67cacc3584e4664f83d75257708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/debug/java/com/mica/music/media/HybridQaPlaybackReceiver.kt:138-146 | app/src/debug/java/com/mica/music/media/HybridQaPlaybackReceiver.kt:176-184 \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 \u0060app/src/debug/java/com/mica/music/media/HybridQaPlaybackReceiver.kt:138\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/debug/java/com/mica/music/media/HybridQaPlaybackReceiver.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a516688c4cdb968c0dc9b1eba369b298886b3ab324a9a0f7bb4b84f577d1c5d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/debug/java/com/mica/music/media/usbprototype/UsbKernelDriverReconnectProtocol.kt:25-33 | app/src/debug/java/com/mica/music/media/usbprototype/UsbKernelDriverReconnectProtocol.kt:38-46 \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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbKernelDriverReconnectProtocol.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85a676a08e610b88727ab8d43951420936b660fa8f006a8b286bc36981b3c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt:118-127 | app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeHttpExecutor.kt:94-103 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeHttpExecutor.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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. 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":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"65181961d2f18aa98033629368a8e737015b310cc62ca788719927328f2106ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt:374-382 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:588-596 \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 \u0060app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt:374\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":"app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"694334517d0512cdf5f8c8ae2dcccd456f76d48f08a2699cd14e75f28f079811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:122-130 | app/src/main/java/com/mica/music/data/scanner/Id3FrameLister.kt:64-72 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:131\u0060 calls \u0060when\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/Id3FrameLister.kt:73\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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfefaf0946ed77c322f8314e2297c903fcedd31a684c78bd0e7f51c7f44d275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:177-185 | app/src/main/java/com/mica/music/data/scanner/Id3FrameLister.kt:168-176 \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 \u0060app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:177\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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf408f650870d54aa5de83527ecf9a489867a6baf808e792f778b26d76e98d32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:47-55 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt:55-63 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:47\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"718e223ed7c63fd5112e39179a0afc500b87d5bb068178a040944a6b20d675da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:185-193 | app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:214-222 \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 \u0060app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:185\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b1d5df223a6c45b8698906b7939dbdf42f1cccb033377967b8bc2039e9e655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/media/ExternalMediaItemCodec.kt:40-48 | app/src/main/java/com/mica/music/media/SongMediaItemCodec.kt:71-79 \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 \u0060app/src/main/java/com/mica/music/media/ExternalMediaItemCodec.kt:40\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":"app/src/main/java/com/mica/music/media/ExternalMediaItemCodec.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf9c72efed02d53aff74a370ab8cd2f9de09381f1b9d6a08a2a6142c9939005"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridPcmAudioSink.kt:85-93 | app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridPcmAudioSink.kt:405-413 \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 \u0060app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridPcmAudioSink.kt:85\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":"app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridPcmAudioSink.kt"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21482ede3fc456909972241733532fa8c89185c6bb46c512811db226c112be5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:686-694 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1811-1819 \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 \u0060app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:686\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, \u0060app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1821\u0060 calls \u0060placeWithLayer\u0060, \u0060toInt\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:695\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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"0747d34b93994721683d5d2c006ff4a04b9bf46dbefce24be3f399a8a5612c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:165-172 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:252-260 \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 \u0060app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:165\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":"app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef1359b827ead31344c041188e75735112095f87bb18cdf231b6e531d98bf3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 4): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:752-757 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:374-380 | app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:701-707 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:2070-2077 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \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 4 times. 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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbcf47c94b4085eff57aac2be6e037473caa1e671744a80acb09c6094f08bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:110-117 | app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt:269-276 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:161-168 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 182 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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4e0b63dbf2aa9d70e3e990d9cb1b73bc0967a12aea2987cf1d0cdb2321faa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/DeviceShadowRetryPlanner.kt:77-84 | app/src/main/java/com/mica/music/data/library/SafShadowRetryPlanner.kt:65-72 \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":"app/src/main/java/com/mica/music/data/library/DeviceShadowRetryPlanner.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e590a9ddb7ffae068c5cdc3280488b4efdb2322ae705199ba3d858bfdf3f0fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt:60-67 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt:142-148 \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 \u0060app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt:60\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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bc0309c262efdc4e31fbe1a4e9680ca7b6bdad3a52cdaecc0c866bee853cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/smb/SmbSeekableByteSource.kt:19-26 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavSeekableByteSource.kt:29-36 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060app/src/main/java/com/mica/music/data/remote/webdav/WebDavSeekableByteSource.kt:28\u0060 calls \u0060check\u0060, \u0060get\u0060 and \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbSeekableByteSource.kt:18\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":"app/src/main/java/com/mica/music/data/remote/smb/SmbSeekableByteSource.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db9c16938a3ea04a17aa92a48a87bd45f16d9e73956c4218c027884c4ec1ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt:74-81 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt:133-140 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 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 \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt:74\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba35623fb1f53c20d075c9f86d945b27d088720925ed70c718f223a662b30930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:753-759 | app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:1143-1150 \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 \u0060app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:753\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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16e227d22b5d60a1ed7b54f06e6909dfd684cfc6a3aaccacf8e0c110404e984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:876-883 | app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:132-139 \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 \u0060app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:876\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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"844efa88026820d86dd5aa0241b777d5372aec577fa69a12ba863bf1df1d9212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:609-617 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:712-720 \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. 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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cd093d51b026e5a53d6d55bbb18c63e0504e39f38f22e41f8bc6c1264219d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:81-88 | app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt:418-425 \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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c595e94c043bd3dcfcf74bc9a81e85d80986623286cd7faabedaa3ba368a4242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): app/src/main/java/com/mica/music/media/ServicePlaybackEngineCoordinator.kt:296-302 | app/src/main/java/com/mica/music/media/ServicePlaybackEngineCoordinator.kt:367-374 \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 \u0060app/src/main/java/com/mica/music/media/ServicePlaybackEngineCoordinator.kt:296\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":"app/src/main/java/com/mica/music/media/ServicePlaybackEngineCoordinator.kt"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a240e0b9adf984d26e334cad9d924613d4504c9fd9b458d2d925bdc256dbafee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:772-779 | app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:726-733 \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 \u0060app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:772\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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd66a76e45db1cce380e7be2b5e549930bc62dafb06073e614241f387a449215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/Theme.kt:122-129 | app/src/main/java/com/mica/music/ui/theme/Theme.kt:134-141 \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":"app/src/main/java/com/mica/music/ui/theme/Theme.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9096030b16b36b015e97a1d437ff7bcf9ee5af3b2248966b70373f7c5b82e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:117-123 | app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:221-227 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:168-174 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt:275-281 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 182 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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt:117\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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1965ef3ed21a7c4ef3e49658b0d54a4b8eb4d5608a5c818a007e8c68c0a47535"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizerAudioProcessor.kt:79-85 | app/src/main/java/com/mica/music/media/MicaFloatDspAudioSink.kt:266-272 | app/src/main/java/com/mica/music/media/SpectrumAudioProcessor.kt:94-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizerAudioProcessor.kt"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f947145b17aefd49aa06ce369732d504311d3d3282756ac066526fea82d842bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt:48-54 | app/src/main/java/com/mica/music/ui/components/HiFiSeekBar.kt:35-41 | app/src/main/java/com/mica/music/ui/screens/settings/color/HsvColorSlider.kt:40-45 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/HiFiSeekBar.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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 \u0060app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt:48\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":"app/src/main/java/com/mica/music/ui/components/CoverEdgeProgressBar.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64faaf538daeb96ee3b8567a94a2262c8e2d3cf4e97e43beffe7cc2e5f95d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt:245-251 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:780-786 \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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4d08779e799ddbb7bbc5f9dd450b6b4197c17589003e8a9477fd2ab5c88321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:312-318 | app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:334-340 \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 \u0060app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:312\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, \u0060app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:341\u0060 calls \u0060put\u0060, \u0060toByte\u0060 and \u0060app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:319\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":"app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c46e428b91e683c9bfed1a485ef5c60a45901ddb20d44917f115fd49a05688d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt:34-49 | app/src/main/java/com/mica/music/data/AppLetterSealImporter.kt:51-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":"app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1560b0c56d20b9e9e63719c160a4dfbdc4ae848f170e30fb34a29cbd875646b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt:77-83 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt:158-167 \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 \u0060app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt:77\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, \u0060app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt:169\u0060 calls \u0060add\u0060 and \u0060app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt:88\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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b52b63ecbf0ed95225e715314ae0266560c6be0a6d1595758c8e2e15adec70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/data/local/StorageDiagnostics.kt:319-325 | app/src/main/java/com/mica/music/data/local/StorageDiagnostics.kt:380-386 \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 \u0060app/src/main/java/com/mica/music/data/local/StorageDiagnostics.kt:319\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":"app/src/main/java/com/mica/music/data/local/StorageDiagnostics.kt"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb0f096ade8633d99ecfeda9e261dcde5123956a114f43dd56ecab244ebaff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:94-100 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt:108-114 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"75058ea40c99b8b268aa9d6dca34bc4db935fc768e433d905ab5934d51bc40a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/media/ExternalMediaItemCodec.kt:40-46 | app/src/main/java/com/mica/music/media/RemoteMediaItemProvider.kt:64-70 \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":"app/src/main/java/com/mica/music/media/ExternalMediaItemCodec.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f442218e49df449618afdf35b5646efea755ba2a67754a31e10516f92761ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/media/RemoteMediaItemProvider.kt:20-27 | app/src/main/java/com/mica/music/media/RemoteMediaItemProvider.kt:64-70 \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 \u0060app/src/main/java/com/mica/music/media/RemoteMediaItemProvider.kt:20\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":"app/src/main/java/com/mica/music/media/RemoteMediaItemProvider.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fbc23b77918732f37649624e3526df4951c40c06df47abcb7a044e1d95ce78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt:61-67 | app/src/main/java/com/mica/music/ui/components/SleepTimerSheet.kt:91-97 \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 \u0060app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt:61\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":"app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64107a7f8b7db1a4315c9aaf2188d6000fb1f5f2ea22b1dcac4d73590f70d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/LyricsCloudLayoutWarm.kt:137-143 | app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt:99-105 \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":"app/src/main/java/com/mica/music/ui/screens/LyricsCloudLayoutWarm.kt"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bc2cbeb33780d4e804f17af1f6a6d923548b6a82919cb0739d57ab82c5f471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:538-544 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:290-296 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e04cab752fff95990ff31bab52d6848496c0ea816eb77c55df4476bc47de31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:1150-1156 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:1158-1164 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b005274c05f08a40015734bea69921ff0ccf1d161e97d6d2d535e033b59d62fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaPickerActivity.kt:84-89 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt:203-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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaPickerActivity.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"061096c69406092eca21c182da28983b19dac07bb0dd2d3fbc9c55a38b6f79f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt:1476-1481 | app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt:1518-1523 \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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"49811aa79b4b24152221ac2a3ed31d677fdab89f32a75e9f9397c8604cb0a9ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/data/LyricDisplayRows.kt:146-152 | app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt:484-490 \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 \u0060app/src/main/java/com/mica/music/data/LyricDisplayRows.kt:146\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":"app/src/main/java/com/mica/music/data/LyricDisplayRows.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e4104bad8c8dc4c8227727f82b1ac4dce55d26acb34b8522405125495bb397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkRequestResolver.kt:16-22 | app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeStreamRequestResolver.kt:24-30 \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":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkRequestResolver.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fc03daf3b273a19269f69983abad1501e9855b8797e97f23548368af6093b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/smb/SmbBrowser.kt:87-92 | app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:94-99 \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":"app/src/main/java/com/mica/music/data/remote/smb/SmbBrowser.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6361c2599cf64c68c4e785ea69eb7390042a63e59e6aa9fe7ccf42afaec9406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:147-152 | app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt:281-286 \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":"app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c118ea750e667e4f8bc2b2d13ac165b394244645a16cdd37ba8e64039f6c2888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:398-406 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:453-461 \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 \u0060app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:398\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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30925d75980912d12290b80c7022334cba9793c4fa99fcfb5e7fdcd22660302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:113-118 | app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.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 \u0060app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:113\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":"app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c7926122b3c470148f88da2a8596bb73c4bb54720dcfbc754b5cc780590b67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:153-158 | app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:167-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt:153\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":"app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed951f3a86b412709af88863e8ea74af6f3fb4d93bff27e56726b284f03411c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:445-450 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1562-1567 \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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"d477f3f255910138cae1effcd0c4f0b8bdc47fd4aa7bed3a88fff1b2e6c20a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt:89-94 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt:69-74 \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 \u0060app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt:89\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":"app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4d4368065a67f9bcba722ff800ac7fb44aa7bf14a981c57389902067ee3bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt:103-113 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt:92-102 \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 \u0060app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt:103\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":"app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18d432a691403b5fe49666e08ee22c4216b8b2f633784ae75aaa708205a584a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackgroundView.kt:644-650 | app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackgroundView.kt:676-682 \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 \u0060app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackgroundView.kt:644\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":"app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackgroundView.kt"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5655e82239b67841cfe0ac615f5bf689343c69ad6781e3c3b860f1934d1ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:388-393 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:2085-2090 \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":"app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e2ef34aea80a5e9521bd4d09d1c4e5ab38ad6ccbbdd198e4f6625ea2e7e43d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:265-270 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:722-726 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:947-951 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1028-1032 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1147-1151 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1209-1213 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1282-1286 \u2014 all 7 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 \u0060app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:265\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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f37c99302065efb42ef3f89a91b939074de7b7b18c9c26e6fbe6f915dd3657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:377-386 | app/src/main/java/com/mica/music/data/remote/smb/SmbNowPlayingMetadata.kt:123-127 | app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt:326-335 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt:355-364 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt:377\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"892925b87510fe3a7448096aa457217d2e616dd52e9d8dad866bf9b8faa83732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt:301-305 | app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt:385-389 | app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:199-202 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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 \u0060app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt:301\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 before the matched lines, \u0060app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt:299\u0060 calls \u0060getColumnIndex\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt: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":"app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa987f0e6b6dadb7e8cdd61f73fbe130ae8e37f9569a771c01f7e9bf0cdcd51b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:139-143 | app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:200-203 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:140-143 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:254-259 \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. 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 before the matched lines, \u0060app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:137\u0060 calls \u0060getColumnIndex\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt: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":"app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"388f00d62ae0a0e60e087115d199ea861d43629acab637a6005a6f4767e7157b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt:158-163 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt:166-171 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"48766ce5467bcb546a763d53adaab4f44b5167a28db93515243f8c5909fbdc09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt:595-602 | app/src/main/java/com/mica/music/media/fx/SoundFxEngine.kt:213-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizer.kt"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a47b2fde0b3a0840b03e47010e111f74425415a80b44e0f961a3445ba35647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt:79-89 | app/src/main/java/com/mica/music/data/AppWallpaperImporter.kt:60-70 | app/src/main/java/com/mica/music/data/PlaylistCoverImporter.kt:70-80 \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 3 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":"app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4aa1089b786470cb02137fe28fe7f70a0d002c612b1da37c3d0ba2cdebbe46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/mica/music/data/PlayerInfoVisibility.kt:80-87 | app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt:299-306 \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":"app/src/main/java/com/mica/music/data/PlayerInfoVisibility.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd68478b847091f3ddd2714cdc573dbb5dc6d9a47dd1da41a848d2798b6e7810"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): app/src/main/java/com/mica/music/data/library/DeviceShadowRetryPlanner.kt:148-155 | app/src/main/java/com/mica/music/data/library/SafMassDeletionConfirmationPlanner.kt:289-296 | app/src/main/java/com/mica/music/data/library/SafShadowRetryPlanner.kt:109-116 \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 3 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":"app/src/main/java/com/mica/music/data/library/DeviceShadowRetryPlanner.kt"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c7765204674f70cac715d130ca9b0b211cd2f8762cab810eb0b4c3a05c63c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt:256-260 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt:303-307 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 52 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6488aa834073e5d65b808f5dc3673a9ccb0fb366b6b3a5ad3724d48b7a46c7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt:887-893 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:62-68 \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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cde2874be6e0466483d805cfe52ac683efd7b22d014c094f4c1e37ac451126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt:612-616 | app/src/main/java/com/mica/music/ui/components/NarrowBarSoftKaraokeLyric.kt:248-252 \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 \u0060app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt:612\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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca88aff47a2913fcf9c9b47772dfbc7439285accdd8dfbd7c26588f80f42809e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/SongListPanel.kt:520-525 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1649-1654 \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 \u0060app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1649\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":"app/src/main/java/com/mica/music/ui/components/SongListPanel.kt"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e9542cdf0fb12947669cfef7fab8db91e3d4e40f7a6840561d9331d1933bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt:829-833 | app/src/main/java/com/mica/music/ui/screens/NowPlayingLyricsExpanded.kt:1284-1288 \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":"app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5742ec34cb384cb0e06c31fc97915cb99f714b285742560c5334c58c3b96b2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt:835-839 | app/src/main/java/com/mica/music/ui/screens/NowPlayingLyricsExpanded.kt:1290-1294 \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":"app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9f74e360724b24b2fca1f5585df644e8ad051241ab7b87035e833666fabff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:1051-1059 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:550-558 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f19608422e10d785fa867799b5b83763f657850f06bcab45735b38a945f57db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt:1202-1210 | app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt:1310-1318 \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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b716fee4d84bff036cbab63fb02feaa189845f450ee8682fd5aef069f29096e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:975-981 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:399-405 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:2096-2102 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt:971\u0060 calls \u0060between\u0060, \u0060nextFloat\u0060 and \u0060app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:396\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":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverRenderer.kt"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb40c9ea267eee1b05191e1ae70f4b109d47a9e2fa1bbdc8661ce8089f09816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt:222-229 | app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt:113-120 | app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:237-244 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:180-187 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/player/view/ParticleCoverView.kt"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2265c985dcbb9d14b7695e09ab204303049285e41fd5cc55d153a78c051b4a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt:219-226 | app/src/main/java/com/mica/music/ui/theme/StarMapGlBackground.kt:162-169 \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":"app/src/main/java/com/mica/music/ui/theme/RainGlassBackground.kt"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"09545b39953f8b0e97c03b2f813410cc762f41e7503034bbabf5fe39c03d4904"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt:779-788 | app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt:958-967 \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 \u0060app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt:779\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":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"8957fb668caf026c79da6153f42db186fef8e011e21c47840020ed729f0e0b3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): app/src/main/java/com/mica/music/data/preferences/AppearancePreferences.kt:156-163 | app/src/main/java/com/mica/music/data/preferences/AppearancePreferences.kt:170-177 | app/src/main/java/com/mica/music/data/preferences/LyricsPreferences.kt:250-257 | app/src/main/java/com/mica/music/data/preferences/LyricsPreferences.kt:307-314 | app/src/main/java/com/mica/music/data/preferences/LyricsPreferences.kt:323-330 | app/src/main/java/com/mica/music/data/preferences/LyricsPreferences.kt:338-345 | app/src/main/java/com/mica/music/data/preferences/LyricsPreferences.kt:536-543 \u2014 there are 7 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 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/preferences/AppearancePreferences.kt"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c6c0a085249545a1c730c0f6d547091b31199728ab99a5b8ca160b5b18c4df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): app/src/main/java/com/mica/music/data/preferences/LibraryBrowseSettings.kt:143-147 | app/src/main/java/com/mica/music/data/preferences/LibraryBrowseSettings.kt:169-173 | app/src/main/java/com/mica/music/data/preferences/LyricsPreferences.kt:686-690 \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":"app/src/main/java/com/mica/music/data/preferences/LibraryBrowseSettings.kt"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fd6e4961af2fa7cd07a565fcd18c803ae959639cf641dba98988bc492c654a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:212-228 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:260-276 \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 \u0060app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:212\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d614cde95cbd14dec6321de7103f2534bd23c1a884fab5ccf2f4c27598ea92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1236-1247 | app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1287-1300 \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 \u0060app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt:1236\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":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"582193f1c96ee95534b53fec67c5df35cdc30ea8577a1d1f3510f6b496b779f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt:128-141 | app/src/main/java/com/mica/music/ui/components/SleepTimerSheet.kt:197-210 | app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt:617-630 \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 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt:128\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":"app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e06b1d4112169c936d6cbf7ea4e6d448c1171cfdabaf01c4e7a863b67c3e10b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt:21-33 | app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeHttpExecutor.kt:24-36 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeHttpExecutor.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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 \u0060app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt:21\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":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3c0b9eda9f481fb142f91580d0681abbe452a42dece5848af8cc39f0adc12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:967-979 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1048-1060 \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 \u0060app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:967\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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"004a8b65268d9b8923f90a9045a2315006daa132fff0aba30230217d3659d871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:748-760 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:972-984 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1053-1065 \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 \u0060app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:748\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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8e604a91815f25b6badc41b51cb5cccf185ad7526a1fb4eb3a8af7a3c307ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt:77-88 | app/src/main/java/com/mica/music/ui/components/SleepTimerSheet.kt:107-118 \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 \u0060app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt:77\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":"app/src/main/java/com/mica/music/ui/components/PlaybackTuningSheet.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"35850c9c838d6ba32277a175953143d7d477fa767eff9d13e7e9b5a8e4819456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1476-1487 | app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1813-1821 \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 \u0060app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt:1476\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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"229900767011541381498939504088e2f02abe2fe55714bf3f701188de4490ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/settings/SettingsExcludedDirectoriesDialog.kt:65-76 | app/src/main/java/com/mica/music/ui/screens/settings/SettingsExcludedDirectoriesDialog.kt:90-101 \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 \u0060app/src/main/java/com/mica/music/ui/screens/settings/SettingsExcludedDirectoriesDialog.kt:65\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":"app/src/main/java/com/mica/music/ui/screens/settings/SettingsExcludedDirectoriesDialog.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"50aa4490241884a4f9cca2ee616879992cafcf7fbac462632cc917826986815b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/src/main/java/com/mica/music/imaging/MicaImageLoaders.kt:51-61 | app/src/main/java/com/mica/music/imaging/MicaImageLoaders.kt:64-74 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/mica/music/imaging/MicaImageLoaders.kt:51\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":"app/src/main/java/com/mica/music/imaging/MicaImageLoaders.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4665e217bddcbe40192d6ac5b7dc8faa21453315db660a3dc8b7420e1ee6205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt:36-45 | app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeHttpExecutor.kt:39-48 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeHttpExecutor.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 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 \u0060app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt:36\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":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f72a06dd10401d9f99fbc232245a04455b2527379bb108bbe2081445116fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt:64-73 | app/src/main/java/com/mica/music/ui/components/SongSortSheet.kt:102-111 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/components/SongSortSheet.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 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 \u0060app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt: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":"app/src/main/java/com/mica/music/ui/components/BrowseGroupDisplaySheet.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6eec7b991684c2640658c4288e9fb1d97491278a1b078b42c75226aeb59d24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt:228-236 | app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt:237-245 \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 \u0060app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt:228\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04dcc6dc87053a95ec36d9912f184058ba01be81d9c172c546feea2a2882e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:416-424 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:511-519 \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 \u0060app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:416\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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db288d7437a86756921803314a73dcb97f416a2213fa342468de470394b5c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/mica/music/ui/screens/home/HomeStatsBar.kt:61-68 | app/src/main/java/com/mica/music/ui/screens/home/HomeStatsBar.kt:69-76 \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 \u0060app/src/main/java/com/mica/music/ui/screens/home/HomeStatsBar.kt:61\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/home/HomeStatsBar.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"91914933fa0bc071ceff648d7225a75d742913a4ba5605dbd2bb4d74b66dff08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:122-129 | app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:186-193 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:117-124 | app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:238-245 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:122\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, \u0060app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:247\u0060 calls \u0060getColumnIndexOrThrow\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt:131\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":"app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b7da1dbf8ae64175625042a06c7c73fafb978b53bee1268e0809722ab11998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:962-969 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1043-1050 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1162-1169 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae1dddeced02cbdde2ccfed14b6e017ed79374b840e1cda40d2178767b7c4c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:870-876 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:962-968 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1043-1049 | app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:1162-1168 \u2014 all 4 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. 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, \u0060app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:877\u0060 calls \u0060isCurrent\u0060 and \u0060app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt:969\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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"c191bcc7455863753102e343acbfe79f6f6f9433b39a5346c5b9e24ac16fbfa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/mica/music/data/PlaylistStore.kt:211-217 | app/src/main/java/com/mica/music/data/PlaylistStore.kt:559-565 \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 \u0060app/src/main/java/com/mica/music/data/PlaylistStore.kt:211\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":"app/src/main/java/com/mica/music/data/PlaylistStore.kt"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89d37399fbc108c73a20ce9eaa5e2820355dfd629f140ffcc7708563c72c399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt:101-106 | app/src/main/java/com/mica/music/data/remote/smb/SmbLyricsTransport.kt:104-109 \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 \u0060app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt:101\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":"app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"90eab9539898c76c7183d18eb3959006ce4b042a8f25fef98590f90bc158b2c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:73-83 | app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt:91-101 \u2014 before extracting anything, compare \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 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 \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:73\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt:72\u0060 calls \u0060arrayOf\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt:90\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae24f69c88fd7edd44cb58aca5617606abfd5ed05cb16b116ce23f9ce1da624"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:134-138 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:139-143 \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 \u0060app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:134\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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2a174942006e352fbce994d78dac823a96c04f6a7024d92757ed07524820ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridDsdRenderer.kt:166-170 | app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridDsdRenderer.kt:250-254 \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 \u0060app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridDsdRenderer.kt:166\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":"app/src/main/java/com/mica/music/media/usbhybrid/UsbHybridDsdRenderer.kt"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6068ae8008a6a720efb0b9b5d11836f46139b29f26ff2baddf4f0e7b36b6bac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/mica/music/data/library/LibraryOperationAuthority.kt:28-32 | app/src/main/java/com/mica/music/data/library/LibraryOperationAuthority.kt:49-53 \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 \u0060app/src/main/java/com/mica/music/data/library/LibraryOperationAuthority.kt:28\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":"app/src/main/java/com/mica/music/data/library/LibraryOperationAuthority.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b41d5845d91a1960445c31e789857d8b5bb29c72dd90a0b1f592622a0b8ac36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt:53-58 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt:86-91 | app/src/main/java/com/mica/music/data/remote/webdav/WebDavStreamRequestResolver.kt:89-94 \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. 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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7dfc59b06049ce5051e50ec0919db3582524aa024d981f5226465c6ba05fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/CoverColorExtractor.kt:91-95 | app/src/main/java/com/mica/music/data/scanner/VideoCoverPosterPrefetcher.kt:170-174 \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":"app/src/main/java/com/mica/music/data/scanner/CoverColorExtractor.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"61150313aeb472749c0006c955c344347e66ec849849cfab01141d4040588d93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:125-133 | app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt:255-263 \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, \u0060app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt:265\u0060 calls \u0060getColumnIndex\u0060 and \u0060app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:134\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":"app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"634cb5b4bec0860979351848e25475454105278753cfa366ca9d9717bc3dd492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt:246-251 | app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt:411-416 \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":"app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"518a269d09286f20bdc7923f82ba33b5a0cdd062bcc21f8da3d223e2d9a75266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt:306-310 | app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:594-598 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:705-709 \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 3 call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbc1aa7ca5ea36ad44c49207f021c87f1cd7a08581debdc253f5885e4f051b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:578-583 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:689-694 \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. 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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d22fdb1388f8eb1d202218e3b729e4678bc33a8dcd8cf458e490563b971c78e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:586-591 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:697-702 \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. 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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f40180fce005ff135bcd26fa4b4f39269d5238859d2ea4e44310cc0f7bc67f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt:601-606 | app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt:681-686 \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. 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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa63707aabcf6d97350be50f8b0ac1c2098a5226fc1aa9b0f2b6c3ee3f622047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/perf/java/com/mica/music/perf/LandscapeCapacityActivity.kt:103-116 | app/src/perf/java/com/mica/music/perf/LandscapeCapacityActivity.kt:145-158 \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 \u0060app/src/perf/java/com/mica/music/perf/LandscapeCapacityActivity.kt:103\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":"app/src/perf/java/com/mica/music/perf/LandscapeCapacityActivity.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a7955839ef8fa95d3636919487710435ad793cf1c0eaa250dc46f0cc9c6de0"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: org.jellyfin.media3:media3-ffmpeg-decoder: \u0060org.jellyfin.media3:media3-ffmpeg-decoder\u0060 1.9.0\u002B1 is published on Maven Central under \u0060GPL-3.0\u0060, which this policy bans, and this repository declares it in a Maven or Gradle manifest. The licence was read from the artifact\u0027s POM \u0060\u003Clicenses\u003E\u0060 block \u2014 following \u0060\u003Cparent\u003E\u0060 where the POM inherits them \u2014 and normalised to SPDX before it was judged, because Maven publishes the name as free text (\u0060GNU Affero General Public License v3\u0060 is AGPL-3.0). Where a POM lists several licences they are read as a CHOICE, per Maven\u0027s own documentation, so this is charged only because EVERY listed licence is banned. Replace the dependency, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b20205083af06cf446d4e0b217040f3c8c64996d59434ebe45a3875339d3df64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt: app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 213 in NowPlayingScreenKt.NowPlayingContent at line 229. 16 of those changes were fix/bug commits, and the other 35 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a15cd4f6a46cc97375a80f80ea96173175b100943ea6d6af9dc1125dbea2ac5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/home/HomeScreen.kt: app/src/main/java/com/mica/music/ui/screens/home/HomeScreen.kt changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 121 in HomeScreenKt.HomeScreen at line 106. 7 of those changes were fix/bug commits, and the other 34 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/home/HomeScreen.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":"app/src/main/java/com/mica/music/ui/screens/home/HomeScreen.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f1dd2c7139602e88ba96d83d6a60497ad687fe8949dcbec5415e9ecb9317a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/NowPlayingLyricsExpanded.kt: app/src/main/java/com/mica/music/ui/screens/NowPlayingLyricsExpanded.kt changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in NowPlayingLyricsExpandedKt.ExpandedLyricsPanel at line 88. 6 of those changes were fix/bug commits, and the other 7 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/NowPlayingLyricsExpanded.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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingLyricsExpanded.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7652a38967400f7e6e76dc6379481fe8572fe0fe84597c3f43f50599b7fef5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt: app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in PlaybackRuntime.createPlayerListener at line 598. 10 of those changes were fix/bug commits, and the other 10 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/playback/PlaybackRuntime.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":"app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0819448a7a293313eff9624a2a455b7d3abeabd1096e1fe310348edaa67c107"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt: app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in NowPlayingCoverSectionKt.NowPlayingCoverSection at line 107. 8 of those changes were fix/bug commits, and the other 11 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5204c6c7241d62514909f91c2988d44b0abe024cfadf10f2d6c61b8f864ad451"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/media/MicaMediaService.kt: app/src/main/java/com/mica/music/media/MicaMediaService.kt changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in MicaMediaService.attachPlaybackStackOwners at line 537. 11 of those changes were fix/bug commits, and the other 31 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/media/MicaMediaService.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":"app/src/main/java/com/mica/music/media/MicaMediaService.kt"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db0af9b79ecececc04406bcb457c2dd15413e53e4943a2387f4653536edd0fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/settings/SettingsScreen.kt: app/src/main/java/com/mica/music/ui/screens/settings/SettingsScreen.kt changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in SettingsScreenKt.SettingsScreen 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/settings/SettingsScreen.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":"app/src/main/java/com/mica/music/ui/screens/settings/SettingsScreen.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b91098bfe60291851e0b55b9d16d5a7b823a8c4ab61b687a4d31b704b581da0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt: app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in NotificationLyricsCoordinatorKt.buildExternalLyricsLine at line 722. 5 of those changes were fix/bug commits, and the other 11 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.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":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9521394c6a1d0aa8cccc02e92f10d91cb51340f748dffc52940b10603bf5b65"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/settings/SettingsLyricsPanel.kt: app/src/main/java/com/mica/music/ui/screens/settings/SettingsLyricsPanel.kt changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SettingsLyricsPanelKt.LyricsSettingsPanel at line 47. 3 of those changes were fix/bug commits, and the other 16 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/settings/SettingsLyricsPanel.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":"app/src/main/java/com/mica/music/ui/screens/settings/SettingsLyricsPanel.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e7c2abc7caf48dc7339b12f611c0a50e4350d57d3c9715eb10f9e32858b8ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt: app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in SafAutoSyncPipeline.executeObservedSnapshot at line 201. 2 of those changes were fix/bug commits, and the other 3 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.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":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b333c747e04efb27dc3a37f428613cd8f382eaa1c5f4a2e44bad22b5500c19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/debug/java/com/mica/music/media/HybridQaPlaybackReceiver.kt: app/src/debug/java/com/mica/music/media/HybridQaPlaybackReceiver.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in HybridQaPlaybackReceiver.onReceive at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/debug/java/com/mica/music/media/HybridQaPlaybackReceiver.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":"app/src/debug/java/com/mica/music/media/HybridQaPlaybackReceiver.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbf3f451890e809fbe84e1b3bd9bfbd3ce0721632ca8663cec8a607f86f6604"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt: app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in PlayerPageLayoutEngine.computeFrame 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageLayoutEngine.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"34751207c4693c7646fc2571eeedf028203c2609efc32937ef0e791b341aa633"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt: app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in HomeBrowseContentKt.HomeBrowseContent at line 121. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.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":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b9bfe9cf9eb63c784a3653388a171e1179a49fe7853e4f3fb54542d5ca22d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt: app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in LibraryAutoSyncQaProfileService.onStartCommand 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"237796d581d612fb7692b32b2ba0521759d637d3c937a0ee067b22c9a9445336"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt: app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in PlaybackQueueSheetKt.PlaybackQueueSheet at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.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":"app/src/main/java/com/mica/music/ui/components/PlaybackQueueSheet.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6750255f1be9f4d22b9e2fe1d360119dc9806208217ca58e5daf753595919e62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/home/SmbBrowserPane.kt: app/src/main/java/com/mica/music/ui/screens/home/SmbBrowserPane.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in SmbBrowserPaneKt.SmbBrowserContent 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/home/SmbBrowserPane.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":"app/src/main/java/com/mica/music/ui/screens/home/SmbBrowserPane.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c537dbf4b7e87c458735c1b55f581a6030e254dd2e16a95c53dbbf0a76378c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/settings/RemoteMusicSettingsPanel.kt: app/src/main/java/com/mica/music/ui/screens/settings/RemoteMusicSettingsPanel.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in RemoteMusicSettingsPanelKt.RemoteMusicSettingsPanel 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/settings/RemoteMusicSettingsPanel.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":"app/src/main/java/com/mica/music/ui/screens/settings/RemoteMusicSettingsPanel.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"73aece99c86f1c2e85bd54043f0bde8e5199d43af2744571a203d06d52643704"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/CustomPlayerLowerPanel.kt: app/src/main/java/com/mica/music/ui/screens/CustomPlayerLowerPanel.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in CustomPlayerLowerPanelKt.CustomPlayerPagePanel 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/CustomPlayerLowerPanel.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":"app/src/main/java/com/mica/music/ui/screens/CustomPlayerLowerPanel.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6e55f3199109d9261857fb27f29036a2c42942bfec0054f946b2b9298f4472"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/home/HomeLibraryStats.kt: app/src/main/java/com/mica/music/ui/screens/home/HomeLibraryStats.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in HomeLibraryStatsKt.resolveLibraryStatsBarModel at line 109. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/home/HomeLibraryStats.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":"app/src/main/java/com/mica/music/ui/screens/home/HomeLibraryStats.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f260ad5d1d9d7a9b38c03eea418ce3e00872544c77d076d2517e4665aedd803"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/components/PlayerSheetHost.kt: app/src/main/java/com/mica/music/ui/components/PlayerSheetHost.kt changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in PlayerSheetHostKt.PlayerSheetHost 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/components/PlayerSheetHost.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":"app/src/main/java/com/mica/music/ui/components/PlayerSheetHost.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9f27f49e4540055864aaaf9f2b151bcb1409cd4cf691dca943d390ed43388c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt: app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in LetterLyricsPrototypeKt.LetterLyricsPrototype at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.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":"app/src/main/java/com/mica/music/ui/screens/LetterLyricsPrototype.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"996b3df669956fdb61eb55955ebf6db1bcba5fe70c1852f77c1d6603add53666"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanel.kt: app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanel.kt changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in PlayerLowerPanelKt.PlayerLowerPanelSection at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanel.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":"app/src/main/java/com/mica/music/ui/screens/PlayerLowerPanel.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c667ac70f71aadd13b6a1e59279965041d10a3b0576fa259b9aa27af88c1f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt: app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SongActionMenuSheetKt.AddToPlaylistSheet at line 458. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.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":"app/src/main/java/com/mica/music/ui/components/SongActionMenuSheet.kt"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"1954361bbd46a5230d3c2fc84a322cdff462651ffe500d46be82c0fb25328fc8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt: app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AudioMetadataProbe.probeTrack at line 304. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5648b0e0b175fd9225ef86825be9fb743b03bcb117ccf95610c39688436e97a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt: app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in LyricsDisplayKt.LyricLineBlock 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/components/LyricsDisplay.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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1923f2c3f91afb945ade318d017a8a3ee77324748f32749edabce90a23905c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/components/SongCover.kt: app/src/main/java/com/mica/music/ui/components/SongCover.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in SongCoverKt.SongCover 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/components/SongCover.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":"app/src/main/java/com/mica/music/ui/components/SongCover.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5cdedf595f78ed0ffbbd39bddf60ff1a9aa4555d45fdc19d23d15fc23fa1ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt: app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in FolderScanner.loadDrafts at line 752. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/scanner/FolderScanner.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":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9867427a1214eea3a493817c91fb1d0ef4537e143054e847f37f8cb2b4fd15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/scanner/ScanProfiler.kt: app/src/main/java/com/mica/music/data/scanner/ScanProfiler.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ScanProfilerKt.reusableCachedSong at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/scanner/ScanProfiler.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":"app/src/main/java/com/mica/music/data/scanner/ScanProfiler.kt"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2146819872ad15d09c04b0a2ee32d88bd8100d9fa78dddd4af0ca7363c50bded"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt: app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DesktopLyricsOverlayServiceKt.DesktopLyricsOverlayContent at line 449. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.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":"app/src/main/java/com/mica/music/ui/overlay/DesktopLyricsOverlayService.kt"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f7efbc45775cd101bc95d46331d8aabfe5323694d50fcba9a426fa812fb401"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/player/PlayerPageState.kt: app/src/main/java/com/mica/music/ui/screens/player/PlayerPageState.kt changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PlayerPageStateKt.rememberPlayerPageUiModel 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/player/PlayerPageState.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":"app/src/main/java/com/mica/music/ui/screens/player/PlayerPageState.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec20adbfddce6e456d84627add17313ad068a0a789257af2ee50da754b5e310"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt: app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in LyricsCloudPanelKt.LyricsCloudPanel at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.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":"app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52d2ab2874c514dd2615f1b23db1f14cd45878e74482cd7550f0d3fa1ca8c63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/theme/PlayerScreenAppearance.kt: app/src/main/java/com/mica/music/ui/theme/PlayerScreenAppearance.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in PlayerScreenAppearanceKt.rememberPlayerScreenAppearance at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/theme/PlayerScreenAppearance.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":"app/src/main/java/com/mica/music/ui/theme/PlayerScreenAppearance.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7302a6054dc416244cfe50de49f2b3e4d6f7df6f248f84424414ceee95d3cd71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt: app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in MediaStoreScanner.loadDrafts at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a67c5bd192a261d22a241d1ce89cece7d1911b92352a0d7e6da2b4c06901f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/SongChangeDiagnostics.kt: app/src/main/java/com/mica/music/data/SongChangeDiagnostics.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in SongChangeDiagnostics.changedFields at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/SongChangeDiagnostics.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":"app/src/main/java/com/mica/music/data/SongChangeDiagnostics.kt"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4135e69c881c7fcf5048566408b4563bafac6004fc8b372d512f7cb7552c63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt: app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PhotoStackTransitionView.drawProgressStrip at line 978. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.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":"app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9851f76a9ed9e1a3847168e0245dccc371b11bffce93a8f09ca2617f0a0076"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt: app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in LibraryAutoSyncQaReceiver.onReceive at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaReceiver.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed8778cd7e171fc6f874092dde14b0880fc856161e9b6db2ec74a5aa765812c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt: app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WebDavSourceSync.scan at line 200. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb689cfb9908cde731f33126c4abbb45c4b2bf092c2c8a43f9225f8a8cbf9330"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/playback/MediaControllerQueueSync.kt: app/src/main/java/com/mica/music/playback/MediaControllerQueueSync.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in MediaControllerQueueSync.planSync at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/playback/MediaControllerQueueSync.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":"app/src/main/java/com/mica/music/playback/MediaControllerQueueSync.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfa45d3b68eb9ce73bc11252f26d388b29c54031e5b2cca241fa8cf4eab7a92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt: app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in DeviceAutoSyncPipeline.executeInternal 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.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":"app/src/main/java/com/mica/music/data/library/DeviceAutoSyncPipeline.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"046983c5f73ab88f27963fffc13cc113f8887f9def12eeb7316683f06925dc86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/home/HomeSortSheets.kt: app/src/main/java/com/mica/music/ui/screens/home/HomeSortSheets.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in HomeSortSheetsKt.HomeSortSheets 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/home/HomeSortSheets.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":"app/src/main/java/com/mica/music/ui/screens/home/HomeSortSheets.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab22d53cee1839ca1f5fdb18c8d56fc8d45c898a327b17a93c4c43bb6892124"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/library/LibraryCacheLoader.kt: app/src/main/java/com/mica/music/data/library/LibraryCacheLoader.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in LibraryCacheLoader.loadCachedLibrary 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/library/LibraryCacheLoader.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":"app/src/main/java/com/mica/music/data/library/LibraryCacheLoader.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde894e0bba3b4c5bfb1866a3cf9daed38eaa1a39fe5b9a033b1a6b5167a4482"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/library/SafUnknownFingerprintDebtPlanner.kt: app/src/main/java/com/mica/music/data/library/SafUnknownFingerprintDebtPlanner.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SafUnknownFingerprintDebtPlanner.plan at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/library/SafUnknownFingerprintDebtPlanner.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":"app/src/main/java/com/mica/music/data/library/SafUnknownFingerprintDebtPlanner.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a7456a844ad251b8496de188452bfc643c04f2b56f3b25b19169621b4f0977"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/components/SongRow.kt: app/src/main/java/com/mica/music/ui/components/SongRow.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SongRowKt.SongRow 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/components/SongRow.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":"app/src/main/java/com/mica/music/ui/components/SongRow.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddbfb1908b6d4b7a4c0809b18be5a0786634dab7ad2744786397549caf50835"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt: app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in SmbFolderLibraryIndexer.discover 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.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":"app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28a3ded17eb7ad6d9dfb177e13ecf69e5cffdbb7bcda0ef0d8e65d29d19e199"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/media/SpectrumAnalysisEngine.kt: app/src/main/java/com/mica/music/media/SpectrumAnalysisEngine.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SpectrumAnalysisEngine.tick at line 110. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/media/SpectrumAnalysisEngine.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":"app/src/main/java/com/mica/music/media/SpectrumAnalysisEngine.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2140d7d26a8265cf6facf4758a116f86f042824d09d65f2e3c99b8d0515ce3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt: app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in BlurredCoverBackgroundKt.BlurredCoverBackground 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.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":"app/src/main/java/com/mica/music/ui/theme/BlurredCoverBackground.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac62e9a52a4c109dd7e5998bfd9e8d6ebc8c35af9b140cbd2eff36c036d04ef2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/ui/screens/home/HomeTopBar.kt: app/src/main/java/com/mica/music/ui/screens/home/HomeTopBar.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in HomeTopBarKt.resolveTopBarTitle 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/screens/home/HomeTopBar.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":"app/src/main/java/com/mica/music/ui/screens/home/HomeTopBar.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90c6eb47a78d9f963b7734ec1f01892b2664fb61573c7717618517113bae610"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/LibraryQueueSyncPolicy.kt: app/src/main/java/com/mica/music/LibraryQueueSyncPolicy.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LibraryQueueSyncPolicy.plan 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/LibraryQueueSyncPolicy.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":"app/src/main/java/com/mica/music/LibraryQueueSyncPolicy.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"391aaa00dc2764c0b88908b94faed4867c1c48a6b91c0fee2dd8c638e2226145"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/mica/music/data/scanner/LrcParser.kt: app/src/main/java/com/mica/music/data/scanner/LrcParser.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LrcParser.parseEntries 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/scanner/LrcParser.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":"app/src/main/java/com/mica/music/data/scanner/LrcParser.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe146383123ea67250760d9bc6d8f67b538ced412a959093d64cfeefd8e98e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/src/main/java/com/mica/music/data/local/LibraryAutoSyncStateEntities.kt: app/src/main/java/com/mica/music/data/local/LibraryAutoSyncStateEntities.kt changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is LibraryAutoSyncStateEntitiesKt.toEntity at line 301), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(library): unify deletion proof and playlist followups\u201D; \u201Cfix(library): persist SAF mass-deletion confirmed-missing proof\u201D; \u201Cfix(library): bound SAF mass deletion confirmation\u201D; \u201Cfix: make playlist cleanup follow-ups late-safe\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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/local/LibraryAutoSyncStateEntities.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":"app/src/main/java/com/mica/music/data/local/LibraryAutoSyncStateEntities.kt"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac7c92346f0a6e774f15607a56d7e04f2fc14f0cf1d59555114f34a73d5c178"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/src/main/java/com/mica/music/data/scanner/AlbumArtCache.kt: app/src/main/java/com/mica/music/data/scanner/AlbumArtCache.kt 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 9 (its worst body is AlbumArtCache.pruneUnreferenced at line 362), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(imaging): recover managed artwork after load failures\u201D; \u201Cfix(artwork): serialize cache maintenance with library state\u201D; \u201CImplement external lyrics controls and library consistency fixes\u201D; \u201Cfix: harden playback lifecycle and library snapshots\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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/data/scanner/AlbumArtCache.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":"app/src/main/java/com/mica/music/data/scanner/AlbumArtCache.kt"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"250111cbb553d8ae6ebcb49d1c21b3bda2890966fee15681c5449906f815d6f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/src/main/java/com/mica/music/ui/theme/AnimatedTheme.kt: app/src/main/java/com/mica/music/ui/theme/AnimatedTheme.kt changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is AnimatedThemeKt.MicaCustomWallpaperSlice at line 326), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): suppress K2 lint false positive in wallpaper image state\u201D; \u201Cfix(wallpaper): prevent audiophile mini bar flicker on sheet collapse\u201D; \u201Cfix(wallpaper): stack-blur viewport frame with safe regen and crop clip\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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/ui/theme/AnimatedTheme.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":"app/src/main/java/com/mica/music/ui/theme/AnimatedTheme.kt"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"24db587b0ac4ad0a389ae30d244d78d7544e9c92ce79b59df232b467cb49cf78"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/src/main/java/com/mica/music/media/DesktopLyricsOverlayState.kt: app/src/main/java/com/mica/music/media/DesktopLyricsOverlayState.kt changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is DesktopLyricsOverlayStateKt.forExternalDisplay at line 58), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix external lyric synchronization\u201D; \u201CImplement external lyrics controls and library consistency fixes\u201D; \u201Cfix: harden playback lifecycle and library snapshots\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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:23:54 \u002B08:00\u0027 --until=\u00272026-10-20 13:23:54 \u002B08:00\u0027 --full-history --no-merges -- app/src/main/java/com/mica/music/media/DesktopLyricsOverlayState.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":"app/src/main/java/com/mica/music/media/DesktopLyricsOverlayState.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe01f7bdac0be49644b87a63d626341c46ba52f5f722073af02d55645c7e8950"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context section: docs/adr/0004-usb-exclusive-hybrid.md has no Context section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adr/0004-usb-exclusive-hybrid.md"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"640843e15177707b35606ba9ac8d324085b0c5a7e5f6a2d786422ce84870e20e"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060app\u0060 (135235 LoC, 2427 module-visible types across 52 directories) overshoots its size bounds. 1 of 5 build unit(s) (Gradle) overshoot their size bounds, lowering Project Cohesion to 6.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/build.gradle.kts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c9ca2f4e1cbcc84bf010a889b5e2cd34ca985c674f80891b0f288e779770d1"}},{"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":"0d568f9e7164578bfc8113a16c698d185bb834b45b67bd4f0fb9155e6816c75b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"feb60934d1c1695b683d4d93fa077dc5e78ce36c74a082792264ce0a5692592e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"dab1b50380e0ec28e77fdb07c23340d76a92b132874ab54141fb4877418a69e7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"b5ca4af9037d73424ccd3c35ae98cd34f23a32c483d3816335ec452173a14fdb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"795ed972b2a999db769039ea4d41377f28dad4dd5c7c375e79be0753c0637d33"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"407a9fda2847144d4a3db21ff6fe8975f0acfc026281d1f0439e24b03606e20c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"dc6a3484103f5747765642302f6f04da47d94ff6defdf19246eb02aeb8e3b21d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"40242b89305ce5b56343a13dc37ff4773ed25f147e5053353e6ea4b60540808d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"57b66fb97fca583d8e5d5673138109bce808acb802a51ce30a4b6f2ba4fad10f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"da5b9ec53108a9c990f23872ab00b6de2acb54f107d54b5d1f6172379d540992"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"8834462aba45039845acfc307e4c6c46c19dba5f400ff0d31e7e50f0f8fd94ac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"5db48092254b7a61101a92f7610c6d7bc008f6d817ee0e9b7e57747150e55224"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"a169f7248eb8ccec629ed6a93e050acdf1a527ad10a87d751221705f0fb2e40e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"02e7a6295fa212721b2db615ff90e1bfcbb902052235191592a9ab693fde1150"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"3cff9a553c59eb8de6b5744171e2b82081d9f36e23de5d86c7ae0b82c9f278dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"41f9bf03e3fe7e06c6530af3214e83b361c4d0fc0f2c25f45c5cb3d7469216f0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"a59f5baaf9e7ee3405145843e02d61a8e4acaa1ef6bcce0d6725fe47c8e02b3d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"d4a11d6a6a9cdb5cdadae78d2a1e296aa06953691fb0d37cd124cf130aba98fb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"3439890bc9cb9059328d13aebae7b559bbedba9833639f0d4b2807922b38c6f4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"c7c98803ff90f3662e017595868d7943079c2141d3d9fc0fabad7dccc2a61915"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"538866ee2454327ae1b558c6e13c4fed4aad274cc0c851e6abbe4c229ca4b0ad"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"eba8477f1288efde09c4396641a432e09d7172418ed8400680d9688ba0eda635"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"d70ae0fc273c468186589485b1ea983290d15ce17dfafce23bc5d319fcd2a61f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"e6438cef5bc9ef7ff4322231ba64c7ab84df3fb4b789761cdbaf57c75ea816df"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"b11bf26d710db178c267b0625fe13e41c60e620d0c6b5ef6b4fc4f1afdab5dd1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"3ad210d3b184969255849e291a5a372d5a94e2caf7d11acd405e57b730ded29b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"8bc1f5913d6d175e6aa987276fe828c437b8b0c42c06ffac517232c994efe64b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03: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":"d0fad0bd6fdbe335fecb2bcaa95a56e5c0eca1462e686362c09b6ce10e6b3eb9"},"taxa":[{"id":"CWE-494","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":"d2e90a03488b632ddd7b8c0ab237cc7a004a0e5793936cdba144f508c566b4b4"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"23ac4310c9855b836b6dc8c5a3d6b54e4b213d540269ea0207a6b73d3dc19c73"},"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":"3ba9375a86657062becfa4692f491781e28b8b6935d46fb9ad5300d5bb31857e"},"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":"df7178972c060787852fca86728051e837c11f70718fdab7626f30dcbf09fca7"},"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":"3b0367e7ea9bdd389991714fe83002077989c3eac9db9d8bdc3becd4dd073aee"},"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":"9e32e55e302d52a66a940c1ee9efa098f1a38978673f70647b143ab3f74e28a9"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0fba5950f4e6258098f429b7de431fb38347a6e9d1a63aae9a1e2ee383a30927"}},{"ruleId":"D31","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":"ae729529b63648a3d934e46e016eac168cac9a83f6631603c7c9f51f0d747fbd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: MicaDatabaseMigrations.kt \u2192 Song.kt, MicaDatabase.kt, SongEntity.kt: \u0060app/src/main/java/com/mica/music/data/local/MicaDatabaseMigrations.kt\u0060 changes together with 3 other files \u2014 \u0060app/src/main/java/com/mica/music/data/Song.kt\u0060, \u0060app/src/main/java/com/mica/music/data/local/MicaDatabase.kt\u0060, \u0060app/src/main/java/com/mica/music/data/local/SongEntity.kt\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/MicaDatabaseMigrations.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c626f819baa1474e15ad9a19483d53e49c2a5a58310e8b8699e93f492b35190"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: LyricsPreferences.kt \u2194 SettingsLyricsPanel.kt: \u0060app/src/main/java/com/mica/music/data/preferences/LyricsPreferences.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/settings/SettingsLyricsPanel.kt\u0060 change together 87% of the time (13 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 \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 13 shared commits counted here, the most recent 3 are \u0060faaa89e8\u0060 feat(lyrics): add configurable current line positioning; \u00601ba407a7\u0060 feat: add Lyricon lyrics provider integration; \u00603f2fd4ac\u0060 feat: move external lyrics into subpage \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/preferences/LyricsPreferences.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"177fa214505ece292c8c40712ddc55c6556a731bf061b3ee6be14e6778fe4372"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: NowPlayingCoverSection.kt \u2194 NowPlayingScreen.kt: \u0060app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt\u0060 change together 68% of the time (19 of the 28 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 19 shared commits counted here, the most recent 3 are \u006024cda2d8\u0060 feat(player): blend landscape standard cover into background; \u0060cde626d1\u0060 feat: expand custom standard player editing; \u0060628ae4a9\u0060 refactor(player): centralize cover renderers and geometry \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9c466fe2898e22d1ec2799166a3930e24020d757bc6cca48e44e0e15ae19cd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: HomeBrowseContent.kt \u2194 HomeLibraryStats.kt: \u0060app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/home/HomeLibraryStats.kt\u0060 change together 64% of the time (7 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00609e0a955e\u0060 feat(remote): merge remote artists and albums; \u0060efc55ac5\u0060 feat(remote): integrate playback stats and recent history; \u0060faa0ed0a\u0060 Add custom song order and artist count sort \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12067869f27d343437e35742174b2af887e1b37cdcdcd15faf10fd0a94dcbb2b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: PlayerSheetHost.kt \u2194 AppNavigation.kt: \u0060app/src/main/java/com/mica/music/ui/components/PlayerSheetHost.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/navigation/AppNavigation.kt\u0060 change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006089573ff3\u0060 fix(playback): unify progress and lyric presentation clock; \u0060cb3d2746\u0060 feat(player): add direct custom layout editor; \u0060a2b265ec\u0060 feat(library): preserve album and song identity \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/PlayerSheetHost.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6255ae4081c23d8f0d9546e36c5ebde74043151025515cdbf9aedbb8b2e0fd6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: AppUiSettings.kt \u2194 Theme.kt: \u0060app/src/main/java/com/mica/music/data/AppUiSettings.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/theme/Theme.kt\u0060 change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00609ea74226\u0060 feat(lyrics): \u652F\u6301\u6587\u4EF6\u81EA\u5E26\u8BFB\u97F3\u8F68\uFF08TTML \u002B LRC/SPL\uFF09; \u0060c9249375\u0060 feat: complete custom wallpaper workflow; \u00608481c437\u0060 Add custom wallpaper for main UI backgrounds. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/AppUiSettings.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d974ef84194873cb79acec668ae678896f31f462a473de352b196d55805aaaae"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: AppUiSettings.kt \u2194 PlaybackUiPreferences.kt: \u0060app/src/main/java/com/mica/music/data/AppUiSettings.kt\u0060 and \u0060app/src/main/java/com/mica/music/data/preferences/PlaybackUiPreferences.kt\u0060 change together 56% of the time (10 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060623d4fce\u0060 feat(playback): add opt-in auto-play on app launch; \u0060c2b0ae09\u0060 feat(player): show lyrics on polaroid immersive captions; \u0060b3322001\u0060 refactor: fix playback queue icon geometry \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/AppUiSettings.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab72b4680f1aeaa84c7c78e907cc03ca5f1fee2b36fea8a70ebcf9cbea1b5eb5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: LyricsDisplay.kt \u2194 NowPlayingScreen.kt: \u0060app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/NowPlayingScreen.kt\u0060 change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006089573ff3\u0060 fix(playback): unify progress and lyric presentation clock; \u0060e984f4bf\u0060 fix: polish landscape STANDARD track-change and classic lyrics; \u0060b84f8abe\u0060 feat: add lyrics word animation presets \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d709d9bece5231a430583f1c6565dafcd775314eb55a57aa8afe0825ed3ab205"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: SongRow.kt \u2194 HomeBrowseContent.kt: \u0060app/src/main/java/com/mica/music/ui/components/SongRow.kt\u0060 and \u0060app/src/main/java/com/mica/music/ui/screens/HomeBrowseContent.kt\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 \u006018f7fbb1\u0060 feat(library): add optional HQ/SQ/HR quality badges on song rows; \u0060523bc418\u0060 refactor(model): decouple song data from UI; \u0060c5180ee4\u0060 perf: deduplicate cover decoding and reflection baking \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/ui/components/SongRow.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"624e7fdfef134953d646a3c2a53427aa4e166619fa4b1f30609d46c3ead78a20"}},{"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":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: MicaDatabase (16 abstract methods): \u0060MicaDatabase\u0060 declares 16 abstract methods: \u0060songDao\u0060, \u0060songLyricsDao\u0060, \u0060libraryMetaDao\u0060, \u0060libraryStateDao\u0060, \u0060librarySyncStateDao\u0060, \u0060libraryRetryItemDao\u0060, \u0060libraryFollowupOutboxDao\u0060, \u0060libraryMembershipEvidenceDao\u0060, \u0060libraryUserExclusionDao\u0060, \u0060browseGroupDao\u0060, \u0060playlistDao\u0060, \u0060songLyricsOffsetDao\u0060, \u0060remoteSourceDao\u0060, \u0060remoteTrackDao\u0060, \u0060remoteSelectedTrackDao\u0060, \u0060remoteSmbScopeDao\u0060. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/MicaDatabase.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1eceec271fd6c2717371aa52e9d47ebcb6c4a14c9114092b1cb49db1b334520"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: PlaylistDao (21 abstract methods): \u0060PlaylistDao\u0060 declares 21 abstract methods: \u0060ensureState\u0060, \u0060getRevision\u0060, \u0060incrementRevision\u0060, \u0060getPlaylists\u0060, \u0060getSongs\u0060, \u0060upsertPlaylist\u0060, \u0060updatePlaylist\u0060, \u0060insertSongs\u0060, \u0060deleteSongs\u0060, \u0060deletePlaylist\u0060, \u0060deleteAll\u0060, \u0060deleteSong\u0060, \u0060getSongPositions\u0060, \u0060getPlaylistIdsContainingAny\u0060, \u0060getSongsForPlaylist\u0060, \u0060clearCoverSong\u0060, \u0060clearCoverSongs\u0060, \u0060shiftSongsLeft\u0060, \u0060shiftSongsRight\u0060, \u0060updateSongPosition\u0060, \u0060closePositionGap\u0060. Counted over its public functions with no body, once per name; default-bodied functions and properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/PlaylistDao.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"801cd73ca09a21afc7e475234af899d11849638c51b8d8f86971e692c70fda2f"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: BrowseGroupEntity: \u0060BrowseGroupEntity\u0060\u0027s public constructor takes \u0060kind\u0060, \u0060groupKey\u0060, \u0060title\u0060, \u0060subtitle\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060BrowseGroupEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/BrowseGroupEntity.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"39478e31d6380195e9b0334b3ef0f3eb72ec9a8d4c19259ddd2363b2571f2225"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: LibrarySyncCheckpointEntity: \u0060LibrarySyncCheckpointEntity\u0060\u0027s public constructor takes \u0060source\u0060, \u0060stableIdentity\u0060, \u0060partitionKey\u0060, \u0060providerVersion\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060LibrarySyncCheckpointEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/LibraryAutoSyncStateEntities.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e31b1a2eff334a2a2614551290ae386958bef783d51f907447821618d132a9"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: LibraryRetryItemEntity: \u0060LibraryRetryItemEntity\u0060\u0027s public constructor takes \u0060source\u0060, \u0060stableIdentity\u0060, \u0060retryKey\u0060, \u0060stableObjectKey\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060LibraryRetryItemEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/LibraryAutoSyncStateEntities.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cbf8f67a9a9c2e628e4b7644c632a2dc0903d7c915555a98afb41ad62511b2"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: LibraryFollowupOutboxEntity: \u0060LibraryFollowupOutboxEntity\u0060\u0027s public constructor takes \u0060eventId\u0060, \u0060action\u0060, \u0060source\u0060, \u0060stableIdentity\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060LibraryFollowupOutboxEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/LibraryAutoSyncStateEntities.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b41e023e405552140e34ecb27579967e9e3e36723670584577322cf478cbda9"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: LibraryMembershipEvidenceEntity: \u0060LibraryMembershipEvidenceEntity\u0060\u0027s public constructor takes \u0060source\u0060, \u0060stableIdentity\u0060, \u0060stableObjectKey\u0060, \u0060songId\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060LibraryMembershipEvidenceEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/LibraryAutoSyncStateEntities.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a7480252649ccff1fa83e95906efc0703d2d065fd73d565dbb7a0d723d237a"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: LibraryUserExclusionEntity: \u0060LibraryUserExclusionEntity\u0060\u0027s public constructor takes \u0060source\u0060, \u0060stableIdentity\u0060, \u0060stableObjectKey\u0060 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060LibraryUserExclusionEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/LibraryAutoSyncStateEntities.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c5fbf0ed486c636f40c88ca613ed2d374f82800d7f1df724d9bdccc3ee2214"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: LibraryStateEntity: \u0060LibraryStateEntity\u0060\u0027s public constructor takes \u0060intent\u0060, \u0060access\u0060, \u0060activeSource\u0060, \u0060activeStableIdentity\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060LibraryStateEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/LibraryStateEntity.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e242ee7c2b8caf145d33179453b2ee2327cfee51203ff0bfe07b2eb54857a4da"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: PlaylistEntity: \u0060PlaylistEntity\u0060\u0027s public constructor takes \u0060id\u0060, \u0060name\u0060, \u0060sortField\u0060, \u0060sortDirection\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060PlaylistEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/PlaylistDao.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8da52e87e25459c6764ac4b626fe86cf35847c7f2bb4ce281c57b7210dd28c4"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: PlaylistSongEntity: \u0060PlaylistSongEntity\u0060\u0027s public constructor takes \u0060playlistId\u0060, \u0060songId\u0060 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060PlaylistSongEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/PlaylistDao.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb4769f8267bc71dc6dfee28122e867398af4dd31e2e08f6f4e2b68f9ad49e8"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: RemoteSmbScopeEntity: \u0060RemoteSmbScopeEntity\u0060\u0027s public constructor takes \u0060id\u0060, \u0060sourceInstanceId\u0060, \u0060relativeDirectory\u0060, \u0060kind\u0060 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060RemoteSmbScopeEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/RemoteSmbScopeEntity.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fded2881cd8bea2ba486e87f9c81d46def1b1cf0ba514900f635187ffe490f89"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: RemoteSmbScopeTrackEntity: \u0060RemoteSmbScopeTrackEntity\u0060\u0027s public constructor takes \u0060scopeId\u0060, \u0060opaqueTrackId\u0060 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060RemoteSmbScopeTrackEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/RemoteSmbScopeEntity.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da45fb5ec2c655f1afa7dcf94e4d021fbf8f095f15c60080fa8c4e3fdb34a20"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: RemoteSourceEntity: \u0060RemoteSourceEntity\u0060\u0027s public constructor takes \u0060id\u0060, \u0060type\u0060, \u0060displayName\u0060, \u0060endpoint\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060RemoteSourceEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/RemoteSourceEntity.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc7061d5cb67436df845a694d9ffc3a6d8df56cfda82ae6fe71e716e275d9b0"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: RemoteTrackEntity: \u0060RemoteTrackEntity\u0060\u0027s public constructor takes \u0060sourceInstanceId\u0060, \u0060opaqueTrackId\u0060, \u0060title\u0060, \u0060artist\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060RemoteTrackEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/RemoteTrackEntity.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f9e39e10941d8f5d3af693be7b57ff7c25be1ce6f41417f1d1e58be2ca0e3d"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: SongLyricsOffsetEntity: \u0060SongLyricsOffsetEntity\u0060\u0027s public constructor takes \u0060songId\u0060, \u0060mediaUri\u0060 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060SongLyricsOffsetEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/SongEntity.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9657da480be578f2ab56b59758700c9728a106220282310366907ce28f10ff3c"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: SongLyricsEntity: \u0060SongLyricsEntity\u0060\u0027s public constructor takes \u0060songId\u0060, \u0060slot\u0060, \u0060revision\u0060, \u0060lyricsJson\u0060 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060SongLyricsEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/SongEntity.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"762bfbc4b6fabf3a0279a2e063a9f4cb198a2f701f1d841b2ac3fb3a93dd81ca"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: PendingSongLyricsEntity: \u0060PendingSongLyricsEntity\u0060\u0027s public constructor takes \u0060scanId\u0060, \u0060songId\u0060, \u0060revision\u0060, \u0060embeddedJson\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060PendingSongLyricsEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/SongEntity.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c6dd6d5d59b57cb6a4d6ecc91abf578d56a111988de9b739b35ba72a1a4631"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: SongEntity: \u0060SongEntity\u0060\u0027s public constructor takes \u0060id\u0060, \u0060title\u0060, \u0060artist\u0060, \u0060album\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060SongEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/SongEntity.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aed18c47b4de6c46f841a35b5235a9b8b6d9348152818b86c3b8d28533b6112"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: LibraryMetaEntity: \u0060LibraryMetaEntity\u0060\u0027s public constructor takes \u0060lastScanSource\u0060, \u0060sortField\u0060, \u0060sortDirection\u0060, \u0060fastScrollSectionsJson\u0060, \u2026 as raw primitives, and neither of the two things that would make that safe was found. What was searched, so you can tell an absence from a miss: for VALIDATION, the constructor body was scanned for \u0060throw\u0060, \u0060Guard.\u0060, \u0060Ensure.\u0060, \u0060ArgumentNullException\u0060, \u0060ArgumentException\u0060, \u0060CheckRule\u0060, \u0060Requires.\u0060 or an \u0060\u2026Exception.ThrowIf\u2026(\u0060 helper, and so was any method of this type it calls \u2014 a guard reached further than that is not seen. A static factory beside it was NOT counted: while this constructor is public a caller can skip the factory. If the constructor validates in a way this search misses, this row is wrong. If it does not, a caller can build a \u0060LibraryMetaEntity\u0060 that breaks the rules it exists to enforce, and every rule downstream then has to cope with a state the model said was impossible. Guard in the constructor, take value objects that validate themselves, or make the constructor private behind a \u0060Create\u0060 that can refuse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/local/SongEntity.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"793a9f10a8d0490a587674c081802faabaede19a8a9c47de3756864879f7d5ac"}},{"ruleId":"DM2","level":"note","message":{"text":"Primitive id on a domain type: Mutation.songId: \u0060Mutation.songId\u0060 is a raw \u0060String\u0060 \u2014 give it a strongly-typed id: a dedicated single-field type wrapping the \u0060String\u0060, in whatever form your language spells that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/PlaybackStatisticsRepository.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"045869fda742b214a599310c9624dafb8b5c82174b2d2518ea6c5ef4b1780d9e"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add spotbugs with find-sec-bugs (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 4 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/android-tests.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060build.gradle.kts\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.gradle.kts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4369de275300dac0d50dbff2ad6a475e44a0d9d95c5ef0a8fa46bbc9b71411d0"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!directory.exists() \u0026\u0026 !directory.mkdirs()\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/AppWallpaperStore.kt, app/src/main/java/com/mica/music/data/PlaylistCoverImporter.kt. 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":"app/src/main/java/com/mica/music/data/AppWallpaperStore.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5fa36920bc4029ea760e8e0b6e47751e012c8a625f78ff6a064fb1d54a8222"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!it.isRecycled \u0026\u0026 it.width \u003E 0 \u0026\u0026 it.height \u003E 0\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt, app/src/main/java/com/mica/music/ui/theme/RainGlassBackdrop.kt. 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":"app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackgroundView.kt"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fcfc128b4bc8a5c54238a09ea93c7ea7c5bdb18f2defbc69cd567268389c43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!name.endsWith(\u0022.lrc\u0022, ignoreCase = true) \u0026\u0026 !name.endsWith(\u0022.ttml\u0022, ignoreCase = true)\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt, app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedLyricsSidecarInventory.kt. 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":"app/src/main/java/com/mica/music/data/scanner/MediaStoreLyricsSidecarInventory.kt"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99ef3b8e5a03b36f308f31826a55c20377488d75e36598f019e4813f18bdaff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060awaitingCommittedPlayIndex == null || index == lastSupersededHostIndex\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt, app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt. 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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"015676b21fd927f34f82ee78865eb056a44b7bf40072f9650ea5f5805b810797"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060backing.released || backing.releaseRequested\u0060 appears character-identically in 4 files \u2014 app/src/main/java/com/mica/music/data/library/LibraryOperationAuthority.kt, app/src/main/java/com/mica/music/data/library/LibraryPublicationAuthority.kt, app/src/main/java/com/mica/music/data/library/LibraryScanEngine.kt, app/src/main/java/com/mica/music/data/library/LibrarySyncScheduler.kt. 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":"app/src/main/java/com/mica/music/data/library/LibraryOperationAuthority.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ed86925d0f32695013baf8d2ef5dadcf4fc96d8e2432ceb94de73dca86bd44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bitmap != null \u0026\u0026 !bitmap.isRecycled \u0026\u0026 bitmap.width \u003E 0 \u0026\u0026 bitmap.height \u003E 0\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt, app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt. 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":"app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0363a59f44720b7fb2aa36b894c886f5b6c5f850b641305790589255372a33b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bounds.outWidth \u003C= 0 || bounds.outHeight \u003C= 0\u0060 appears character-identically in 5 files \u2014 app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt, app/src/main/java/com/mica/music/data/AppLetterSealImporter.kt, app/src/main/java/com/mica/music/data/AppWallpaperImporter.kt, app/src/main/java/com/mica/music/data/PlaylistCoverImporter.kt. 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":"app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7d56670eb0457514384b9fe976576c803181ecb3864ca3144bde342b458ed6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bufferOffset \u003E= 0 \u0026\u0026 length \u003E= 0 \u0026\u0026 bufferOffset \u002B length \u003C= buffer.size\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/mica/music/data/remote/SeekableByteSource.kt, app/src/main/java/com/mica/music/data/remote/smb/SmbSeekableByteSource.kt, app/src/main/java/com/mica/music/data/remote/webdav/WebDavSeekableByteSource.kt. 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":"app/src/main/java/com/mica/music/data/remote/SeekableByteSource.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4245b1da11841954e5325d249c9833e3005230f55cf3dd6b5a9a51ed74e96e07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes[i] == 0.toByte() \u0026\u0026 bytes[i \u002B 1] == 0.toByte()\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt, app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt, app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt. 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":"app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7df1c172070d49761b90b822946e451f9c5f0fe2fcab57403e7f05c98f51cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cause == LibraryOperationCause.MEDIASTORE_AUDIO_DIRTY || cause == LibraryOperationCause.MEDIASTORE_FILES_DIRTY\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/library/LibraryDirtySignalObserver.kt, app/src/main/java/com/mica/music/data/library/SafAutoSyncTargetedHint.kt. 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":"app/src/main/java/com/mica/music/data/library/LibraryDirtySignalObserver.kt"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5af003abbcae354e3e86fc879abeb380f244276eaa54dd39d7b180fd591550b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060columnIndex \u003E= 0 \u0026\u0026 !isNull(columnIndex)\u0060 appears character-identically in 9 files \u2014 app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt, app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt, app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt, app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt. 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":"app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde3684d7266a5866edbb218289d6ebc6b587f65fafcf8e25810b67ca8376c96"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060containerWidthPx \u003E 0 \u0026\u0026 textWidthPx \u003E containerWidthPx\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/components/MarqueeTitleText.kt, app/src/main/java/com/mica/music/ui/components/MiniPlayer.kt. 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":"app/src/main/java/com/mica/music/ui/components/MarqueeTitleText.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"74906e988ad2dbcfce8ffc6dc38ae1139149f96509684756ae0ec2629768a01e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060count != 0 || lastPlayedAtMs != 0L || totalListenSeconds != 0L\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/PlayHistoryStore.kt, app/src/main/java/com/mica/music/data/remote/RemotePlayStatsPresentation.kt. 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":"app/src/main/java/com/mica/music/data/PlayHistoryStore.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeff465f7c3b40dc726d2715b485a353f93327712500f3dbeca4e8f508142fb2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060coverFlowMode == PlayerCoverFlowMode.PAUSE_FOLD || coverFlowMode == PlayerCoverFlowMode.RETRO_3D\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt, app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt. 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":"app/src/main/java/com/mica/music/ui/screens/NowPlayingCoverSection.kt"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e879790045bf5422e9efa603771284eb21b0b3a4723363555126dec01894c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060currentWidth \u003E MAX_DECODE_SIDE_PX || currentHeight \u003E MAX_DECODE_SIDE_PX\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt, app/src/main/java/com/mica/music/data/AppWallpaperImporter.kt, app/src/main/java/com/mica/music/data/PlaylistCoverImporter.kt. 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":"app/src/main/java/com/mica/music/data/AppHiResBadgeImporter.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"914e5ccbba718d983b6b8edcc1f7b31f04deb5a1f298ac5304505428d0705f45"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data[i] == 0xFF.toByte() \u0026\u0026 i \u002B 1 \u003C data.size \u0026\u0026 data[i \u002B 1] == 0.toByte()\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt, app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt, app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt. 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":"app/src/main/java/com/mica/music/data/scanner/DsdMetadataReader.kt"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1dfd1a392789d4f09868852783da90bc0670ceb619ece9c5d79e496d92f54c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dragging || trackAnimator != null || settleAnimator != null || pendingPlayQueueIndex != null\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt, app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt. 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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"58964de87fc5a309b62347e847d68b3a524a19e51cb9f67bcc40f28135e126c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index != latestTarget \u0026\u0026 SystemClock.uptimeMillis() \u003C hostIndexGuardUntilMs\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt, app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt. 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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cd8d5a8d2c65a012e7983f3f6767b7419e7514d43cc3548e6d5570a41a0021"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index != pendingPlay \u0026\u0026 index != lastSupersededHostIndex\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt, app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt. 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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd209b4d79a6d28563ff6e9df6b8d93e7fc4df15ac4136cca8664a215183520"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inputEnded \u0026\u0026 !pendingInput.hasRemaining()\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/media/MicaAudioProcessorChain.kt, app/src/main/java/com/mica/music/media/PipelineFormatTraceAudioProcessor.kt. 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":"app/src/main/java/com/mica/music/media/MicaAudioProcessorChain.kt"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c0be0e0081948be88016f9bbd400bce1a34ffcbbb367fc6ba392fe5d9aa297"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inputEnded \u0026\u0026 !pendingOutput.hasRemaining()\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizerAudioProcessor.kt, app/src/main/java/com/mica/music/media/SpectrumAudioProcessor.kt. 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":"app/src/main/java/com/mica/music/audio/eq/SoftwareEqualizerAudioProcessor.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf191d83932b3800fbd8bafba4a06142d8eccff1c91b55f7b8e7b1df49558a25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isMusic || mime.startsWith(\u0022audio/\u0022, ignoreCase = true)\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt, app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt. 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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b6224d2e13d0881399f3a7064a1e2186c856a62c34cc649f8d028590b86e4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it == Player.REPEAT_MODE_OFF || it == Player.REPEAT_MODE_ONE || it == Player.REPEAT_MODE_ALL\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt, app/src/main/java/com/mica/music/media/ServicePlaybackBootstrapResolver.kt. 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":"app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab514f9f1735abb8095f29d721f084bb90a9c93f837954638514b9c8aeb86dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.activationEpoch == null || it.activationEpoch == activationEpoch\u0060 appears character-identically in 4 files \u2014 app/src/main/java/com/mica/music/data/library/DeviceAutoProbePlanner.kt, app/src/main/java/com/mica/music/data/library/DeviceShadowRetryPlanner.kt, app/src/main/java/com/mica/music/data/library/SafShadowRetryPlanner.kt, app/src/main/java/com/mica/music/data/library/SafUnknownFingerprintDebtPlanner.kt. 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":"app/src/main/java/com/mica/music/data/library/DeviceAutoProbePlanner.kt"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9be85cc3ac236c6e6b4dba9ff233499a8107f1ced70129b027f7f348a6a6f20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.id == AUDIO_CONTROL_INTERFACE_ID \u0026\u0026 it.alternateSetting == 0\u0060 appears character-identically in 2 files \u2014 app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02AudioOutputProvider.kt, app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt. 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02AudioOutputProvider.kt"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"768907a0be438739b56e863e4dcd98b0fea21111208089fecc9ad962113484d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.id == AUDIO_STREAMING_INTERFACE_ID \u0026\u0026 it.alternateSetting == 0\u0060 appears character-identically in 2 files \u2014 app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02AudioOutputProvider.kt, app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt. 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02AudioOutputProvider.kt"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a02197df2a9ca144ef682851e314760d718334b9ee7c593da9875d983c7e2a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.isBlank() || it == MediaStore.UNKNOWN_STRING\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt, app/src/main/java/com/mica/music/data/scanner/MediaStoreScanner.kt. 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":"app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"61900007796fc874cd3beceb0d8135d4c1a67d5e1ed23f962d461b3ee8e07117"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.partRole == LyricTextRole.ORIGINAL || it.partRole == LyricTextRole.EXTRA\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt, app/src/main/java/com/mica/music/ui/screens/LetterLyricsTiming.kt. 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":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a21db8bf00fff3a2e0a6c9f75f2fc92ff4b166b49f32436dcc2d04f56316a07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.role == LyricTextRole.ORIGINAL || it.role == LyricTextRole.EXTRA\u0060 appears character-identically in 5 files \u2014 app/src/main/java/com/mica/music/data/LyricDisplayRows.kt, app/src/main/java/com/mica/music/media/DesktopLyricsOverlayState.kt, app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt, app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt. 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":"app/src/main/java/com/mica/music/data/LyricDisplayRows.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e722126789864387c1a186c1bf207c3da754807ea3daf2760e504c244a636a9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.vendorId == TARGET_VENDOR_ID \u0026\u0026 it.productId == TARGET_PRODUCT_ID\u0060 appears character-identically in 3 files \u2014 app/src/debug/java/com/mica/music/media/usbprototype/UsbKernelDriverReconnectOwner.kt, app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02AudioOutputProvider.kt, app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt. 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbKernelDriverReconnectOwner.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3a7a2b868538c43cfd4dcd5334339aa6f8573219bec23e2ef65b5a26ed6af1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.videoCoverUri != null || it.musicVideoUri != null\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt, app/src/main/java/com/mica/music/data/library/SafShadowRelationRematcher.kt. 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":"app/src/main/java/com/mica/music/data/library/SafAutoSyncPipeline.kt"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9fe8cbbb305e4c38ba0785d2d1233ad7f8e336a434d0ce6260bad5602b7d7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.mediaId.isBlank() || mediaUri.isBlank()\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/media/ExternalMediaItemCodec.kt, app/src/main/java/com/mica/music/media/SongMediaItemCodec.kt. 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":"app/src/main/java/com/mica/music/media/ExternalMediaItemCodec.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50f2aba7f08558fa6018204aa0fe30c1ac6d5a9e606c2ca9649c615c5d4068f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.contains(\u0022LYRIC\u0022) || key.contains(\u0022UNSYNCED\u0022)\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt, app/src/main/java/com/mica/music/data/scanner/Mp4LyricsReader.kt. 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":"app/src/main/java/com/mica/music/data/scanner/EmbeddedLyricsReader.kt"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d0769f225cc66c37554ef422e9e99f9f6617fc73f53449b2bc5119d8ab7f57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060locateRequestKey \u003E 0 \u0026\u0026 locateSongId != null\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/mica/music/ui/components/PlaylistSongListPanel.kt, app/src/main/java/com/mica/music/ui/components/SongListPanel.kt, app/src/main/java/com/mica/music/ui/screens/home/RemoteLibraryPane.kt. 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":"app/src/main/java/com/mica/music/ui/components/PlaylistSongListPanel.kt"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ceeffed27ff5f4a08d2fd23df907999d9c5b0f06221d9cc5a5aa6458c2b9fc6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060old.folderPath != new.folderPath || old.filePath != new.filePath\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt, app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt. 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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c7df9986f8b997f0fdc29760a4b3a4ca3b130592ec49b8acfa2226038bcb26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060old.id == new.id \u0026\u0026 old.albumArtUri == new.albumArtUri \u0026\u0026 old.coverColorArgb == new.coverColorArgb\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt, app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt. 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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"396416ff1db73181a45d42d5068531be769cc44f8db46555023ab511a3ea9b42"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060old.mediaUri != new.mediaUri || old.fileName != new.fileName\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt, app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt. 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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2748c3e2553172802e092cda5e56b58c3ec9ea4142590b0d8f0d5bd01cf7a71"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060old.musicVideoUri != new.musicVideoUri || old.musicVideoRevision != new.musicVideoRevision\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt, app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt. 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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96098caba6e5b46c7b67d37c7ed6bc9945ff1ae54af5fccf1babf34e2d69cea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060old.sizeBytes != new.sizeBytes || old.dateModifiedMs != new.dateModifiedMs\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt, app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt. 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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd74ce8e6862d975b3836f6620c268525cd73fa5a6744dcb7ef57f1b88cb2ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060old.title != new.title || old.artist != new.artist || old.album != new.album || old.albumArtist != new.albumArtist || old.durationSec != new\u2026\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt, app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt. 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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90286d0d409c8a7ca6eb613965d25272a7bdf4c3b70fe64992a856463e97003"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060old.videoCoverUri != new.videoCoverUri || old.videoCoverRevision != new.videoCoverRevision\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt, app/src/main/java/com/mica/music/data/scanner/DeviceShadowCanonicalCatalog.kt. 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":"app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3bdb89dab008190c8ad48a51dc8404b83d0b18d16d18349f58abd89c692012"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060operation.source.instance.type != RemoteSourceType.NAVIDROME || !operation.source.instance.enabled\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkRequestResolver.kt, app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeLyricsLoader.kt, app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeStreamRequestResolver.kt. 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":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkRequestResolver.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6994d162f5fccd3057b1ef049a58ab32ce6db698c6d016c553b120e59eb91428"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.minDurationMs \u003C= 0L || durationMs \u003C= 0L || durationMs \u003E= options.minDurationMs\u0060 appears character-identically in 5 files \u2014 app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt, app/src/main/java/com/mica/music/data/scanner/DeviceObjectRevisionReader.kt, app/src/main/java/com/mica/music/data/scanner/DeviceShadowProbeDraftReader.kt, app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt. 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":"app/src/main/java/com/mica/music/data/scanner/DeviceMediaStoreDeltaReader.kt"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8226fd06c405ec0a838e58acad46b25fe6d513aae1acc18fd90970369794c42b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pending != null \u0026\u0026 lastPlay != null \u0026\u0026 pending != lastPlay\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt, app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt. 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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"70136cd1b841bf9b98812fd06eab2cfd8e99ba40390baaafb03623b9d6d8c79e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060permission == null || context.checkSelfPermission(permission) == PackageManager.PERMISSION_GRANTED\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt, app/src/main/java/com/mica/music/data/scanner/MediaStoreTrackedPresenceInventory.kt. 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":"app/src/main/java/com/mica/music/data/scanner/MediaStorePresenceInventory.kt"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e1b1ea67e1072ed68b8fa2d444e63864835ecd0600ae5e8f22d85cc4cf966a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previous != null \u0026\u0026 base.contentRevision.isNotBlank() \u0026\u0026 previous.contentRevision == base.contentRevision \u0026\u0026 previous.sizeBytes == base.size\u2026\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt, app/src/main/java/com/mica/music/data/remote/webdav/WebDavCatalogAdapter.kt. 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbSourceSync.kt"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"358380f08e3005525547d65c6e907fa637aa430d4bacac1d419dd1e16306c832"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060projection.fullyResolved \u0026\u0026 diff.changes.isEmpty()\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/library/DeviceShadowCanonicalProjector.kt, app/src/main/java/com/mica/music/data/library/SafShadowCanonicalProjection.kt. 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":"app/src/main/java/com/mica/music/data/library/DeviceShadowCanonicalProjector.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d6d2ef8ea98c36ea1076ccb2d661f34b190eec0c5338f642be745fce3ab0bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reason == Player.DISCONTINUITY_REASON_SEEK || reason == Player.DISCONTINUITY_REASON_SEEK_ADJUSTMENT\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt, app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt. 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":"app/src/main/java/com/mica/music/media/NotificationLyricsCoordinator.kt"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6223215a4f7067ebdb0023cfe6b265d3226243a921156c814558d59eb09d0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.code == 401 || response.code == 403\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt, app/src/main/java/com/mica/music/data/remote/webdav/WebDavLyricsTransport.kt. 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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5df801ffa657a02115df7a40ad01dac00031d3654e31afcfb6e4b8fce699e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result !is SuccessResult \u0026\u0026 MicaImageLoaders.recoverAfterLoadFailure(context, albumArtUri)\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt, app/src/main/java/com/mica/music/ui/theme/DynamicLightGlBackground.kt. 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":"app/src/main/java/com/mica/music/ui/theme/DynamicArtworkBackground.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58980c088cf382b1f5782859df70d7afe6a45d0a2bcf4eacbcc3be0093a7483"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060retryUpserts.isEmpty() \u0026\u0026 retryDeleteKeys.isEmpty()\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/mica/music/data/library/DeviceShadowRetryPlanner.kt, app/src/main/java/com/mica/music/data/library/SafShadowRetryPlanner.kt, app/src/main/java/com/mica/music/data/library/SafUnknownFingerprintDebtPlanner.kt. 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":"app/src/main/java/com/mica/music/data/library/DeviceShadowRetryPlanner.kt"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bfc5cdfd2f83e5d2d70b434fccba6eadcb47bb7f6f639787894f5eb4532808"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060song.mediaUri == stableUri \u0026\u0026 song.playbackUri == null\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt, app/src/main/java/com/mica/music/media/RemoteMediaItemProvider.kt. 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":"app/src/main/java/com/mica/music/data/playback/ServicePlaybackStateStore.kt"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"18339f37bea9a4f95c9873afe4909848a9c09e0440a6e9e8ee12cad3ea306fdf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.type != RemoteSourceType.SMB || !source.enabled\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt, app/src/main/java/com/mica/music/data/remote/smb/SmbPlaybackTransport.kt. 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbArtworkTransport.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e445dc199cecc73ee15ae98c8c11e075a7c65e34a3807d409c846537aaae92e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.type != RemoteSourceType.WEBDAV || !source.enabled\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt, app/src/main/java/com/mica/music/data/remote/webdav/WebDavStreamRequestResolver.kt. 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":"app/src/main/java/com/mica/music/data/remote/webdav/WebDavArtworkTransport.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f962566f620c374764d69d4244936f045b51c394e25a06e47f915881ded97c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.type == RemoteSourceType.SMB \u0026\u0026 source.enabled\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/remote/smb/SmbBrowser.kt, app/src/main/java/com/mica/music/data/remote/smb/SmbFolderLibraryIndexer.kt. 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":"app/src/main/java/com/mica/music/data/remote/smb/SmbBrowser.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d2048cc58ce35d9616b453fbd902a7f212103ff4c41bdd84c0b05fac4a0e19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state == Player.STATE_IDLE || state == Player.STATE_ENDED\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/media/MicaSessionPresentationPlayer.kt, app/src/main/java/com/mica/music/playback/PlaybackRuntime.kt. 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":"app/src/main/java/com/mica/music/media/MicaSessionPresentationPlayer.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a9cc47d7f9bc898b2dae75940d1cdff968920badd5d5cbe0706bc92dedf7c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.desiredMode != DesiredUsbOutput.Shared || state.phase != UsbOutputPhase.SharedRouteWaiting\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/media/UsbOutputCoordinator.kt, app/src/main/java/com/mica/music/media/usbhybrid/UsbOutputStateMachine.kt. 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":"app/src/main/java/com/mica/music/media/UsbOutputCoordinator.kt"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7afc470a2effc5cf4cde064b7cd920e60f35f9c5306e410e910177fc2bdb84"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status == HttpURLConnection.HTTP_UNAUTHORIZED || status == HttpURLConnection.HTTP_FORBIDDEN\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt, app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeHttpExecutor.kt. 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":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeArtworkHttpStreamer.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f347119e4fbb96647aafc743d21f0a99f9e88ac00b481cb944ef2814855ae507"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target == null || !manager.hasPermission(target)\u0060 appears character-identically in 2 files \u2014 app/src/debug/java/com/mica/music/media/usbprototype/UsbKernelDriverReconnectOwner.kt, app/src/debug/java/com/mica/music/media/usbprototype/UsbSk02DescriptorPrototypeReceiver.kt. 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":"app/src/debug/java/com/mica/music/media/usbprototype/UsbKernelDriverReconnectOwner.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"83891d542867aeb07cd64d9eff915b7d7cd54b7664963c8b7cbd9e017fc27209"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060textLayout == null || fillFraction \u003C= 0f\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt, app/src/main/java/com/mica/music/ui/components/NarrowBarSoftKaraokeLyric.kt. 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":"app/src/main/java/com/mica/music/ui/components/LyricsDisplay.kt"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bdd5ee8445908032b6371df50e5383393fec673bc150b25cf95bac50a5d288"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.partRole == LyricTextRole.ORIGINAL || token.partRole == LyricTextRole.EXTRA\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/LyricDisplayRows.kt, app/src/main/java/com/mica/music/ui/screens/LyricsCloudPanel.kt. 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":"app/src/main/java/com/mica/music/data/LyricDisplayRows.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb753bfde4711cd37c6cdb2a7ce118ad10093ab091002eb0082ee406fa542d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trackAnimator != null \u0026\u0026 !replaceRunningTrack\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt, app/src/main/java/com/mica/music/ui/screens/player/view/PhotoStackTransitionView.kt. 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":"app/src/main/java/com/mica/music/ui/screens/player/view/CoverFlowCarouselView.kt"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ea74081f682caf15d17d54517138230e4c66d436f8e1880dac1ce8b47d940a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060uri.rawQuery == null \u0026\u0026 uri.rawFragment == null\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt, app/src/main/java/com/mica/music/data/remote/smb/SmbPathCodec.kt. 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":"app/src/main/java/com/mica/music/data/remote/RemoteSourceManager.kt"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbe43d2cc1d26a0688f91d2995e16b292fd73e3a52154e6bfa9b91dbe292264"}},{"ruleId":"X2","level":"note","message":{"text":"Not all suspend functions that make a request accept the coroutine\u0027s cancellation: Only 0/2 suspend functions that make a cancellable request (Ktor, OkHttp newCall, URL streams) accept the coroutine\u0027s cancellation 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. In a suspend function, make the request with a call that suspends \u2014 Ktor, OkHttp\u0027s \u0060executeAsync()\u0060, or a \u0060suspendCancellableCoroutine\u0060 that cancels the \u0060Call\u0060 \u2014 not a blocking \u0060execute()\u0060: \u0060withContext(Dispatchers.IO)\u0060 moves the call off the caller\u0027s thread but does not make it cancellable; 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":"97a0137a13dc63b0e07ec4e232770b687c26a8a2030f49787e45a4506416c527"}},{"ruleId":"X2","level":"warning","message":{"text":"Suspend function with a blocking request: fetchManifestFromNetwork: \u0060fetchManifestFromNetwork\u0060 suspends, but makes its request with \u0060URL(\u2026).openConnection()\u0060, which blocks: its caller\u0027s cancellation cannot reach the request, so it runs to its end after whatever wanted it has given up \u2014 \u0060withContext(Dispatchers.IO)\u0060 moves it off the caller\u0027s thread and does not change that. Make the request with a call that suspends: Ktor, OkHttp\u0027s \u0060executeAsync()\u0060, or a \u0060suspendCancellableCoroutine\u0060 over \u0060enqueue\u0060 that cancels the \u0060Call\u0060 in \u0060invokeOnCancellation\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/update/AppUpdate.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9562f09b667d2be5420e84c28f4035c20baf44791be569ddf9740fde4335c207"}},{"ruleId":"X2","level":"warning","message":{"text":"Suspend function with a blocking request: execute: \u0060execute\u0060 suspends, but makes its request with \u0060URL(\u2026).openConnection()\u0060, which blocks: its caller\u0027s cancellation cannot reach the request, so it runs to its end after whatever wanted it has given up \u2014 \u0060withContext(Dispatchers.IO)\u0060 moves it off the caller\u0027s thread and does not change that. Make the request with a call that suspends: Ktor, OkHttp\u0027s \u0060executeAsync()\u0060, or a \u0060suspendCancellableCoroutine\u0060 over \u0060enqueue\u0060 that cancels the \u0060Call\u0060 in \u0060invokeOnCancellation\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/remote/navidrome/NavidromeHttpExecutor.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03ca92f2e2d9afa10781f041dd529ca62b23c177b877826a284e44110cb96c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: RuntimeException)\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":"app/src/main/java/com/mica/music/ui/screens/player/view/VideoAlbumCoverHost.kt"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e954d364e363f8a7bf3f3dc5cb8d331f48cdfad8ffec0db8a587d0844937ce9"}},{"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":"app/src/main/java/com/mica/music/data/scanner/AudioMetadataProbe.kt"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a4a14b42ddc7aa6a9d769927ca154dfdb12d554947e637c92e967a80feb8ff"}},{"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":"app/src/main/java/com/mica/music/data/scanner/AudioTechnicalProbe.kt"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca4022ca2b94609de128b48759ee25c58bd9ae51339a575eb3b34cc53081def"}},{"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":"app/src/main/java/com/mica/music/data/scanner/AudioTrackProbe.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"947a9a423f3e948cf7b6c8996ed6721bd556feeca5e6a24bc9b297ab94070460"}},{"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":"app/src/main/java/com/mica/music/data/scanner/EncoderSettingsReader.kt"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"6200bf67bfc5bf35703cc1d91f72f68436e330668c6724c095212b9fb8638d0b"}},{"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":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d5eb773e608caa517b88c0b4045875860111d512e951fe18c1fa6b5820384c"}},{"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":"app/src/main/java/com/mica/music/data/scanner/FolderScanner.kt"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"f707bb0ccee31f9b1929973e11114190ab896a134921cfcb423453795efb9272"}},{"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":"app/src/main/java/com/mica/music/data/scanner/VideoCoverPosterPrefetcher.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b135f387a5a47a6449a3c50840043fe8722fbfd88c2e9214e72d387ae32cb7b0"}},{"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":"app/src/main/java/com/mica/music/data/scanner/VideoCoverPosterStore.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f494c682a6633ac1bb64e728d4a7e8720296f65dfe14044c71ca931e5217c2"}},{"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":"app/src/main/java/com/mica/music/data/library/LibraryDirtySignalObserver.kt"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6312d8ed09fe03661136ffa6ced303c41b51609c28d762a5d9f851d42c1f6051"}},{"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":"app/src/main/java/com/mica/music/data/library/LibraryDirtySignalObserver.kt"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a82e678e1e3b8bcaba947833e60b56eb5332542819a0f03cc54c4263433c283"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readSelfVmRssKb\u0060 swallows every exception into \u0060-1L\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":"app/src/debug/java/com/mica/music/data/LibraryAutoSyncQaProfileService.kt"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf472a13c4d02b0f2fd07e8806ee8d77072c4ab106e03aafa65b3ef2dc66a901"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listProfiles\u0060 swallows every exception into \u0060emptyList()\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":"app/src/main/java/com/mica/music/data/EqCustomProfileStore.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc2dffe854bf907f6e2fb6ed246734108b2807dec00536e569ab99fa546225e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060decodeSongIds\u0060 swallows every exception into \u0060emptyList()\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":"app/src/main/java/com/mica/music/data/PlaybackSessionStore.kt"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00d2b2f86a7bac04433b604a9b40fa78aa1482214c548fb3589d796da023cb9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060canonicalFullDate\u0060 answers \u0060\u0022\u0022\u0060 when \u0060DateTimeParseException\u0060 is thrown, with no log or throw \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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/mica/music/data/ReleaseDate.kt"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02615d71f3f86081db80b6f2f76ab5abda85ff2d13aab2796c23547ed92d802"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060customSongOrderIds\u0060 swallows every exception into \u0060emptyList()\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":"app/src/main/java/com/mica/music/data/preferences/LibraryBrowseSettings.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"829a05aa41462abe26029e070b8897d6a0bc0c9802a737c89a44ca8790b92de9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readStringArray\u0060 swallows every exception into \u0060emptyList()\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":"app/src/main/java/com/mica/music/data/preferences/LibraryBrowseSettings.kt"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d26ae1cc3cde4e8e23b430b110d77a08aab71c0106a1e44b5fb09bb4531df9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060decodeStrict\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":"app/src/main/java/com/mica/music/data/scanner/LyricsEncoding.kt"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30ec44918abb34d1e868c2a6da1f9b07c0741527fdbee0f2261d4577f3e84e0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060installedEffectCandidates\u0060 swallows every exception into \u0060emptyList()\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":"app/src/main/java/com/mica/music/util/AudioEnvironmentDiagnostics.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4980512b46820ba27c8cc18254f767ceb25d48de961f7582c4833347e5a889c5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060registeredSystemEffects\u0060 swallows every exception into \u0060emptyList()\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":"app/src/main/java/com/mica/music/util/AudioEnvironmentDiagnostics.kt"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a77729effa2fc341e4e36fc928dfd01e1951b23637e67975b9a82546de8a40"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060runningEffectProcesses\u0060 swallows every exception into \u0060emptyList()\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":"app/src/main/java/com/mica/music/util/AudioEnvironmentDiagnostics.kt"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f52cd3676601e77db81b229aeb2fe112c793917cb582a17a5e002645d23633a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060installedEffectPackageNames\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":"app/src/main/java/com/mica/music/util/AudioEnvironmentDiagnostics.kt"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0b89868ba49ce3f8e7b87df3f53da8ef5ea9a2acf0118cf5d1c60a13420bf1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060activePlaybackCount\u0060 swallows every exception into \u0060-1\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":"app/src/main/java/com/mica/music/util/AudioEnvironmentDiagnostics.kt"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"840b367f9c00512e0ebd02f9e2552d03320682663051e667d216ce3096dc1203"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060collectDiagnostics\u0060 swallows every exception into \u0060false\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":"third_party/sylvakru-usb-transport/src/main/kotlin/com/afalphy/sylvakru/UsbStandardHardwareVolumeController.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e62035f5e8804056ab7317c51d11d2f5c987eb4921914bc0762d21270d2d8ee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060diagnostics\u0060 swallows every exception into \u0060false\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":"third_party/sylvakru-usb-transport/src/main/kotlin/com/afalphy/sylvakru/UsbStandardHardwareVolumeController.kt"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"34734ea01d766cb3d543e4ab3b4b9d74dc88f9274350d0849c51c0020ef4d8a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060queryUac2ClockSampleRateCapability\u0060 swallows every exception into \u0060false\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":"third_party/sylvakru-usb-transport/src/main/kotlin/com/afalphy/sylvakru/UsbStreamingTargetResolver.kt"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"68682c74bd04ba478cfc6b5c1f936bfa8bee108407235a10c17645cd875f9132"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060configureUsbAudioClock\u0060 swallows every exception into \u0060false\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":"third_party/sylvakru-usb-transport/src/main/kotlin/com/afalphy/sylvakru/UsbStreamingTargetResolver.kt"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f913e16c7bf5ed9e128eed44f836cb0d70164174e72fe3f328549f8b795d8d2d"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"Reversible One-Way Hash","shortDescription":{"text":"Reversible One-Way Hash"},"helpUri":"https://cwe.mitre.org/data/definitions/328.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-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-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"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":40,"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."]}]}