{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C1","name":"Data Protection","shortDescription":{"text":"Data Protection"},"helpUri":"https://codehealth.canine.dev/dimensions/C1"},{"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":"DM12","name":"Ambient inputs in the domain","shortDescription":{"text":"Ambient inputs in the domain"},"helpUri":"https://codehealth.canine.dev/dimensions/DM12"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"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":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"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":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"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":"MainScreenContentKt.PhoneLayout (cyclomatic 77): MainScreenContentKt.PhoneLayout has cyclomatic complexity 77 (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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0e016d851af3c92ff48867ac3f491bbdc11a06954c270b45e614badc3e286c"}},{"ruleId":"D1","level":"warning","message":{"text":"BudgetPillKt.BudgetPill (cyclomatic 73): BudgetPillKt.BudgetPill has cyclomatic complexity 73 (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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ff64e27ac16182e0a678ba1a320555ad111f74c8ddf39932c81b147a203096"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalyticsKt.Analytics (cyclomatic 71): AnalyticsKt.Analytics has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e62687bf350dae5b4f0d1e60f359c0df04960a1ca5db12541bf2b2d11ae734"}},{"ruleId":"D1","level":"warning","message":{"text":"TransactionEditScreenKt.TransactionEditScreen (cyclomatic 44): TransactionEditScreenKt.TransactionEditScreen 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/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4386733a40efb2d702af2c8f6f72d6f4fda70edb0299e736373e2386e5488435"}},{"ruleId":"D1","level":"warning","message":{"text":"TrendingGraphKt.BudgetGraph (cyclomatic 42): TrendingGraphKt.BudgetGraph has cyclomatic complexity 42 (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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingGraph.kt"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8cc2573aad3da8afbe48530e974a01fe9e7197ded9246343dfd7a431a45576"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorKt.EditingContent (cyclomatic 41): EditorKt.EditingContent 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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"715040e74b8959401e810b0c2b266e0565d90a8714a4209d5999564842073e70"}},{"ruleId":"D1","level":"warning","message":{"text":"HardwareKeyHandlerKt.handleHardwareNumpadKeyEvent (cyclomatic 40): HardwareKeyHandlerKt.handleHardwareNumpadKeyEvent has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/util/HardwareKeyHandler.kt"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00a38c2eb18cae0c050b5528b18df647b2c6463ab120fa470f8b2282d2a24de"}},{"ruleId":"D1","level":"warning","message":{"text":"SwatchColorsKt.getSwatchColors (cyclomatic 37): SwatchColorsKt.getSwatchColors has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/schemes/SwatchColors.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3a371a6ec2b3783a2a3d2e39166f3131e814d15fc11e45079af1b6e649b201"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorSchemesKt.getAppColorScheme (cyclomatic 36): ColorSchemesKt.getAppColorScheme has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/schemes/ColorSchemes.kt"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8c68f0f93db21c1aac1bc1bf39f7b25ff268645b99ee9d3bb5136e1a672fe6"}},{"ruleId":"D1","level":"warning","message":{"text":"S05Pill.S05Pill (cyclomatic 36): S05Pill.S05Pill has cyclomatic complexity 36 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S05Pill.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4627540eec387b157a65fe498b90c331227fc7219960e197ccbc25fb07bed25c"}},{"ruleId":"D1","level":"warning","message":{"text":"S05Pill.S05Pill (cyclomatic 36): S05Pill.S05Pill has cyclomatic complexity 36 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S05Pill.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce90abba4cf1b4533d0d79642ef0504f6be3def49453c1f6b0421ea317eaf9fa"}},{"ruleId":"D1","level":"warning","message":{"text":"EditableCategoryTagKt.EditableCategoryTag (cyclomatic 34): EditableCategoryTagKt.EditableCategoryTag has cyclomatic complexity 34 (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/serranoie/app/minus/presentation/ui/editor/category/EditableCategoryTag.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1fe88f0443ca3cbfd8581da6fd5be73a2a40cde667997ea0c69757ce115cae"}},{"ruleId":"D1","level":"warning","message":{"text":"BudgetPillMetricsKt.resolveExhaustedMessage (cyclomatic 34): BudgetPillMetricsKt.resolveExhaustedMessage has cyclomatic complexity 34 (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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillMetrics.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d7839d400df1f8e4bd8f1f05cf20b2488a5fc2a52b0bbe2e7914c995a36297"}},{"ruleId":"D1","level":"warning","message":{"text":"SwipeActionsKt.SwipeActions (cyclomatic 33): SwipeActionsKt.SwipeActions has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SwipeActions.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a564065f096f7ae933cd2772dd23dd48fb9c9b91156b0592441ff0b93dd0bc9"}},{"ruleId":"D1","level":"warning","message":{"text":"MainScreenContentKt.MainScreenContent (cyclomatic 31): MainScreenContentKt.MainScreenContent 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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff9dce7c57cf0170aed07547b6f3a327ac32457ec9893a7082739f257d90c4a"}},{"ruleId":"D1","level":"warning","message":{"text":"BudgetPillMetricsKt.calculateBudgetMetrics (cyclomatic 31): BudgetPillMetricsKt.calculateBudgetMetrics has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillMetrics.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a05079540803e87582ff2897adaeecf279d2e2d468d64b70f7981537e952644"}},{"ruleId":"D1","level":"warning","message":{"text":"BudgetPeriodManager.persistBudgetSettings (cyclomatic 30): BudgetPeriodManager.persistBudgetSettings 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/serranoie/app/minus/presentation/ui/budget/BudgetPeriodManager.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3bd5518aa98e4c498a8071da0393d1dbdadaea99ece13cb4edda2a616f1512"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpenseItemExpandedContentKt.ExpenseItemExpandedContent (cyclomatic 30): ExpenseItemExpandedContentKt.ExpenseItemExpandedContent 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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItemExpandedContent.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d423a3c77df76d07669a00c8af3d2b2ae75d53a13c2f7b733bbccb74d9746c"}},{"ruleId":"D1","level":"warning","message":{"text":"BudgetPeriodSheetKt.EditBudgetContent (cyclomatic 29): BudgetPeriodSheetKt.EditBudgetContent has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0e375eadfd575b735fac4642171b456d843445496176c21c8eb15a33800f71"}},{"ruleId":"D1","level":"warning","message":{"text":"Phone.EditorScreen (cyclomatic 26): Phone.EditorScreen has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 10 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 273). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Phone.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce8ece5f2d0404b1b2d757134f9302a745a662a89140116f3d70ec55df3aa33"}},{"ruleId":"D1","level":"warning","message":{"text":"Phone.EditorScreen (cyclomatic 26): Phone.EditorScreen has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 10 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 273). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/components/Phone.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"23343ee2bc619a7ee67df1f74436e21dd871bc58b22fa1f371fef8d9cdedbde4"}},{"ruleId":"D1","level":"warning","message":{"text":"MainScreenKt.MainScreen (cyclomatic 25): MainScreenKt.MainScreen 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/serranoie/app/minus/presentation/ui/home/MainScreen.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ad968f048ee099dbceb9935eb6b7e75c542371476332b828a6c2a0797c278a"}},{"ruleId":"D1","level":"warning","message":{"text":"BudgetFormulaKt.buildBudgetFormula (cyclomatic 25): BudgetFormulaKt.buildBudgetFormula 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/serranoie/app/minus/presentation/ui/theme/component/budget/formula/BudgetFormula.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0eb4c94de47865335ec1630f2bc93d0c323200e9adb4a59eafc6671fa8baa44"}},{"ruleId":"D1","level":"warning","message":{"text":"NumpadKt.Numpad (cyclomatic 25): NumpadKt.Numpad has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fd0fdf3c75cb54d7dc7ae8785ff5b740d349dc02d26f2cd1518b4c86b9fe22"}},{"ruleId":"D1","level":"warning","message":{"text":"BudgetTransactionHandler.applyTransaction (cyclomatic 24): BudgetTransactionHandler.applyTransaction 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/serranoie/app/minus/presentation/ui/budget/BudgetTransactionHandler.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c25bf80057be66355aefb877738a97fbfcd69b2c9a495af0b6ed000b566a73"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpenseItemKt.ExpenseItem (cyclomatic 24): ExpenseItemKt.ExpenseItem 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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26470ac5fe526b457b9c6ddf28e37145db57872e89dceff122e14aaf3ba96df"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorKt.Editor (cyclomatic 23): EditorKt.Editor has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8177e86422f67ad414112eb01c38b4b90f12669046c28d74590202a28766a2a5"}},{"ruleId":"D1","level":"warning","message":{"text":"TotalBudgetCardKt.TotalBudgetCard (cyclomatic 23): TotalBudgetCardKt.TotalBudgetCard 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/serranoie/app/minus/presentation/ui/theme/component/budget/TotalBudgetCard.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"344bd752486abf713797d65553e68a6457d1f8f643ad16166a2bb733e80ca7ab"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionEvaluatorKt.evaluateExpression (cyclomatic 22): ExpressionEvaluatorKt.evaluateExpression 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/serranoie/app/minus/domain/calculator/ExpressionEvaluator.kt"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fa25015f96947757953c1a2282e46e770444d8bfe3d7b64a37cbdfa8e5c361"}},{"ruleId":"D1","level":"warning","message":{"text":"BudgetPillStatusLabelKt.StatusLabel (cyclomatic 22): BudgetPillStatusLabelKt.StatusLabel 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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillStatusLabel.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22eba6e6227f0532d4b985c3d64a760aee195375c0afb400211e84b64831a79"}},{"ruleId":"D1","level":"warning","message":{"text":"MainScreenContentKt.MainScreenNumpadSection (cyclomatic 21): MainScreenContentKt.MainScreenNumpadSection 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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb044d0147680afa9740b9e7cd233da0d333750907bc7fb98d650c644384e2f"}},{"ruleId":"D1","level":"warning","message":{"text":"UpcomingRecurrentItemRowKt.UpcomingRecurrentItemRow (cyclomatic 21): UpcomingRecurrentItemRowKt.UpcomingRecurrentItemRow 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/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"52064a2e4465efe4688ce85f1f49055eaa164ea20ce845640eee9f1927a44413"}},{"ruleId":"D1","level":"warning","message":{"text":"NumpadButtonKt.NumpadButton (cyclomatic 21): NumpadButtonKt.NumpadButton 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/serranoie/app/minus/presentation/ui/theme/component/numpad/NumpadButton.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0174112754ddffef3a175749274c8602897388e9e02956ee8477b25df80394c"}},{"ruleId":"D1","level":"warning","message":{"text":"BudgetStateCalculator.calculateBudgetState (cyclomatic 20): BudgetStateCalculator.calculateBudgetState 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/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4dd1b06789398f7b1e66f08ba57cdce927cd3034378774232e9343e7107474"}},{"ruleId":"D1","level":"warning","message":{"text":"ReceiptScannerKt.rememberReceiptScanner (cyclomatic 20): ReceiptScannerKt.rememberReceiptScanner 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/serranoie/app/minus/presentation/ui/editor/receipt/ReceiptScanner.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2a8374267b2ea12e96f7f39798fdebcadc5499c0110c9c72594822725000eb"}},{"ruleId":"D1","level":"warning","message":{"text":"ThemeKt.MinusTheme (cyclomatic 20): ThemeKt.MinusTheme has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/serranoie/app/minus/presentation/ui/theme/Theme.kt"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fa0cacb8ed77bce6373cf85c275a8787d4907c12cf2cdb846fcab8674f92e9"}},{"ruleId":"D1","level":"warning","message":{"text":"BudgetPillAmountTextKt.SegmentedAmountText (cyclomatic 20): BudgetPillAmountTextKt.SegmentedAmountText 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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillAmountText.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"465bc44a2101f02d58ae16e2c5ece29ec45a6ec1a7e01ab7562be37dbbea897f"}},{"ruleId":"D1","level":"warning","message":{"text":"LeftoverChoiceListKt.LeftoverChoiceList (cyclomatic 20): LeftoverChoiceListKt.LeftoverChoiceList 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/serranoie/app/minus/presentation/ui/theme/component/numpad/LeftoverChoiceList.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"448574a4c76aef629e53a4e6a9541a0c5ab54295b22c6b96499171669884c71b"}},{"ruleId":"D1","level":"warning","message":{"text":"TutorialBoxKt.TutorialBox (cyclomatic 20): TutorialBoxKt.TutorialBox 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/serranoie/app/minus/presentation/ui/tutorial/TutorialBox.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbaca4a42379025d49f570070bd61c954f85350436f23ac9d4e1d579549fccf"}},{"ruleId":"D1","level":"warning","message":{"text":"RecurrentExpenseDialogKt.RecurrentExpenseDialog (cyclomatic 19): RecurrentExpenseDialogKt.RecurrentExpenseDialog 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/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cddbb83eb115a51bb9f4110b8f5f544e7f9f2619c2c1a5b1b389b937191fdb"}},{"ruleId":"D1","level":"warning","message":{"text":"BudgetGraphChartDrawingKt.drawCoordinateSystem (cyclomatic 19): BudgetGraphChartDrawingKt.drawCoordinateSystem 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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e623c0d8b7c8f2b1e18c809d47d676f8065cf12c2b9fcaa4e75bdb044180cb3"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_audio.build_music (cyclomatic 19): generate_audio.build_music 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":"promo/audio/generate_audio.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d03d3773e437d989f17ce784acc5a20d8e6194737374ef0a84d4ccd599dcb3"}},{"ruleId":"D1","level":"warning","message":{"text":"S09Subs.SubscriptionsScreen (cyclomatic 19): S09Subs.SubscriptionsScreen has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 105, 93). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S09Subs.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ab8ab9c1c55f613e99df994f67f13f0145b437e655a967f801d8311c4af30b"}},{"ruleId":"D1","level":"warning","message":{"text":"S09Subs.SubscriptionsScreen (cyclomatic 19): S09Subs.SubscriptionsScreen has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 105, 93). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S09Subs.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fabade4aa092254ca38edac8b07d5d0ffc604b424841a6c5c449cb7b442121"}},{"ruleId":"D1","level":"warning","message":{"text":"TopSheetKt.TopSheetLayout (cyclomatic 18): TopSheetKt.TopSheetLayout 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/serranoie/app/minus/presentation/ui/theme/component/TopSheet.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db014155915edc8296b5d12b72b7721182672069754abdff66cd1e9cedd2d71"}},{"ruleId":"D1","level":"warning","message":{"text":"DetailedChartKt.DetailedChart (cyclomatic 18): DetailedChartKt.DetailedChart 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/serranoie/app/minus/presentation/ui/theme/component/charts/DetailedChart.kt"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"68aa842948438206319d8f9b9613a42de549c4cda92481fc44adfce035a92866"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpenseWidget.ExpenseWidgetContent (cyclomatic 18): ExpenseWidget.ExpenseWidgetContent 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/serranoie/app/minus/presentation/widget/ExpenseWidget.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d30023912ce54557468d88f81c25d28d98917308666e6a97bafbb5062b64111"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationScheduler.nextOccurrenceDateTime (cyclomatic 17): NotificationScheduler.nextOccurrenceDateTime has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \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/serranoie/app/minus/presentation/notification/NotificationScheduler.kt"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"612a624a2245d4f73c5ee2e7da1fa125cfc2b895356dc69ef113d67c10e90213"}},{"ruleId":"D1","level":"warning","message":{"text":"CategoryAnalyticsKt.CategoryAnalytics (cyclomatic 17): CategoryAnalyticsKt.CategoryAnalytics 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/serranoie/app/minus/presentation/ui/analytics/dialogs/CategoryAnalytics.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf3d0baede363a1cc49f7589f27be2a100324e63fdde6e8c0d70d6c347725a4"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryCalculationsKt.calculateNextChargeDate (cyclomatic 17): HistoryCalculationsKt.calculateNextChargeDate 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/serranoie/app/minus/presentation/ui/history/HistoryCalculations.kt"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fae735ffd76678b3f7b9f8d7c33f4482467a84931ab485b394965457e361e1"}},{"ruleId":"D1","level":"warning","message":{"text":"FinishDateSelectorKt.FinishDateSelector (cyclomatic 17): FinishDateSelectorKt.FinishDateSelector 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/serranoie/app/minus/presentation/ui/onboarding/FinishDateSelector.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84df505e141bfaf4ccedbbe71d96430afb31b15c085b139463aeb8afbbae4f1"}},{"ruleId":"D1","level":"warning","message":{"text":"SwipeToDismissKt.SwipeToDismiss (cyclomatic 16): SwipeToDismissKt.SwipeToDismiss 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/serranoie/app/minus/presentation/ui/theme/component/SwipeToDismiss.kt"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ef9178dea04ec0466f2586796094e27dfce5564fbb5eac44803d5cdd1d7dba"}},{"ruleId":"D1","level":"warning","message":{"text":"TextRowKt.TextRow (cyclomatic 16): TextRowKt.TextRow 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/serranoie/app/minus/presentation/ui/theme/component/TextRow.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bc55028769b7c7d5aa8a40bedc1e407716fc2e3abfbe1af1bd0a097e3155ba"}},{"ruleId":"D1","level":"warning","message":{"text":"TutorialBoxStateKt.markForTutorial (cyclomatic 16): TutorialBoxStateKt.markForTutorial 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/serranoie/app/minus/presentation/ui/tutorial/TutorialBoxState.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e13ca5ec480537c14ec6c0d0ed8d7c9c168ff954c155da2622d9937a8a615a"}},{"ruleId":"D1","level":"warning","message":{"text":"S10Analytics.Heatmap (cyclomatic 16): S10Analytics.Heatmap has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 111, 135). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S10Analytics.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"77545470845637547c4a8189453fb66110540bc7bc18532e1d6808bb50ff7f1b"}},{"ruleId":"D1","level":"warning","message":{"text":"S10Analytics.Heatmap (cyclomatic 16): S10Analytics.Heatmap has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 111, 135). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S10Analytics.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5b302d38bbc72c0c9eb96f72ff0fc181a3d8793fec9a679fc15a241750a493"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetPillKt.BudgetPill (cognitive 119): BudgetPillKt.BudgetPill has cognitive complexity 119 (threshold 15). Drivers by points: if/else 71 (91 pts), boolean chains 22, match/switch 2 (4 pts), loops 2 (nesting depth added 22). 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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2a2bc55cdc2b1b7ddc26456c174ce237502fe2a49fa3b2631063fe7e143523"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalyticsKt.Analytics (cognitive 98): AnalyticsKt.Analytics has cognitive complexity 98 (threshold 15). Drivers by points: if/else 55 (77 pts), boolean chains 12, match/switch 4 (9 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aef9a3a609f494d7a869513bd8c470a5d5e0d1379685579560aa70508ab378b"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorKt.EditingContent (cognitive 80): EditorKt.EditingContent has cognitive complexity 80 (threshold 15). Drivers by points: if/else 43 (65 pts), boolean chains 15 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"f011c98e866bd72af5cd5eb0338954b21790b6248af98b288693b32d678a232a"}},{"ruleId":"D2","level":"warning","message":{"text":"MainScreenContentKt.PhoneLayout (cognitive 71): MainScreenContentKt.PhoneLayout has cognitive complexity 71 (threshold 15). Drivers by points: if/else 40 (50 pts), boolean chains 16, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0b162a5d73f7f0b942a1b61e9620f3f3c5132dade73fbb32b7fb9fe7a43963"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionEditScreenKt.TransactionEditScreen (cognitive 64): TransactionEditScreenKt.TransactionEditScreen has cognitive complexity 64 (threshold 15). Drivers by points: if/else 41 (52 pts), boolean chains 9, match/switch 2 (3 pts) (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f590e027128abd46ea7e0a25c8c69d425fda13f5115e64e4c1d1ad014d772f05"}},{"ruleId":"D2","level":"warning","message":{"text":"TrendingGraphKt.BudgetGraph (cognitive 59): TrendingGraphKt.BudgetGraph has cognitive complexity 59 (threshold 15). Drivers by points: if/else 38 (46 pts), boolean chains 12, match/switch 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingGraph.kt"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"599ace58d76976006e8d4633b4b5724f85ea265bec3cfca34622a78aa8a285ee"}},{"ruleId":"D2","level":"warning","message":{"text":"EditableCategoryTagKt.EditableCategoryTag (cognitive 57): EditableCategoryTagKt.EditableCategoryTag has cognitive complexity 57 (threshold 15). Drivers by points: if/else 37 (48 pts), boolean chains 9 (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/serranoie/app/minus/presentation/ui/editor/category/EditableCategoryTag.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c32117c166874074be1ad782a3927fc9b3b5e5d805274f9a1eb907dbd375be"}},{"ruleId":"D2","level":"warning","message":{"text":"SwipeActionsKt.SwipeActions (cognitive 57): SwipeActionsKt.SwipeActions has cognitive complexity 57 (threshold 15). Drivers by points: if/else 41 (51 pts), match/switch 4, boolean chains 2 (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/serranoie/app/minus/presentation/ui/theme/component/SwipeActions.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4538013498ece1cce7928730eb7a24df94b6a86492934647013dcc17624def"}},{"ruleId":"D2","level":"warning","message":{"text":"SwatchColorsKt.getSwatchColors (cognitive 55): SwatchColorsKt.getSwatchColors has cognitive complexity 55 (threshold 15). Drivers by points: if/else 36 (54 pts), match/switch 1 (nesting depth added 18). 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/serranoie/app/minus/presentation/ui/theme/schemes/SwatchColors.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd52efb6209c4df5e696a7c82bc14bc47a30192f5a28d8c5c411436d4b9597c"}},{"ruleId":"D2","level":"warning","message":{"text":"S05Pill.S05Pill (cognitive 55): S05Pill.S05Pill has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 24 (44 pts), boolean chains 8, if/else 1 (2 pts), loops 1 (nesting depth added 21). Of this number, 54 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S05Pill.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a478b72106de158a2651d903d4648aa2a7e3011f7a7134a62fcd56fa76a2c87"}},{"ruleId":"D2","level":"warning","message":{"text":"S05Pill.S05Pill (cognitive 55): S05Pill.S05Pill has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 24 (44 pts), boolean chains 8, if/else 1 (2 pts), loops 1 (nesting depth added 21). Of this number, 54 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S05Pill.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"19983c7a7ee5f73cde41733377059a5b3cd547175d933cc81d188a963a7c6cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorSchemesKt.getAppColorScheme (cognitive 52): ColorSchemesKt.getAppColorScheme has cognitive complexity 52 (threshold 15). Drivers by points: if/else 34 (51 pts), match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/schemes/ColorSchemes.kt"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8596ff19419aee47a63695d2118e8f36ff8a106ad992286df900373fc5a58146"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorKt.Editor (cognitive 50): EditorKt.Editor has cognitive complexity 50 (threshold 15). Drivers by points: if/else 34 (49 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a8c4c5e5ff255a63a80ab81e90de315ca359ff0c2c430a3227c97b3167107d"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetPeriodSheetKt.EditBudgetContent (cognitive 49): BudgetPeriodSheetKt.EditBudgetContent has cognitive complexity 49 (threshold 15). Drivers by points: if/else 28 (42 pts), boolean chains 5, match/switch 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/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3291dc7448434e36ffec016afc96674f7864e192b0c6c49cf1d8014a4642205"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpenseItemKt.ExpenseItem (cognitive 46): ExpenseItemKt.ExpenseItem has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 6, match/switch 3 (6 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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"271fbedbc2faccec4ceda0e52734dc595e9a2f3c5c481f39529d9dd91e6bbb38"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetFormulaKt.buildBudgetFormula (cognitive 42): BudgetFormulaKt.buildBudgetFormula has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 4, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/formula/BudgetFormula.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfdf6733d189ebed4767720b46498b057eef192ce231ef36ac8b1984a6fb02e"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetPeriodManager.persistBudgetSettings (cognitive 39): BudgetPeriodManager.persistBudgetSettings has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 11, match/switch 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/serranoie/app/minus/presentation/ui/budget/BudgetPeriodManager.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"950a21d16112362cfffc7537417dda2a77b53d558ab122c39383a702ed735771"}},{"ruleId":"D2","level":"warning","message":{"text":"UpcomingRecurrentItemRowKt.UpcomingRecurrentItemRow (cognitive 39): UpcomingRecurrentItemRowKt.UpcomingRecurrentItemRow has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23 (32 pts), boolean chains 5, match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"495de737259b89dcb148b22f48135f20e46f1d977e6e1a97465807e7d065bc63"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetPillMetricsKt.resolveExhaustedMessage (cognitive 37): BudgetPillMetricsKt.resolveExhaustedMessage has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 9, match/switch 4 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillMetrics.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e46c47218d3951a1f5ea35364662d085f86d79070b98b56715b9b9aa3dba883"}},{"ruleId":"D2","level":"warning","message":{"text":"TotalBudgetCardKt.TotalBudgetCard (cognitive 35): TotalBudgetCardKt.TotalBudgetCard has cognitive complexity 35 (threshold 15). Drivers by points: if/else 25 (28 pts), boolean chains 4, 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/serranoie/app/minus/presentation/ui/theme/component/budget/TotalBudgetCard.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2586caa3be989d9eb19d0d927e0d020c68075c8fcacc9c5e649e4a46e7cdf6"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpenseItemExpandedContentKt.ExpenseItemExpandedContent (cognitive 34): ExpenseItemExpandedContentKt.ExpenseItemExpandedContent has cognitive complexity 34 (threshold 15). Drivers by points: if/else 23 (25 pts), boolean chains 7, 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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItemExpandedContent.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e89a33bd293d556b3b7a8493f66653a5b6b02c397ad6da086659b288662e2f3"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetGraphChartDrawingKt.drawCoordinateSystem (cognitive 33): BudgetGraphChartDrawingKt.drawCoordinateSystem has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 6, loops 3 (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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7689942db334025ffe414d8f10d1ca918c00c9702b3d2abf009d7428d6329f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"TutorialBoxKt.TutorialBox (cognitive 33): TutorialBoxKt.TutorialBox has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 7 (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/serranoie/app/minus/presentation/ui/tutorial/TutorialBox.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec49b0d92ea328aebb62b9116b34893458f92038d7cbb7fd910e787902ee49f"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_audio.build_music (cognitive 33): generate_audio.build_music has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 8 (11 pts), ternaries 4 (9 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":"promo/audio/generate_audio.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a9569c87b0414807b03cb33fb84df7bf429c1eb2590e2d07e7d1be4870a363"}},{"ruleId":"D2","level":"warning","message":{"text":"RecurrentExpenseDialogKt.RecurrentExpenseDialog (cognitive 32): RecurrentExpenseDialogKt.RecurrentExpenseDialog has cognitive complexity 32 (threshold 15). Drivers by points: if/else 28 (30 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/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce2f306933e22bd0bdcef77b296dd7a90cdf8096ee72fb4efcaef1af326b35e"}},{"ruleId":"D2","level":"warning","message":{"text":"NumpadKt.Numpad (cognitive 32): NumpadKt.Numpad has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 9, 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/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e46009d21d1eb8953813415205c40cf3ce28737b23c8338b92f22bbe58fdd4"}},{"ruleId":"D2","level":"warning","message":{"text":"Phone.EditorScreen (cognitive 32): Phone.EditorScreen has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 17 (27 pts), boolean chains 3, if/else 2 (nesting depth added 10). Of this number, 16 points are the body\u0027s own statements and 16 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Phone.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a119e3d8c99efec95c70af3e51cec73e1d06c027a9f581d50b8bcbcf8699132"}},{"ruleId":"D2","level":"warning","message":{"text":"Phone.EditorScreen (cognitive 32): Phone.EditorScreen has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 17 (27 pts), boolean chains 3, if/else 2 (nesting depth added 10). Of this number, 16 points are the body\u0027s own statements and 16 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/components/Phone.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"719dfb170f94fddd3fde0460be226578e52d521f4bd434aeca64118e8c77ecf9"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionEvaluatorKt.evaluateExpression (cognitive 31): ExpressionEvaluatorKt.evaluateExpression has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (21 pts), match/switch 2 (4 pts), boolean chains 3, loops 2, error handling 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/serranoie/app/minus/domain/calculator/ExpressionEvaluator.kt"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3066d6d2862fbe631c9317e5c7428e0c0641c5be33703af6adb4a6b0bd2b77"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetStateCalculator.calculateBudgetState (cognitive 31): BudgetStateCalculator.calculateBudgetState has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21 (26 pts), boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"354ea08f48a82c22baec8245dbd0f45fb31539ea4bffb77afea9ab2d8ad133ca"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetTransactionHandler.applyTransaction (cognitive 30): BudgetTransactionHandler.applyTransaction has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (17 pts), error handling 5 (7 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/serranoie/app/minus/presentation/ui/budget/BudgetTransactionHandler.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f96887ef5e25961cbb3c2df46992a31ac97bbbea0a7430a77481397e40b66b0"}},{"ruleId":"D2","level":"warning","message":{"text":"MainScreenContentKt.MainScreenNumpadSection (cognitive 29): MainScreenContentKt.MainScreenNumpadSection has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 8, 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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4452e3c9f109956258ec672298175dc97d2caeaa41717bf7acdc578108a177ea"}},{"ruleId":"D2","level":"warning","message":{"text":"TutorialBoxStateKt.markForTutorial (cognitive 28): TutorialBoxStateKt.markForTutorial has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, loops 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/tutorial/TutorialBoxState.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d6342b2c7c5cecb2399ea315559d9df4a0e7f77a816508788e6cc3562c382d"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiptScannerKt.rememberReceiptScanner (cognitive 27): ReceiptScannerKt.rememberReceiptScanner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23 (26 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/receipt/ReceiptScanner.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3dad68e0f5ccc6eb1ecd852042538792f00357f16b638771ac48b590376d9a"}},{"ruleId":"D2","level":"warning","message":{"text":"MainScreenContentKt.MainScreenContent (cognitive 27): MainScreenContentKt.MainScreenContent has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16, boolean chains 7, match/switch 3 (4 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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d6069a4732b5e97bf2885943a7b925daead0420a108c2a0a97b2bbae3cf5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetPillStatusLabelKt.StatusLabel (cognitive 27): BudgetPillStatusLabelKt.StatusLabel has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, boolean chains 5, match/switch 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillStatusLabel.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73ab6ec41b8123b4cf6734ec9b955524950630641ef4f3209af3bc3f3a47a44"}},{"ruleId":"D2","level":"warning","message":{"text":"TextRowKt.TextRow (cognitive 26): TextRowKt.TextRow has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/TextRow.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c143e943af123482d41b2e0c37542c8df1f7af32cacf5376b80808bc11c54c97"}},{"ruleId":"D2","level":"warning","message":{"text":"LeftoverChoiceListKt.LeftoverChoiceList (cognitive 25): LeftoverChoiceListKt.LeftoverChoiceList has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 4 (5 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/LeftoverChoiceList.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c370bab8ad8ce535d4e55489f7c49213171f899cb692bbaa8f7c0fca6f26b9c9"}},{"ruleId":"D2","level":"warning","message":{"text":"FinishDateSelectorKt.FinishDateSelector (cognitive 23): FinishDateSelectorKt.FinishDateSelector has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/onboarding/FinishDateSelector.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"220c4d2252d50342800aca784bbbf711b6f3c310554a54add960f9227c82dc84"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsKt.Settings (cognitive 23): SettingsKt.Settings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 23. 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/serranoie/app/minus/presentation/ui/settings/Settings.kt"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9bb6315e71ba802f992055042f9460ebbba1e81ca917c38aa9553161eb6e75"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetPillAmountTextKt.SegmentedAmountText (cognitive 23): BudgetPillAmountTextKt.SegmentedAmountText has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, boolean chains 6, match/switch 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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillAmountText.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a9873ac36dc249decaaed3e5443c396efb22154c2f4da0800cb548f9be81a1"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryCalculationsKt.calculateNextChargeDate (cognitive 22): HistoryCalculationsKt.calculateNextChargeDate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 2 (4 pts), 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/serranoie/app/minus/presentation/ui/history/HistoryCalculations.kt"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"44562332e6d2b7e7e63213c609e50418bbe0b40c5516bceecae92cbd149774a4"}},{"ruleId":"D2","level":"warning","message":{"text":"TopSheetKt.TopSheetLayout (cognitive 22): TopSheetKt.TopSheetLayout has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/TopSheet.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb28d2c577500008d774cdc4984d3e1355f7e0a92d34ac4393289834573aaedd"}},{"ruleId":"D2","level":"warning","message":{"text":"CategoriesChartCardKt.CategoriesChartCard (cognitive 22): CategoriesChartCardKt.CategoriesChartCard has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, boolean chains 2, error handling 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/serranoie/app/minus/presentation/ui/theme/component/charts/CategoriesChartCard.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e929e3cfca5f5d399e3e809137eface85204b82153f4264edf193f4e4cc12e"}},{"ruleId":"D2","level":"warning","message":{"text":"CategoryAnalyticsKt.CategoryAnalytics (cognitive 21): CategoryAnalyticsKt.CategoryAnalytics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/dialogs/CategoryAnalytics.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b9c5cd289908b11cc0f9e3c82757d0d9584fbe324081b72bf8bfb6c1fe9f73"}},{"ruleId":"D2","level":"warning","message":{"text":"NewCategoryTagKt.NewCategoryTag (cognitive 21): NewCategoryTagKt.NewCategoryTag has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (20 pts), 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/serranoie/app/minus/presentation/ui/editor/category/NewCategoryTag.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7f10897042d86744ea5cede9f12f1fbdb7285346134d13b4b1eb6816835f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"MinMaxSpentCardKt.MinMaxSpentCard (cognitive 21): MinMaxSpentCardKt.MinMaxSpentCard has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (19 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/serranoie/app/minus/presentation/ui/theme/component/budget/MinMaxSpentCard.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"69568f45840d2affef91d83388c772653d27871b3754014d61ab7a40ff0a5b99"}},{"ruleId":"D2","level":"warning","message":{"text":"DetailedChartKt.DetailedChart (cognitive 21): DetailedChartKt.DetailedChart has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 3, loops 2 (3 pts), match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/charts/DetailedChart.kt"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57691c0f28e2523b02eac0185fe6bf44a37bb8df3f07ec254ec7f81e49383d8"}},{"ruleId":"D2","level":"warning","message":{"text":"CalendarHeatmapKt.DayCell (cognitive 21): CalendarHeatmapKt.DayCell has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, boolean chains 4, match/switch 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/serranoie/app/minus/presentation/ui/theme/component/date/CalendarHeatmap.kt"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2e4ccb9f10522f643b7f2cd374d532cf49254e69f437145eb40fe0235b5a84"}},{"ruleId":"D2","level":"warning","message":{"text":"CamSolver.bisectToLimit (cognitive 21): CamSolver.bisectToLimit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/harmonize/hct/CamSolver.java"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a46024622fc1a05416ed2e99c5b2712be9e1cb6469e3cb2a5bb63a3b182ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiCategoryChartKt.MultiCategoryChart (cognitive 20): MultiCategoryChartKt.MultiCategoryChart has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe90bb274df9728778f17abeb48d508957620486c4eb0d364e807e6a1a982b33"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetPillMetricsKt.calculateBudgetMetrics (cognitive 20): BudgetPillMetricsKt.calculateBudgetMetrics has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8, match/switch 6 (7 pts), boolean chains 5 (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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillMetrics.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52bcedfc311740b131b404646dbaae5f4a9d6e2709116f817e94b35827b216e"}},{"ruleId":"D2","level":"warning","message":{"text":"DonutChartKt.DonutChart (cognitive 20): DonutChartKt.DonutChart has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/charts/DonutChart.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"86adea6687603014037dea4fb3754e011d950f2d51fd19cce1a646d8b340ff6b"}},{"ruleId":"D2","level":"warning","message":{"text":"NumpadKt.ActionButtonsColumn (cognitive 20): NumpadKt.ActionButtonsColumn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c6cfc1d9fdc4463e43ef53294efda0124b088b05f1ebfe1d931d7ff24904ae"}},{"ruleId":"D2","level":"warning","message":{"text":"S09Subs.SubscriptionsScreen (cognitive 20): S09Subs.SubscriptionsScreen has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 14 (16 pts), boolean chains 4 (nesting depth added 2). None of this is in the body itself: all 20 points belong to 2 function literals inside it that branch (lines 105, 93). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S09Subs.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ad137ac29d7a668ae24a2b60fa0bbfde0c3e60b79e0ce05d8c61a6b9dfde7d"}},{"ruleId":"D2","level":"warning","message":{"text":"S09Subs.SubscriptionsScreen (cognitive 20): S09Subs.SubscriptionsScreen has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 14 (16 pts), boolean chains 4 (nesting depth added 2). None of this is in the body itself: all 20 points belong to 2 function literals inside it that branch (lines 105, 93). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S09Subs.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbddbbbe7ed8789f91081cdcef16009fb9f72d86fe91497ca1c0f4a89987c06"}},{"ruleId":"D2","level":"warning","message":{"text":"ThemeKt.MinusTheme (cognitive 19): ThemeKt.MinusTheme has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (6 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/serranoie/app/minus/presentation/ui/theme/Theme.kt"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cc12497aa6f8f7084b9260506990e28d0ca7ec70371383ffdd374558f590b9"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryScreenKt.History (cognitive 18): HistoryScreenKt.History has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e592f8e00beead4e53e1614800459d97abfd521f95188085221415cf9fd8e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryScreenKt.HistoryListContent (cognitive 18): HistoryScreenKt.HistoryListContent 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/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0280e8f4db136a258c4064fa4e856d253ba0b4564a9d249aeacf35892868190"}},{"ruleId":"D2","level":"warning","message":{"text":"SpendsChartKt.SpendsChart (cognitive 18): SpendsChartKt.SpendsChart has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/serranoie/app/minus/presentation/ui/theme/component/charts/SpendsChart.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b5098a4439c1962fe91ff07c65e52af96c2756766c35953c0bd443a2681d07"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetViewModel.triggerTestNotifications (cognitive 17): BudgetViewModel.triggerTestNotifications has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 4, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetViewModel.kt"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a20990f1ad394d9368f8c81ef6ce2c09c0ece57810e8e257eca9920e0f9b25"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetPeriodSheetKt.BudgetPeriodSheet (cognitive 17): BudgetPeriodSheetKt.BudgetPeriodSheet 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/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeed0ef2dab5251e5b1954da5465c5cf000fdde4cf469d91faf877077793fc73"}},{"ruleId":"D2","level":"warning","message":{"text":"BudgetPeriodSheetKt.ViewBudgetContent (cognitive 17): BudgetPeriodSheetKt.ViewBudgetContent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, 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/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"78798095cdb3d8d42c8fbf4285af43b6936f65f1573f9409aa1bce87aa379232"}},{"ruleId":"D2","level":"warning","message":{"text":"NumpadKt.CompactHardwareLayout (cognitive 17): NumpadKt.CompactHardwareLayout has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8459c01c07da6641d8cf7ee676dd68571520d8e1704c2127e05e41db16e83627"}},{"ruleId":"D2","level":"warning","message":{"text":"HapticUtil.performCustomHaptic (cognitive 17): HapticUtil.performCustomHaptic has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 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/serranoie/app/minus/presentation/util/haptic/HapticUtils.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d9e0ac3edb775e872d872f2b98248647f5e7b7e64b5f278a10ba35d877da63"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_audio.render_cue (cognitive 17): generate_audio.render_cue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/audio/generate_audio.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"232d2b1abab4de1404168095de824db7679399f148053b9fecf222611c00a8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"S10Analytics.Heatmap (cognitive 17): S10Analytics.Heatmap has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 14 (16 pts), boolean chains 1 (nesting depth added 2). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 111, 135). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S10Analytics.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0392f4d2d2c90a29a52905c8f591000a2911e3244293d757f30df016048f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"S10Analytics.Heatmap (cognitive 17): S10Analytics.Heatmap has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 14 (16 pts), boolean chains 1 (nesting depth added 2). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 111, 135). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S10Analytics.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"badf28cb7c550b0867f0d877b386dc8cd179ec103ffdb76b602c9bfd8fd4ba6e"}},{"ruleId":"D2","level":"warning","message":{"text":"BugReportFormKt.BugReportForm (cognitive 16): BugReportFormKt.BugReportForm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/bugreport/BugReportForm.kt"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f9f2e88f3701c40ba52938c15e38fc80fcbd0e362618a9028147bbea5f073d"}},{"ruleId":"D2","level":"warning","message":{"text":"SavingsPreferencesEditorKt.SavingsPreferencesEditor (cognitive 16): SavingsPreferencesEditorKt.SavingsPreferencesEditor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, 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/serranoie/app/minus/presentation/ui/settings/savings/SavingsPreferencesEditor.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb95a099900d6c7f200f0aa19736723975d05523a71858ab8cde749f704b0089"}},{"ruleId":"D2","level":"warning","message":{"text":"SubscriptionsWeeklyCalendarKt.SubscriptionsWeeklyDayPill (cognitive 16): SubscriptionsWeeklyCalendarKt.SubscriptionsWeeklyDayPill has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), 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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsWeeklyCalendar.kt"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede107287048ef4025be0a28ea5a1c62e5838c62a833c60a5058f769f887f43f"}},{"ruleId":"D2","level":"warning","message":{"text":"AverageSpendCardKt.AverageSpendCard (cognitive 16): AverageSpendCardKt.AverageSpendCard 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/serranoie/app/minus/presentation/ui/theme/component/budget/AverageSpendCard.kt"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd5123ecf1a5f8d99a0f602b2420df110c3365bb4781a84e8b9a4edee77f58b"}},{"ruleId":"D2","level":"warning","message":{"text":"SpendBudgetCardKt.drawWavyPattern (cognitive 16): SpendBudgetCardKt.drawWavyPattern has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, 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/serranoie/app/minus/presentation/ui/theme/component/budget/SpendBudgetCard.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea4ee98f0a4a10e20b2b90c073c0417111a9efd8dc9326ee8f4b26fdf661cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"DateFormattingKt.prettyDate (cognitive 16): DateFormattingKt.prettyDate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/util/font/format/DateFormatting.kt"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f691257c200ba12ff78f4d9523827203a47d890e5bb97a98fa78685dd0cc7755"}},{"ruleId":"D2","level":"warning","message":{"text":"CamSolver.findResultByJ (cognitive 16): CamSolver.findResultByJ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/harmonize/hct/CamSolver.java"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b7417c285750985375b1a4fa9039f163b2bdf519d6f4825d149f72cc656349"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainScreenContentKt.PhoneLayout: MethodTooLong \u2014 PhoneLayout runs 401 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 301 over it, 4.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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d12cb629c981cbfbdc906883a1e5a518a13b936061c098a908b7a31e11b005"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainScreenContentKt.MainScreenContent: MethodTooLong \u2014 MainScreenContent runs 287 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 187 over it, 2.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0a9ada6d6933f3d953293c86321ac0b527fcae13924a79c3c03ab9f4059efb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/MainScreenContent.kt: FileTooLong \u2014 1357 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 857 over it, 2.71\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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e64f5890c8d9b10a989f40c022f57007df82fbf733350a91aaca32709d5f4a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BudgetPillKt.PreviewBudgetPillSmallHeight: MethodTooLong \u2014 PreviewBudgetPillSmallHeight runs 251 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdfe922f9ec4ae22b75a36011375e81757a3a509b556de6f165cbe621cad79b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SettingsRepositoryImpl: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. Most of these members implement repository.SettingsRepository (64 of 70 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/serranoie/app/minus/data/repository/SettingsRepositoryImpl.kt"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef90a821deff75ef0dcfa0119cd2ca3d314722d12e1b2bb1239b834892a8f095"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analytics/Analytics.kt: FileTooLong \u2014 1114 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 614 over it, 2.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb551bde6da473e47efbc18dfc400a27e15bad5caed4c925d4822a94dfb21338"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: editor/Editor.kt: FileTooLong \u2014 1093 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 593 over it, 2.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab45c13b5debc84ecb6d3a994dd57f2342417a81b18483ed8acbd046db17223"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultiCategoryChartKt.MultiCategoryChart: MethodTooLong \u2014 MultiCategoryChart runs 213 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 113 over it, 2.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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"df56fa08363454fa659ed06aa034ab747a95281519ac4dea2be240b82ef16f65"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HistoryScreenKt.HistoryListContent: MethodTooLong \u2014 HistoryListContent runs 209 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 109 over it, 2.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db9b2c4510b87584d6343b2ebc88ed33529b0224211a55c6546e0c6082081d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sheets/BudgetPeriodSheet.kt: FileTooLong \u2014 1011 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 511 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce6118c5e7c8bed4e54a32dbf4b8bb185e536a1aa9b8874b68031b1cd625ba1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BudgetPeriodSheetKt.ViewBudgetContent: MethodTooLong \u2014 ViewBudgetContent runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cb9be28d50a2daa5ef226373b3623ce14cc3dc2df6abf26fd6d6f085b75f59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecurrentExpenseDialogKt.RecurrentExpenseDialog: MethodTooLong \u2014 RecurrentExpenseDialog runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8436b863cbae77b210e3c0e57e34292cfd4f16ec11f6e9f693b576e5d2bcfc9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TotalBudgetCardKt.TotalBudgetCard: MethodTooLong \u2014 TotalBudgetCard runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/TotalBudgetCard.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"33266f68b1eb961374baec909930cd6dc6fa5e480afb1a52a1e925821f8bf53b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SavingsPreferencesEditorKt.SavingsPreferencesEditor: MethodTooLong \u2014 SavingsPreferencesEditor runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/serranoie/app/minus/presentation/ui/settings/savings/SavingsPreferencesEditor.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0da6c4834e9bb255ee450c544884ced228f5cf314a30797e096025d4eeb224"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pill/BudgetPill.kt: FileTooLong \u2014 859 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 359 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d02bb7c556625100d2b9c6bdae705e5f5fd913629040fd4721560c7624adde"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BudgetRepositoryImpl: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. Most of these members implement repository.BudgetRepository (44 of 49 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/serranoie/app/minus/data/repository/BudgetRepositoryImpl.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"565f5f311691b81170216487cb17e074b7efe2c4c7dcc21d54c27fbca95a51ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: S05Pill.S05Pill: FunctionTooLong \u2014 S05Pill runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S05Pill.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a700d2832f0a5b7afc9f8f0dcc5c75856d8739641f5d36e9846e010193ae9fc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: S05Pill.S05Pill: FunctionTooLong \u2014 S05Pill runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S05Pill.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e977f89e3506c047aeadc23cd81126083ff1c50f45ea6990ae0a232755a0b9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecurrenceConfigSheetKt.RecurrenceConfigSheet: MethodTooLong \u2014 RecurrenceConfigSheet runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/RecurrenceConfigSheet.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd67320668d81bc1fa73a0167c848c6f4251a07de351d1b42ea0ca5ef742f3d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExpenseItemExpandedContentKt.ExpenseItemExpandedContent: MethodTooLong \u2014 ExpenseItemExpandedContent runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItemExpandedContent.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fa7ecba55edb364cce5596ae3bb6258720f1d59171cd7737e4d8ecb3c72920"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultiCategoryHourChartKt.MultiCategoryHourChart: MethodTooLong \u2014 MultiCategoryHourChart runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"023d5c69179d90a580692aa9fa5aa0d585216dee2589826cd08db7a059c3d7a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LeftoverChoiceListKt.LeftoverChoiceList: MethodTooLong \u2014 LeftoverChoiceList 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/serranoie/app/minus/presentation/ui/theme/component/numpad/LeftoverChoiceList.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fbeabb40ba2126240919ad8722b61a0fa165df7ff1d73bcc73ee0354003f5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TutorialBoxKt.TutorialOverlay: MethodTooLong \u2014 TutorialOverlay 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/serranoie/app/minus/presentation/ui/tutorial/TutorialBox.kt"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff73a355df5f88e3632b1dd1899cfe5689ac93df7dd09d28cf6e1d76f561fad7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: budget/BudgetViewModel.kt: FileTooLong \u2014 733 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: BudgetViewModel (108-937). The bar is 500 significant lines; this is 233 over it, 1.47\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetViewModel.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6a4e580bf95b0482d9901a47005d97588fea4e33b5ed17a06c22d3609ca5a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainScreenContentKt.MainScreenNumpadSection: MethodTooLong \u2014 MainScreenNumpadSection 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/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b33daa60ae2651f0e21ad22db64460103ae73e60db4dcec1811742ebca81e2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BudgetViewModel: ClassTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 179 over it, 1.45\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetViewModel.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23ba454089d2e498e0bccd25e8c8ef7832af8b6c752086272d4d18328f39cda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/Settings.kt: FileTooLong \u2014 723 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 223 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/Settings.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec535e60b385de7043da9dea44e2bcb43b9c0883d988bd2ac444e6e98dd454e9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SavingsRecommendationCardKt.SavingsRecommendationCard: MethodTooLong \u2014 SavingsRecommendationCard 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/serranoie/app/minus/presentation/ui/theme/component/SavingsRecommendationCard.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8ac761524b5f3a4b58235507244bd26ee00d9ca1b695e466ee27eb769bbb06"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MockDisplayKt.MockPillScreen: MethodTooLong \u2014 MockPillScreen 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/serranoie/app/minus/presentation/ui/settings/appearance/MockDisplay.kt"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4c1115550702fa415a08a2935f353146f31346f883e8f80f6423b1e41b6328"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubscriptionItemKt.SubscriptionItem: MethodTooLong \u2014 SubscriptionItem runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionItem.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"199d7200869b8e6105d63c6bb43c7bffc7c776117dbb092751686b82a9f097da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphs/TrendingGraph.kt: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 165 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingGraph.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d6c6e7ce6d3ce048bc3691c33723d57f7a80ad57b63f43ac455d380e8ea4b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BudgetStateCalculator.calculateBudgetState: MethodTooLong \u2014 calculateBudgetState runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6d94793864fb9f5f7d70b99e416b112890d979d2d105fa35e29248760350ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainScreenContentKt.TabletLayout: MethodTooLong \u2014 TabletLayout 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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"425dbe0ba890295cc2bb5b5fce3023601e53c7871fceb3ae117b00362bc54c3e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SettingsViewModel: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.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/main/java/com/serranoie/app/minus/presentation/ui/settings/SettingsViewModel.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2538c21fede5269ad89671e6161e334ffdcdba77cfd2a537a28b25f3751588c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numpad/Numpad.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/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3c6c22beffee0233b8e67e3126d23a62b811c76f5ce142740ebee7ec67d633"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MockDisplayKt.MockNumpadScreen: MethodTooLong \u2014 MockNumpadScreen runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/MockDisplay.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab8d45e76816adfce1aedf9f7b6c2e02d654cf3fb788ef3efeffb33d63074e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpendBudgetCardKt.SpendBudgetCard: MethodTooLong \u2014 SpendBudgetCard 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/serranoie/app/minus/presentation/ui/theme/component/budget/SpendBudgetCard.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d21809a97e59d48a5874e7c7557feb764d3955ea56e92a25bfcb473d0acc99"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnalyticsViewModel: ClassTooLong \u2014 494 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 94 over it, 1.24\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/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c862feb8798ca5486b4f8929ab9bfd722196cc90d8c5b355234ade0f9c40ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bugreport/BugReportForm.kt: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 90 over it, 1.18\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/serranoie/app/minus/presentation/ui/settings/bugreport/BugReportForm.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2b08f9999547444c9122112d7936992896fc5ac1e31d0ad2d56f397fdb9e26"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BudgetViewModel: 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/serranoie/app/minus/presentation/ui/budget/BudgetViewModel.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fedc90ca5144e8ad2f8e8870cfb5a0031ff6b312fefbe485e04fd141cccc0a2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PillFace: ClassTooLong \u2014 459 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 59 over it, 1.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3024dff801f269e9bda5371f4bcf47305e7ab5822cc57cc562642c397897f4c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TrendingDailyGraphKt.GraphHourCanvas: MethodTooLong \u2014 GraphHourCanvas 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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingDailyGraph.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba1ce6561e495db084a61da499eeac22c2ae4cc5384a380814fe8ce75e4f947"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: component/SettingsGroup.kt: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f412f2494b3e5b5dc66ffe6724e7d2d5b15c61dedbf7585a4e507d878a3b7c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubscriptionDayDetailsSheetKt.SubscriptionDayChargeRow: MethodTooLong \u2014 SubscriptionDayChargeRow 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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionDayDetailsSheet.kt"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83e243ba28481de883d0888e65d432c403b511b9631343d47d346cf63b91102"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FinishDateSelectorKt.FinishDateSelector: MethodTooLong \u2014 FinishDateSelector runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/onboarding/FinishDateSelector.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ef385ee133556d86545cfcdf861ffa93e9d2a12d778f13ce937640e3ba19b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analytics/AnalyticsViewModel.kt: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: AnalyticsViewModel (69-721). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c319b668d94b283dd54d954ead8af24c9748b5f54d2f4f1a7422edc5b571d3ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MinMaxSpentCardKt.MinMaxSpentCard: MethodTooLong \u2014 MinMaxSpentCard runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/MinMaxSpentCard.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52c60e31bee589e673c4fed406c42ed6479daee55ab3011a87e32b9469cfc94"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NotificationScanScreenKt.NotificationScanScreen: MethodTooLong \u2014 NotificationScanScreen 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/serranoie/app/minus/presentation/ui/settings/features/NotificationScanScreen.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4efffa4827ab65c47a10d863eb0a98bb2471950e3eb243066530c5841bf3c29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NewCategoryTagKt.NewCategoryTag: MethodTooLong \u2014 NewCategoryTag 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/serranoie/app/minus/presentation/ui/editor/category/NewCategoryTag.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"57aaa07a4c5b5e11397b6c80e300a5f0aa32887462325ef2959fd85157251aaf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainActivity.onCreate: MethodTooLong \u2014 onCreate 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/serranoie/app/minus/presentation/MainActivity.kt"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fe5a0308e6f1ba1b776bf55f3dad1647f91298b03678a116aa96142fc66203"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphCanvasKt.GraphCanvas: MethodTooLong \u2014 GraphCanvas 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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/GraphCanvas.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92f68eb8c554faf64b5b32478df6d66656c12997deedfe2b2b56ab2d212cb9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: appearance/MockDisplay.kt: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/MockDisplay.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53000af93d7708106796289428ad5bde327ce4d82c9cf88adf46a0ee63135806"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnalyticsViewModel: 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/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c5281483d3bc06d194feddd51ca9824fa5a99c0ddc3eb45d07a2bbadf1bfd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CurrencySelectorDialogKt.CurrencySelectorDialog: MethodTooLong \u2014 CurrencySelectorDialog 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/serranoie/app/minus/presentation/ui/editor/sheets/CurrencySelectorDialog.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1338b8b99941e4b5ef62138f67fd1455eb2d360e275d0b78338677346618911"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graphs/MultiCategoryChart.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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3ad9a40761dca0c81cd08b77f96b316c9cd564fe2a669a5c663871b6ea4853"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: appearance/AppearanceOptionsScreen.kt: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3 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/serranoie/app/minus/presentation/ui/settings/appearance/AppearanceOptionsScreen.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"580f2fa5f4b5de3b02e4494f947042c28ab981c45360f76f2df4f625be8e5e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (79 shared lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1073-1233 | app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1247-1402 \u2014 These two members are variants of one another: 79 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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac457de8d9cbd72d6c1e64514cab69b3a8fd527d7358c565f78cc6284760884"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/charts/SpendsChart.kt:54-182 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/charts/SpendsChart.kt:196-281 \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/serranoie/app/minus/presentation/ui/theme/component/charts/SpendsChart.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfad70e5f2a6a742c225ec45afa5accfc88424594416b9881c8fcb59c6df0217"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/CurrentPeriodRecurrentSection.kt:56-126 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/FutureRecurrentSection.kt:60-141 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt:57-155 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/TransactionDateSections.kt:76-182 \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/serranoie/app/minus/presentation/ui/history/sections/CurrentPeriodRecurrentSection.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef1c3db3216178ce9f925234e0999cd3241e659c8f999889d3072ee51b4a6e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (94 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/Type.kt:167-260 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/Type.kt:263-356 \u2014 These two members are one piece of code written twice and then edited apart: 94 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/serranoie/app/minus/presentation/ui/theme/Type.kt"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7910fbf58abe3b6c073c0e2485d5b98108f159a12c149679ae58c7d1e03e2cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:52-153 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:172-244 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9fb41f99699c789adcaef924d5fa8cc62f44e73d74dfc2052165703ccd03fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt:142-207 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsWeeklyCalendar.kt:298-363 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one 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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"de66440e20f84bb411e901d8f093e3544760ab028fa41340e89a98de9ddf04b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/RecurringSummaryCard.kt:38-87 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/SpendsCountCard.kt:41-98 \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/serranoie/app/minus/presentation/ui/theme/component/budget/RecurringSummaryCard.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef8c818b40a384e19338c2d5a1f17d0f069b71b17ceed47157bdeff5be9c363"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/SavingsPocketsCard.kt:445-482 | app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/SavingsPocketsCard.kt:489-531 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/SavingsPocketsCard.kt"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"f728ae013118e4b0dbcf5ccf61a91c538f8bc18bd81b4c183b5b8b5c355b436f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1222-1263 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1313-1358 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c8f50ed55e2a51ac250f5d3b8f82ccecf398f5c88d8dd8c1914200ef4f4187"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt:146-177 | app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt:364-398 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa4b103814f3789a0090f89039193860b575e36154b033666c08fae1771a507"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:121-163 | wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt:99-141 \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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf84fb7d2f20c0eafbb35ee8a92a2db0f4f4114fa611d70642315f80c7bfffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingGraph.kt:376-398 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingGraph.kt:406-425 \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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingGraph.kt"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f360f28b726c0fd802f845d88d0c50b0112762355f0d81828943df70bf9d958"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/util/Utils.kt:84-115 | app/src/main/java/com/serranoie/app/minus/presentation/util/Utils.kt:121-150 \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/serranoie/app/minus/presentation/util/Utils.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d100be6dd3b083c3e8b9ef20513f917d633195fd89617f8d64a7b53feb722367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:511-559 | wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt:288-331 \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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"73013dc72b8ecd9a2ea9242f4e9fc96eed4b55ca28097cab9fcd7213b2b50a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt:111-138 | app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearMessageListener.kt:105-125 \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/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0dc3e32d26931687c2b7e2707b9af82b2bc544f490ca7ed5957e4197850b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/widget/HeatmapWidget.kt:190-226 | app/src/main/java/com/serranoie/app/minus/presentation/widget/MonthHeatmapWidget.kt:171-216 \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/serranoie/app/minus/presentation/widget/HeatmapWidget.kt"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37136be40bca3cfe937522a866c6d0eea9a74210fe2da84baae68fbb2eab917"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:990-1016 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsEmptyState.kt:27-53 \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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c412e3bd3b7b6f1c3a2aaa2f9e68e46cdcc8cecc9d4843639d82417733fc168"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/widget/HeatmapWidget.kt:151-183 | app/src/main/java/com/serranoie/app/minus/presentation/widget/MonthHeatmapWidget.kt:125-160 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/widget/HeatmapWidget.kt"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b579c967d9187edb09e43ba939a654f7719d334d8ed29060a26e3f67c9866872"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt:55-84 | app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearMessageListener.kt:58-83 \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/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac28385b1d7a43a8ebbb3d9a032ee0d5e6508a5b472321d0f65346969e99bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt:60-81 | app/src/main/java/com/serranoie/app/minus/presentation/widget/CompleteBudgetWidget.kt:61-84 \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/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed252d991dc53078a6cab9b8af2bd4b81213e17a65751a536585c5a4c6dc05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt:92-117 | app/src/main/java/com/serranoie/app/minus/presentation/widget/CompleteBudgetWidget.kt:98-133 \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/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38684a548efacaf86a011e5775df370a4991611011e1e22ddea4cd4352ffe36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/widget/HeatmapWidget.kt:356-393 | app/src/main/java/com/serranoie/app/minus/presentation/widget/MonthHeatmapWidget.kt:321-354 \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/serranoie/app/minus/presentation/widget/HeatmapWidget.kt"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e14a046b372fa7bab7a9d1c53089f758e2c17d18837cdd519f55838b876bb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/SavingsPocketsCard.kt:535-566 | app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/SavingsPocketsCard.kt:570-601 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/SavingsPocketsCard.kt"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4b67cffd12ef62719bf45977a83f0bf79d8aa5f8719057e9f8b3d27ca4c6c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt:223-242 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsWeeklyCalendar.kt:444-478 \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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc60b12058b4bfc2212173b36bd27b40e9c8402bb72e5a371ba77f1588c6f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:394-423 | wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt:201-233 \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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d8d1b19bacc63a3d487e0c0ec3bc2578e3a1426cec947cef688035b418f6a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt:225-241 | app/src/main/java/com/serranoie/app/minus/presentation/widget/CompleteBudgetWidget.kt:301-317 \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/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"880d9a9939c1cbd1c16f7ebde075b7e3978d67f9a23081ef4b63450965eafd3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/widget/ExpenseWidget.kt:239-260 | app/src/main/java/com/serranoie/app/minus/presentation/widget/WidgetCommon.kt:38-59 \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/serranoie/app/minus/presentation/widget/ExpenseWidget.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"725a08ada7a4d3bfd25c2f091ce02aa4beb8b617546c73ed3e9af3cba31892bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt:27-42 | app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetWidgetUpdater.kt:152-174 \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/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"944d6d10bc14ab29ca0289ae038cb76457788ea460cabcb5bf3673c77c01bb1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/CategoryLimitCard.kt:322-349 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/CategoryLimitCard.kt:353-378 \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/serranoie/app/minus/presentation/ui/editor/category/CategoryLimitCard.kt"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd14ea6e331b9929134dbb053458bf9227a3e2e1c0dc1826b0aa528635fc8c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/widget/HeatmapWidget.kt:130-148 | app/src/main/java/com/serranoie/app/minus/presentation/widget/MonthHeatmapWidget.kt:104-122 \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/serranoie/app/minus/presentation/widget/HeatmapWidget.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e263e7d3c3d918095a1768838285fd430789abe0654f34528227199d2d0a8619"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt:86-109 | app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearMessageListener.kt:85-103 \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/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cce2ef9e2bc85f9f42cd46e1a6d79cf16ed3fb389117522ba7f9b5e0ae089e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.kt:520-538 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.kt:542-564 \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/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.kt"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb298e136dac5050440888da7d653f088ccf99cbf4958e34dcd26f169458f404"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SavingsRecommendationCard.kt:383-407 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SavingsRecommendationCard.kt:444-475 \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/serranoie/app/minus/presentation/ui/theme/component/SavingsRecommendationCard.kt"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de4929f2141882d9fc2ebf4793d72668a761f957c97d809e63a25cde27b5d4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1031-1059 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/RolloverDialog.kt:107-137 \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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea63775d01d8272c70660d30d762005b041eec22086be8aecc0495eb2e8b92cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): wear/src/main/java/com/serranoie/app/wear/minus/sync/WearSyncManager.kt:25-52 | wear/src/main/java/com/serranoie/app/wear/minus/sync/WearSyncManager.kt:54-76 | wear/src/main/java/com/serranoie/app/wear/minus/sync/WearSyncManager.kt:78-99 \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":"wear/src/main/java/com/serranoie/app/wear/minus/sync/WearSyncManager.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e602f6b3bcd1b7c081236d3f564b3b9281cd85b81d4271f6e1825f74ff0db7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/changelog/components/ChangelogBugFixItemCard.kt:39-61 | app/src/main/java/com/serranoie/app/minus/presentation/ui/changelog/components/ChangelogItemCard.kt:55-77 \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/serranoie/app/minus/presentation/ui/changelog/components/ChangelogBugFixItemCard.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf32f8c79e690e1753124ce4b7a57284eefc2670724bd6869ba0960cc638e203"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/SavedCategoriesGrid.kt:210-232 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/SavedCategoriesGrid.kt:236-255 \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/serranoie/app/minus/presentation/ui/theme/component/numpad/SavedCategoriesGrid.kt"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f060ead528428075ebce15b6c2deeaf29d9aad053dcbd7915595601591c1608"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 23\u002B corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/AppearanceOptionsScreen.kt:226-248 | app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/features/CsvSyncGuideScreen.kt:269-291 | app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/features/FeatureLabScreen.kt:244-266 | app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/features/NotificationScanScreen.kt:214-236 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/AppearanceOptionsScreen.kt"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba1b33f96495f65be9a6f833bfa0a02e347d499b9f351d4a537671b0755d69f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/ExpandableRow.kt:82-104 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/ExpandableRow.kt:116-138 \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/serranoie/app/minus/presentation/ui/theme/component/numpad/ExpandableRow.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec93008243de55ec17f3e94dc3f23eb0d4e50dbb34c9ba69d94672b23773449"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt:117-128 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsWeeklyCalendar.kt:275-286 \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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f040f333ea4caaba2477f6d6d7b7090c070139eb88166a21bd9805f73ec5885"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 24\u002B corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:253-276 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:352-377 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt:235-258 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt:263-286 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dce5166ca6ee96b5e3424c666f431ddc6827d05db161c30a93bda94f18bf670"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionEditToggleButton.kt:123-142 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionEditToggleButton.kt:146-165 \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/serranoie/app/minus/presentation/ui/history/edit/TransactionEditToggleButton.kt"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf0718a05d4ccfd410d944bc4f483c1274caefe483ff088f8fd55b27bc633a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/widget/DaysCountdownWidget.kt:108-120 | app/src/main/java/com/serranoie/app/minus/presentation/widget/ExpenseWidget.kt:279-291 \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/serranoie/app/minus/presentation/widget/DaysCountdownWidget.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"201e4dab5684370470973d360b34fdabc7eeb193b94be2df5774e30563949287"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt:1300-1319 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt:1327-1342 \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/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba3ccb917289aade74a29dfaa90b3e8a8dd958b91ceb9adf9cca10dfd433508"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): wear/src/main/java/com/serranoie/app/wear/minus/presentation/PeriodOverviewScreen.kt:341-360 | wear/src/main/java/com/serranoie/app/wear/minus/presentation/PeriodOverviewScreen.kt:376-396 \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":"wear/src/main/java/com/serranoie/app/wear/minus/presentation/PeriodOverviewScreen.kt"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d095bb14f31cf2139ac37909a30f07b18c81ff29b183645721f340941640c927"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt:296-315 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt:319-337 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItemExpandedContent.kt:269-287 \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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd90284d9b46c5c1d2fbaa50c7d1ddd79da4196ebaf139cb3351f2711affc45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/TopSheet.kt:62-68 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/TopSheet.kt:71-77 \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/serranoie/app/minus/presentation/ui/theme/component/TopSheet.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"702c03f810df54082c8c244811f89bf8e4a6f0e5205356c70551062faaa0b3b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/dialogs/DeleteRecurrentExpenseDialog.kt:86-100 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/dialogs/DeleteRecurrentExpenseDialog.kt:104-118 \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/serranoie/app/minus/presentation/ui/history/dialogs/DeleteRecurrentExpenseDialog.kt"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a4d45f81c74349bd79a286535b9ee1f95d0f52fe9de7f7646b92d6f3c1d90d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/TotalBudgetCard.kt:533-547 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/TotalBudgetCard.kt:584-598 \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/serranoie/app/minus/presentation/ui/theme/component/budget/TotalBudgetCard.kt"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2db8c4ef96533c4908bbb38981e6b39d36e1f88dfdb27163bdd2c7e008f024"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt:376-395 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionDayDetailsSheet.kt:124-129 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"3469eb8bcb106e6663bec6a7dc6fda50a713f332d425983dd6bde8c84840cb79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/harmonize/util/ColorUtils.java:159-168 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/harmonize/hct/CamSolver.java:333-342 \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/serranoie/app/minus/presentation/ui/theme/harmonize/util/ColorUtils.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acaba3862fca728d5bae8dc8c093dc5a06f0c35af9317a0a50a3c3e6eb9d41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryViewModel.kt:215-229 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsViewModel.kt:133-144 \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/serranoie/app/minus/presentation/ui/history/HistoryViewModel.kt"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32e598a561841283a876583403405bf7afa0906482992f46dffbe4259137864"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt:1242-1249 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/formula/BudgetFormulaDialog.kt:565-570 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1fe2e8573118577f07e2d66095af968ae2c721975afc8599e2859251f39a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt:42-53 | app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearMessageListener.kt:48-56 \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/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e81b4597d55d0888aa3a48c0267a7cc7fdb1ab785893ff975bfc7448722c63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetViewModel.kt:781-784 | app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/SettingsViewModel.kt:430-433 \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/serranoie/app/minus/presentation/ui/budget/BudgetViewModel.kt"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93d400b1e6db1cf48d8fd94ef7a6b6633fae636c1cca0602787eaa0ef12bf0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): app/src/main/java/com/serranoie/app/minus/domain/time/MidnightPeriodChecker.kt:394-400 | app/src/main/java/com/serranoie/app/minus/presentation/notification/MidnightPeriodTransitionReceiver.kt:104-108 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/domain/time/MidnightPeriodChecker.kt"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd626f63fc63aa27eb5a336d9de1c6835182fa753abb20def56bb4557a237db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt:192-202 | app/src/main/java/com/serranoie/app/minus/presentation/widget/CompleteBudgetWidget.kt:250-261 \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/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca83cd50cdbf438e5ccaa7a4e2794f386805f866f48c7ade375eb98822678e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): app/src/main/java/com/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt:206-216 | app/src/main/java/com/serranoie/app/minus/presentation/widget/CompleteBudgetWidget.kt:280-291 \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/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fd32bed578622b9bba9ca094df8278d36ddd23063720af487e663b05910c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (61 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt:126-186 | app/src/main/java/com/serranoie/app/minus/presentation/widget/CompleteBudgetWidget.kt:185-245 \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/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba465451953e6bf5707f24290dba4b3dc352ad4c4a5a4a07b55ff26c59f57a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/CurrentPeriodRecurrentSection.kt:77-126 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/FutureRecurrentSection.kt:92-141 \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/serranoie/app/minus/presentation/ui/history/sections/CurrentPeriodRecurrentSection.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/serranoie/app/minus/presentation/ui/history/sections/CurrentPeriodRecurrentSection.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dc51d88f5a8fd49bc029f2168a62b4194fed7364858f2904852d8df0840de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201350 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/charts/DetailedChart.kt:99-101 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/charts/SpendsChart.kt:75-124 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/charts/SpendsChart.kt:201-250 \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/serranoie/app/minus/presentation/ui/theme/component/charts/SpendsChart.kt:75\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/serranoie/app/minus/presentation/ui/theme/component/charts/DetailedChart.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2043b83d98117493f411f3ef46dab94ec9fdc3b73d394a94f23e6270bcebd98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt:374-421 | app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt:447-494 \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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f1f0e4d54571201e2c5d25ef1d1b644e9b69593477786a4bc3ab29827146a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201343 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:600-642 | wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt:402-438 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt\u0060 and \u0060wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:600\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 first that the copies are not typed on the same thing: \u0060Icon\u0060 names \u0060androidx.compose.material3.Icon\u0060 in one and \u0060androidx.wear.compose.material3.Icon\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:644\u0060 calls \u0060HorizontalDivider\u0060, \u0060padding\u0060 and \u0060wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt:440\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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"010eca98ab63866ad103ac614f77e946e0d10e3115cab2097f976ef3054c9a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/changelog/components/ChangelogBugFixItemCard.kt:88-120 | app/src/main/java/com/serranoie/app/minus/presentation/ui/changelog/components/ChangelogItemCard.kt:140-172 \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/serranoie/app/minus/presentation/ui/changelog/components/ChangelogBugFixItemCard.kt:88\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/serranoie/app/minus/presentation/ui/changelog/components/ChangelogBugFixItemCard.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca665e3aa2a4d69c796571daff4c1cda02b5dc730645507d6386534cfcdc9f38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:989-1019 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:1035-1065 \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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:989\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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5dbabf280b9983d4d8b57f0a582cc92c8e6ddeecde4aceedb474c1deb2988f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt:203-231 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt:234-262 \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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt:203\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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0ef7aeb39620ba62407eb13e2366d0120935fa6bbb1bd9d16f3b98ecdb8975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:736-762 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:764-791 \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/serranoie/app/minus/presentation/ui/editor/Editor.kt:764\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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"54153bb784a25d9ae3d833f6da1109603dc43c77c464d6802d2e017275b676bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt:182-209 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt:160-187 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt:182\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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b6dfba4b77121c753062029774610680ed1a67fb781f9348ae2d3d60ab091a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:250-274 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:307-333 \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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:250\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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a197142156cc33d5259045676485668d3d82abe7858a2c10656d6f22349fa203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:55-78 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:175-198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"124ef224278c69401d49b581a2239df6cd13f7ea607b523bc8c8f451ed516dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1109-1131 | app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1285-1307 \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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1109\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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8040ecef504670f76f8ca2770f2468377f3be25bb93ee2e6ea4d95374ace67cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:735-756 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:786-807 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:811-832 \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/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:735\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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce578d309cd49432177ee9d022d5033e7d8b27790d8a7b7fe2c9d23bd93aaf26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:228-248 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:285-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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:228\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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3322dbea1296cd57f69f4005e65ee406595856495c7c367024bcb9fb8f4737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:86-105 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:130-151 \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/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:130\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/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"285c8c80d1295f0ff3a49425755c2738be17a68a900376192325186203c2a3a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/widget/HeatmapWidget.kt:164-183 | app/src/main/java/com/serranoie/app/minus/presentation/widget/MonthHeatmapWidget.kt:139-160 \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/serranoie/app/minus/presentation/widget/HeatmapWidget.kt:164\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/serranoie/app/minus/presentation/widget/HeatmapWidget.kt"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06a75d63c13b49fa5265438f15bb7a03e3e6ca81d458f041c57df882e625316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1161-1181 | app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1313-1333 \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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1161\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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1160\u0060 calls \u0060padding\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1312\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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cadfbeaf20b08e73223d76564beeb9e34e075064df823ed3337349631d728a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201321 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt:477-491 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt:556-576 \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/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt:477\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/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6ce66c0edefb7e125476567a0ccae28efb3a801cb17cac661a259fec9dc71f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt:179-198 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsWeeklyCalendar.kt:334-354 \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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt:179\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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ced10953149a8d27e76cbeda6c47e389a20ee1d7f75001f75d9a6234eb5ee7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:764-782 | app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:791-810 \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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:791\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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21fd965ca3d80e74e19fccac7008e4d9c96a4a88c6e55d31b844ee97db7a1b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1223-1242 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1268-1287 \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/serranoie/app/minus/presentation/ui/editor/Editor.kt:1223\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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6fca8eb0561f77d940897fe670c3aa2917f0815027fdedfbd4710e297bf1ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt:155-174 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/RecurrenceConfigSheet.kt:112-131 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/RecurrenceConfigSheet.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt:155\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/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2234f51ccce6b1f5a977d22ea25ef5b15ecc5a2c9fdd47ca8acb6bf9e1812d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt:80-99 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/TransactionDateSections.kt:100-119 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/TransactionDateSections.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt:80\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/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9953545b6c553976c5eecbc215c999c38b2f7d72ba86cdc8329d71f065ce9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/MockDisplay.kt:330-349 | app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/MockDisplay.kt:641-660 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/MockDisplay.kt:350\u0060 calls \u0060Spacer\u0060, \u0060weight\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/MockDisplay.kt:661\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/serranoie/app/minus/presentation/ui/settings/appearance/MockDisplay.kt"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f530d010f22ec0c1c01214c9641ad610c75440624ebbac3474fb713f79ce7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:870-889 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:896-915 \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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:870\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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05e2bf81f0dc6fcb9b2a4e9b0b91b70e811db397ca51b8f01f70e025f60dc7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/charts/CategoriesChartCard.kt:153-172 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/RecurringItemVisuals.kt:47-63 \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/serranoie/app/minus/presentation/ui/theme/component/charts/CategoriesChartCard.kt:153\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/serranoie/app/minus/presentation/ui/theme/component/charts/CategoriesChartCard.kt"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b6274319c2900dcb46bc29e6b9af00d042cc3a27135e4e133d7f4c21780c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:378-396 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:425-443 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:473-491 \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/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:378\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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b7254b3141362b13bedbde4b99e5e682cc1a9c71ce22c2245b52073eb0c292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:111-129 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:208-226 \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/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:111\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/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae2415d4784863b33f32b3c3e3e5f00d18c322a766a321288a274366b24b7c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt:99-117 | app/src/main/java/com/serranoie/app/minus/presentation/widget/CompleteBudgetWidget.kt:115-133 \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/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt:99\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/serranoie/app/minus/presentation/widget/BudgetOverviewWidget.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b265bd0b7555c1a6ac894bcd37516feeb3be2f84b9e8a12f44b87f40e2474006"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/features/CsvSyncGuideScreen.kt:274-291 | app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/features/FeatureLabScreen.kt:249-266 | app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/features/NotificationScanScreen.kt:219-236 \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/serranoie/app/minus/presentation/ui/settings/features/CsvSyncGuideScreen.kt:274\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/serranoie/app/minus/presentation/ui/settings/features/CsvSyncGuideScreen.kt"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb711d86c6b82076185cb628c34cd26d475d398a6f72d21efd5488a4df3715d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/CategoryLimitsCard.kt:48-64 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SavingsRecommendationCard.kt:126-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/serranoie/app/minus/presentation/ui/analytics/CategoryLimitsCard.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. 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/serranoie/app/minus/presentation/ui/analytics/CategoryLimitsCard.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d148b866168d2f9bad27ac882e2eb2ab204ad0ef7b6037626f7fcd873bfeec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt:429-445 | app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt:502-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/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt:429\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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c2f0b8fc01af81464a0c9f01d41a57502d4f92e20a034fddf5fac9a454929f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/AppearanceOptionsScreen.kt:231-248 | app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/bugreport/BugReportForm.kt:149-166 \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/serranoie/app/minus/presentation/ui/settings/appearance/AppearanceOptionsScreen.kt:231\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/AppearanceOptionsScreen.kt"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9889de4942882b22ac971fb55cbd7518d8f77bca120057f3997b05130ababc5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:544-559 | wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt:314-331 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt\u0060 and \u0060wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:544\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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"a018bddea1134030effb9fe81567f9891e7bebc14c2f329b3f03dfea1eb280d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/CreditOwedCard.kt:72-89 | app/src/main/java/com/serranoie/app/minus/presentation/ui/tutorial/TutorialBox.kt:229-246 \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/serranoie/app/minus/presentation/ui/theme/component/budget/CreditOwedCard.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ce3750eefda976f403f6c70e7df9bed7cda812b1820737399a62b5f3bca97c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:582-599 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:621-638 \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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:582\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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:600\u0060 calls \u0060plusDays\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:639\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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e8644e3e9a6db1927e23ba642bd4e38a7925ffb7f8be0cd509e5f2f98fd123"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt:122-139 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt:124-141 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d7ee0e398d58ad0067e6ebb515d054cc2b348c0314ff8916a9fccb2a9436ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/AppearanceOptionsScreen.kt:265-281 | app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/AppearanceOptionsScreen.kt:318-334 | app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/AppearanceOptionsScreen.kt:495-511 \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/main/java/com/serranoie/app/minus/presentation/ui/settings/appearance/AppearanceOptionsScreen.kt:265\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/serranoie/app/minus/presentation/ui/settings/appearance/AppearanceOptionsScreen.kt"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5af47cc1289e2f6a57598d639f2bfd209324a867267ae0fb984360ced869f30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:566-576 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:61-77 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:181-197 \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/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:61\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f895e87d4044f50950588c9d0e87c6418ced22677647868dc72f72d9edb68d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/dialogs/PastPeriodsBottomSheet.kt:222-237 | app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/dialogs/PastPeriodsBottomSheet.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/serranoie/app/minus/presentation/ui/analytics/dialogs/PastPeriodsBottomSheet.kt:222\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/serranoie/app/minus/presentation/ui/analytics/dialogs/PastPeriodsBottomSheet.kt"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c40f46255babeddfaa368f9cf35a7cbaee563cd4327d6b57be5c3de1cce1764"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:407-423 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:455-471 \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/serranoie/app/minus/presentation/ui/editor/Editor.kt:407\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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd735d721dfe8af571316f5d17240420959fc2d658e20531a27c9eb700a6f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:122-138 | wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt:100-116 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt\u0060 and \u0060wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: \u0060MaterialTheme\u0060 names \u0060androidx.compose.material3.MaterialTheme\u0060 in one and \u0060androidx.wear.compose.material3.MaterialTheme\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadadc2cf993a4624f7d165b83981eb907fd205b2504f919c9ad62613f073e1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt:184-200 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingDailyGraph.kt:181-197 \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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c71e7c17234e8d91f60b5b15a81568a5d16df13922dea5bb0fff78a0993b550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingDailyGraph.kt:115-129 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/charts/DetailedChart.kt:180-196 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingDailyGraph.kt:115\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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingDailyGraph.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a590d7c4d34573d5d0f38913c4337466bef11b7ca996dbaa1e8e4c49067641"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:893-909 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:948-964 \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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:893\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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd58c9c9a8449b9ba3a38a26dc03130d356e358f3b29cf575c087ee4c7aaff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1248-1263 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1294-1309 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1343-1358 \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/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1248\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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ad0b93356a21163dbee56cfa79213185a905c42553410a1459dbe843ff2a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1137-1152 | app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1339-1352 \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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1137\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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef8ade6c3db393d1f5b83c02ddcd40154fc56caa82cbef59c48be992ebf24ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt:362-377 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/RecurrenceConfigSheet.kt:341-353 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/RecurrenceConfigSheet.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \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/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebe6f96425100461e6845b780a57af5206a77e5c8f3c8d07f49581250495f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/GraphCanvas.kt:62-77 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingDailyGraph.kt:96-107 \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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/GraphCanvas.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c99f27b85e9288b81709a8d61013e9b5f0bb3251f8cd6561abe9382bd288537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): wear/src/main/java/com/serranoie/app/wear/minus/presentation/PeriodOverviewScreen.kt:342-357 | wear/src/main/java/com/serranoie/app/wear/minus/presentation/PeriodOverviewScreen.kt:377-392 \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 \u0060wear/src/main/java/com/serranoie/app/wear/minus/presentation/PeriodOverviewScreen.kt:342\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":"wear/src/main/java/com/serranoie/app/wear/minus/presentation/PeriodOverviewScreen.kt"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"2084958493628447c875f43abbea83c5e1a902c4dc43005a2e41e5b560ed50f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt:31-42 | app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetWidgetUpdater.kt:160-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt:31\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/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bb0b6275957698f2f7c7de9d005717cd109563f669bd69f6a33c9d3f3978df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1060-1074 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/CategoryToolbar.kt:255-269 \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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5f15873a0c337b608df3a2af82fef3b0767b184974ee4797da687a22a54b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/EditableCategoryTag.kt:218-231 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/note/EditableNoteTag.kt:135-149 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/EditableCategoryTag.kt:218\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/serranoie/app/minus/presentation/ui/editor/category/EditableCategoryTag.kt"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2328404c03d3c6ed562151030644fb7abec9891a65ade42c089b403f7b2bb365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt:449-462 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt:491-504 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt:521-534 \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/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"330c8009c1a997849b207b4980164c57e572514c40cb3e19668cbf824573b600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:870-883 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:896-909 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:951-964 \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/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:870\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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59fc720837ea978591918f31fc27b86f47d563d9983bad7959e88ef657ee53b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/date/CalendarHeatmap.kt:541-554 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/date/CalendarHeatmap.kt:559-572 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/date/CalendarHeatmap.kt:577-590 \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. 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/serranoie/app/minus/presentation/ui/theme/component/date/CalendarHeatmap.kt"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46cbedd02941c6c3ddf333dd1abaa7ea83cf52f81c09c04e0bd706339fbd1d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/CategoryLimitCard.kt:256-269 | app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/bugreport/BugReportForm.kt:408-421 \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/serranoie/app/minus/presentation/ui/editor/category/CategoryLimitCard.kt:256\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/serranoie/app/minus/presentation/ui/editor/category/CategoryLimitCard.kt"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"74eb1d4da1085be9c4556703a12cca0a99e8bad4b4e7b899957a6cf18fa960d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetBehaviourContent.kt:245-257 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt:499-512 \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/serranoie/app/minus/presentation/ui/editor/sheets/BudgetBehaviourContent.kt:245\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/serranoie/app/minus/presentation/ui/editor/sheets/BudgetBehaviourContent.kt"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de3f23065d2b1f2a0cc9530db9a8738c0a032a73952952a9de78819c92f9b11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/DueTodayCard.kt:48-61 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/Subscriptions.kt:320-333 \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/serranoie/app/minus/presentation/ui/subscriptions/DueTodayCard.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acc44401e7b64f2a0a63de4f9de5e31bfa9db975a4496b8717822fb1c084cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:140-153 | wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt:118-131 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt\u0060 and \u0060wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:140\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: \u0060Icon\u0060 names \u0060androidx.compose.material3.Icon\u0060 in one and \u0060androidx.wear.compose.material3.Icon\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ba7f365f61e355584a086347d672b2c54a4c693c8020fc2c5cb67a081b3e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/util/Utils.kt:102-115 | app/src/main/java/com/serranoie/app/minus/presentation/util/Utils.kt:137-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/serranoie/app/minus/presentation/util/Utils.kt:102\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/serranoie/app/minus/presentation/util/Utils.kt"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a56047269f3c25859911ced64a231810640a987c4fe3f8a1eecd4527ca02905"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1279-1291 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1325-1336 \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/serranoie/app/minus/presentation/ui/editor/Editor.kt:1279\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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"447245c4d212ef812250d265da35c35151227c8585cf57405688fd919a4b2898"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt:222-234 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/dialogs/TransactionEditDialog.kt:58-70 \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/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1040d4809e01721c82d46fa6b7b08234a81a948d19b43809ac177d6ca6e19c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionDateTimeRow.kt:43-55 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionDateTimeRow.kt:74-86 \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/serranoie/app/minus/presentation/ui/history/edit/TransactionDateTimeRow.kt:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionDateTimeRow.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d18c92c23ce7d34b3bd9f4fb4ae6ec398c9b104c75c08e0f6cc17729d31020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt:104-116 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/TransactionDateSections.kt:140-152 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/TransactionDateSections.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt:104\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e813c64bac2963beaca535960048a95e70c1f3793f9a0851003a9bd414e8562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionItem.kt:168-180 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionItem.kt:188-200 \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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionItem.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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionItem.kt"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd116f7c3f547897f473fab02a84e933d35c6c7ec662f91cb5d2fff0615426f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/GraphCanvas.kt:84-96 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:234-246 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/GraphCanvas.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6b372759b5f1af271bbf8b29c33dc635817ed56a4ffa789addc57a4b74f4da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:504-516 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt:319-331 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:504\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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca239a0508da7bd76d25d4493bbed9a758f37c81055c6116bf304def7320668"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt:297-309 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt:320-332 \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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt:297\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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81315a999e6d8567c0fd84dcb1cf81193dd4d0e623c9226c4704b0b0c1a59db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt:426-438 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt:690-702 \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/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt:426\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b32397874a0b1e47dd31b4b1450b197165978ec89a1e1080631ab4f969ab33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/CurrentPeriodRecurrentSection.kt:74-85 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/FutureRecurrentSection.kt:89-100 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt:77-88 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/TransactionDateSections.kt:97-108 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/TransactionDateSections.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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/serranoie/app/minus/presentation/ui/history/sections/CurrentPeriodRecurrentSection.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/serranoie/app/minus/presentation/ui/history/sections/CurrentPeriodRecurrentSection.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b695db5e5ba82b114a4922edcd02d8e76565aacaa887cc82a155463388d03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt:149-160 | app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt:254-265 | app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt:367-378 \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 before the matched lines, \u0060app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt:252\u0060 calls \u0060recurrentNotificationId\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt:365\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/serranoie/app/minus/presentation/notification/NotificationHelper.kt"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4e46acd51217f1481d8f0e33bb22dd3fe8f15699f7dcdb981b12e7f518bd43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1232-1243 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1277-1288 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1323-1334 \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/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:1232\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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"214cb4113365f1000f864bb702aafcac8dfae842a3e0804fe96b477639f99ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.kt:297-308 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.kt:340-351 \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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.kt:297\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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.kt"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb344c1b97fd02027988da46d3c66fae3ddd796a4b5bd25838bd3314997e2a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:295-306 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:316-328 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:337-345 \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/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt:295\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/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.kt"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede0e57384f673322b23814e6a074a7a62f50ae98a034b665afc28b9c013e987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/widget/HeatmapWidget.kt:84-95 | app/src/main/java/com/serranoie/app/minus/presentation/widget/MonthHeatmapWidget.kt:79-90 \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/serranoie/app/minus/presentation/widget/HeatmapWidget.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6ea89fa93d69e2f7c85b03c492e5718b999e58efd93cf981f8a0707fffb1a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt:123-134 | app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearMessageListener.kt:113-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt:123\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"61230ebe635de15fbe771df47e16f3ba522a429e0b692e29a05a0adab4a3b283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:734-744 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:759-769 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:785-795 \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/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:734\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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eab5e7e44dfaa3d9c5269852c7e9ccac957a99ef899e3b4674481d7a19088cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1193-1203 | app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1366-1376 \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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1193\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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebc2f18a20b7ee9be380e3a105d31773357bb94cf5f7fcc863746ecfb2e158c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1205-1215 | app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1377-1386 \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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1205\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1204\u0060 calls \u0060padding\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:1376\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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf6c551dd7ff501ce03b9916a257bb7c3bbff51734ca24288187f3a2fe1cb75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.kt:188-198 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.kt:385-394 \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/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.kt"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e70d4310e818c77dfaee9b2946927d3faf93b9d548f5cdda4fcdb9d7653f27c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/onboarding/OnboardingScreen.kt:251-261 | app/src/main/java/com/serranoie/app/minus/presentation/ui/onboarding/OnboardingScreen.kt:275-285 \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/serranoie/app/minus/presentation/ui/onboarding/OnboardingScreen.kt:251\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/serranoie/app/minus/presentation/ui/onboarding/OnboardingScreen.kt"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9d7985b288d0fafed7d437bcdb557114fca87b2c6bcfe42ad55cf3a4c3a157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt:284-293 | app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt:347-356 \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/serranoie/app/minus/presentation/notification/NotificationHelper.kt:284\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/serranoie/app/minus/presentation/notification/NotificationHelper.kt"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f46b27ed386d713414b0d0e515f60567ce680492eb3630f3cfcf60da5dde735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt:51-60 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsWeeklyCalendar.kt:97-106 \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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c23224b4999bddfc83fa29cab445a3e32b72278c0c4a15bbc4d363aa8123449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:210-219 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt:106-115 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:221\u0060 calls \u0060stringResource\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt:117\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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"231bb515de417387763bff3c2ac66ec59f3e6c3fdb70e0039afda3a4391ddb7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/SavedCategoriesGrid.kt:211-221 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/SavedCategoriesGrid.kt:237-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/SavedCategoriesGrid.kt:211\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/serranoie/app/minus/presentation/ui/theme/component/numpad/SavedCategoriesGrid.kt"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e330aa11d75bc85b90665b2d512cd0b1eb21c6eec116f6701e7796941eb31e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/domain/calculator/TransactionPeriodMapper.kt:63-71 | app/src/main/java/com/serranoie/app/minus/domain/calculator/TransactionPeriodMapper.kt:88-96 \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/serranoie/app/minus/domain/calculator/TransactionPeriodMapper.kt:63\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/serranoie/app/minus/domain/calculator/TransactionPeriodMapper.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6919adb049bf737cd2d16a7a53e0769ec9b038c85020e2aebac51a68a751e95a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:941-949 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/FinishedPeriodHeader.kt:65-73 \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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:941\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/serranoie/app/minus/presentation/ui/theme/component/FinishedPeriodHeader.kt:63\u0060 calls \u0060fillMaxWidth\u0060, \u0060padding\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt:940\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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9278c8a5459cdd91f0f0254993849f13dd4273bd86b873ed08988b5512521ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt:176-192 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/RecurrenceConfigSheet.kt:133-149 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/RecurrenceConfigSheet.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt:176\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/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2de000d1f02b0f642a148bfa4b93d0d6b724e0831ef3c3cc9789d46e596b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:403-411 | wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt:209-220 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt\u0060 and \u0060wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:403\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. Note first that the copies are not typed on the same thing: \u0060Icon\u0060 names \u0060androidx.compose.material3.Icon\u0060 in one and \u0060androidx.wear.compose.material3.Icon\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, 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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e43e15a8f343ee3f2710d542f8a802ece4de60a7d58affd129ebfaa878381a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/CreditOwedCard.kt:58-66 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/TotalBudgetCard.kt:116-124 \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/serranoie/app/minus/presentation/ui/theme/component/budget/CreditOwedCard.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"160786af2153f5275647cfd76090f72c8a55fc156ffdf313a624638b6a5869fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt:360-368 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"97052860a3e1c131e177f1208914f94628fe1af0b7e0873e1c37bf5925407d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt:156-164 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt:151-159 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c4fd8e68e5fab4f8358ca773f6ecdb9c2112d05b3b7e36e384e7078f60aef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt:97-105 | app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearMessageListener.kt:91-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt:97\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/wear/java/com/serranoie/app/minus/wearsync/PhoneWearListenerService.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"203cf8a2ada6faaa45180fefbd3e69b638f9b33ec3539f644ae21cb3512d4edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/Subscriptions.kt:223-229 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/Subscriptions.kt:235-242 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/Subscriptions.kt:258-265 \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/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/Subscriptions.kt:223\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/serranoie/app/minus/presentation/ui/subscriptions/Subscriptions.kt"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"99440f5cdd61dd8c2cc026a2f2432c8b68626f155917ebf4c0cccf5d6696440e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt:166-173 | app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationHelper.kt:388-395 \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/serranoie/app/minus/presentation/notification/NotificationHelper.kt:166\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/serranoie/app/minus/presentation/notification/NotificationHelper.kt"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"769854e48464355a352662a9f30960f0d19220112d6d1847206f0b51eb48f28e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt:204-211 | app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt:275-282 \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/serranoie/app/minus/presentation/ui/history/HistoryScreen.kt"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdc086f7e82848b360cbe9a99c9eae28a67ebeb1f7da8fbe2194f6abf117f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:329-339 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt:163-170 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:329\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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryHourChart.kt:172\u0060 calls \u0060coerceAtMost\u0060, \u0060toPx\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:340\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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e4a2caa16d2933b79bb60ebdacac1795b779a799990f118df95634b092a386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/GraphCanvas.kt:61-70 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:207-213 \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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/GraphCanvas.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc84592d1d7a4920f07bb1adb5b1ffa8800d1abd4934cb537817170767d48ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/data/repository/BudgetRepositoryImpl.kt:84-89 | app/src/main/java/com/serranoie/app/minus/data/repository/BudgetRepositoryImpl.kt:124-129 \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/serranoie/app/minus/data/repository/BudgetRepositoryImpl.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9583f40a2c8d8c7c71cc51aa9c7ce275715407ccca199e202c0650c98ed5054c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/util/ColorUtils.kt:116-125 | app/src/main/java/com/serranoie/app/minus/presentation/util/ColorUtils.kt:127-137 \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/serranoie/app/minus/presentation/util/ColorUtils.kt:127\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/serranoie/app/minus/presentation/util/ColorUtils.kt"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"418d5a07a99f8f960ec38875fc282791e117d8ba8a12db7d6d17db4180c29338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt:370-374 | app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/dialogs/PastPeriodsBottomSheet.kt:146-150 \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/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt:370\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/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0d1e76ce3c9ece5a7331ed2f3d61d48d4c4225bb540523b35983c9a668518e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.kt:268-273 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/MultiCategoryChart.kt:538-542 \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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.kt"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b821d69f2a0990d5a50e18a14ba86c4a803250d70da7de982d680bb43206311b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt:391-396 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt:668-673 \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/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d747ef2cfe3901957b73821ab095775438754b96d39bb632287c9583d9095941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetTransactionHandler.kt:365-374 | app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetViewModel.kt:927-936 \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/serranoie/app/minus/presentation/ui/budget/BudgetTransactionHandler.kt"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"7291d54ab4ee49db30327083dd7a7af92477a0a1434674192c06b619820d5fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/split/CalculatedSplitCard.kt:39-44 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/split/SplitCalculations.kt:9-14 \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/serranoie/app/minus/presentation/ui/editor/sheets/split/CalculatedSplitCard.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b532fd27c9b2333a24290559a2e1fbcb6e073d618e81e6b9636533c38d284de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/SectionUtils.kt:21-26 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/SavedCategoriesGrid.kt:51-56 \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/serranoie/app/minus/presentation/ui/history/sections/SectionUtils.kt:21\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/serranoie/app/minus/presentation/ui/history/sections/SectionUtils.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27a6ec19f484ed50f380e1c24769a5398e4c3fe956fb207961932ce7b6a0313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCategoryGraph.kt:154-164 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsWeeklyCalendar.kt:429-439 \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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCategoryGraph.kt"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8739705b878ee858ff9ba8824ae9fe1f497b566086086ab5ba58611145131c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:174-183 | wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt:153-162 \u2014 before extracting anything, compare \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt\u0060 and \u0060wear/src/main/java/com/serranoie/app/wear/minus/presentation/theme/component/SettingsGroup.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 114 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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt:174\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/serranoie/app/minus/presentation/ui/theme/component/SettingsGroup.kt"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"08979fac2f75cb666ffc8be0168a9095890e8755d3855ec0e44f1653d1340e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/SavingsPocketsCard.kt:260-264 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/RolloverDialog.kt:89-93 \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/serranoie/app/minus/presentation/ui/analytics/SavingsPocketsCard.kt"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b895d4e47d74c0036175b5db2ba040e648cad830ec9b04a703aef019456046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/changelog/components/ChangelogBugFixItemCard.kt:69-82 | app/src/main/java/com/serranoie/app/minus/presentation/ui/changelog/components/ChangelogItemCard.kt:121-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/changelog/components/ChangelogBugFixItemCard.kt:69\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/serranoie/app/minus/presentation/ui/changelog/components/ChangelogBugFixItemCard.kt"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced0755b41576800c533e900391e756d729396ba63492257698b6a1dfaf3f6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:356-371 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt:403-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/serranoie/app/minus/presentation/ui/editor/Editor.kt:356\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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76508eb8e6e8c86f67183812c98a41dce978c75f7091bcd72258982fc43aa5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SavingsRecommendationCard.kt:389-403 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/SavingsRecommendationCard.kt:450-464 \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/serranoie/app/minus/presentation/ui/theme/component/SavingsRecommendationCard.kt:389\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/serranoie/app/minus/presentation/ui/theme/component/SavingsRecommendationCard.kt"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba03cc7c75fb3f6efcb58f27a823a8850adf52efe1932dbdd1d32b43f4e7b939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/SpendBudgetCard.kt:312-325 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/SpendBudgetCard.kt:330-343 \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/serranoie/app/minus/presentation/ui/theme/component/budget/SpendBudgetCard.kt:312\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/serranoie/app/minus/presentation/ui/theme/component/budget/SpendBudgetCard.kt"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"842eb82277d1ab47fd72541b608d0566c4a4d5d0ca3e22b07502d086fa1df934"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/MinMaxSpentCard.kt:278-289 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/MinMaxSpentCard.kt:299-310 \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/serranoie/app/minus/presentation/ui/theme/component/budget/MinMaxSpentCard.kt:278\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/serranoie/app/minus/presentation/ui/theme/component/budget/MinMaxSpentCard.kt"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e392ed29531bc643edd1ad29849ec7a4deb4098920179ad440983ee8593b4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt:1303-1313 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt:1329-1338 \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/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt:1303\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/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a725dfc54c4fa608178fb36a852fff07ae71cd77b4a43da1be964cc6b3b4415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCategoryGraph.kt:169-176 | app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCategoryGraph.kt:190-197 \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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCategoryGraph.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCategoryGraph.kt:198\u0060 calls \u0060previewCharge\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCategoryGraph.kt:177\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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCategoryGraph.kt"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d2d4b4bfd729b888c21e9e68bd0b6897d8fdabc5ec1efb3a3af172c48fcb96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/CategoryToolbar.kt:216-220 | app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/CategoryToolbar.kt:245-249 \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/serranoie/app/minus/presentation/ui/editor/category/CategoryToolbar.kt:216\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/CategoryToolbar.kt"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e67a5b0e390efa4189e018b1f15a3d6f6a7e41451ac204e25f0423852b0018c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/harmonize/hct/Cam16.java:376-381 | app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/harmonize/hct/CamSolver.java:576-581 \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/serranoie/app/minus/presentation/ui/theme/harmonize/hct/Cam16.java"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1405de7688372366b1ecf226ae5d0c89893519d9abb2a1ad30a3df7296f4a6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: :island-sdk: :island-sdk: abstractness 0.07, instability 0.00, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fc9f050e810489492e1d0408af97ef71c8c96e66987cbebeacec41207b35b115"}},{"ruleId":"D12","level":"warning","message":{"text":"No Gemfile.lock committed by an application: This repository declares 2 gem(s) across 1 Bundler manifest(s) and ships no application \u0060.gemspec\u0060, so it is an APPLICATION \u2014 but no \u0060Gemfile.lock\u0060 is committed. Nothing records the versions a working build resolved to, so \u0060bundle install\u0060 re-resolves against whatever rubygems.org serves today and two deploys of this commit are not guaranteed to be the same deploy. Run \u0060bundle install\u0060 and commit the resulting \u0060Gemfile.lock\u0060. (A published GEM correctly omits its lock, which is why this is asked only of a repository that ships no .gemspec.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cce86a6764b0429f696055851835123ad1dee71ace60575c329aed06e5e6bcd7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in MainScreenContentKt.PhoneLayout at line 628. 4 of those changes were fix/bug commits, and the other 18 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d079ecde6a531e3f4593ab1379c00b7a5eed51f3dcd9f461c9fdd31b077c09b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in AnalyticsKt.Analytics at line 206. 4 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.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/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"41101af788b16ebf0bd43ebee7625d00860dc08892bb332e15a259fb13b1ea3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in BudgetPillKt.BudgetPill at line 129. 3 of those changes were fix/bug commits, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPill.kt"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d437eb7e06393f1d2489d1a8365b7ccd572200571ba4878190fb2073f08d7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in EditorKt.EditingContent at line 665. 4 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c8ccd544b22e2699249b8bfbc8da40a714c08e46e4a9f762d0cdbff998d084"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.kt changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in TransactionEditScreenKt.TransactionEditScreen at line 80. 4 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-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.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/serranoie/app/minus/presentation/ui/history/edit/TransactionEditScreen.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa58a9b82596d000e327a985c5d3460b2e249fa83a5b87df319a79cc8fb034e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingGraph.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingGraph.kt changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in TrendingGraphKt.BudgetGraph at line 428. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingGraph.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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/TrendingGraph.kt"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"960a9ecdb37bfc476b012846687039971416e2e9b9a4fea42e34c04b8faae24f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in BudgetPeriodSheetKt.EditBudgetContent at line 659. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.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/serranoie/app/minus/presentation/ui/editor/sheets/BudgetPeriodSheet.kt"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"038ea4169636279712d9286275163543f7ee08cf725c8aa0bec3f67135182761"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetTransactionHandler.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetTransactionHandler.kt changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in BudgetTransactionHandler.applyTransaction at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetTransactionHandler.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/serranoie/app/minus/presentation/ui/budget/BudgetTransactionHandler.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62f3d07a8e5bd22c0439cb7d03f46d1e18ebedb8c67bf59204c17821ff085d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in BudgetStateCalculator.calculateBudgetState at line 44. 1 of those changes was a fix/bug commit, 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-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.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/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"77057cea84bf90e479c83d9e164a6e4bdc27be01467b99f8cac5c9da8783fe72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/EditableCategoryTag.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/EditableCategoryTag.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in EditableCategoryTagKt.EditableCategoryTag at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/EditableCategoryTag.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/serranoie/app/minus/presentation/ui/editor/category/EditableCategoryTag.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d16d5e37b19b0029647d88813ed971b793211d1628cd77532f966cce596299"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillMetrics.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillMetrics.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in BudgetPillMetricsKt.resolveExhaustedMessage at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillMetrics.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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillMetrics.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc70fc998d3e6a93b21d6af8d2232f6c9cdbe8e05f60994d9c0940363a6b37b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreen.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreen.kt changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in MainScreenKt.MainScreen at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreen.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/serranoie/app/minus/presentation/ui/home/MainScreen.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"330d127616be0f959c756664407a4feb890da14fbb5317ecb074b66a39ae74a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItemExpandedContent.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItemExpandedContent.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in ExpenseItemExpandedContentKt.ExpenseItemExpandedContent at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItemExpandedContent.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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItemExpandedContent.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0974e9f4d2acede558ab9b2771850bbe80c8b6e94fabc246337ac0a149ae76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetPeriodManager.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetPeriodManager.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in BudgetPeriodManager.persistBudgetSettings at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetPeriodManager.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/serranoie/app/minus/presentation/ui/budget/BudgetPeriodManager.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"83af3ea59cc152b1677aa894d32358407262d1418179e000b6758ef42df50ad8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in UpcomingRecurrentItemRowKt.UpcomingRecurrentItemRow at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.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/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df0179ce4eb4a98e346514a1f554bf98b3acd12e7333d94e99d2bf989e87d4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in NumpadKt.Numpad at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.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/serranoie/app/minus/presentation/ui/theme/component/numpad/Numpad.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff14fa867b359fa7d06fbe9b7a9d24904c5374edf17d75f6d6ccbd30943eb176"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ExpenseItemKt.ExpenseItem at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1fc5f8c460cfeb5b16d36c327ef5dcdb7b35402bc930ee36c836a60200e13c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryCalculations.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryCalculations.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in HistoryCalculationsKt.calculateNextChargeDate at line 127. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryCalculations.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/serranoie/app/minus/presentation/ui/history/HistoryCalculations.kt"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd6e86ea7b76570907ff1f11cf2349364e5b15401890089984d99ab907c4568"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillStatusLabel.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillStatusLabel.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in BudgetPillStatusLabelKt.StatusLabel at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillStatusLabel.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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillStatusLabel.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3757c2fb8f76af4226dd934ea1a2b6d6db26d976a5a0904da4c47087b9a00faa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/formula/BudgetFormula.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/formula/BudgetFormula.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in BudgetFormulaKt.buildBudgetFormula at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/formula/BudgetFormula.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/serranoie/app/minus/presentation/ui/theme/component/budget/formula/BudgetFormula.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad8e53ca15c16a10732629cef43bdcfc388b72b238c4b5558081541429a0fd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationScheduler.kt: app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationScheduler.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in NotificationScheduler.nextOccurrenceDateTime at line 342. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/notification/NotificationScheduler.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/serranoie/app/minus/presentation/notification/NotificationScheduler.kt"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7ac465b88425cd1607879ab4bd4b15336c449898fd89c239f9bac8e6e9d81e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/NumpadButton.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/NumpadButton.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in NumpadButtonKt.NumpadButton at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/NumpadButton.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/serranoie/app/minus/presentation/ui/theme/component/numpad/NumpadButton.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2c712d21b7cb56e3491962e7191d82028a9207b516454f4a78d987e1eeb09a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/LeftoverChoiceList.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/LeftoverChoiceList.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in LeftoverChoiceListKt.LeftoverChoiceList at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/LeftoverChoiceList.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/serranoie/app/minus/presentation/ui/theme/component/numpad/LeftoverChoiceList.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dae29939ddb147592c60602d23d0e45483cbf4177372c5dbcefbe611293bca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/receipt/ReceiptScanner.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/receipt/ReceiptScanner.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ReceiptScannerKt.rememberReceiptScanner at line 91. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/receipt/ReceiptScanner.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/serranoie/app/minus/presentation/ui/editor/receipt/ReceiptScanner.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fe97aa06820a9327f1d36a741c1fb26062f4591d19d57982fd92cb3731926a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillAmountText.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillAmountText.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in BudgetPillAmountTextKt.SegmentedAmountText at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillAmountText.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/serranoie/app/minus/presentation/ui/theme/component/budget/pill/BudgetPillAmountText.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ddd71fe78c4961a94ac086b35b74fe4b256209e42c2f2677b5695788aa6cb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in RecurrentExpenseDialogKt.RecurrentExpenseDialog 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-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.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/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"231ad510217544c4a5d2e04c6e62b506af9ebbebf8eb97b7b33d9c2429d88a6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in BudgetGraphChartDrawingKt.drawCoordinateSystem at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.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/serranoie/app/minus/presentation/ui/theme/component/budget/graphs/BudgetGraphChartDrawing.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4704597b8b6fa9d71659e2379b2fc1bbf360a9cfbeb5527b337a11701f09388"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/TotalBudgetCard.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/TotalBudgetCard.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in TotalBudgetCardKt.TotalBudgetCard at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/TotalBudgetCard.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/serranoie/app/minus/presentation/ui/theme/component/budget/TotalBudgetCard.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"34988650f058085512c15579e06dabe149feb60a0c888b6f8c394f8b0e4d6a4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/onboarding/FinishDateSelector.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/onboarding/FinishDateSelector.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in FinishDateSelectorKt.FinishDateSelector at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/onboarding/FinishDateSelector.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/serranoie/app/minus/presentation/ui/onboarding/FinishDateSelector.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8affb1c41e149bdc56c84daa25d421a9ae9389fc7acc7dd828e664709e3e563a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/tutorial/TutorialBoxState.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/tutorial/TutorialBoxState.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TutorialBoxStateKt.markForTutorial at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/tutorial/TutorialBoxState.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/serranoie/app/minus/presentation/ui/tutorial/TutorialBoxState.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac71f8e5f66f80055604d7e3a9f29add0d21d35328efd7cb892ef5c022ec5976"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/tutorial/TutorialBox.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/tutorial/TutorialBox.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TutorialBoxKt.TutorialBox at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/tutorial/TutorialBox.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/serranoie/app/minus/presentation/ui/tutorial/TutorialBox.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50380839bfd528fff1e044e3d402e0bb9ef20b0e2653bd80e2b9f73e14b62a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/Theme.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/Theme.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ThemeKt.MinusTheme at line 275. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/Theme.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/serranoie/app/minus/presentation/ui/theme/Theme.kt"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbeaa02ac7c18cbd19ecdbc0a3f612f591e723384f190211e9cac3f4e4ee06a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/TopSheet.kt: app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/TopSheet.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TopSheetKt.TopSheetLayout at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 00:21:00 -07:00\u0027 --until=\u00272026-11-15 00:21:00 -07:00\u0027 --full-history --no-merges -- app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/TopSheet.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/serranoie/app/minus/presentation/ui/theme/component/TopSheet.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2068123080cd4692ba9f38cc01cfc8fa6fd5c16b1f5eecee615caa2bca72656a"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060wear/build.gradle.kts\u0060 makes this repository a deployable product (line 5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/build.gradle.kts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"281c74192b03110ebff3772ad8261b57a5c763fd41d3abd3cd7a8b90bbfe4b09"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060onExportCSV\u0060 spells \u0060CSV\u0060 where 12 names in the project spell it \u0060Csv\u0060: 12 of 13 names in project app spell the token \u0060Csv\u0060 (12 of 13; unit: names in project app containing \u0060Csv\u0060). Peers: com.serranoie.app.minus.data.csv.MinusCsvContract (app/src/main/java/com/serranoie/app/minus/data/csv/MinusCsvContract.kt:3); com.serranoie.app.minus.data.csv.MinusCsvExporter (app/src/main/java/com/serranoie/app/minus/data/csv/MinusCsvExporter.kt:15); com.serranoie.app.minus.data.csv.MinusCsvParser (app/src/main/java/com/serranoie/app/minus/data/csv/MinusCsvParser.kt:21); com.serranoie.app.minus.data.csv.MinusCsvService (app/src/main/java/com/serranoie/app/minus/data/csv/MinusCsvService.kt:13); SettingsKt.Settings(onExportCsv) (app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/Settings.kt:147). Rename to \u0060onExportCsv\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/Analytics.kt"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee05e97a0491352f70c07923efe394f46e4140d5678b9dc85fd17ec2e0b6dbc"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060performUIHaptic\u0060 spells \u0060UI\u0060 where 40 names in the project spell it \u0060Ui\u0060: 40 of 41 names in project app spell the token \u0060Ui\u0060 (40 of 41; unit: names in project app containing \u0060Ui\u0060). Peers: com.serranoie.app.minus.presentation.ui.analytics.AnalyticsUiState (app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt:45); com.serranoie.app.minus.presentation.ui.analytics.AnalyticsUiEffect (app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt:62); com.serranoie.app.minus.presentation.ui.budget.BudgetUiState (app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetUiState.kt:15); BudgetViewModel.observeBudgetUiState (app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetViewModel.kt:157); BudgetViewModelKt.toBudgetUiError (app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetViewModel.kt:997). Rename to \u0060performUiHaptic\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/util/haptic/HapticUtils.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d29363aa809f9da976419560b671dd354684aec5e8c79a9526290cfa58f579a"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060app\u0060 (70503 LoC, 951 module-visible types across 85 directories) overshoots its size bounds. 1 of 7 build unit(s) (Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 7.1/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":"61a4c393fcf2edcc146a6fd7256e749b5108edb71d3e989350e050eaf3da4729"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10911f54b35d5e7f6ac3ca9c3897ce0586b43f824f86549f4f45944ec21d8e9b"},"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":"4e7391a71e8695a20aec423b255abc9464ef5fd16306da94f3ad5d5ed7d49e09"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8dfdaf84b7825b60bd4fc876071ec411c6534eab7d07434aa03886b54c1e6134"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85fad3c8e2d0fc6b585325ea44a1f46ca9e892dae20d6f0f3947f7c230727001"},"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":"8e7810b8b45ae78036dc9083c6b028126e9aa02288d93448f361a2cd968570aa"},"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":"7efd580a34ee4f3ab5583fbfd844393a1dee9869aa710f0585c223de4c5f4886"},"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":"d8b9fcd7cde31d5bc1b5c7980e8f902b0d075b48b6879b1b8428793b27f1c9d5"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29750baeb0abcbf25fe9e8d9acbb37beedb436e6cea8fb5267cdea97b99eb01c"},"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":"b297c0cb1698aa411a02a0c0c418a2b9a5d0c53dd5a621cb853849e5966af306"},"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":"96dd157f128580d32281f19a7c7077f64d2093d9646935485d9f3efdbde8a06a"},"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":"f204b021a2bea6e8d5e282a2dadfab510de1e32227e0c1f29202e0a56ecf1830"},"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":"b238443afe24c92e0a3cfa18197260e1c43e656f708048f356a15db7b6d6bcac"},"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":"31e15292ee7781495cff3025f3779e23aded0d07be93120b45c65e1d6518c389"},"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":"f1b966c70d2e5f6ab697ac6d268d54938c60e802d8ea58ea6ff9cb7e10a35f70"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a25692745ad0ed3ca68036746171ef1bfebcc093c4887320630d8afff98acf8"},"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":"f33f08448d372bbe3db6c1d9147aa1391c03aa82c80dcb4619fcd2569de9b530"},"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":"d07359526ec33dfeb9ca173208559ebcf97c967cbc6e0ff6e8fb3597b08e9f8a"},"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":"e2ddd713aa7a103e5bf233d4cc92db865fc33f84ab8a8b74643e42cf8f3a89db"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11ddbeb2753a436ed89e4349025acb6e41e3cf3f82468257b4a047855d9771f2"},"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":"cbe97bb5c07a6a8b4d6e5577a4294dec0d8c2f2f5bb3592174cce3d6f274e72b"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"303ff1840d175636c13e8e5945a67eed760efd3ad81248b15cd4632e7790edaa"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e693d64b06bfd4b0e33d91079f1518fe9f84df373d9768e8b622ba409a86255e"},"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":"54ca5bb9cb62edd1769462e4618acd5324a222f1253c6a8f58d13c72530f9d05"},"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":"8882e1b6d2a797b393d5058dcf459b27f6b100d5611e2d48aab82333c6ed3b29"},"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":"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":"63778fa624412affc09bbae17ed4e235deee47c1e8fbbd49594e08c2f223c987"},"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":"4203f64635d5dbbaa531ad4f03e6eb7b3fe4606e2ac8d7d8ffe41a2db40c064f"},"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":"D30","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":"47743485b2d4107a901b7f2083ef7efda031a025895f2df8c71c48fa3a12d3bd"},"properties":{"dependency":{"package":"zod","version":"4.5.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"a1a7b0d7c2bf340f3c0be15ef43fb3f997e2b18b2638982de45853faa8458d9f"},"properties":{"dependency":{"package":"zod","version":"4.5.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5506a20f9262f5563e0af2e9c7d6ee6848d5bf5acbfef94cd08ccf996056c008"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"3.1.9","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1936d51bcfd0c9939c7e09a7389d5b2f73874c4ba1cf03488d0f7b3fb70e2c34"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"3.1.9","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: SettingsRepositoryImpl.kt \u2194 SettingsViewModel.kt: \u0060app/src/main/java/com/serranoie/app/minus/data/repository/SettingsRepositoryImpl.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/settings/SettingsViewModel.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 \u00606b747361\u0060 feat: enhance CSV folder sync with status reporting and non-destructi\u2026; \u0060e0c5f728\u0060 fix: enable marquee effect on projection label; \u0060285b319e\u0060 feat: implement AMOLED dark theme option \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/data/repository/SettingsRepositoryImpl.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce498c7bd2623c29fcaacb244f369d39b43892665f7b3940cbff6d0ea071e77f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: Editor.kt \u2192 EditableCategoryTag.kt, MainScreen.kt, MainScreenContent.kt: \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.kt\u0060 changes together with 3 other files \u2014 \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/category/EditableCategoryTag.kt\u0060, \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreen.kt\u0060, \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreenContent.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/serranoie/app/minus/presentation/ui/editor/Editor.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d161864794a8dcb62791e169efd54f35f0e1ec6938c4fed7861f5e0fa9662c1b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: BudgetRepositoryImpl.kt \u2192 MidnightPeriodChecker.kt, BudgetStateCalculator.kt, BudgetTransactionHandler.kt: \u0060app/src/main/java/com/serranoie/app/minus/data/repository/BudgetRepositoryImpl.kt\u0060 changes together with 3 other files \u2014 \u0060app/src/main/java/com/serranoie/app/minus/domain/time/MidnightPeriodChecker.kt\u0060, \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt\u0060, \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetTransactionHandler.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/serranoie/app/minus/data/repository/BudgetRepositoryImpl.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0ec0ccae4480beced223b0332591004c68daba28163f175aa2192af9b2fb4d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: SettingsRepositoryImpl.kt \u2194 MainActivity.kt: \u0060app/src/main/java/com/serranoie/app/minus/data/repository/SettingsRepositoryImpl.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/MainActivity.kt\u0060 change together 57% of the time (12 of the 21 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 12 shared commits counted here, the most recent 3 are \u0060d609a396\u0060 fix(pockets): address PR review on savings pockets; \u00606f08a198\u0060 feat: support unresolved rollover surplus handling; \u0060bd810a7d\u0060 Revert \u0022feat: add daily surplus dialog and carry-forward support for \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/data/repository/SettingsRepositoryImpl.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e5dfd4a98993aea9cf7b46af3bffe3fc843a4a848ae64f9ce4d8537cbb527e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: AppNavGraph.kt \u2194 MainActivity.kt: \u0060app/src/main/java/com/serranoie/app/minus/navigation/AppNavGraph.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/MainActivity.kt\u0060 change together 52% of the time (11 of the 21 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 11 shared commits counted here, the most recent 3 are \u0060b742edcf\u0060 feat: add launcher shortcuts for receipt scanner; \u00605b206317\u0060 feat: add automated CSV folder sync and guide screen; \u0060285b319e\u0060 feat: implement AMOLED dark theme option \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/navigation/AppNavGraph.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59927f25f60c71ffbdf5f5a38abb1a5c0fc7033188771a871c9c9ac4351ee856"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: MainScreen.kt \u2194 NumpadButton.kt: \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreen.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/numpad/NumpadButton.kt\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006076f6f5a6\u0060 fix: add API compatibility guards for font width variations and versi\u2026; \u0060a83812ac\u0060 fix: send the state for the budget split on main screen (#67); \u0060ea10162b\u0060 feat: Overhaul Numpad interaction and refine keyboard animations \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/ui/home/MainScreen.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59490b90cb68cfc803ec19805a69818de5a8575cb95b2e0b766d75c00014c7d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: AppDatabase.kt \u2194 BudgetStateCalculator.kt: \u0060app/src/main/java/com/serranoie/app/minus/data/local/AppDatabase.kt\u0060 and \u0060app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.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 \u00606f08a198\u0060 feat: support unresolved rollover surplus handling; \u0060bd810a7d\u0060 Revert \u0022feat: add daily surplus dialog and carry-forward support for \u2026; \u00602b62273b\u0060 feat: add daily surplus dialog and carry-forward support for dynamic \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/data/local/AppDatabase.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97065ca6ce9307e943fde1d7fb2a192ff85bf421739b590d0e4c8dbef198c7bd"}},{"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":"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":"14a318f4ed6aa8de4aff6cb44c44a6afd22fb7a5ff289f7b968a61eb3fd98e9c"},"taxa":[{"id":"CICD-SEC-4","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":"AX2","level":"warning","message":{"text":"Stateful singleton: CensorManager: \u0060CensorManager\u0060 is a singleton (@Singleton: the container shares one instance across every request thread) but mutates instance state outside any lock (wasNear; e.g. \u0060wasNear\u0060 in \u0060onSensorChanged\u0060 at line 49)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/util/CensorManager.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbe9883e65657d720f4da3595574d793c940b63af61077e254537fd76550e21"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: TransactionDao (24 abstract methods): \u0060TransactionDao\u0060 declares 24 abstract methods: \u0060getAllTransactions\u0060, \u0060getTransactionsForDateRange\u0060, \u0060getTransactionsForDay\u0060, \u0060getTotalSpentForDay\u0060, \u0060getTotalSpentForPeriod\u0060, \u0060insert\u0060, \u0060insertOrReplace\u0060, \u0060insertIgnore\u0060, \u0060insertAllOrReplace\u0060, \u0060update\u0060, \u0060delete\u0060, \u0060deleteById\u0060, \u0060deleteAll\u0060, \u0060getByPocketId\u0060, \u0060deleteOneTimeByPeriodId\u0060, \u0060getTransactionById\u0060, \u0060countDistinctPeriods\u0060, \u0060hasTransactionsInPeriod\u0060, \u0060existsByClientGeneratedId\u0060, \u0060getByClientGeneratedId\u0060, \u0060getRecentTransactions\u0060, \u0060markCreditAsPaidInRange\u0060, \u0060markAllCreditAsPaid\u0060, \u0060markTransactionAsPaid\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/serranoie/app/minus/data/local/dao/TransactionDao.kt"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2275dfb2f28bd9a5795b9a472ff5bd780391c2e5e85a32044a85e1e7cfe284bb"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: BudgetRepository (44 abstract methods): \u0060BudgetRepository\u0060 declares 44 abstract methods: \u0060getTransactions\u0060, \u0060getQueuedTransactions\u0060, \u0060getTransactionsForPeriod\u0060, \u0060addTransaction\u0060, \u0060addTransactions\u0060, \u0060addQueuedTransaction\u0060, \u0060addTransactionIfAbsent\u0060, \u0060addPocketWithdrawal\u0060, \u0060addPocketDeposit\u0060, \u0060updateTransaction\u0060, \u0060assignQueuedTransactionsToPeriod\u0060, \u0060upsertTransactions\u0060, \u0060replaceAllTransactions\u0060, \u0060existsTransactionByClientGeneratedId\u0060, \u0060getRecentTransactions\u0060, \u0060deleteTransaction\u0060, \u0060getSpentForDate\u0060, \u0060getSpentForPeriod\u0060, \u0060getBudgetSettings\u0060, \u0060saveBudgetSettings\u0060, \u0060getBudgetSettingsSync\u0060, \u0060getTransactionById\u0060, \u0060getActiveCategories\u0060, \u0060getAllCategories\u0060, \u0060findOrCreateCategory\u0060, \u0060createCategory\u0060, \u0060hideCategory\u0060, \u0060incrementCategoryUsage\u0060, \u0060setCategoryLimit\u0060, \u0060getPeriodCount\u0060, \u0060markCreditTransactionsAsPaid\u0060, \u0060markAllCreditTransactionsAsPaid\u0060, \u0060markTransactionAsPaid\u0060, \u0060getPaidRecurrentOccurrences\u0060, \u0060markRecurrentOccurrencePaid\u0060, \u0060getPaidOccurrenceDatesFor\u0060, \u0060getArchivedBudgets\u0060, \u0060upsertArchivedBudgets\u0060, \u0060replaceAllArchivedBudgets\u0060, \u0060archiveCurrentPeriod\u0060, and 4 more. 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/serranoie/app/minus/data/repository/BudgetRepository.kt"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f1d31b345ca2befac008ad4ddded90d1a1a7313ea1f83ce97db3bca7277f99"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: SettingsRepository (64 abstract methods): \u0060SettingsRepository\u0060 declares 64 abstract methods: \u0060observeSettings\u0060, \u0060observeCurrentPeriodRollover\u0060, \u0060observeCurrentPeriodBoundary\u0060, \u0060getCurrentPeriodId\u0060, \u0060getSettings\u0060, \u0060setOnboardingCompleted\u0060, \u0060setEarlyFinishActive\u0060, \u0060setPeriodEndAlreadyHandled\u0060, \u0060setCurrentPeriod\u0060, \u0060setCurrentPeriodRollover\u0060, \u0060setPendingRollover\u0060, \u0060clearPendingRollover\u0060, \u0060setNotificationTime\u0060, \u0060setRecurrentNotificationTime\u0060, \u0060setThemeMode\u0060, \u0060setTypographyMode\u0060, \u0060setContrastMode\u0060, \u0060setAppColorScheme\u0060, \u0060setLanguage\u0060, \u0060setDynamicColorEnabled\u0060, \u0060setRoundedFontEnabled\u0060, \u0060setAmoledEnabled\u0060, \u0060setCreditQuickToggleEnabled\u0060, \u0060setShowPastTransactions\u0060, \u0060setCategoryPickerDirectPopupEnabled\u0060, \u0060setCategoryGridModeEnabled\u0060, \u0060setExtraNoteEnabled\u0060, \u0060setReserveUpcomingChargesEnabled\u0060, \u0060setNewCategoryTagEnabled\u0060, \u0060setNotificationScanEnabled\u0060, \u0060setNotificationScanPackages\u0060, \u0060toggleNotificationScanPackage\u0060, \u0060setTutorialBoxCompleted\u0060, \u0060setAnalyticsTutorialCompleted\u0060, \u0060setHistoryTutorialCompleted\u0060, \u0060setReceiptScanHintShown\u0060, \u0060setSavingsReminderEnabled\u0060, \u0060setAnalyticsSpendsTutorialCompleted\u0060, \u0060setPeriodMappingMode\u0060, \u0060setFirstLaunchTutorialStage\u0060, and 24 more. 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/serranoie/app/minus/data/repository/SettingsRepository.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9eb566f1e68a3af2de3a4d05a2da10f70d0f7cb15ca83c03b02cf2fd08860c8"}},{"ruleId":"C1","level":"warning","message":{"text":"No data-protection/encryption: No encryption usage (javax.crypto\u0027s Cipher in ENCRYPT_MODE, Tink, Jasypt, Spring Security\u0027s Encryptors, Jetpack Security\u0027s EncryptedSharedPreferences or EncryptedFile, the Android Keystore, SQLCipher, pgcrypto) was found, and this repository persists personal data in the model cited here \u2014 sensitive data at rest may be unprotected. If TDE/KMS/vault is delegated to infrastructure, ignore."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/data/local/entity/BudgetSettingsEntity.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d4d19a886d57fc791eec80bf9f7c2aaed5f2f14763134c96a0a19b8e9fe72"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: ArchivedBudgetEntity: \u0060ArchivedBudgetEntity\u0060\u0027s public constructor takes \u0060totalBudget\u0060, \u0060spentAmount\u0060, \u0060currencyCode\u0060, \u0060periodType\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 \u0060ArchivedBudgetEntity\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/serranoie/app/minus/data/local/entity/ArchivedBudgetEntity.kt"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1a0f2febd40cdf80da29d4ea162e5d6431049efa342b285b35a82102877d6b"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: BudgetSettingsEntity: \u0060BudgetSettingsEntity\u0060\u0027s public constructor takes \u0060totalBudget\u0060, \u0060period\u0060, \u0060currencyCode\u0060, \u0060rollOverLimit\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 \u0060BudgetSettingsEntity\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/serranoie/app/minus/data/local/entity/BudgetSettingsEntity.kt"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da46a385dc464079817ca57947a9980ea31554c9d7112cd2b176437b017eeef"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: CategoryEntity: \u0060CategoryEntity\u0060\u0027s public constructor takes \u0060name\u0060, \u0060limitAmount\u0060, \u0060limitUnit\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 \u0060CategoryEntity\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/serranoie/app/minus/data/local/entity/CategoryEntity.kt"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e34b8c45b990cb5e94d0d0d0ab4887417197149be23f701e9e2f2fc9d493b9"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: PaidRecurrentOccurrenceEntity: \u0060PaidRecurrentOccurrenceEntity\u0060\u0027s public constructor takes \u0060status\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 \u0060PaidRecurrentOccurrenceEntity\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/serranoie/app/minus/data/local/entity/PaidRecurrentOccurrenceEntity.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"801759f5c626878d4148cbce205c62d74ccdf683c6cd1f946f912af025cd47f7"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: QueuedTransactionEntity: \u0060QueuedTransactionEntity\u0060\u0027s public constructor takes \u0060amount\u0060, \u0060comment\u0060, \u0060note\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 \u0060QueuedTransactionEntity\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/serranoie/app/minus/data/local/entity/QueuedTransactionEntity.kt"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"86575e64e8d5b50bf8b2ab96bbe6c21ccd938deb035c06e422263e2c70bedeb5"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: SavingsPocketEntity: \u0060SavingsPocketEntity\u0060\u0027s public constructor takes \u0060name\u0060, \u0060targetAmount\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 \u0060SavingsPocketEntity\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/serranoie/app/minus/data/local/entity/SavingsPocketEntity.kt"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3b42cb4618afd874f1cb25ab2758146ae7f079f91eb3197d1fd4187f57e4e0"}},{"ruleId":"DM11","level":"warning","message":{"text":"Constructible in an invalid state: TransactionEntity: \u0060TransactionEntity\u0060\u0027s public constructor takes \u0060amount\u0060, \u0060comment\u0060, \u0060note\u0060, \u0060clientGeneratedId\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 \u0060TransactionEntity\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/serranoie/app/minus/data/local/entity/TransactionEntity.kt"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"704f419f52178adec9620131f78de6b2c6230df608f1ceea5b1710292e3cfd59"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060PROJECT_OVERVIEW.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060island-sdk\u0060, \u0060sync-contract\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"PROJECT_OVERVIEW.md"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ae40e5b3e54d377af3514f2d5d9f228722d99ffbad837e53e04557eb222f81"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060fastlane/CHANGELOG_GENERATION.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060island-sdk\u0060, \u0060sync-contract\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastlane/CHANGELOG_GENERATION.md"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3c0d9d7d9ca12c933a43e791366efebbb1c151c3e359f21439d86631ced69f"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add 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 5 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/pr-check.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060promo/remotion-es/package.json\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":"promo/remotion-es/package.json"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dc1a84ff2e83b8905edc63b2eb3b3a9d466e00410f5939b9a785d70a030c0d"}},{"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":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (25 clone groups): 25 of the duplicated blocks reported below have copies in at least two of the sibling directories remotion, remotion-es under promo/. That concentration is one structural fact, not 25 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 25 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Phone.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc207ab081e0cdc1b2f879c447ca87161b18f200cc3e27aeb8d51de3f94ffa8"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (260 identical lines \u00D7 2 files): promo/remotion-es/src/components/Phone.tsx:1 \u00B7 promo/remotion/src/components/Phone.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 260 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Phone.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a721a432ab13a3e86380b781660dcbed4f4e892d5e2f7ac374c811dad5faba16"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (177 identical lines \u00D7 2 files): promo/remotion-es/src/scenes/S05Pill.tsx:1 \u00B7 promo/remotion/src/scenes/S05Pill.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 177 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S05Pill.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"045864ad14b598c2f527c8be4eaa6c9117486b3be6aab749b83a678426db1cd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (167 identical lines \u00D7 2 files): promo/remotion-es/src/scenes/S09Subs.tsx:1 \u00B7 promo/remotion/src/scenes/S09Subs.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 167 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S09Subs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"460b661084e3fc6835fc2f052f730f04f4651bb7fd935cc4517ad39d3a5e4132"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (147 identical lines \u00D7 2 files): promo/remotion-es/src/scenes/S06Sheet.tsx:1 \u00B7 promo/remotion/src/scenes/S06Sheet.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 147 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S06Sheet.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0592f590da3b1c350c6fa1e19a86b45f212db99eac87fd84e7112c669c6148ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (144 identical lines \u00D7 2 files): promo/remotion-es/src/scenes/S10Analytics.tsx:1 \u00B7 promo/remotion/src/scenes/S10Analytics.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 144 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S10Analytics.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc81a468f0c615062e5199d4cf0f4fc93c805848876065e3074bf40d3892a1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (103 identical lines \u00D7 2 files): promo/remotion-es/src/scenes/S07Split.tsx:1 \u00B7 promo/remotion/src/scenes/S07Split.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 103 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S07Split.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcf0e50b80c2ceb5c196d13d0bb7dbdd9d9fb9d9f8c5f6ec9468e499b2bbba2"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (86 identical lines \u00D7 2 files): promo/remotion-es/src/scenes/S04Question.tsx:1 \u00B7 promo/remotion/src/scenes/S04Question.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 86 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S04Question.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7372bcb3bc12fb39a7cea226e98826c37cf7246c447cb905fb261c07e5eead7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (83 identical lines \u00D7 2 files): promo/remotion-es/src/components/Icons.tsx:1 \u00B7 promo/remotion/src/components/Icons.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 83 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Icons.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74a4a50806df825bf17b61d121b3f0cb958add6627997961a6a9e46fb333833"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (79 identical lines \u00D7 2 files): promo/remotion-es/src/scenes/S08Choice.tsx:1 \u00B7 promo/remotion/src/scenes/S08Choice.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 79 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S08Choice.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"779af3b36fa904a9bbe1ee90a8cd07e72bc0ccc2fbebe43ff7c2fca440821564"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (75 identical lines \u00D7 2 files): promo/remotion-es/src/theme.ts:1 \u00B7 promo/remotion/src/theme.ts:1 \u2014 these 2 files are line-for-line copies of one another \u2014 75 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/theme.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"858f44cbeb5fe3ba952f8355575ac41bc2a95f415d60777f278db796675450ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (64 identical lines \u00D7 2 files): promo/remotion-es/src/Promo.tsx:1 \u00B7 promo/remotion/src/Promo.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 64 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/Promo.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac007cdaaa626a41fd8b27a662be2a5ef23b976345f02719190354c19b79335"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2 locations): promo/remotion-es/src/components/Logo.tsx:4 \u00B7 promo/remotion/src/components/Logo.tsx:4 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Logo.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf00f4863c1d7600e5cd6d8d5ef5d08d08dfc7f7cffcdf29ffd1bf96349f4552"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (58 identical lines \u00D7 2 files): promo/remotion-es/src/components/Cursor.tsx:1 \u00B7 promo/remotion/src/components/Cursor.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 58 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Cursor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"232fd3b94c46f9d8318f911b958e35379a289d63852dbc68037a64131c6f47bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (56 identical lines \u00D7 2 files): promo/remotion-es/src/components/Kinetic.tsx:1 \u00B7 promo/remotion/src/components/Kinetic.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 56 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Kinetic.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2540206ba123142109024cf2161e018becf15cbe1f0fc6011b115f4514d13793"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (54 identical lines \u00D7 2 files): promo/remotion-es/src/components/Pill.tsx:1 \u00B7 promo/remotion/src/components/Pill.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 54 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Pill.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae03dae0df6b6beb22709467514fe2ba6d99a9adb5ff239ab1885c433d28012"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (53 identical lines \u00D7 2 files): promo/remotion-es/src/components/Backgrounds.tsx:1 \u00B7 promo/remotion/src/components/Backgrounds.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 53 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Backgrounds.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"042927a969340551a26c7231ef808d67875e677b647349b5c8ec056da452506b"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (52 identical lines \u00D7 2 files): promo/remotion-es/src/anim.ts:1 \u00B7 promo/remotion/src/anim.ts:1 \u2014 these 2 files are line-for-line copies of one another \u2014 52 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/anim.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ded8a78e40a368861d7a06bdaf6f9754206d6c23ac3ff927babd96ada4afdae"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (50 identical lines \u00D7 2 files): promo/remotion-es/src/scenes/S03Splash.tsx:1 \u00B7 promo/remotion/src/scenes/S03Splash.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 50 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S03Splash.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf0714e8ce1d92491c97bef98650cc49d186f96432ba1737df9b14886fc0dc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): promo/remotion-es/src/scenes/S02Wordmark.tsx:13 \u00B7 promo/remotion/src/scenes/S02Wordmark.tsx:13 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S02Wordmark.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9714757aef4fd8262fcba18abc820abfcdffd2c7610d6f3e28040cd570972f6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): promo/remotion-es/src/scenes/S11Outro.tsx:10 \u00B7 promo/remotion/src/scenes/S11Outro.tsx:10 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S11Outro.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"469fe3433849a188d21c17612031f3ad970718da2a18c34fdaee066ae4828422"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): promo/remotion-es/src/components/SplashLogo.tsx:4 \u00B7 promo/remotion/src/components/SplashLogo.tsx:4 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/SplashLogo.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d194b34db6e1877b6634c260c954722048e73c398b93e868ee1cc78776d6de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): promo/remotion-es/src/scenes/S11Outro.tsx:44 \u00B7 promo/remotion/src/scenes/S11Outro.tsx:44 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S11Outro.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b4a58d2d834662e45d7d751c5d72db6c5fa91f945537e0346a99e5562c878b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): promo/remotion-es/scripts/mux.mjs:5 \u00B7 promo/remotion/scripts/mux.mjs:5 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/scripts/mux.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06e83b41b04154700b0835f3bcad2042660c4004b4f3ff94661d394097795f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): promo/remotion-es/scripts/stills.mjs:5 \u00B7 promo/remotion/scripts/stills.mjs:5 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/scripts/stills.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea95360c20693a0939d98c20237d96d804b600b7f96d67d1d282d8cbbc2e9c49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): promo/remotion-es/remotion.config.ts:3 \u00B7 promo/remotion/remotion.config.ts:3 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/remotion.config.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ed7267f2afc48183aca6febdb653a4a0127ee7e3712197df6b58ccec27e330"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function S05Pill (cyclomatic 35, cognitive 35): S05Pill has cyclomatic complexity 35 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S05Pill.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fad853fdef44d778c6ef4ad3bf05abee84159391dea0beb8418c2773125208"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function S05Pill (cyclomatic 35, cognitive 35): S05Pill has cyclomatic complexity 35 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S05Pill.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5449315ff4eb056ffa1ccad2d15e7decd4da28ee9fe5fcad6d28a08b2c6a359c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 15): (anonymous) has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Phone.tsx"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1680fe79ab8696ab8ba4c2ab289cfcb73fcbcc7d22e1dc064c80c9cda018e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 15): (anonymous) has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/components/Phone.tsx"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd580c85db0927114dfb1735509f8718ebb7b4613f9670ef4539929d0fe3162c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function S04Question (cyclomatic 15, cognitive 23): S04Question has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S04Question.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad69209610c01581fd47b6ecafc9699f88a96cfefd42347e273718ade0db92b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function S04Question (cyclomatic 15, cognitive 23): S04Question has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S04Question.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ed20afb9d608f81ce21102bec5b8e61acfc69db6d58f34ba2f4ab514442564"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S09Subs.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"631540b50b3a65cd1671fc8591c18af645b42ada5d1a524438ef11fd751239aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S09Subs.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dd91dd58c50fdc2f536bad19bbf8932c938845545f2b8e6cc5d1ae6d8bbe35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S10Analytics.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a4e61476c2a0937f412f3854a2b05aba635a69f4108d2abf728a202d5d8151"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S10Analytics.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1db72f3977a1945439aadffc9814c476335c2e7a41cd265c1599f50280ef05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MinMaxCard (cyclomatic 12, cognitive 11): MinMaxCard has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/scenes/S10Analytics.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"095510809de576ffb471432ce762aa769ad78eee944379e94fc1c593593862bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MinMaxCard (cyclomatic 12, cognitive 11): MinMaxCard has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/scenes/S10Analytics.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b925e5a7378f929939cf995faddc0b0c2abcbb9faa0988d6b98aa886bcfe4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Phone.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23decfd51d3f13dfe6747fc5f2e779d157518749c2916daa284c7cc5452c081"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/components/Phone.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dd7985cb76f18eff3f161c69142ae6ad7a1b4d2b700590020d41c8ba96d3ad"}},{"ruleId":"R6","level":"warning","message":{"text":"No test script: test \u2717 \u00B7 lint \u2713 \u00B7 typecheck \u2713 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7e5e0cc374484b1c72227eba121f79e7e90e5907d71a39d0ffec753e709f7fa6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (4 application, 2 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/scripts/stills.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cb5988b0b01ebdd0c93075852b2a8eef5f77fc0addd4b739c3968fd1fd8f9b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (4 application, 2 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/scripts/stills.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ccd0b90c178c3a107a64b2b89501ec5ba456f066af7fee55cffeef10d0ace0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SPATIAL_FAST\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/anim.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"663bc7580b26b15243b87760132c7a87189a1f5944fa74f509d06515c926321c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SPATIAL_SLOW\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/anim.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ce3cb547061129856d99e9354a06063fcad90d5ceff6d5762f55214a5b2fd7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027countTo\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/anim.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc7e949ff8211546679a4acbdb0c94a9c3564f7ee81c9a3060384bda643ef68"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027HistoryIcon\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Icons.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fac9cb82ab39103621845048813fea87fbd2ea2322f1ed5b5cdd365b24145b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Cookie\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/Logo.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"df285f5ce93f60100eb46e59b97ee217d039060b7e1d83787b7982ad3d46d99d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SPLASH_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/components/SplashLogo.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3399f19bda89698d6cdf4e47e0571043d6cea8c58c8234d545aa7882a14868"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027T\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion-es/src/theme.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c87cacd05222c3d3d3c9f064320e05cc0e482cedbc04fb9b67234c00ad82968"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SPATIAL_FAST\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/anim.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f9f19741b2a638a54b82ffa344652f5a8d9982df8ac13be45092ab2877678f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SPATIAL_SLOW\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/anim.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e43f466aa8478db3ccd5d5898623c262d072d441a033b620239efc0f44c7ef"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027countTo\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/anim.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45b23856be77faeff5bccace335796fbab7ebe8ab4fa29ce613f85bab4d44c6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027HistoryIcon\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/components/Icons.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"712af5aa48a91b2c96b859a66833c25f51c6a026a4b515de0626cc863586e1bc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Cookie\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/components/Logo.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddf95b3a589d0af36d1601d95bd11e4fb4294a6a49ce259f17eab307b82e414"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SPLASH_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/components/SplashLogo.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1548a558ebbb18b4b29b81f2253dd377596ed5e45ef897d3a5e92a2f834d78fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027T\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"promo/remotion/src/theme.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa666aca29b0a02fe3b3ad89e81217dffc33bfdd6f32aceb7e80f62afafe75a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Math.floor(f / 14) % 2 === 0 || typed \u003C WORD.length\u0060 appears character-identically in 2 files \u2014 promo/remotion-es/src/scenes/S05Pill.tsx, promo/remotion/src/scenes/S05Pill.tsx. 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":"promo/remotion-es/src/scenes/S05Pill.tsx"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a013f30d2e894428d2a0fb80767e08ca640feef30cea9f23e898aff0cc2635d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f \u003E= m.type \u0026\u0026 f \u003C m.type \u002B WORD.length * 4\u0060 appears character-identically in 2 files \u2014 promo/remotion-es/src/scenes/S05Pill.tsx, promo/remotion/src/scenes/S05Pill.tsx. 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":"promo/remotion-es/src/scenes/S05Pill.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"82628724b7141317e8fb592703968943706e22d80573e99f76c6ecbacc8cd99b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060k === \u0027div\u0027 || k === \u0027mul\u0027 || k === \u0027plus\u0027 || k === \u0027minus\u0027\u0060 appears character-identically in 2 files \u2014 promo/remotion-es/src/components/Phone.tsx, promo/remotion/src/components/Phone.tsx. 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":"promo/remotion-es/src/components/Phone.tsx"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1ac665676f594e7da49c98e8c4baa7dd7c3e9e7daab8be6710f8380e51ca94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060k === \u0027dot\u0027 || k === \u0027eq\u0027 || k === \u0027div\u0027 || k === \u0027mul\u0027 || k === \u0027plus\u0027 || k === \u0027minus\u0027\u0060 appears character-identically in 2 files \u2014 promo/remotion-es/src/components/Phone.tsx, promo/remotion/src/components/Phone.tsx. 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":"promo/remotion-es/src/components/Phone.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"901f7ba92f004425dbaa041040f9d6a356730bca91db472a94f436b370771f15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tagFor(m.clear1, m.cleared1) || tagFor(m.clear2, m.cleared2)\u0060 appears character-identically in 2 files \u2014 promo/remotion-es/src/scenes/S05Pill.tsx, promo/remotion/src/scenes/S05Pill.tsx. 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":"promo/remotion-es/src/scenes/S05Pill.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"835028bb16e7b6d2366c59c47f9ee25251ef9e1b8553d6942d47e5bc12c167d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tagFor(m.swipe, m.calcOn) || tagFor(m.swipe2, m.calcOn2) || tagFor(m.swipe3, m.calcOn3)\u0060 appears character-identically in 2 files \u2014 promo/remotion-es/src/scenes/S05Pill.tsx, promo/remotion/src/scenes/S05Pill.tsx. 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":"promo/remotion-es/src/scenes/S05Pill.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cd799321f99f488653c4cb705d07462a7a739e7aefb7841f462bcf183da54e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!endOfWeek.isBefore(periodStart) \u0026\u0026 !week.startDate.isAfter(periodEnd)\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsWeeklyCalendar.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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd368de048a03f392d6eada081553e319e74f90bc9fa858d537cf427336f225"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060currentPeriodId \u003E 0L \u0026\u0026 transaction.periodId \u003E 0L\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetWidgetUpdater.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryCalculations.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/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3924abfa81e08a03c4f7a1982f9c888c91276b491a69dc5b3332bdf469dc03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060date.isAfter(today) \u0026\u0026 !date.isAfter(maxSelectableDate)\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/history/edit/RecurrenceConfigSheet.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/serranoie/app/minus/presentation/ui/editor/dialogs/RecurrentExpenseDialog.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1409e69f2ab86dfe271d382a36a79502f8881150d21d5c3679389cf690235a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060day.isBefore(periodStart) || day.isAfter(periodEnd)\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsWeeklyCalendar.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/serranoie/app/minus/presentation/ui/subscriptions/SubscriptionsCalendarSection.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f933f759d39f8037f6384f7359b4a5f6d290555d6c3c43c07bd41a14241105f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060endDate != null \u0026\u0026 today.isAfter(endDate)\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/serranoie/app/minus/domain/calculator/RecurringExpenseCalculator.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryCalculations.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/serranoie/app/minus/domain/calculator/RecurringExpenseCalculator.kt"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b5d8f09538828f702bc3bb5a43ea592deccae1014d49d1931bb653312fcb05"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C transactions.size - 1 \u0026\u0026 transaction.id !in deletingTransactionIds\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/history/sections/TransactionDateSections.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/serranoie/app/minus/presentation/ui/history/sections/PastTransactionDateSections.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a58cbca209fdb6782a5aaffa44e2c5661dd81340ccbc18e66df7f11df46548f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input.startsWith(\u0022\u002B\u0022) || input.startsWith(\u0022-\u0022)\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetTransactionHandler.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/editor/Editor.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/serranoie/app/minus/presentation/ui/budget/BudgetTransactionHandler.kt"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7082bd7a4277047e5fa1f32acc571486359130a97d8c1f7255fd5ab4692a914"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.amount \u003E BigDecimal.ZERO \u0026\u0026 !it.isAdjustment\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/budget/MinMaxSpentCard.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/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b127f7623309fe6b55cd1f55389b1de39cc9f148d2429975bb75c3ebe550d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.amount \u003E BigDecimal.ZERO \u0026\u0026 it.isAdjustment\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.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/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c1baba57083d5dedf2611b082db44bcb3db9463fdaf2e184b4dc491a862c40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.isCredit \u0026\u0026 !it.isDeleted \u0026\u0026 !it.isCreditPaid\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetViewModel.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/history/HistoryViewModel.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/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.kt"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a089dedb9795316322e001ab9e2eda0765f562fa45172f7f41ef0e4dbe3d08"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.periodId == periodId \u0026\u0026 !it.isDeleted\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/serranoie/app/minus/domain/time/MidnightPeriodChecker.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/analytics/AnalyticsViewModel.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/serranoie/app/minus/domain/time/MidnightPeriodChecker.kt"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe77ca12592527192436ab33b626b22af9c184945f37fbcdb8aacaa7663959a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sharedTransitionScope != null \u0026\u0026 animatedVisibilityScope != null\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItemExpandedContent.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc68afc905a04346e77849e2169a19e46263d663d19e41c0c9b4ba542853d6be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060transaction.amount \u003E java.math.BigDecimal.ZERO \u0026\u0026 transaction.isAdjustment\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/SwipeableExpenseItem.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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"07169cd5a27c1f399921e3456f6c0f3756075db3ffb56e664fde995ba488b532"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060transaction.isCredit \u0026\u0026 creditCardCutoffDay != null\u0060 appears character-identically in 3 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItemExpandedContent.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/theme/component/expense/UpcomingRecurrentItemRow.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/serranoie/app/minus/presentation/ui/theme/component/expense/ExpenseItem.kt"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"505646b790b9548805b1eddca22ab6772ddf2a1258e7d3421df1afd3ee68e0b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060txDate.isBefore(settings.startDate) || txDate.isAfter(periodEnd)\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetWidgetUpdater.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/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"28acb84ff47aa98778a01171c0715285f19f9a930e3b1e1e0e7777e3d458335b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060txDate.isEqual(settings.startDate) \u0026\u0026 currentPeriodStartedAtMillis \u003E 0L\u0060 appears character-identically in 2 files \u2014 app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt, app/src/main/java/com/serranoie/app/minus/presentation/ui/budget/BudgetWidgetUpdater.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/serranoie/app/minus/presentation/ui/budget/BudgetStateCalculator.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04c055c9c798ae8169f05b3ed5c4e5d9ab91781a1e8d49356533e04e4bd3eb8"}},{"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":"island-sdk/src/main/java/com/sameerasw/island/sdk/IslandCodec.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a09f9649266997ed5e040207f9fb2804083c227f55f3af94db351598a609c3"}},{"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":"island-sdk/src/main/java/com/sameerasw/island/sdk/IslandIdentity.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3be44b9943f8f83902f7f22a80a179be8811fdc8a18e60e0bfbf885e4dccfb1"}},{"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":"island-sdk/src/main/java/com/sameerasw/island/sdk/IslandIdentity.kt"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2e48b590450e672751a44fa41de6c27781819b780da28206f962a583299cda"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"island-sdk/src/main/java/com/sameerasw/island/sdk/compose/IslandSnapshot.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2415b9bd742e6588d62c46a242f0c296a4b5a79413700df233506020810e2e53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/src/main/java/com/serranoie/app/minus/presentation/util/font/format/VisualTransformationAsCurrency.kt"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"651c6ccd67b0d338c087ddc99c7c236ac76022de7a29a029dba26ba4b8d75255"}},{"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/serranoie/app/minus/presentation/ui/budget/BudgetViewModel.kt"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"42733ba31d42aa62d633d86f2705b053b2bb65164f4a775e874f3ec5548ef868"}},{"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/serranoie/app/minus/domain/calculator/ExpressionEvaluator.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffddb3df6da41e8cff2a0f839f7a45b985b4a709aa8694a4b95b52507154107"}},{"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/serranoie/app/minus/data/repository/BudgetRepositoryImpl.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae3b6879cc52159f88e76589f6a7053e0085205fce2abef3c90177ef7ec5dc3"}},{"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/serranoie/app/minus/data/repository/BudgetRepositoryImpl.kt"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"358c51d4a9a5b7e54510ab97fb67dc06171e9dbb5dd1769ef6174f66bf716b1a"}},{"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/serranoie/app/minus/data/repository/BudgetRepositoryImpl.kt"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c560346f8596a9fac8343831dea3317dd7f6e717fd0fa31a9516632afebbdc1f"}},{"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/serranoie/app/minus/data/repository/SettingsRepositoryImpl.kt"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7d7234eaef10467053aedfd4d27c4e46f212d8bdb290b2f7977217ce635065"}},{"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/serranoie/app/minus/data/repository/SettingsRepositoryImpl.kt"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3bb50c0dea3097c8618896a7f36a2a8bae07487dc1e8040a12a3e6fbdf5b4a"}},{"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/serranoie/app/minus/data/repository/SettingsRepositoryImpl.kt"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"003d761c3be45899e5e90c84bd45053b16073cfa122305961e892ff491401a74"}},{"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/serranoie/app/minus/data/repository/SettingsRepositoryImpl.kt"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf9dc7b938cfa19f52bdf52b13b3b807eeca686738d5e90549d3e9a81cdc7c3"}},{"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/serranoie/app/minus/data/repository/SettingsRepositoryImpl.kt"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5747a59b57b7b6bde9b1a6d27eb552495aa130542eb8c1fafc5a7789e0006d5"}},{"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/serranoie/app/minus/data/repository/SettingsRepositoryImpl.kt"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ced66a35a82c186c809a83ab58d65c58cc88235be054163b47812254414208"}},{"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/serranoie/app/minus/data/csv/MinusCsvParser.kt"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4117cb85ed960b8ae8aeeb0a634b180ba7e5ed9a67e3eb1a94f4132a68c855d0"}},{"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/serranoie/app/minus/data/csv/MinusCsvParser.kt"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb947d0f1cf35aed1e56074dd63dd4f187eb5eba05c42cbcc70788e3d03c0fa0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060PhoneLayout\u0060 swallows every exception into \u00600f\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/serranoie/app/minus/presentation/ui/home/MainScreenContent.kt"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ae8c03e0db732d35e51bfcb088493838dbd64ca7bdf9b1ca844666da7754fe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060SwipeActions\u0060 swallows every exception into \u00600f\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/serranoie/app/minus/presentation/ui/theme/component/SwipeActions.kt"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"012582e67c26a40d6ca2ddb915e21db9bd92cafaf628a92e8a340fa156908b3c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readLedger\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/wear/java/com/serranoie/app/minus/wearsync/WearExpenseIngestor.kt"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c0c286de8aef7111a0d2298ee606f00b54a28f1ea8e07cc50fd4f3b0aaa55a"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-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-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-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"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":36,"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."]}]}