{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"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":"JsonUtils.typedMapToBundle (cyclomatic 86): JsonUtils.typedMapToBundle has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b8839253ce507bcee555027dc6a2b013b1030a2abab071b13d3f2a65880c97"}},{"ruleId":"D1","level":"warning","message":{"text":"WearPhoneConnection.onMessageReceived (cyclomatic 58): WearPhoneConnection.onMessageReceived has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/WearPhoneConnection.kt"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf63c6fa4bb8c617345c31f54b9693113b5db9b6def8e05c4923606ce76d3e2"}},{"ruleId":"D1","level":"warning","message":{"text":"ReceiverManager.updateSourceReceiver (cyclomatic 52): ReceiverManager.updateSourceReceiver has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da88b047fa1ebff735992c7cdc1d6afa97463027aa413d09e4123c4a97c7bce"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonUtils.bundleToTypedMap (cyclomatic 49): JsonUtils.bundleToTypedMap has cyclomatic complexity 49 (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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f735b6e571c5614e90c038332614c80057c38c14b215013a10e6be151d3c36"}},{"ruleId":"D1","level":"warning","message":{"text":"GlucoDataServiceAuto.updateSourceReceiver (cyclomatic 46): GlucoDataServiceAuto.updateSourceReceiver has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddce1c4ca871da60c26a196ad1f48fdc692f040ea9c9f2f6591be9a7f50beacb"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsMigrator.migratePhoneSettings (cyclomatic 46): SettingsMigrator.migratePhoneSettings has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"23075338e89b6518dd7d8f4707c8ffb39c69583e147c263c62136fb09ea2800e"}},{"ruleId":"D1","level":"warning","message":{"text":"GlucoseDataReceiver.requestWebserverData (cyclomatic 45): GlucoseDataReceiver.requestWebserverData has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/GlucoseDataReceiver.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc59ad1bfb93afb15caa9c6f9fe87fb304d2d7241ebfd19a6180c8157f61d8f"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsMigrator.migrateSettings (cyclomatic 41): SettingsMigrator.migrateSettings 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":"common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"62db39a90a69cc9eba8d9c3afedbad33989113e345b52c2a036cfddea4de9235"}},{"ruleId":"D1","level":"warning","message":{"text":"ReceiveData.handleIntent (cyclomatic 35): ReceiveData.handleIntent has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6a68cda7ff205df3d15061637b4de9d751c7e04cba7ee50229bab85f164bea"}},{"ruleId":"D1","level":"warning","message":{"text":"MainActivity.updateConnectionsTable (cyclomatic 32): MainActivity.updateConnectionsTable has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"df595a64629e6e2d302dcb8e3484c2e6be75772259459f5140e9dc867742af54"}},{"ruleId":"D1","level":"warning","message":{"text":"WallpaperBase.createWallpaperView (cyclomatic 30): WallpaperBase.createWallpaperView 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":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/WallpaperBase.kt"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf2be4e01067989a6fd6203b0dee036295f3413d80619148f1f54af0ea5b0c0"}},{"ruleId":"D1","level":"warning","message":{"text":"GlucoseBaseWidget.getRemoteViews (cyclomatic 26): GlucoseBaseWidget.getRemoteViews has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91548746452f34b2accb7b97c8c6e567a59f5ed5263dc262408b87076f39ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"BroadcastServiceAPI.handleBgBundle (cyclomatic 24): BroadcastServiceAPI.handleBgBundle 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":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/BroadcastServiceAPI.kt"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"54eb1353ab668fbf11f46864bce928ff2302499fc0759a9e478e4183b7eba001"}},{"ruleId":"D1","level":"warning","message":{"text":"MainActivity.onOptionsItemSelected (cyclomatic 24): MainActivity.onOptionsItemSelected has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40ddbab952fc0d276d31820c74e2b553100814458bb637bf049b1e316866d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceOnlineFragmentBase.onSharedPreferenceChanged (cyclomatic 23): SourceOnlineFragmentBase.onSharedPreferenceChanged has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7b263c69279762f7c356f32d6375d417b57da6f1f6e06b0945df9289224939"}},{"ruleId":"D1","level":"warning","message":{"text":"LibrePatchedReceiver.onReceiveData (cyclomatic 23): LibrePatchedReceiver.onReceiveData 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":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/LibrePatchedReceiver.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de44c101c988c0edd0cca4c8bfbf549075a5c0f659e6bb6c79f0dc102dd0ae8"}},{"ruleId":"D1","level":"warning","message":{"text":"XDripBroadcastReceiver.onReceiveData (cyclomatic 22): XDripBroadcastReceiver.onReceiveData has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/XDripBroadcastReceiver.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8417436a997b2af5e4c1a0e5036b387d7d187ad7cc16816fa85bb455e66aca"}},{"ruleId":"D1","level":"warning","message":{"text":"MedtrumSourceTask.handleMonitorListResponse (cyclomatic 22): MedtrumSourceTask.handleMonitorListResponse has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/MedtrumSourceTask.kt"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f229597695fb750bbdc2be5c7970c9910bfb8e6741051eddeff794c4b06311"}},{"ruleId":"D1","level":"warning","message":{"text":"GlucoDataUtils.getDummyGlucodataIntent (cyclomatic 22): GlucoDataUtils.getDummyGlucodataIntent has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/GlucoDataUtils.kt"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81c85b895e8a0d21b9cc5d0548b11bc67626d8cf42fc7aba43d32c1e84adb7c"}},{"ruleId":"D1","level":"warning","message":{"text":"XDripServer.createResponse (cyclomatic 21): XDripServer.createResponse 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":"mobile/src/main/java/de/michelinside/glucodatahandler/xdripserver/XDripServer.kt"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"74066b8a37110cb5d1a1b2c51f789dccb2c9c834bb7fe7d036b061167d67a357"}},{"ruleId":"D1","level":"warning","message":{"text":"WearPhoneConnection.sendMessage (cyclomatic 20): WearPhoneConnection.sendMessage 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":"common/src/main/java/de/michelinside/glucodatahandler/common/WearPhoneConnection.kt"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e209eb66cc9e1325f200927631a48db8f54ceaf2bba1a052f311f9c338bc20"}},{"ruleId":"D1","level":"warning","message":{"text":"WearPhoneConnection.handleCommand (cyclomatic 20): WearPhoneConnection.handleCommand 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":"common/src/main/java/de/michelinside/glucodatahandler/common/WearPhoneConnection.kt"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ada1250ea72e5630224c5440ca45893d8e15a79c4a2b9d7cc9cd30b29becb8b"}},{"ruleId":"D1","level":"warning","message":{"text":"GlucoseStatistics.getStatisticsTitle (cyclomatic 20): GlucoseStatistics.getStatisticsTitle 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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/GlucoseStatistics.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c06c5b0af38e69a52df339a590eb90a983248d475a2d7287aa9b99e3766772"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeAxisRenderer.computeNiceAxisValues (cyclomatic 19): TimeAxisRenderer.computeNiceAxisValues 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":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/TimeAxisRenderer.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ad4015f61d8baac295b769f2c785461bba2d20b21e393f61c36a649aec2b59"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationReceiver.validGlucoseNotification (cyclomatic 19): NotificationReceiver.validGlucoseNotification 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":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.kt"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"430591823b1fda08b3cf6a7c3ea65afd1842a3db41656191d53dd1a869510f12"}},{"ruleId":"D1","level":"warning","message":{"text":"MainActivity.updateDetailsTable (cyclomatic 19): MainActivity.updateDetailsTable 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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d356cda2f7b4d8a0be798537c8f857be91007e7f081f841e53418e87945acf66"}},{"ruleId":"D1","level":"warning","message":{"text":"AlarmNotificationBase.startSound (cyclomatic 18): AlarmNotificationBase.startSound has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dfad4f367831c8c46719c53b98e5c2047439c3057d27c38fc649016c2e9046"}},{"ruleId":"D1","level":"warning","message":{"text":"ReceiveData.calculateDeltasAndRate (cyclomatic 17): ReceiveData.calculateDeltasAndRate has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ReceiveData.onSharedPreferenceChanged (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbab85af3c0fea00fec2ebe7cdf2b081acc54b2ad4c5f4e90f7f28f518cfd7ff"}},{"ruleId":"D1","level":"warning","message":{"text":"BackgroundTaskService.checkExecution (cyclomatic 17): BackgroundTaskService.checkExecution 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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/BackgroundTaskService.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f2f797ca82aa44a1d08559638599165a72830a6b7adb952dc6398a28ec387b"}},{"ruleId":"D1","level":"warning","message":{"text":"DexcomShareSourceTask.handleValueResponse (cyclomatic 17): DexcomShareSourceTask.handleValueResponse 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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DexcomShareSourceTask.kt"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ce048edb05affc41fc715a7773ac2496406ebec253788917ba1a2fd0f8976b"}},{"ruleId":"D1","level":"warning","message":{"text":"LibreLinkSourceTask.checkPreferenceChanged (cyclomatic 17): LibreLinkSourceTask.checkPreferenceChanged 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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/LibreLinkSourceTask.kt"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"497dcd3bb75e717779c3199e0f64264e63d2bbc22497297b1e641ebfd1a8b303"}},{"ruleId":"D1","level":"warning","message":{"text":"MainActivity.updateNotesTable (cyclomatic 17): MainActivity.updateNotesTable 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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc1ebb0778b9377fffba45f6016be8ead560fd402d615e8b9086c279d94bd8c"}},{"ruleId":"D1","level":"warning","message":{"text":"XDripServer.onSharedPreferenceChanged (cyclomatic 17): XDripServer.onSharedPreferenceChanged 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":"mobile/src/main/java/de/michelinside/glucodatahandler/xdripserver/XDripServer.kt"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a47b4869a5523c29cac4dd500d85d5ccae8d803a540e40d60411fd3a88b630c"}},{"ruleId":"D1","level":"warning","message":{"text":"AlarmHandler.checkForAlarmTrigger (cyclomatic 16): AlarmHandler.checkForAlarmTrigger has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d9ce977c024b60a9b81a1e285710fbe827ae881e22670cd5342ea2dbf95dfd"}},{"ruleId":"D1","level":"warning","message":{"text":"NightscoutSourceTask.handleEntriesResponse (cyclomatic 16): NightscoutSourceTask.handleEntriesResponse 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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/NightscoutSourceTask.kt"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"006daacec1e12e686b7f859185a53ca1f38f1efb15da3f32541375b32d1f06e7"}},{"ruleId":"D1","level":"warning","message":{"text":"BitmapUtils.calcMaxTextSizeForBitmap (cyclomatic 16): BitmapUtils.calcMaxTextSizeForBitmap 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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/BitmapUtils.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c30b4d53037ca3086b4d0edafe96b3eda4717d3bed89c8ce9aa4750c1fec0c6"}},{"ruleId":"D1","level":"warning","message":{"text":"AlarmNotification.buildNotification (cyclomatic 16): AlarmNotification.buildNotification 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":"mobile/src/main/java/de/michelinside/glucodatahandler/notification/AlarmNotification.kt"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce61eb06865bad1d73e5d9216ec000f4602a8ab38dc5af414e8421608aec91a"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonUtils.typedMapToBundle (cognitive 168): JsonUtils.typedMapToBundle has cognitive complexity 168 (threshold 15). Drivers by points: if/else 50 (94 pts), match/switch 12 (47 pts), error handling 5 (24 pts), boolean chains 2, loops 1 (nesting depth added 98). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dae24ce737561058e6aba57114d047e3e12fe523ba936c0d83768d16c9bbfa8"}},{"ruleId":"D2","level":"warning","message":{"text":"GlucoseDataReceiver.requestWebserverData (cognitive 142): GlucoseDataReceiver.requestWebserverData has cognitive complexity 142 (threshold 15). Drivers by points: if/else 39 (116 pts), boolean chains 12, error handling 3 (12 pts), loops 1 (2 pts) (nesting depth added 87). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/GlucoseDataReceiver.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"306b15a3c6ecf224b5d02f4e0369ec6147d95b04ada0f7b5f58939cb4fb69615"}},{"ruleId":"D2","level":"warning","message":{"text":"WearPhoneConnection.onMessageReceived (cognitive 141): WearPhoneConnection.onMessageReceived has cognitive complexity 141 (threshold 15). Drivers by points: if/else 51 (129 pts), boolean chains 7, error handling 2 (5 pts) (nesting depth added 81). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/WearPhoneConnection.kt"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6c75de5d90ddb6d35823d685f0386c6fab92344626efa21c7fca8714c65c42"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiverManager.updateSourceReceiver (cognitive 99): ReceiverManager.updateSourceReceiver has cognitive complexity 99 (threshold 15). Drivers by points: if/else 41 (89 pts), boolean chains 9, error handling 1 (nesting depth added 48). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98d988cb8eb76da5e049706f3830ebc42e74dd2ffdda6bb938a31549d21c533"}},{"ruleId":"D2","level":"warning","message":{"text":"GlucoDataServiceAuto.updateSourceReceiver (cognitive 87): GlucoDataServiceAuto.updateSourceReceiver has cognitive complexity 87 (threshold 15). Drivers by points: if/else 36 (78 pts), boolean chains 8, error handling 1 (nesting depth added 42). 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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5bbcd662be5cda250d2e52d48175f75db9f40ccd205bb17ce18b6d610bf5cc"}},{"ruleId":"D2","level":"warning","message":{"text":"MedtrumSourceTask.handleMonitorListResponse (cognitive 75): MedtrumSourceTask.handleMonitorListResponse has cognitive complexity 75 (threshold 15). Drivers by points: if/else 18 (70 pts), boolean chains 4, loops 1 (nesting depth added 52). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/MedtrumSourceTask.kt"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc6a0d16bf1e81025f38144bd271871bb7cc39b255104ecb9093e35c7d7d838"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiveData.handleIntent (cognitive 73): ReceiveData.handleIntent has cognitive complexity 73 (threshold 15). Drivers by points: if/else 34 (64 pts), boolean chains 8, error handling 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f99155950b3a31f67fb48b4d603b44fbf59d4ad5d35bda0f7ce73ec29b09cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsMigrator.migratePhoneSettings (cognitive 63): SettingsMigrator.migratePhoneSettings has cognitive complexity 63 (threshold 15). Drivers by points: if/else 34 (50 pts), boolean chains 13 (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":"common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fad4e6cb4130094da8bb8d41145e0cbb09b7861226123691617976cd414a6e7"}},{"ruleId":"D2","level":"warning","message":{"text":"MainActivity.updateConnectionsTable (cognitive 63): MainActivity.updateConnectionsTable has cognitive complexity 63 (threshold 15). Drivers by points: if/else 27 (44 pts), error handling 5 (15 pts), boolean chains 4 (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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"e785eacfacea97629e0b2b24f1debb9c4d3dd52ca00caff490a4a6d45e93525c"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsMigrator.migrateSettings (cognitive 58): SettingsMigrator.migrateSettings has cognitive complexity 58 (threshold 15). Drivers by points: if/else 31 (43 pts), boolean chains 12, match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fb7160bab121b2c214b715e076ed18ac902d58ba71d00a9b6e9a90a27d397a"}},{"ruleId":"D2","level":"warning","message":{"text":"LibrePatchedReceiver.onReceiveData (cognitive 57): LibrePatchedReceiver.onReceiveData has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (49 pts), boolean chains 7, error handling 1 (nesting depth added 34). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/LibrePatchedReceiver.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1121f171bf03803d4e02491cc9c9fe05f0f0958d0e1e139a3305d41c17f085c0"}},{"ruleId":"D2","level":"warning","message":{"text":"XDripBroadcastReceiver.onReceiveData (cognitive 54): XDripBroadcastReceiver.onReceiveData has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (49 pts), boolean chains 4, error handling 1 (nesting depth added 30). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/XDripBroadcastReceiver.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2747bdb063ba1fe197e3edfb300e0c3acb8e9e45feab38693039e42368747ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"GlucoseStatistics.getStatisticsTitle (cognitive 52): GlucoseStatistics.getStatisticsTitle has cognitive complexity 52 (threshold 15). Drivers by points: if/else 24 (51 pts), match/switch 1 (nesting depth added 27). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/GlucoseStatistics.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca15c81aa183e26b3973bad38000a6c3b988878bfbd479874e641dc066c7710"}},{"ruleId":"D2","level":"warning","message":{"text":"GlucoseBaseWidget.getRemoteViews (cognitive 48): GlucoseBaseWidget.getRemoteViews has cognitive complexity 48 (threshold 15). Drivers by points: if/else 30 (44 pts), boolean chains 4 (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":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"491115f7c7d635ba68d57b0679a834ca8c01b2e456975907a94db3600701f076"}},{"ruleId":"D2","level":"warning","message":{"text":"BroadcastServiceAPI.handleBgBundle (cognitive 47): BroadcastServiceAPI.handleBgBundle has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (38 pts), boolean chains 6, error handling 1 (3 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/BroadcastServiceAPI.kt"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7066af84c5489866a6d488053a22c0946d5b6ac624815e9d00e8849ae30ddd31"}},{"ruleId":"D2","level":"warning","message":{"text":"WallpaperBase.createWallpaperView (cognitive 46): WallpaperBase.createWallpaperView has cognitive complexity 46 (threshold 15). Drivers by points: if/else 32 (38 pts), boolean chains 6, error handling 1, match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/WallpaperBase.kt"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc25b415780acb2eb235d493bd092da5d24a738247c7296061154514455a3cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"AAPSReceiver.onReceiveData (cognitive 45): AAPSReceiver.onReceiveData has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (43 pts), boolean chains 1, error handling 1 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/AAPSReceiver.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a680292482fdebf951f2a5324b2cccafcd9f02c9096cc1aa231c39905498252"}},{"ruleId":"D2","level":"warning","message":{"text":"NsEmulatorReceiver.onReceiveData (cognitive 42): NsEmulatorReceiver.onReceiveData has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (39 pts), boolean chains 2, error handling 1 (nesting depth added 27). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NsEmulatorReceiver.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e37c2bad023da681ec75802c0fd2405f7e8d60a0677a3436a703d843f94288"}},{"ruleId":"D2","level":"warning","message":{"text":"MainActivity.updateDetailsTable (cognitive 42): MainActivity.updateDetailsTable has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 5 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff8f069bacbaadc61084057732bba230dde9714b491110c278884c2713c7baf"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationReceiver.validGlucoseNotification (cognitive 41): NotificationReceiver.validGlucoseNotification has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (39 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.kt"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43cffba02b8feca321d94f1090ffa92e4abf3af4cd6fe1ba5fe5eb7cb2dc753"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonUtils.bundleToTypedMap (cognitive 40): JsonUtils.bundleToTypedMap has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 5 (14 pts), boolean chains 8, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a764ba8c0b98ed655b7a8f7ace0d7b21e9435c896fa6058716462808e398fb89"}},{"ruleId":"D2","level":"warning","message":{"text":"GlucoDataUtils.getDummyGlucodataIntent (cognitive 38): GlucoDataUtils.getDummyGlucodataIntent has cognitive complexity 38 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 7 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/GlucoDataUtils.kt"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9318434f992b014d4247f597e0bb1d2600467fa3d10a2919c9b43b75434a36b8"}},{"ruleId":"D2","level":"warning","message":{"text":"AlarmNotification.buildNotification (cognitive 38): AlarmNotification.buildNotification has cognitive complexity 38 (threshold 15). Drivers by points: if/else 22 (37 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":"mobile/src/main/java/de/michelinside/glucodatahandler/notification/AlarmNotification.kt"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c163f85d9d06c7d97642af5649296416f94ec31c738ce050dc5bb2022c235500"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeAxisRenderer.computeNiceAxisValues (cognitive 37): TimeAxisRenderer.computeNiceAxisValues has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (27 pts), loops 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":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/TimeAxisRenderer.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d636063278b27a0bb60262e2cbca5871d0fbc41d57b7c8ef0d834ba4cdc9a47"}},{"ruleId":"D2","level":"warning","message":{"text":"BackgroundTaskService.checkExecution (cognitive 37): BackgroundTaskService.checkExecution has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 6 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/BackgroundTaskService.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"db323875e822e3e9df47dbeb78ad0d939a25809bde8c31b84bf6c8c6ef2ed860"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiveData.calculateDeltasAndRate (cognitive 36): ReceiveData.calculateDeltasAndRate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed01e9549316ad15429ed38402b131ef6be31bbc6f2d7663114c6d805ea699d0"}},{"ruleId":"D2","level":"warning","message":{"text":"DexcomShareSourceTask.handleValueResponse (cognitive 36): DexcomShareSourceTask.handleValueResponse has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DexcomShareSourceTask.kt"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7381a7fa83c673a7fa28c4d6e6110b7b99349c4e6c96bda3bd384836cb92bac"}},{"ruleId":"D2","level":"warning","message":{"text":"XDripServer.createResponse (cognitive 35): XDripServer.createResponse has cognitive complexity 35 (threshold 15). Drivers by points: if/else 31, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/xdripserver/XDripServer.kt"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"2424b9016047e454da59a005a4d9304e144bb30e14ad07ee744d3090c0f05339"}},{"ruleId":"D2","level":"warning","message":{"text":"WearActivity.updateConnectionsTable (cognitive 34): WearActivity.updateConnectionsTable has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (34 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dab8aa6c7a489b29cb7243b7afd51e293f307c40048a9b8c628d65db821fc5"}},{"ruleId":"D2","level":"warning","message":{"text":"WearPhoneConnection.sendMessage (cognitive 33): WearPhoneConnection.sendMessage has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 7, error handling 3 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/WearPhoneConnection.kt"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf7563b717aa198b9dc71eeb15345957aba06ed9ddd1dea16ecca9759c24015"}},{"ruleId":"D2","level":"warning","message":{"text":"NightscoutSourceTask.handleEntriesResponse (cognitive 33): NightscoutSourceTask.handleEntriesResponse has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 3, loops 1 (3 pts), error handling 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/NightscoutSourceTask.kt"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dd63ce4b7bc09dea5389f259275462c8b15d92120f83f9115e6d24e7c395a9"}},{"ruleId":"D2","level":"warning","message":{"text":"PermanentNotification.createNotificationRemoteView (cognitive 33): PermanentNotification.createNotificationRemoteView has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/notification/PermanentNotification.kt"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3154d3c983abcdf9b99b79b2001b3cf4ca8067a10f8e95f08fd430f1e993722b"}},{"ruleId":"D2","level":"warning","message":{"text":"LibreLinkSourceTask.checkPreferenceChanged (cognitive 31): LibreLinkSourceTask.checkPreferenceChanged has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/LibreLinkSourceTask.kt"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"5211a8b70d68777ef53cf5d42998a5a1e740a3478b9c71cb52eb8701b17af236"}},{"ruleId":"D2","level":"warning","message":{"text":"MainActivity.updateNotesTable (cognitive 30): MainActivity.updateNotesTable has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), error handling 4 (9 pts), boolean chains 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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"869f0e22ca55a4e200e3cc7e85d788f19f69c5dd7e24ed3c29c1dc2b4cd88502"}},{"ruleId":"D2","level":"warning","message":{"text":"LockscreenSettingsFragment.checkPermissions (cognitive 30): LockscreenSettingsFragment.checkPermissions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 3 (10 pts), boolean chains 2 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dfa28239114a38558a7e5bc630cd7fcbd464d5b4ac4c2e2de6fbc773ec5b97"}},{"ruleId":"D2","level":"warning","message":{"text":"AlarmNotificationBase.startSound (cognitive 29): AlarmNotificationBase.startSound has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 6, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56434b44ec96163f2be5145e9487888156e49bfe8907ba4d4f63182034b40df"}},{"ruleId":"D2","level":"warning","message":{"text":"LibreLinkSourceTask.parseGraphData (cognitive 29): LibreLinkSourceTask.parseGraphData has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 1 (3 pts), boolean chains 1, error handling 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/LibreLinkSourceTask.kt"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b6d6961c7c77b26a1f291d7291a5a42b748f93c1fdf9fea7a93eee6a9095cf"}},{"ruleId":"D2","level":"warning","message":{"text":"BitmapUtils.calcMaxTextSizeForBitmap (cognitive 28): BitmapUtils.calcMaxTextSizeForBitmap has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/BitmapUtils.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4381ec8e43e262a8a9412d1606268712641d20d6fbcfffaa07c7be368eab3252"}},{"ruleId":"D2","level":"warning","message":{"text":"StatisticsData.update (cognitive 28): StatisticsData.update has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19 (27 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/GlucoseStatistics.kt"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b25f68e902e969e7266aff79bbe43c54ca9359b8de614058a270236151b3f7"}},{"ruleId":"D2","level":"warning","message":{"text":"TextToSpeechUtils.initTextToSpeech (cognitive 27): TextToSpeechUtils.initTextToSpeech has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (23 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/TextToSpeechUtils.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"423c684cbab304dde02689a451a17d096a444a2d2a7aa7f1fb58f2ec3e79b0fa"}},{"ruleId":"D2","level":"warning","message":{"text":"AlarmNotificationBase.checkCreateSound (cognitive 26): AlarmNotificationBase.checkCreateSound has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 2, error handling 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4d38836cb845e7cec57520c8f968a6491ab7620eb78911fee737adf25d7da8"}},{"ruleId":"D2","level":"warning","message":{"text":"CarNotification.canShowNotification (cognitive 25): CarNotification.canShowNotification has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5 (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":"auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarNotification.kt"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"027efab35f9c1c2fb7f7765e5f4ec0e5314f27175209f207bfdc35e2b9a87716"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartCreator.addEmptyTimeData (cognitive 25): ChartCreator.addEmptyTimeData has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.kt"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0790e215e02fa6791b17073c3afe84c04dcf82193dcec1dd7bb60329d7e003b"}},{"ruleId":"D2","level":"warning","message":{"text":"LibreLinkSourceTask.parseGlucoseData (cognitive 25): LibreLinkSourceTask.parseGlucoseData has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 2 (nesting depth added 15). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/LibreLinkSourceTask.kt"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe9e2a852b8152b656432bbd8815012799621f76fffa4a4fd1fb13922beac39"}},{"ruleId":"D2","level":"warning","message":{"text":"XDripServer.onSharedPreferenceChanged (cognitive 25): XDripServer.onSharedPreferenceChanged has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/xdripserver/XDripServer.kt"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f650768ce1eab6c80fc4cfabff026923200a52642f750524e9456024b0ced5"}},{"ruleId":"D2","level":"warning","message":{"text":"ActiveComplicationHandler.OnNotifyData (cognitive 25): ActiveComplicationHandler.OnNotifyData has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 4, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/complications/ActiveComplicationHandler.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"591feafd174486b2b46f7d2e3d91a3f9fcaa01dd84199e25f074bfb7fe94fe5f"}},{"ruleId":"D2","level":"warning","message":{"text":"MedtrumSourceTask.handleGraphDataResponse (cognitive 24): MedtrumSourceTask.handleGraphDataResponse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/MedtrumSourceTask.kt"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3fd873098424974421bc3ae396ff1c6965713c140d942d4e69b35ea8b27911"}},{"ruleId":"D2","level":"warning","message":{"text":"BackgroundTaskService.startTimer (cognitive 23): BackgroundTaskService.startTimer has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (23 pts) (nesting depth added 13). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/BackgroundTaskService.kt"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"626da36c8cc57462742c295b777e6d1c202235c94be2f5cb05c59c423529f189"}},{"ruleId":"D2","level":"warning","message":{"text":"MedtrumSourceTask.checkPreferenceChanged (cognitive 23): MedtrumSourceTask.checkPreferenceChanged has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/MedtrumSourceTask.kt"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fdf8acaface4b091dd3a9a430b6d79808f3f22b366f77fc757758004b9c855"}},{"ruleId":"D2","level":"warning","message":{"text":"Utils.getDeviceInformations (cognitive 23): Utils.getDeviceInformations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (3 pts), boolean chains 2, error handling 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ea5f77369976077868605dde4515da5f2c6b9ece776a30e7bb72fae112e7e9"}},{"ruleId":"D2","level":"warning","message":{"text":"DexcomBroadcastReceiver.onReceiveData (cognitive 22): DexcomBroadcastReceiver.onReceiveData has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (3 pts), boolean chains 2, error handling 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/DexcomBroadcastReceiver.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"435d6a21471639c03fe825f4e053014a814eae1616e948f1d4a9da50d6f96324"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchDrip.addGraph (cognitive 22): WatchDrip.addGraph has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/watch/WatchDrip.kt"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e76a02478dc79f2e7c615cf73dded086300e16a858512cc584937cca93ba96f"}},{"ruleId":"D2","level":"warning","message":{"text":"GlucoseValueTileService.buildLayout (cognitive 22): GlucoseValueTileService.buildLayout has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"333bff05f83e1446650093eaf75143d0dc0a721365bca581eaf9e4aa976df186"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartCreator.addEntries (cognitive 21): ChartCreator.addEntries has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.kt"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e6d6e74ee3b4d9888a3df6a5ddcc42f7ac1d050e6bcfacc266fa55c9329eca"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomBubbleMarker.findNearestIndex (cognitive 21): CustomBubbleMarker.findNearestIndex has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/CustomBubbleMarker.kt"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"417cae0c9ea2182189e18c2d6b22be4d67b9901f51b66f73c4bc77f33351cca3"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationReceiver.parseString (cognitive 21): NotificationReceiver.parseString has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.kt"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef955ca133e7ccae3096a556462772d602bacce4160156090012eda9b04305ac"}},{"ruleId":"D2","level":"warning","message":{"text":"NightscoutSourceTask.handlePebbleResponse (cognitive 21): NightscoutSourceTask.handlePebbleResponse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/NightscoutSourceTask.kt"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52c7a6f258c13e61237bc8e6743219e01f4bfd9a258fe552d28599536b93b00"}},{"ruleId":"D2","level":"warning","message":{"text":"CarModeReceiver.sendToGlucoDataAuto (cognitive 21): CarModeReceiver.sendToGlucoDataAuto has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 2, error handling 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/android_auto/CarModeReceiver.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e033bbf1376e45516fe7b0896055cddf5c1ef36adf9ccbcbf6f207683de5557d"}},{"ruleId":"D2","level":"warning","message":{"text":"FloatingWidget.createWindow (cognitive 21): FloatingWidget.createWindow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, error handling 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/FloatingWidget.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99bf0a170e52c71404b9f08cfd689bd483dadd58f35ca833958d09480a96ace"}},{"ruleId":"D2","level":"warning","message":{"text":"GlucoDataService.start (cognitive 20): GlucoDataService.start has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/GlucoDataService.kt"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"254ca251ee50abc3c581fa10b25d9faf43453094a9d75ea1476ae735dfbe92ab"}},{"ruleId":"D2","level":"warning","message":{"text":"AiDexCgmParser.parse (cognitive 20): AiDexCgmParser.parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, error handling 1, match/switch 1 (nesting depth added 9). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/AiDexCgmParser.kt"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"953b3ed7414367fcc7af4f5c0dfbc09239ab68f40570e311745c04c5adbcfcdb"}},{"ruleId":"D2","level":"warning","message":{"text":"MainActivity.checkMissingPermissions (cognitive 20): MainActivity.checkMissingPermissions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcac7e2753e46648daed7003b4a4a9e8eb30cd816c3b2928a16380a00367f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"PermanentNotification.getNotification (cognitive 20): PermanentNotification.getNotification has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (20 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/notification/PermanentNotification.kt"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92c72f6422cc16d659eb9bae4ed093bb38312d2802a9c2a4eef3e2df893bca0"}},{"ruleId":"D2","level":"warning","message":{"text":"WearActivity.updateDetailsTable (cognitive 20): WearActivity.updateDetailsTable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6356f54c5be418c7bdb61ab60298b17e2ce8dd2a4c21067ec86e4efdb198d98"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomBubbleMarker.draw (cognitive 19): CustomBubbleMarker.draw has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/CustomBubbleMarker.kt"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7755ddfd54340f2cb2bc2ee9336714b7a2926a61f96c402c2f6e1a20f2adcc9d"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomBubbleMarker.onChartTranslate (cognitive 19): CustomBubbleMarker.onChartTranslate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/CustomBubbleMarker.kt"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa586f08f2d1d289abbc4cc8a9e1d5d838a6e871b2356205b8a198dbc01c65a"}},{"ruleId":"D2","level":"warning","message":{"text":"AlarmHandler.checkForAlarmTrigger (cognitive 19): AlarmHandler.checkForAlarmTrigger has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 2, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d8ed0f8336a997437469b27cc92cadcfc0be56f2e55650bcac1845a5d85499"}},{"ruleId":"D2","level":"warning","message":{"text":"AlarmNotificationBase.checkRetriggerAndAutoClose (cognitive 19): AlarmNotificationBase.checkRetriggerAndAutoClose has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d647a86b849fa8cc8fbe9dd2e60fed46c090ea5d9b72ea53aacdf7ddc6d035"}},{"ruleId":"D2","level":"warning","message":{"text":"DataSourceTask.handleResult (cognitive 19): DataSourceTask.handleResult has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DataSourceTask.kt"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b06d0b0876bffe7ce0b241470f19a0d1f624b374e00add15363a23d67d1e87"}},{"ruleId":"D2","level":"warning","message":{"text":"Utils.formatDurationFromSeconds (cognitive 19): Utils.formatDurationFromSeconds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (19 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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f47d491ed150918cd6fd0cdcc3dd97f0877be364798ca750c47196d084fcbf5"}},{"ruleId":"D2","level":"warning","message":{"text":"WallpaperBase.onSharedPreferenceChanged (cognitive 19): WallpaperBase.onSharedPreferenceChanged has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, error handling 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/WallpaperBase.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"027f715e294f708ea98be32579b0afa73e9ec3d8b90a2c9a51b3bad587754f69"}},{"ruleId":"D2","level":"warning","message":{"text":"AlarmHandler.checkDeltaAlarmTrigger (cognitive 18): AlarmHandler.checkDeltaAlarmTrigger has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (16 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":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e701a35c6da6c267a6d6dea5b596d7f0002529038f516ffd51cea73c7ceec35"}},{"ruleId":"D2","level":"warning","message":{"text":"LibreLinkSourceTask.handleError4 (cognitive 18): LibreLinkSourceTask.handleError4 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3 (nesting depth added 9). 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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/LibreLinkSourceTask.kt"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db40c69f9d593681dc157274ca8711db763f034cafb17c356a971fb44dfd0a6"}},{"ruleId":"D2","level":"warning","message":{"text":"CarMediaBrowserService.getBackgroundImage (cognitive 17): CarMediaBrowserService.getBackgroundImage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 1, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarMediaBrowserService.kt"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa5273a0e5c41df17ce8828f3dedc683341a56234fa558c34bb99331f32d507"}},{"ruleId":"D2","level":"warning","message":{"text":"CarMediaPlayer.playMedia (cognitive 17): CarMediaPlayer.playMedia has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarMediaPlayer.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c858a0ca9a1a8e7b11f8504d79dad42563a1781bcb9a852141208a23777319e1"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiveData.getAsText (cognitive 17): ReceiveData.getAsText has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faafbfea7f7431e97da94bb351a0a903b5fdfc0725ac12219ca18308dfd52cd"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceOnlineFragmentBase.updateEnableStates (cognitive 17): SourceOnlineFragmentBase.updateEnableStates has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"22691365d1e76ec82ba80c5a0e53be28dc974879ca0f398c77ef8c6881d4238a"}},{"ruleId":"D2","level":"warning","message":{"text":"BackgroundTaskService.executeTasks (cognitive 17): BackgroundTaskService.executeTasks has cognitive complexity 17 (threshold 15). Drivers by points: error handling 4 (9 pts), if/else 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/BackgroundTaskService.kt"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"024687dd50d15b92dc8ab923f156058e46b8dcad1f462d233339c113007e3518"}},{"ruleId":"D2","level":"warning","message":{"text":"DexcomShareSourceTask.checkPreferenceChanged (cognitive 17): DexcomShareSourceTask.checkPreferenceChanged has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DexcomShareSourceTask.kt"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4eb764c6ad88d5a32ad290a15ff2de9c875cf0c26266178246496d724161083"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageUtils.updatePackages (cognitive 17): PackageUtils.updatePackages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/PackageUtils.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eee23aba0068b83848c2544da54518c78e9073656d8264251f634b5bd91111"}},{"ruleId":"D2","level":"warning","message":{"text":"Utils.parseTimeAndGetNextTimestamp (cognitive 17): Utils.parseTimeAndGetNextTimestamp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"97148432b0037f147d8b20dcbd2f24b625c73beef286841f9098b78147b641d1"}},{"ruleId":"D2","level":"warning","message":{"text":"AlarmTypeFragment.setRingtoneSelect (cognitive 17): AlarmTypeFragment.setRingtoneSelect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2 (5 pts), boolean chains 1 (nesting depth added 9). 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":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8637695cad670e6f0e02391a2490119c19a5397f81060d86a895fa1b0b7fbdb9"}},{"ruleId":"D2","level":"warning","message":{"text":"BatteryLevelWidget.onUpdate (cognitive 17): BatteryLevelWidget.onUpdate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec4f9d5bf15f991a9b1e2cf09d66010a3814e7e3d69bfd846453d5f5a3be0d6"}},{"ruleId":"D2","level":"warning","message":{"text":"CarNotification.updateSettings (cognitive 16): CarNotification.updateSettings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarNotification.kt"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44770de7277c001c95d6f9f61f479dd144f7f8c1afab0df96de7192c2b1e977"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiveData.hasNewIobCob (cognitive 16): ReceiveData.hasNewIobCob has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"486b6eb6b10917e26cacf619194f3b89ced126af537775629a7f580b3def9b19"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartBitmap.waitForCreation (cognitive 16): ChartBitmap.waitForCreation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 6, 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":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartBitmap.kt"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e712b5d4b1b91de399677289cbfa23487259969b6e9191fc55474000093b61"}},{"ruleId":"D2","level":"warning","message":{"text":"BackgroundTaskService.checkTimer (cognitive 16): BackgroundTaskService.checkTimer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, error handling 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/BackgroundTaskService.kt"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80a3dd0b736d423178c958f32d01dfb53b10c60ad5bc5860194261fc989b965"}},{"ruleId":"D2","level":"warning","message":{"text":"DataSourceTask.checkPreferenceChanged (cognitive 16): DataSourceTask.checkPreferenceChanged has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DataSourceTask.kt"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac09fec0b433f8253d465f6fe7fed06296b965849fbfebd95926d0262952b55f"}},{"ruleId":"D2","level":"warning","message":{"text":"MainActivity.onOptionsItemSelected (cognitive 16): MainActivity.onOptionsItemSelected has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0889316f6c851f9e4716f7479d2ff4acf23d492cd9870f0417dc866fe2f284e2"}},{"ruleId":"D2","level":"warning","message":{"text":"NightscoutUploader.onSharedPreferenceChanged (cognitive 16): NightscoutUploader.onSharedPreferenceChanged has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (3 pts), boolean chains 1, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/transfer/NightscoutUploader.kt"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0975785d9c465b8c1c8da9c7d9a7b9296573e20fcabd5fedef034ad7faf87a3"}},{"ruleId":"D2","level":"warning","message":{"text":"WearActivity.updateNotesTable (cognitive 16): WearActivity.updateNotesTable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 3 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ddc7414d7882f7220241405e0ec36f1d0b5070a0d8b45f76a6fdd30c9befad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AlarmNotificationBase: TooManyMethods \u2014 77 methods. The bar is 30 methods; this is 47 over it, 2.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fd94e651432bba175803dd98e5bd6f2f507dfbe068d9e97dc69c3772627568"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MainActivity: ClassTooLong \u2014 997 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 597 over it, 2.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d43d2f92150e403d5a4154427a884cc42fdec8f06c4f221330df792a0bab55e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: glucodatahandler/MainActivity.kt: FileTooLong \u2014 1090 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: MainActivity (97-1441). The bar is 500 significant lines; this is 590 over it, 2.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0a69b41c5e2bfe01e981c761e16aed9e889726a8b7668808161b99956548f8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AlarmNotificationBase: ClassTooLong \u2014 794 significant lines (blank, comment-only and punctuation-only lines excluded), 77 methods. The bar is 400 significant lines; this is 394 over it, 1.99\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":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"57db33a27e46493df765d5616484df5d6dc6b2f61bae0ad7da3217c0b1d0e5c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReceiveData: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abde165ce598baa9a507a21cab9d80773b9a64c4010685f9bf3124a6e401c05"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChartCreator: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2a462be23f16c04b8b12f7034467cb4613cdac12fcfa7ff74c49a54f37ee28"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common/ReceiveData.kt: FileTooLong \u2014 868 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 368 over it, 1.74\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":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac976bff79eeee97bfcfd382b4db0daea5c430c57be6d1f41653df8078e9e10d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsonUtils.typedMapToBundle: MethodTooLong \u2014 typedMapToBundle runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"146adb8cc36c622d5754263a3b208c309f1314a40cf936fe82b920d1054ea92f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notification/AlarmNotificationBase.kt: FileTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: AlarmNotificationBase (40-1136). The bar is 500 significant lines; this is 339 over it, 1.68\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eef311ae0dd6216dd1871fa9f30dd7f694b8ea8c5c00fab9dda75d5f8a261d2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WearPhoneConnection: ClassTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 204 over it, 1.51\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":"common/src/main/java/de/michelinside/glucodatahandler/common/WearPhoneConnection.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab72e7de0f9ff92a4cfdd94e511e1c7276caf65ad6f8973bee04daa958e9c77"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WearPhoneConnection.onMessageReceived: MethodTooLong \u2014 onMessageReceived 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":"common/src/main/java/de/michelinside/glucodatahandler/common/WearPhoneConnection.kt"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cc538e0e475c7ceed71333bbb698b58e2d9436ccf10eaa5139dad27dab5449"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SettingsMigrator.migratePhoneSettings: MethodTooLong \u2014 migratePhoneSettings 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":"common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e655354fe04fb277d3665c3f46ad0fe8f102458c93146df83211bb998168ab0c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NotificationReceiver: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5c6cf6d9e405d64ab3b49a141159fcd6c03e1898bb1127448d49285a17d828"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WallpaperBase.createWallpaperView: MethodTooLong \u2014 createWallpaperView runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/WallpaperBase.kt"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba1d53bab375bed0322f568f0be6a5aa2baf5944e314c2c2b38c0e1558e390e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Utils: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5fe84b47fd77919b3a24d121d4e65cc377ec2fa47634f7b03332dd676ae54a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chart/ChartCreator.kt: FileTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 151 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b3e9148cc309754afb113a239dcaa770808ef2d2207b7f9ae7e7695341384c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BgValueComplicationService: 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":"wear/src/main/java/de/michelinside/glucodatahandler/complications/BgValueComplicationService.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e3a5b3f390e187470e0805d814d7ab601bbe47181a14cf5c96e833fe5c3415"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common/WearPhoneConnection.kt: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: WearPhoneConnection (42-890). The bar is 500 significant lines; this is 140 over it, 1.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/WearPhoneConnection.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2cc52c4096202ee2dfd2a20d8bff3cdf4051d6e872f13f490bfd51b77883e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: receiver/NotificationReceiver.kt: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.28\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":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c386767699a956114ab2adac834260d74d90c8813ad2a0a91ad6e6393b5a19"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MainActivity: ClassTooLong \u2014 494 significant lines (blank, comment-only and punctuation-only lines excluded), 25 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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f857426acb49b3df5f44f2cdf422f0f804bc5d27a5ed71eab89565c5e76dcec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MainActivity: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b6f4b80a251e78d0d9c51677b7ec12af0883e5d8aca6b5049408e25f44aafd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataSourceTask: 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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DataSourceTask.kt"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fcba4ba3e75e192fe4928f8f4f2cf2398417ddd98526a1fc15b6888d23a363"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainActivity.updateConnectionsTable: MethodTooLong \u2014 updateConnectionsTable runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"841653ef938a3fcdd821d98f9f96afb9a4f882c588bf4b20b85a23a6ed77d61a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: glucodataauto/MainActivity.kt: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: MainActivity (63-736). The bar is 500 significant lines; this is 54 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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef353da623b7551aa45db0182f665d79049a0cdf412510fd427ad6828e186326"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WearPhoneConnection: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/WearPhoneConnection.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"687418a7b1bbfb61f003d7c3b78e9527f141975956bbe2e913d71fc19bd1d914"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WearActivity: ClassTooLong \u2014 436 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 36 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"579c5c7b6575cf5656626335e6b779db8539d63aaad694345bb58c789c1a6a4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SettingsMigrator.migrateSettings: MethodTooLong \u2014 migrateSettings 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":"common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e0b442b6ccf833e689aebc2c99b9382c4d6780371ba4ec1691a41b6492ce17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SettingsActivity.onCreate: MethodTooLong \u2014 onCreate 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":"wear/src/main/java/de/michelinside/glucodatahandler/settings/SettingsActivity.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeedc4ce7f98f2a44af92d65a498b31654ecf23371071462d0754b3fd3e0e9c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: dbAccess: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/database/dbAccess.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe12c1a8f4aa1ccf12a953d746219404a25076b432b9e4c0f6851e629df4b53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Companion.requestWebserverData: MethodTooLong \u2014 requestWebserverData runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/GlucoseDataReceiver.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f88eee71192aa8404bfe103bd098e3c5b0d7f0cec6f0a11412d02749b59d23f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/Utils.kt: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fb7c67a78a10fbe17e0c0ed815693631f34d5f888578a6f8dcdc1416fefd80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notification/AlarmHandler.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":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cf1c72a61c0e62c9dabfd12a4b86b6c17fc55c92785034e9edd55653fa5bae"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LibreLinkSourceTask: ClassTooLong \u2014 402 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 2 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/LibreLinkSourceTask.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f2886354dc27f15e3a97cb75410bedd81397215316e65963d50b5fa9552287"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CarMediaBrowserService: ClassTooLong \u2014 402 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 2 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarMediaBrowserService.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a219c012a771f091c1b9c6bcd35c016dc142be8a035a16fbd09823015a615f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (27 shared lines): auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt:302-410 | common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.kt:73-197 \u2014 These two members are variants of one another: 27 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c7fbe3674cbf4ac4caed2682ea2f6b5c91d317c4515c3ceba24ceed55024da"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): auto/src/main/java/de/michelinside/glucodataauto/receiver/AAPSReceiver.kt:11-19 | auto/src/main/java/de/michelinside/glucodataauto/receiver/DexcomBroadcastReceiver.kt:11-19 | auto/src/main/java/de/michelinside/glucodataauto/receiver/DiaboxReceiver.kt:11-19 | auto/src/main/java/de/michelinside/glucodataauto/receiver/GlucoDataReceiver.kt:11-19 | auto/src/main/java/de/michelinside/glucodataauto/receiver/LibrePatchedReceiver.kt:10-18 | auto/src/main/java/de/michelinside/glucodataauto/receiver/NsEmulatorReceiver.kt:11-19 | auto/src/main/java/de/michelinside/glucodataauto/receiver/XDripReceiver.kt:11-19 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/receiver/AAPSReceiver.kt"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0edd0549a1db5dcd5a79d6b61f0804018a3a2ca0dc53686a0ffea59efc84767"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:88-180 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:138-257 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1406-1440 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:77-186 \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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9337e2f418f547116b8cff29381db1961cc78fded2564d994cecf1901251b39e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:483-524 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:740-792 | mobile/src/main/java/de/michelinside/glucodatahandler/notification/LockscreenActivity.kt:294-322 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:254-300 \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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"917fe017add92c131a58beafb16d1cb7f2ca5d3a506d8478eeee20f9bcbf0654"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt:25-63 | auto/src/main/java/de/michelinside/glucodataauto/preferences/LogSettingsFragment.kt:25-48 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/ExportImportSettingsFragment.kt:28-85 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/LogSettingsFragment.kt:37-81 \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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb1e7c71a975e0ffb61e4156749cbee61b30138a7bf2e8bbfdb5d5f9a7f3630"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt:65-82 | auto/src/main/java/de/michelinside/glucodataauto/preferences/LogSettingsFragment.kt:70-86 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/ExportImportSettingsFragment.kt:87-104 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/LogSettingsFragment.kt:126-143 \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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf9ca8e77f7908df102ab8cf611fb7680169bd425d992e641fd16ad4d4fa98f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (91 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:117-207 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:123-224 \u2014 These two members are one piece of code written twice and then edited apart: 91 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe6e46ef6a7f5a75e47791b9b17145dd2cbc5c6640f2a86f3604ad8968add38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DexcomShareSourceTask.kt:320-364 | common/src/main/java/de/michelinside/glucodatahandler/common/tasks/MedtrumSourceTask.kt:430-481 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DexcomShareSourceTask.kt"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebd0515350e52eae90bcf785923dfb3c1bac132391f4bef6170743de4d59f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:281-332 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:450-498 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e696ffa7f5f163d0c02cd15177837089bc807bb1258d9c894a6246506507aa3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreferenceDialogFragmentCompat.kt:89-124 | wear/src/main/java/de/michelinside/glucodatahandler/settings/VibrationPatternActivity.kt:103-143 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreferenceDialogFragmentCompat.kt"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c253f912887ce59504bfb993f31e82d2ff8eb34310c64fb7005036decc3d8bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:270-309 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:199-232 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c56eb9c10b40fe4d9b8884f06e53e156610240b6ec342b93ca082b5a3b19c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt:370-396 | wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmTypeActivity.kt:288-310 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6dd378d482ca60db73aa3522f732d53dbf0a21fe4db18dec104b9a3dc247d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1085-1100 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:509-524 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ca5a7da4ed4beb2839b9733402ffc74b6821d3d4c11526250ec51819866ad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:712-737 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:364-385 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"904ff49c272effea70b613907e7b4b1d8a9079bc24ecdb0a4f4230a8ee6345b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:55-74 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:88-107 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f6c3d9b977535e9e18eb239e0f52be6068951f1da7c6b9b1ef39a3832a9b91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt:256-284 | mobile/src/main/java/de/michelinside/glucodatahandler/android_auto/CarModeReceiver.kt:92-118 \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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"112ec34057a917a504a8ba2ef105dc693fa0c0a44ab9a56fe58e84eafacbc100"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt:311-344 | common/src/main/java/de/michelinside/glucodatahandler/common/service/StartupTrigger.kt:32-71 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ad035970247f6d8ce534d3d7ce81bfa9cbe027bf8d0478c8d5298ae505b91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/widget/AodWidget.kt:54-75 | mobile/src/main/java/de/michelinside/glucodatahandler/widget/LockScreenWallpaper.kt:100-117 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/AodWidget.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7794302c033bafe44726867499633d3aa653c054a263b4ae53118ae8faa7ecfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/notification/SnoozeAlarmReceiver.kt:14-29 | wear/src/main/java/de/michelinside/glucodatahandler/SnoozeAlarmReceiverWear.kt:13-28 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/notification/SnoozeAlarmReceiver.kt"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce9a1fe221a165efefba50e6a14c249b3b8f620bbc9ab3b6cb03a9a3758bf30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1102-1125 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:526-537 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6a7f09095f7424bfeb3ea84eb8f6ba24ef0b3b1ea3f6e2db9810ae7797275c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:720-735 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1341-1360 \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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"712fedc3f6394c85168b206c9eb4f27d31314b1bf4c29647c4764930cab84a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/healthconnect/HealthConnectManager.kt:333-352 | mobile/src/main/java/de/michelinside/glucodatahandler/transfer/NightscoutUploader.kt:246-263 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/healthconnect/HealthConnectManager.kt"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe62676a6b31a0495b1da00931be161202a5015f9465818202def54622d747ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/notification/PermanentNotification.kt:76-92 | mobile/src/main/java/de/michelinside/glucodatahandler/widget/WallpaperBase.kt:162-181 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/notification/PermanentNotification.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b439a4d2400e4cc0796ea63f36694c7cc522fb49df579f1089662a480ee60ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt:543-575 | common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt:616-649 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd3b0c01a92af055bc61fd4539ad35c4993a3d8a910f1318ca1b8b5d46cc4d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:263-279 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:342-367 \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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5c68d257927b94828ac0533e150dc525fe0083253218c9f17b4da8cd122408"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt:89-112 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AppSettingsActivity.kt:91-114 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec33bce2cad2b8d2f7e2f3f9b72450373bede874da91939dae024a343d39dd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt:70-83 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:142-156 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt:161-175 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6120bb4eb32400afc7698b664362567f5836e0914a954a7b5bcd72c23619f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:384-400 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:441-458 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ecdf708ba44020d20cdcf0a810db69ce437531dd1893ccab56250781bae477"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartBitmap.kt:251-274 | common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.kt:852-870 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartBitmap.kt"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bbfb0d4c833587d64fa881e11fabc9241e22492e57f6643a3ca7ce9591568f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartBitmapHandlerView.kt:61-75 | common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartBitmapView.kt:48-64 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartBitmapHandlerView.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e9dfab4f092ba82cd5ed1e8d385936b2e54fc29524f80b15fc5d8ea4a9b0e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/preferences/LogSettingsFragment.kt:50-68 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/LogSettingsFragment.kt:106-124 \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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/LogSettingsFragment.kt"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9030a4ffe7f8f9fb4ea23ed059ef9725ba1a887ff3ea7c07b51dbb6abf0af571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt:1098-1118 | wear/src/main/java/de/michelinside/glucodatahandler/complications/ActiveComplicationHandler.kt:76-100 | wear/src/main/java/de/michelinside/glucodatahandler/complications/ChartComplication.kt:348-374 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8416718e7de99813be999b0248e539985a5596e8439feabaf56b0d55f81c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.kt:639-651 | common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.kt:661-673 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.kt"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"c909355b1e309aafff36fbb97118327118abeb47946c9958d9662c61720a9951"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarMediaBrowserService.kt:543-555 | auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarMediaBrowserService.kt:564-576 \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":"auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarMediaBrowserService.kt"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"b233d51a1dcdb8f0bc9a594021b13b95e5b103be680a1b5ae802782b03123b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/healthconnect/HealthConnectManager.kt:178-196 | mobile/src/main/java/de/michelinside/glucodatahandler/healthconnect/HealthConnectManager.kt:199-215 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/healthconnect/HealthConnectManager.kt"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5531fac9b28cc4de5f55019967ea8e5e6474ceeedded09463d9fc2c3019a3d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:334-349 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:500-517 \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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05918750cc368e1ce6303dc3d280031bbaa634341e9d326fac4a1b737c8b308"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/complications/BatteryLevelComplication.kt:83-107 | wear/src/main/java/de/michelinside/glucodatahandler/complications/BgValueComplicationService.kt:107-124 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/complications/BatteryLevelComplication.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"58937f84a58eb8fb68fc5a3e97af2b92a37106482975c3c26d66190676e7dcc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragment.kt:18-34 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragment.kt:15-30 \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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragment.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"502360f46d39a6e38d1f12ee000832429246fce37e3512e6732cbd6efabe6f1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:189-204 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmGeneralFragment.kt:147-165 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"061161bf1e9a11757590476bffa61c6107445f93b56e9888da054ce89504aae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreferenceDialogFragmentCompat.kt:49-62 | wear/src/main/java/de/michelinside/glucodatahandler/settings/ComplicationsTapActionActivity.kt:89-99 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreferenceDialogFragmentCompat.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce0b15ea1b414fd1b36ea11fd43daf4b76f0d8522c08cdeadf249f05a8a0af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/complications/ActiveComplicationHandler.kt:102-113 | wear/src/main/java/de/michelinside/glucodatahandler/complications/ChartComplication.kt:376-388 \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":"wear/src/main/java/de/michelinside/glucodatahandler/complications/ActiveComplicationHandler.kt"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"370ed980822a3389496671471206744308927cd2b212aa38100d3dd209663f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.kt:187-206 | common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.kt:225-244 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.kt"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"5067976c68efb78746c805e2a38765b1a5bce919681914d2dc72d2d0afaa4b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt:247-259 | common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt:262-274 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5328793e1fceb2fc27d2c0ea14fe9ddd2984449f0f1abbcd6eb9dd4f8115c815"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/tasker/AndroidAutoConnectionState.kt:44-55 | mobile/src/main/java/de/michelinside/glucodatahandler/tasker/WearConnectionState.kt:44-55 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/tasker/AndroidAutoConnectionState.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a90b67a43f74976af722fb14f61f6c99416e484be8037f2072ee92e57c740b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:80-91 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt:113-125 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:83-94 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb4a7840ba0a7df6e25b8a6bfc5c48e947376402f66bb21cb9b68f01a2bdaed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/widget/ActiveWidgetHandler.kt:106-120 | mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidgetNotifier.kt:91-109 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/ActiveWidgetHandler.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38b08d648c5f3e47d473dcba0a6a3a17fd32351effaa924cf9e64a7e267d0f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:251-261 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:240-251 \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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"060f39c7580468890d1163d44342ed55d82b82a352033dc919b0d3d3edd11765"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:657-669 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1244-1257 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:572-585 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcade5c33220f22a6b1beec64a84db873364b1bfc4ed666f7bab09464c38f63b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt:99-113 | mobile/src/main/java/de/michelinside/glucodatahandler/watch/WatchDrip.kt:53-65 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"499da0a7e68c0fcdb59130c9db2364f5d6954c0cb1a0c85d2d9a6b04db99f16a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt:486-497 | common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt:566-577 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8cc4c062438a41ecf72874b066faebaea95e5d0f49f0e348f1925a20ac3a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt:73-85 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:83-100 \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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40921aa57a83eeecfa3c95676b0811314a50aa0172eab6a3dca14450b811faa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt:117-124 | mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt:114-121 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaff8f2ae2b79da66661d200e06ba888c57d4e656da191ebc6e4538302f63617"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt:327-343 | common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt:412-424 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"16736e379701916689f380b0f6defc538402546f7a2a39d573387a76130036ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/StartServiceReceiver.kt:12-25 | wear/src/main/java/de/michelinside/glucodatahandler/StartServiceReceiver.kt:12-25 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/StartServiceReceiver.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3529dd0ab717f01f85ed18c8c2a6b883128ba252a483b87be770e9bef885fba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:197-206 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmAdvancedFragment.kt:71-79 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c870e768c4372962473779118b5600872c4372c50587e8bf887ff7f5c72a2a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/complications/BatteryLevelComplication.kt:36-48 | wear/src/main/java/de/michelinside/glucodatahandler/complications/BgValueComplicationService.kt:58-69 | wear/src/main/java/de/michelinside/glucodatahandler/complications/ChartComplication.kt:124-137 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/complications/BatteryLevelComplication.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f67fbc9bf0c42f3ce88124c46a0629a4b3c3336132c23dd505312f3d1505d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/database/dbSync.kt:82-92 | mobile/src/main/java/de/michelinside/glucodatahandler/watch/LogcatReceiver.kt:76-88 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/database/dbSync.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c05dae7c981cbffc789379bb00e1138e8b07bd0a47da5d7008861c119340b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/chart/GlucoseChart.kt:69-81 | common/src/main/java/de/michelinside/glucodatahandler/common/chart/GlucoseChart.kt:83-95 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/GlucoseChart.kt"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"074cc6cf5ab0b6a5b0518af5448db64421c81ecc2e63f6e19af989fbb228529d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/database/dbAccess.kt:192-206 | common/src/main/java/de/michelinside/glucodatahandler/common/database/dbAccess.kt:225-239 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/database/dbAccess.kt"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"daec8bc0b4ef88a5bc4699a546895715adf89bf2b3b17bace589884ecb139f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarNotification.kt:372-385 | auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarNotification.kt:387-398 \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":"auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarNotification.kt"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed947c662ea52f56d2ba4cc9adb135b0c7c0d122f3c0311f2bdc1978efdad798"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:23-36 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:33-45 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b2e4afaebba899c1e959b14953c9b81e75d6fa80373cb2e27992d76d67d94a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/tasks/BackgroundWorker.kt:26-37 | common/src/main/java/de/michelinside/glucodatahandler/common/tasks/BackgroundWorker.kt:39-53 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/BackgroundWorker.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a11b63778ee9a5eee399d665fdde03a3328b9f855a47b1435fb7a4400f6dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreference.kt:78-86 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreference.kt:57-65 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreference.kt"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8b5789d7459f508285b3b3c4f2289994cb7e9e1d8f9f93ec4d6ea4f5ad3fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreferenceDialogFragmentCompat.kt:75-87 | wear/src/main/java/de/michelinside/glucodatahandler/settings/VibrationPatternActivity.kt:89-101 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreferenceDialogFragmentCompat.kt"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"626864dca9009f4c474955fc9855a95d76e454d89253af732ee29d65d56282bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarNotification.kt:318-335 | auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarNotification.kt:337-353 \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":"auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarNotification.kt"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b505e67bc589e8568d3e01a21f214895e712a75ba4a63c7021a6933125416bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmAdvancedActivity.kt:184-196 | wear/src/main/java/de/michelinside/glucodatahandler/settings/SettingsActivity.kt:225-238 \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":"wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmAdvancedActivity.kt"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b921f113cb482f82edddbee73bfdedf0ce86b8a75875d5d15511f2ac0f03bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt:108-115 | mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt:105-112 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"411a080e59c8808aea439e6e298447f687c65d148e62ab5a44727a5fdc595eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt:137-148 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:194-203 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a48a14907fbcfc82e5612e3903bfc1213137e7a77d6c1a5f67209abb3cac13a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt:27-37 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceFragment.kt:11-24 \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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3cad6591134a71ded8326c4b68333e769765edf22e5ec9b1ce8f8e651d0a26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/complications/SmallImageComplication.kt:119-131 | wear/src/main/java/de/michelinside/glucodatahandler/complications/SmallImageComplication.kt:147-159 \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":"wear/src/main/java/de/michelinside/glucodatahandler/complications/SmallImageComplication.kt"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6db7a32515d1a2927e68ead202c65a5126f533637ff6d771c7335cf2020818"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1279-1289 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1330-1339 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:607-616 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc314e9ac603f3330de38a043d641e77db7c7490906061e66510563ead89d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/complications/ChartComplication.kt:149-161 | wear/src/main/java/de/michelinside/glucodatahandler/complications/BgValueComplicationService.kt:71-79 \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":"wear/src/main/java/de/michelinside/glucodatahandler/complications/ChartComplication.kt"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f594d2c855ee6da5da593adf4707687e9ad049df5100ad244fa2314624afcf4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt:149-157 | mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt:152-159 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"44988bc2f40039bbac58e348ba65dc603fa7c6cdc6af9fe54f932bc88da55622"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarNotification.kt:144-155 | common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt:204-213 | mobile/src/main/java/de/michelinside/glucodatahandler/watch/WatchDrip.kt:67-78 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarNotification.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68114228b7e0b05d2be730327c18973228dfb6e7a1b0f2f34c862015e097a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt:655-666 | common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt:671-681 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c56b296def288e331b5067e7cae7c808918754c31a1c9de2cfa504f89af004"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:61-73 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:181-192 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmAdvancedFragment.kt:42-52 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt:125-135 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"920651b82dd5eb19f6f02211f068d5e05eed6fa7b8d010135881883df43598d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/settings/ComplicationsTapActionActivity.kt:57-69 | wear/src/main/java/de/michelinside/glucodatahandler/settings/VibrationPatternActivity.kt:57-68 \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":"wear/src/main/java/de/michelinside/glucodatahandler/settings/ComplicationsTapActionActivity.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7241459caa7b306fb1e8927ee3ebb48447923e3f6378c1fd9a272c925c9cde15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreferenceDialogFragmentCompat.kt:143-156 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreferenceDialogFragmentCompat.kt:62-73 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreferenceDialogFragmentCompat.kt"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"417d2f4e33f1b4d3d52ef40ad5513f64696ffe4f19bcdc1c5f148216be60ab39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/preferences/HelpFragment.kt:13-21 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:30-39 \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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/HelpFragment.kt"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9cae8083779210717710120e1685bd715ff27ab7ed98d7e046d38bffb5ae6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmAdvancedFragment.kt:20-30 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceNotificationFragment.kt:15-24 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmAdvancedFragment.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd7dda5c0bf0c2ea066e43d7c28a6e30add9cd6e878ab72be2127da7e0245a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt:87-92 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:115-120 \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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"427b8add80731b84a0261891a34450199eb911de1f5899c3bc71325ea77e7637"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/complications/ShortTextComplication.kt:38-47 | wear/src/main/java/de/michelinside/glucodatahandler/complications/TimeComplicationBase.kt:49-59 \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":"wear/src/main/java/de/michelinside/glucodatahandler/complications/ShortTextComplication.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1fd4d44e3ac55be1563d4dd01dea8dd3af744facf16c133a6db83bd4a4377f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/notification/LockscreenActivity.kt:235-243 | wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmTypeActivity.kt:188-197 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/notification/LockscreenActivity.kt"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5433c3bd5b2f570206312aaa1541cac2e9c1e0e68131e1cd273dc2a6483fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt:126-134 | mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt:123-132 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fff957f0b11cf4cb5b36028ede3a97b4d4a75e5d35e8a194d36a5031248c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileUpdater.kt:28-37 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileUpdater.kt:33-41 \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":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileUpdater.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b299a024e8e69614b3d3b0a47b14e91b0d87d18fddb494f51054c60489c7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt:136-145 | mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt:134-142 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"abffc0b64fe1664abf2e71528744849c6ae6cc82a41905256b0c81a32179ccbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/GlucoDataServiceWear.kt:148-157 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/TransferFragments.kt:197-205 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/GlucoDataServiceWear.kt"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5922003c1618784f0493e18ee570b92895d9a90563b211e2921b36c79a154ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/complications/BgValueComplicationService.kt:48-56 | wear/src/main/java/de/michelinside/glucodatahandler/complications/ChartComplication.kt:139-147 \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":"wear/src/main/java/de/michelinside/glucodatahandler/complications/BgValueComplicationService.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"53eecc4bd39e5fe2ddbbb86b948a543a1a43f35257bc6cbfd0310daf81cf2323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/GlucoDataServiceMobile.kt:44-53 | wear/src/main/java/de/michelinside/glucodatahandler/GlucoDataServiceWear.kt:31-39 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/GlucoDataServiceMobile.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"878019e3c9a54ccd549c7eb680a2778df25ca92110558fb492b36d003dcd3aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:259-268 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/LogSettingsFragment.kt:92-99 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2922728377b427acfa3332ec338b645a31f2bbe5871c1f9c58a4109e34a8578"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/tasker/TaskerPlugin.kt:98-106 | mobile/src/main/java/de/michelinside/glucodatahandler/tasker/WatchBatteryEvent.kt:67-75 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/tasker/TaskerPlugin.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4337bd88d62b9c4dab9dbdb5a4122824dad571bae75e30a4bec672bdc135f563"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/complications/BgValueComplicationService.kt:146-153 | wear/src/main/java/de/michelinside/glucodatahandler/complications/SmallImageComplication.kt:49-56 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/complications/BgValueComplicationService.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"798943e15cd636809f1645d5cce23963742e541cbe8718b01254178da369abc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/tasks/NightscoutSourceTask.kt:153-162 | mobile/src/main/java/de/michelinside/glucodatahandler/transfer/NightscoutUploader.kt:53-62 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/NightscoutSourceTask.kt"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d139f7be2b31f509bba87829d26ea9209dcbf1cc8209fc238347e10741e4122"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): wear/src/main/java/de/michelinside/glucodatahandler/complications/BatteryLevelComplication.kt:109-118 | wear/src/main/java/de/michelinside/glucodatahandler/complications/BgValueComplicationService.kt:96-105 \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":"wear/src/main/java/de/michelinside/glucodatahandler/complications/BatteryLevelComplication.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d39559c8be689548369030ad8e4e6df2f2b6f784fe06fc1abdcb6b4881813d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreferenceDialogFragmentCompat.kt:32-39 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreferenceDialogFragmentCompat.kt:20-28 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreferenceDialogFragmentCompat.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"df84fe09eb2f19616080d190fa901bbff6e5d3f6077f153df92c7c0be7f90eab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): mobile/src/main/java/de/michelinside/glucodatahandler/tasker/AndroidAutoConnectionState.kt:36-39 | mobile/src/main/java/de/michelinside/glucodatahandler/tasker/WearConnectionState.kt:36-39 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/tasker/AndroidAutoConnectionState.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c881cdf711c360ba6cbddfaf8355c0f177b983c09e7cacfcca705099229907fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55\u201356 lines \u00D7 2): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:119-174 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:129-183 \u2014 before extracting anything, compare \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 138 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 \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:119\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":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"996bc18737a9d1ecd12f195537ad402c4ab7edaecba41019951bd558ab378d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt:29-77 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AppSettingsActivity.kt:30-78 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AppSettingsActivity.kt\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AppSettingsActivity.kt:81\u0060 calls \u0060v\u0060 and \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt:80\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec493a3aee287281e715537c32d89ab66f810f5e2de30a38d5f2b67b857427d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt:115-142 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:145-172 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d07c9904e250eba3c60f1f3274c06b15ebfa3e1290ab4d85e3e593a5fa2f104"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201332 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt:97-128 | common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.kt:336-361 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7dadf8a9a468e4500c527db13fc99cfef45e49f04ffe0c475b7ec0e4bb4c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt:93-112 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AppSettingsActivity.kt:95-114 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AppSettingsActivity.kt\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt:93\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0edcca9403ea74df83a92e70aad272d5e534890c2d91c80c98599e288e766a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:99-115 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:104-121 \u2014 before extracting anything, compare \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 138 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cf0593d7c3eac5940d3d30d02966510015308817ff262fbc6c7b82dbe7bb69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt:43-59 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt:107-123 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 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. Note first that the copies are not typed on the same thing: \u0060R\u0060 names \u0060de.michelinside.glucodataauto.R\u0060 in one and \u0060de.michelinside.glucodatahandler.R\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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaec85e4cf820d8d13fb91e69cd955d03a7bb8e02123d4c50920a491f51c738"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt:120-135 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt:312-328 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt:120\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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"096e10520ec240546ea0eb7aa66966d93be84936be0d5982075d1e6eab519bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:294-309 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:463-478 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:294\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2976084395f9344383177ef86b9ca5125777f1ac7106354cddeea6731d113a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:392-406 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:539-553 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:392\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:538\u0060 calls \u0060putExtra\u0060 and \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:391\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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"051d928200ec221b3458db2e6fcd4226d4444afd5b0c5ff2a59139dfa206057d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:193-207 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:210-224 \u2014 before extracting anything, compare \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 138 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 \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:193\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee2e67094d49bba39e45a6dae744e9e7fdbff52175a5e3de46e92167fd3219c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:487-499 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:747-760 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"94aacd480a5f5e4c0755d622eb8d9c73ecd7a363f3e0de7b5999e1468e120b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt:69-82 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/ExportImportSettingsFragment.kt:91-104 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/ExportImportSettingsFragment.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt:69\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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9536e45fedc760d6a4b71466c800b031684a543987af7f07fe48f167eab4b3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt:180-193 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:124-137 \u2014 before extracting anything, compare \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 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 \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt:180\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt:179\u0060 calls \u0060v\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:123\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":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b0f7d6e017221d0781cd89cbfe08c2002358daf724e4d846d83b475a52dc50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:118-130 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt:184-196 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:128-140 \u2014 before extracting anything, compare \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 138 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:124\u0060 calls \u0060deltaStr\u0060, \u0060iobLineText\u0060, \u0060cobLineText\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.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":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"442f875873e43dba8394a38432e3524ddfeb6609ae73a1320f64c498ff16cd70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:126-136 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt:206-218 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:136-147 \u2014 before extracting anything, compare \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 138 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 \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:126\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":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d5cffa3828f27a661fdd07fcd778f7955a80b3f644b7b4812fdb767c67d7e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:235-249 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:434-448 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:235\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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b876a62da4d8a77b4a6a69fd2b0c8081c897ae5a71d833ad14a4c3ee2c0dc966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:505-516 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:770-782 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced5b3513041796e7fd6aa9107e197fac03512f6e59b07c2881cf14c73e1357f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt:341-351 | common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.kt:111-122 \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 \u0060auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt:341\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: \u0060DexcomBroadcastReceiver\u0060 names \u0060de.michelinside.glucodataauto.receiver.DexcomBroadcastReceiver\u0060 in one and \u0060de.michelinside.glucodatahandler.common.receiver.DexcomBroadcastReceiver\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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f08fa442db80226f8a7f30cdf850b705485afc144634494d802b085d3fcc256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt:383-393 | common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.kt:153-164 \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 \u0060auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt:383\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: \u0060LibrePatchedReceiver\u0060 names \u0060de.michelinside.glucodataauto.receiver.LibrePatchedReceiver\u0060 in one and \u0060de.michelinside.glucodatahandler.common.receiver.LibrePatchedReceiver\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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"125cbe876a899f900798ffb7e992b1556747117c0edfb15164edc64483d017b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt:99-110 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt:252-263 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dca5fb8c04c9e3ce811ccaa385233026bc8e254d8eea656614dd660300b0af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreferenceDialogFragmentCompat.kt:113-124 | wear/src/main/java/de/michelinside/glucodatahandler/settings/VibrationPatternActivity.kt:132-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 \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreferenceDialogFragmentCompat.kt:113\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":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreferenceDialogFragmentCompat.kt"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"389b017399a4329d058b251365c0c4b9aa95e7bac5a856c3503781a3eabe3f4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt:26-36 | auto/src/main/java/de/michelinside/glucodataauto/preferences/LogSettingsFragment.kt:27-37 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/ExportImportSettingsFragment.kt:30-40 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/LogSettingsFragment.kt:39-49 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/ExportImportSettingsFragment.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"010c65bb5994e5f2ab5b008731c69049c3726b61a9a82f00a4060b3a5c3e889d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmAdvancedFragment.kt:96-106 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:103-113 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmGeneralFragment.kt:135-145 \u2014 before extracting anything, compare \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmGeneralFragment.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmAdvancedFragment.kt"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d230564211c56d5c393b328294ea5e8b82c389937bb30e3dc9a82a2667f5db34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt:102-112 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:132-142 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa5a4541a6ef67bcdd2e6e08a3dd106cae4d21dc898f591a9e64d092647b712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt:86-96 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt:239-249 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1bf752cc106387b7f08c515e48357a88429d20adda1dbfd4c21e7de9cfd6b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:48-58 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmGeneralFragment.kt:70-80 \u2014 before extracting anything, compare \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmGeneralFragment.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd2fcc91b7cfc5c7c67ccc73722f0a6a8123887f17dc4fb259ed6873e38ccb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt:74-83 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:147-156 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt:166-175 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt\u0060 and \u0060common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt:74\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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b55579a0639fec01a1636abd78492a4eea5d405fe3bc0b1286f114af13957b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:450-458 | auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:572-581 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a240a4378453a3c0c3adc2bd9fdaba898ad14998e1ae4ddba19677ee2b6f903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt:76-85 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:91-100 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt:76\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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc26a53cb54484b7b80ce73970637b4f5d464897294c5d7714257f1bf3f99c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:65-74 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:98-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:65\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":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3c2c339de3b3bbbfd5ec35affe3e5816ac9f035e40c022a5b6c80999070271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:120-129 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:169-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fae23e5496472083499c107858844022fa8fb000a5a24c19dabcc43d08b906e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1033-1042 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:492-501 \u2014 before extracting anything, compare \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 98 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 \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1033\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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"17adbc2a086b9e9ffa4e1339b86a30250a42599549a79045a706c4e6f613692e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1091-1100 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:515-524 \u2014 before extracting anything, compare \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 98 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 \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1091\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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f26f55668158b7b8540eb0a2729dd57f0d8efd6647843a17f43cabdc1f0001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1264-1273 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:592-601 \u2014 before extracting anything, compare \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 98 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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16dd4e68fd406cae25b621fb1ff20af102d8608136b591cc66751e30346b592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:721-729 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1342-1350 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:620-628 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:721\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, \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:731\u0060 calls \u0060currentTimeMillis\u0060, \u0060isOutOfMemoryException\u0060, \u0060showOkDialog\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:629\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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"adef517ff0645f856cfb43274f93fc26f07eb67655df7d062a92d04eb950f819"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:484-492 | mobile/src/main/java/de/michelinside/glucodatahandler/notification/LockscreenActivity.kt:295-303 \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 \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:484\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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6814046127dbc34f68b7f36c1a4fc66a7b1b55536befe6f367fc541521be4752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt:138-146 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt:331-339 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 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. Note first that the copies are not typed on the same thing: \u0060R\u0060 names \u0060de.michelinside.glucodataauto.R\u0060 in one and \u0060de.michelinside.glucodatahandler.R\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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"30888e4617266ef71abb09589dc15b59aed1e315214272bc835e579b46e3f0bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/chart/TimeValueFormatter.kt:72-80 | common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt:664-672 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/TimeValueFormatter.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3d2013b9f896ccae95cc783eaaf09c74101db6b2262f51d2a1426558b33f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt:60-68 | common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt:71-79 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a49ecf21e3d46f2a9afd11aac804b13f9a057683be271c27eea79867fb4353e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): auto/src/main/java/de/michelinside/glucodataauto/receiver/AAPSReceiver.kt:12-19 | auto/src/main/java/de/michelinside/glucodataauto/receiver/DexcomBroadcastReceiver.kt:12-19 | auto/src/main/java/de/michelinside/glucodataauto/receiver/DiaboxReceiver.kt:12-19 | auto/src/main/java/de/michelinside/glucodataauto/receiver/GlucoDataReceiver.kt:12-19 | auto/src/main/java/de/michelinside/glucodataauto/receiver/LibrePatchedReceiver.kt:11-18 | auto/src/main/java/de/michelinside/glucodataauto/receiver/NsEmulatorReceiver.kt:12-19 | auto/src/main/java/de/michelinside/glucodataauto/receiver/XDripReceiver.kt:12-19 \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 7 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":"auto/src/main/java/de/michelinside/glucodataauto/receiver/AAPSReceiver.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91919afa54f477069019f3360df97c237f77495f64f71f651c6ef9c613acaaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt:145-157 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:175-187 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bce2082fc615c0c8af6ad0586e712251802ca3e87efff82eeb0d8c607cb9f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:486-492 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:746-752 | mobile/src/main/java/de/michelinside/glucodatahandler/notification/LockscreenActivity.kt:297-303 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:259-265 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:745\u0060 calls \u0060updateLandscapeItems\u0060 and \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:485\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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ba0cc04cd851ec15a387c670e3ede70b2b75feef3fe7a9b7dd08d13a9ada48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:264-270 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:343-349 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:264\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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c991430985b18e0aa5a4f0f978f7083b509c311d633a0f9d36d18aa8c637e881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:56-62 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:89-95 \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 \u0060common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:56\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfa6d18d26f89e35b285ac5f09c689f424ff892a5f809c0ebfa2d722fb6aeed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/notification/AlarmNotification.kt:94-100 | mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt:218-224 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/notification/AlarmNotification.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3c41ceaecb6520b07dc08e9f3ce7346112e61fbe199522fd3514ba7ec59255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt:109-115 | mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt:106-112 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec93ce231ca579bd96b77a5e6b57017c447030f2515d51f280443c2c45c4566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:103-108 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:148-153 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1415-1420 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:89-94 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa18f75e7490f02783b416b5bea1ff7180db1022d68f3372d2d1e4e4a34d976e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:617-625 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1086-1094 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:510-518 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec55ad579212ee9d479990ab3794625dc54835f374da7df1d2c033741110a7af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): mobile/src/main/java/de/michelinside/glucodatahandler/healthconnect/HealthConnectPermissionActivity.kt:35-42 | mobile/src/main/java/de/michelinside/glucodatahandler/notification/LockscreenActivity.kt:92-99 | mobile/src/main/java/de/michelinside/glucodatahandler/tasker/WriteSettingConfigureActivity.kt:53-60 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/healthconnect/HealthConnectPermissionActivity.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"af645abf72eacb7e4abef95cdfea812b09987754bbd03f976d9e6f0943c0e58a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:641-647 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:556-562 \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 \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:641\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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c18a63f637f7abc1e4f6ec08a034b930cb19481bb0289dab8acd3957be1273f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/LogSettingsFragment.kt:74-79 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/LogSettingsFragment.kt:130-135 \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 \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/LogSettingsFragment.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/LogSettingsFragment.kt:136\u0060 calls \u0060requestLogs\u0060, \u0060requireContext\u0060 and \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/LogSettingsFragment.kt:80\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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/LogSettingsFragment.kt"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"57234718647fdb37e13b6fd15100da9f644148f47b7e234bff122b9597252e4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.kt:869-874 | common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NsEmulatorReceiver.kt:42-47 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.kt"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"316fd80ba71ec961c2e5ac9c4f16d3a1c2a1965fc0a7a58c7e4f302ee572bbbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:725-730 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:377-381 \u2014 before extracting anything, compare \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 98 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 \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:725\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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21bd5c158501e63f7f629425fa098079a06067ce09cedfe783f914c3f6d5b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt:67-73 | auto/src/main/java/de/michelinside/glucodataauto/preferences/LogSettingsFragment.kt:72-78 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/ExportImportSettingsFragment.kt:89-95 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/LogSettingsFragment.kt:128-134 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/ExportImportSettingsFragment.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/LogSettingsFragment.kt:136\u0060 calls \u0060requestLogs\u0060, \u0060requireContext\u0060 and \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/LogSettingsFragment.kt:80\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/preferences/ExportImportSettingsFragment.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18766313b789500a941bca0de7df6cd712b809f255041aff14a6e01eabc3810"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:644-651 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1166-1173 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:559-566 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:644\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d92bff9fc1210aebf227f08186e2cc6d238409f87a82d01776e4517d715c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1109-1125 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:533-537 \u2014 before extracting anything, compare \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 98 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 \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1109\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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"992c3ab968f5b4831d6af9a1b74dae2c5e320c8e2f7abbc5b70dacb08db75498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/notification/AlarmNotification.kt:117-121 | mobile/src/main/java/de/michelinside/glucodatahandler/notification/PermanentNotification.kt:234-238 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/notification/AlarmNotification.kt"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa685cde91fbd4f0d232393bc6becf3fcc8c3803e754ed19716a6151aa63abc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt:118-124 | mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt:115-121 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidget.kt"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"93854fe4706c8e4acb71f63cb605c620a7cb2f307be8643867209ab26778153e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt:63-70 | auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt:70-77 \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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmFragment.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b122164381ef4fb133dc5b80f75e59bcfef0dd9e897bff670eb193aac5b2a33d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragment.kt:47-55 | auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt:48-56 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceNotificationFragment.kt:38-46 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:113-121 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:109-117 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmAdvancedFragment.kt:54-62 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:72-80 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmGeneralFragment.kt:94-102 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt:95-103 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt\u0060 and \u0060common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragment.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0969feeb84b2909fd28719196a6f1080505f349bbf03e7d14590c645b5966eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt:36-46 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:101-111 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt:83-93 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt\u0060 and \u0060common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt:32\u0060 calls \u0060updatePreferences\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt:80\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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"efca54a3f364f58c2469038cb1ada6c65b275b9302fbdb0a1b5d548af2d263f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:38-46 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/TransferFragments.kt:19-27 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36e567e94e53b3ec0cb245a6a59b76966eb2d234920bea8b370d73653f4d3b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:94-99 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:161-166 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt:177-182 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:92\u0060 calls \u0060initPreferences\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt:175\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":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1667de9ed8bef00eba91e652afab97bfd6256731614aa251891785ec746061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt:320-326 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt:185-191 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.kt"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"51701b17e3abbe14ae296b1eaee6421d5a678b9f18751d33dceab20c3067cdc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DexcomShareSourceTask.kt:301-312 | common/src/main/java/de/michelinside/glucodatahandler/common/tasks/NightscoutSourceTask.kt:305-316 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DexcomShareSourceTask.kt"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"4708d40c0bb27e9828bd63c2c62bd941309a3dffc10d417f4bb26402a2c77cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt:61-70 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmGeneralFragment.kt:83-92 \u2014 before extracting anything, compare \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmGeneralFragment.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b70cf6b118acbac092066b3d158476969d6afe0aba42d0de5f5c3e4e1c9f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt:458-465 | wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmTypeActivity.kt:312-319 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9beb59844e56d9c7a77283d290e5641d04633939c9729d504a09b4b508654408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmAdvancedActivity.kt:151-158 | wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmsActivity.kt:103-110 | wear/src/main/java/de/michelinside/glucodatahandler/settings/SettingsActivity.kt:192-199 | wear/src/main/java/de/michelinside/glucodatahandler/settings/SourcesActivity.kt:90-97 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmAdvancedActivity.kt"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"54825cb295d81bf88cef4a1667447c7bac3c389b0700770a941ff34fe61df1aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmAdvancedActivity.kt:160-167 | wear/src/main/java/de/michelinside/glucodatahandler/settings/ComplicationsTapActionActivity.kt:71-78 | wear/src/main/java/de/michelinside/glucodatahandler/settings/SettingsActivity.kt:201-208 | wear/src/main/java/de/michelinside/glucodatahandler/settings/VibrationPatternActivity.kt:70-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmAdvancedActivity.kt"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3d710e0162397492fc8afb9e98e2b21e2dc7b6425928305af43c8878af881b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmAdvancedActivity.kt:169-176 | wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmTypeActivity.kt:210-217 | wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmsActivity.kt:122-129 | wear/src/main/java/de/michelinside/glucodatahandler/settings/ComplicationsTapActionActivity.kt:80-87 | wear/src/main/java/de/michelinside/glucodatahandler/settings/SettingsActivity.kt:210-217 | wear/src/main/java/de/michelinside/glucodatahandler/settings/SourcesActivity.kt:109-116 | wear/src/main/java/de/michelinside/glucodatahandler/settings/VibrationPatternActivity.kt:79-86 \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 7 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmAdvancedActivity.kt"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c35e14670655167c25a7c5ee7915228176987371d42742099e9334ac6fadc57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmAdvancedActivity.kt:198-204 | wear/src/main/java/de/michelinside/glucodatahandler/settings/SettingsActivity.kt:240-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":"wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmAdvancedActivity.kt"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5091edcaf8d6e2b747fc1d0623771b87bd0dc4538174ee2f9e8b52b68ee236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmsActivity.kt:112-120 | wear/src/main/java/de/michelinside/glucodatahandler/settings/SourcesActivity.kt:99-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":"wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmsActivity.kt"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"03973732b545388f0bf2b463f1723a9fd3f33318b456a6d933457067f286c0e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:52-59 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:55-62 \u2014 before extracting anything, compare \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 138 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":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfb2ed10909ce2c1bcb5df6da7c1fbd06491c10f6b53dc0e9409fba0485d1d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:61-68 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:64-71 \u2014 before extracting anything, compare \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 138 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":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23f1ce9030485e74cc0d68bebfa3cf4b1575a1810a6bb32586a96c386cea0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt:70-76 | wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt:73-79 \u2014 before extracting anything, compare \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.kt\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 138 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":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b098b35ccece60916e9f35b807160ef044c06907f5ad818b8aeff46064db4a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt:16-26 | common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt:81-90 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt\u0060 and \u0060common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ae2081c3ead955ec5f15d59d7e67f6e35cc2466e4e984ae3cf3981e4e882ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreferenceDialogFragmentCompat.kt:92-100 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreferenceDialogFragmentCompat.kt:35-43 \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":"common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreferenceDialogFragmentCompat.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b179819c8563c31b90cc202d9bd5454722c77b175a52865553dca58c8207e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/StartServiceAtBootReceiver.kt:12-19 | wear/src/main/java/de/michelinside/glucodatahandler/StartServiceAtBootReceiver.kt:11-18 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/StartServiceAtBootReceiver.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b204ef65a7a772e8f19c815dff6dcb3bf49aca01fd7df8e84658422632d8b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/tasker/AndroidAutoConnectionState.kt:23-31 | mobile/src/main/java/de/michelinside/glucodatahandler/tasker/WearConnectionState.kt:23-31 \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":"mobile/src/main/java/de/michelinside/glucodatahandler/tasker/AndroidAutoConnectionState.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"87669fb8e6b6b13f90b6b307086f52037a5ef71d505ffad085ff28af228fc6f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): wear/src/main/java/de/michelinside/glucodatahandler/settings/SettingsActivity.kt:179-190 | wear/src/main/java/de/michelinside/glucodatahandler/settings/SourcesActivity.kt:78-88 \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 \u0060wear/src/main/java/de/michelinside/glucodatahandler/settings/SettingsActivity.kt:179\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":"wear/src/main/java/de/michelinside/glucodatahandler/settings/SettingsActivity.kt"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6993088a5df0ec31ce12774748ffe3655d36e110e7bc2669dc9fe3ecab43e8a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragment.kt:20-30 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragment.kt:17-26 \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 \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragment.kt:20\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: \u0060BuildConfig\u0060 names \u0060de.michelinside.glucodataauto.BuildConfig\u0060 in one and \u0060de.michelinside.glucodatahandler.BuildConfig\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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragment.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0b5ae2dfb2998ec4ccf2e19d9e5ad3dc21416e248cf7083baabef2ce9510e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:133-143 | mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:200-210 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 130 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 \u0060auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt:133\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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d221115bac534f3fc36fb1edcc851646eb717e61aa7eba045d8995cb0954de5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/xdripserver/XDripServer.kt:186-193 | mobile/src/main/java/de/michelinside/glucodatahandler/xdripserver/XDripServer.kt:198-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060mobile/src/main/java/de/michelinside/glucodatahandler/xdripserver/XDripServer.kt:186\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/xdripserver/XDripServer.kt"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32864dce7011eed887e55321679545d700394f950ec1c3f9cfe3f2a2f68374e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt:249-255 | common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt:264-270 \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 \u0060common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt:249\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f102a98a8486eade3e380f54539f609f7ef780c9b1b2de370bfff5a2fbc9ab85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt:304-308 | common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.kt:75-79 \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 \u0060auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt:304\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce4d18b930df1da965a7cd2c20008194405cb8f2171cf4c114c857e356a4aac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt:399-403 | mobile/src/main/java/de/michelinside/glucodatahandler/watch/LogcatReceiver.kt:117-121 \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 \u0060common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt:399\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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"099172c1d9132b99953abc5561c9a6c9dbc009e244cd21771cf63305611ecbf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt:113-118 | mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt:265-270 \u2014 before extracting anything, compare \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AlarmTypeFragment.kt"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea3aff4cd3aa791b0261b4b2a898763c38f50fc52038bb83b4e22f4572c0d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt:109-115 | common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt:117-123 \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 \u0060common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt:109\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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/JsonUtils.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e2c8662a2db09dff93947adba3df0a656b2bfde647ba6dcfbcb319bb2a9752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt:1133-1138 | wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt:546-551 \u2014 before extracting anything, compare \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.kt\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fbb2782f205eb984e3cc6c7eb1d44bff3818f3a5fdb790ce342edd1713bc30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt: mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in MainActivity.onOptionsItemSelected at line 532. 4 of those changes were fix/bug commits, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-04 17:35:31 \u002B02:00\u0027 --until=\u00272026-10-02 17:35:31 \u002B02:00\u0027 --full-history --no-merges -- mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f4cddf7c0c06102b8f306a155f10258b1a59b19d7f75a31f5ed3398a5badbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt: common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ReceiveData.handleIntent at line 630. 2 of those changes were fix/bug commits, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-04 17:35:31 \u002B02:00\u0027 --until=\u00272026-10-02 17:35:31 \u002B02:00\u0027 --full-history --no-merges -- common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.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":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f2802d17de1d48add01dcba2e83a9f426759cd8cd694d79ff03fcd339aafc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.kt: common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in SettingsMigrator.migratePhoneSettings at line 201. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-04 17:35:31 \u002B02:00\u0027 --until=\u00272026-10-02 17:35:31 \u002B02:00\u0027 --full-history --no-merges -- common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.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":"common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.kt"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5491394585e490b8a7459b26a32067b49a0020c73e144321548ab646ed56e3a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt: mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is SettingsFragmentBase.onSharedPreferenceChanged at line 105), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix AOD settings for Android 17\u201D; \u201CAndroid 17 - AOD: Advanced Protection and permission bug\u201D; \u201Cfix sensor start time\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-04..2026-10-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-04 17:35:31 \u002B02:00\u0027 --until=\u00272026-10-02 17:35:31 \u002B02:00\u0027 --full-history --no-merges -- mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.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":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd971fe9bfe2eade1deab06fe7caa1c1d59b34cbdaa55d6049daf6802e55c05"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 74 significant file(s) lose their only recent owner: mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt, common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt, common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.kt, auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt, common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.kt, common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt, mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.kt, common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt (\u002B66 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a64be952ef90bfa822aafdc13724d5543626c2276cee4d72ab568b2ad70535e7"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (75 single-owned of 156 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 156 of the 234 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: common/src/main/java/de/michelinside/glucodatahandler/common/chart/ValueBitmapHandler.kt."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: check for portrait mode for tablets!? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/GlucoseBaseWidget.kt"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8f0f53fcabaa0457228d5094bb578a921ac0a5e3d5b0aff5555355a0b29976"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf66bad872f148ad3912e5bade1007354a2e84fe24b4d2b56c0dff35f91e9c8"}},{"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\u0060 makes this repository a deployable product (line 2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/build.gradle"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d093a964b9c86cf12511f44f6c306ad6925b7a73dfff636c9bfe4b3fea7b0f2f"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060sensorID\u0060 spells \u0060ID\u0060 where 77 names in the project spell it \u0060Id\u0060: 77 of 78 names in project common spell the token \u0060Id\u0060 (77 of 78; unit: names in project common containing \u0060Id\u0060). Peers: GlucoDataService.onStartCommand(startId) (common/src/main/java/de/michelinside/glucodatahandler/common/GlucoDataService.kt:199); GlucoDataService.onTimeout(startId) (common/src/main/java/de/michelinside/glucodatahandler/common/GlucoDataService.kt:382); ReceiveData.setSensorStartTime(serialId) (common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt:1101); SourceState.resId (common/src/main/java/de/michelinside/glucodatahandler/common/SourceState.kt:10); Companion.getNodeBatteryLevel(nodeId) (common/src/main/java/de/michelinside/glucodatahandler/common/WearPhoneConnection.kt:127). Rename to \u0060sensorId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1419ca1bf28473512ba54086929c18d592f6e1414b1e95ecda1224c642529648"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060common\u0060 (19191 LoC, 299 module-visible types across 13 directories) overshoots its size bounds. 2 of 4 build unit(s) (Gradle) overshoot their size bounds, lowering Project Cohesion to 0.7/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":"common/build.gradle"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35df0b186682ecc475408e28d17b63d675f83e586a479cae7647b9353a5fa3e"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060mobile\u0060 (9836 LoC, 149 module-visible types across 10 directories) overshoots its size bounds. 2 of 4 build unit(s) (Gradle) overshoot their size bounds, lowering Project Cohesion to 0.7/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":"mobile/build.gradle"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8243a937df6bc82e23e26a1e4b41a700bcec81ecf54a924d3056f3866cb12cf1"}},{"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":"45b5c51a1624455f3398e6a347b356d320495964a4ab5c99c944a6c3ca72c360"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8695ebdca926d9e45d56d123eb0b0671e64b011883b141b06ae67b95b8e9a309"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6bfa5888b345aaa381fab296565c085d4dd84b881e87b7576cdc37fa8b256b77"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02788048c9c1f28d92553e8de43b6276728ac603fa7332dea9328a1e8a1bd77b"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e8838b7e9079cd8c64bbf354819891f013046d67834a94c82ea1f2ead7f38b2"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b588d2bf88affdf85b98a6459ba8256cf6f3b70e4721cb2319d09f597ebcc35"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d5361c89e205b49e682f5d4985faefb437f234819154940ff01d07697357a88"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34c27ca107bd73f59bc3a02420fe6c115385e399fb7a5006216e7a346ef71959"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8364efe79482ac5833a5bcac1874603dd358bbfc28d672dd441a1eb35702f6e1"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4802fc9392a03d9c535c79657dfaba5c542e68f0b13cf87144a0b1561877d1c"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0a4ebd35f5c5fdb03f8af9e7e7fe6ead9d3c6a40516ddac1713cf4e729721d1"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 3 of 156 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 156 of the 234 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidgetNotifier.kt, common/src/main/java/de/michelinside/glucodatahandler/common/utils/AiDexCgmParser.kt, common/src/main/java/de/michelinside/glucodatahandler/common/receiver/AidexBroadcastReceiver.kt. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/BatteryLevelWidgetNotifier.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1517d2a48d100002741bd459bc6b160dd10059fb409287175b4d7a1f9c69b1d5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/AiDexCgmParser.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"399e75f5699cdb7d94288ae5403236894ba2e6cc7d254b513eccf28df45bf84c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/AidexBroadcastReceiver.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4647a35a675da38881a6b735e5ee3ab7ce0c81016df12c311f1021b40a35c24"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: GlucoseStatistics.kt \u2194 MainActivity.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/utils/GlucoseStatistics.kt\u0060 (context common) and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00602858e786\u0060 mmol/mol support for GMI and Hba1c; \u0060db57f1fa\u0060 TITR support; \u006064a31ebc\u0060 Add Hba1c statistic \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/GlucoseStatistics.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d13da65990679f186b8ad749b6066cfe80f9462013f889194f3f3eaf734f2a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: Constants.kt \u2194 ComplicationsTapActionActivity.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt\u0060 (context common) and \u0060wear/src/main/java/de/michelinside/glucodatahandler/settings/ComplicationsTapActionActivity.kt\u0060 (context wear) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060e8cdd929\u0060 Complication Tap action: show graph; \u006085839861\u0060 Change default tap action, fix uncaught exception, fix notification c\u2026; \u0060c62f7a29\u0060 TTS values, small fixes \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"917698c2ef274cf1a336a6f9759802ea2cabed63e72517e6e687758370f21118"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: Constants.kt \u2194 AlarmAdvancedFragment.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt\u0060 (context common) and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmAdvancedFragment.kt\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060e35984e0\u0060 Alarm: refactor settings; \u00600121cab2\u0060 Alarm delay on phone; \u00606eef4307\u0060 Move fullscreen setting, add obsolete color setting \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"168bf5975f1e616387353143d60028a23a8702d0decc8d82299fdb274f20cdc9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: Constants.kt \u2194 AlarmFragment.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt\u0060 (context common) and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmFragment.kt\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 54% of the time (15 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u006056727dd4\u0060 Inactive time for all alarms; \u0060e35984e0\u0060 Alarm: refactor settings; \u0060defa8e0d\u0060 Workaround for Samsung notification bug \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e108d4771fcfec36ad67991f387aa954239768fed8bdc94d9249e4ccb5adb76"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: Constants.kt \u2194 AlarmNotificationWear.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt\u0060 (context common) and \u0060wear/src/main/java/de/michelinside/glucodatahandler/AlarmNotificationWear.kt\u0060 (context wear) sit in DIFFERENT parts of the tree yet change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060fb7e5757\u0060 Wear: No alarm while charging; \u0060c0b5ba05\u0060 Wear: No update while watch screen is off; \u0060884dd5a2\u0060 Wear toggle alarm and fix alarm state \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90fc7cb58fde7814621b2513afe32fcb84b627e13bbc17fd464d5bb6c0f0c99"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: Constants.kt \u2194 SettingsFragment.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt\u0060 (context common) and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragment.kt\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 52% of the time (22 of the 42 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 22 shared commits counted here, the most recent 3 are \u0060c793b57e\u0060 GDH/GDA Second replace related names; \u0060024219bf\u0060 Pref for color scheme; \u006073efd208\u0060 Update settings menu \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99601238ad11a8fd175117b9950da36812dfe462752d7d95845a424902baceb4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ReceiveData.kt \u2194 TaskerPlugin.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt\u0060 (context common) and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/tasker/TaskerPlugin.kt\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 50% of the time (10 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060da56f185\u0060 GDA: add new alarms; \u0060898dcda9\u0060 Add IOB/COB support for NS #114; \u00601f731c86\u0060 Move glucose fun to GlucoDataUtils \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce58557d4f8a4b39dd82906d9d00769285edaef338560636e66ccdde9f62c019"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: Dialogs.kt \u2194 MainActivity.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/ui/Dialogs.kt\u0060 (context common) and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060a0d9e2bc\u0060 AOD policy changes; \u0060dfa3f1a4\u0060 fix cancel of aod accept dialoag; \u0060f63ce8ae\u0060 fix sensor start time \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ui/Dialogs.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"622253b01c8767bf30e603255ee3ec1386675454a97ab392f671a01442e1529b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: GlucoseValueDao.kt \u2194 dbAccess.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/database/GlucoseValueDao.kt\u0060 and \u0060common/src/main/java/de/michelinside/glucodatahandler/common/database/dbAccess.kt\u0060 change together 90% of the time (9 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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00606dc6db71\u0060 Fix db-trend; \u0060bdb9f946\u0060 Add trend to marker; \u006075aabb66\u0060 Fix nightscout upload \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/database/GlucoseValueDao.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecf1e40ce2c0e07814b514f58c8e5b36165f8de19e02aeb813bad3f34bdd824"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ChartCreator.kt \u2194 GlucoseValueDao.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.kt\u0060 and \u0060common/src/main/java/de/michelinside/glucodatahandler/common/database/GlucoseValueDao.kt\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006081342f42\u0060 Add glucose statistics; \u00607acce5b8\u0060 Disable graph setting; \u0060c2044b0f\u0060 Fix x compare \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca303a8bc2c68b158dc6c0f96f2c07c306ab36e67ee335a6b9bdcdd557960481"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ReceiveData.kt \u2194 XDripBroadcastReceiver.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt\u0060 and \u0060common/src/main/java/de/michelinside/glucodatahandler/common/receiver/XDripBroadcastReceiver.kt\u0060 change together 61% of the time (11 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u006066430873\u0060 Fix for 0 value from xDrip #115; \u00609f156086\u0060 Fix xDrip unit change #115; \u00601f731c86\u0060 Move glucose fun to GlucoDataUtils \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/ReceiveData.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6475b3861cbe365ccb2b14418f9c0f10146b648de58743ab55889a1d2e84e1df"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Constants.kt \u2194 DataSource.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt\u0060 and \u0060common/src/main/java/de/michelinside/glucodatahandler/common/notifier/DataSource.kt\u0060 change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060ebb6443a\u0060 Add AiDex broadcast parser (#288); \u0060a4157831\u0060 Found hidden Aidex broadcast intent, implemented with recreation of t\u2026; \u00604d61d9f2\u0060 New local source: Libre patched app \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"176ee9c121e59017e66fb93c686b1f6b0d1f8894997dd885ae2232112cf2c48c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: AlarmNotification.kt \u2194 AlarmAdvancedFragment.kt: \u0060mobile/src/main/java/de/michelinside/glucodatahandler/notification/AlarmNotification.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmAdvancedFragment.kt\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 \u00600121cab2\u0060 Alarm delay on phone; \u0060ecaa08fa\u0060 No alarm on wear or AA connected; \u0060d3121baa\u0060 Update alarm cat prefs \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/notification/AlarmNotification.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bad064c2850100d1488f2ffa955298be1abee78599ac2cf1cb11a7cc2cecc1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: GlucoDataServiceWear.kt \u2194 ActiveComplicationHandler.kt: \u0060wear/src/main/java/de/michelinside/glucodatahandler/GlucoDataServiceWear.kt\u0060 and \u0060wear/src/main/java/de/michelinside/glucodatahandler/complications/ActiveComplicationHandler.kt\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060c0acd2f9\u0060 Remove screen off setting from watch; \u006073a40f26\u0060 Wear: No update while watch screen is off; \u0060c0b5ba05\u0060 Wear: No update while watch screen is off \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wear/src/main/java/de/michelinside/glucodatahandler/GlucoDataServiceWear.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc45589fbc1428cf545495e798abd92efa40a607279173158bde4ccc9d9c260"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Constants.kt \u2194 AlarmHandler.kt: \u0060common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt\u0060 and \u0060common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmHandler.kt\u0060 change together 52% of the time (22 of the 42 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 22 shared commits counted here, the most recent 3 are \u0060cbce33a9\u0060 Setting for snooze buttons; \u006073235335\u0060 Force very low alarm; \u006073a40f26\u0060 Wear: No update while watch screen is off \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/Constants.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b878a6687b5913761e24fd87796b9d682465e75c0ccf34a76295cc70059b2a5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ActiveWidgetHandler.kt \u2194 FloatingWidget.kt: \u0060mobile/src/main/java/de/michelinside/glucodatahandler/widget/ActiveWidgetHandler.kt\u0060 and \u0060mobile/src/main/java/de/michelinside/glucodatahandler/widget/FloatingWidget.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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006004c57be5\u0060 Floating widget with graph; \u006013550687\u0060 Tap action setting; \u006031425a4c\u0060 New notify source for IOB/COB \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/main/java/de/michelinside/glucodatahandler/widget/ActiveWidgetHandler.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b607bf2849108f2c29a2d6264028b41725ae27aa46570a3888c2780e60ddb62"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: CarMediaBrowserService.kt \u2194 SettingsFragmentBase.kt: \u0060auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarMediaBrowserService.kt\u0060 and \u0060auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.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 \u00602c65a7a6\u0060 GDA: enable progress bar for Fake media player; \u006062849544\u0060 GDA: Speak value settings changed; \u0060cc05f1d7\u0060 GDA: fix notification permission \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarMediaBrowserService.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b139bbac5cdb19ffb17b7ed28806c64e0f5707956c694e59eebcff529bc4be9"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: GlucoseValueDao (24 abstract methods): \u0060GlucoseValueDao\u0060 declares 24 abstract methods: \u0060insertValue\u0060, \u0060insertValues\u0060, \u0060updateRate\u0060, \u0060getValues\u0060, \u0060getValue\u0060, \u0060getValuesByTime\u0060, \u0060getLastTopNValues\u0060, \u0060getValuesInRange\u0060, \u0060getLiveValues\u0060, \u0060getLiveValuesByTimeSpan\u0060, \u0060getLiveValuesByStartTime\u0060, \u0060getLastTimestamp\u0060, \u0060getFirstTimestamp\u0060, \u0060getCount\u0060, \u0060getCountByTime\u0060, \u0060getMaxValue\u0060, \u0060getMaxValueByTime\u0060, \u0060getAverageValue\u0060, \u0060getValuesInRangeCount\u0060, \u0060getPreviousValue\u0060, \u0060deleteValue\u0060, \u0060deleteValues\u0060, \u0060deleteOldValues\u0060, \u0060deleteAllValues\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":"common/src/main/java/de/michelinside/glucodatahandler/common/database/GlucoseValueDao.kt"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5576f0ef0e6bda0c09f8f3dcfbaffa79436575fd7179a32609f632cc6a77ad00"}},{"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":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 229 JVM production file(s) this check read across 4 module(s). Each was searched for its ecosystem\u0027s logging libraries (JVM: SLF4J, Log4j2, java.util.logging, Logback, kotlin-logging, scala-logging) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add spotbugs with find-sec-bugs (or \u0060semgrep --config=auto\u0060, which runs on any language) \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 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":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060auto/build.gradle\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":"auto/build.gradle"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b479cdcf44f9a6c8585cc02d675a969d51db42c30c3910ae4c80cce30c0db428"}},{"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":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060.openConnection(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/HttpRequest.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeafd2f22efb6ee2d00d097a377d16d6c692cde3a1df134e2ceee30b03dc9a5"}},{"ruleId":"X1","level":"warning","message":{"text":"Blocking \u0060Thread.sleep\u0060 inside a coroutine: This coroutine runs on a dispatcher\u0027s thread, and \u0060Thread.sleep\u0060 blocks that thread: for the whole delay no other coroutine scheduled on it makes progress (on \u0060Dispatchers.Main\u0060 the UI freezes) \u2014 the Kotlin form of blocking on a task. Use \u0060delay(\u2026)\u0060, which suspends only this coroutine. Where the blocking work is not a sleep but a call that cannot be made suspending, move it off the dispatcher with \u0060withContext(Dispatchers.IO) { \u2026 }\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/GlucoseDataReceiver.kt"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc37c3b6a0b708d108984ddd5c1131abe9b10ee5fb5afb72ee531d60e31eae4e"}},{"ruleId":"X1","level":"warning","message":{"text":"Blocking \u0060Thread.sleep\u0060 inside a coroutine: This coroutine runs on a dispatcher\u0027s thread, and \u0060Thread.sleep\u0060 blocks that thread: for the whole delay no other coroutine scheduled on it makes progress (on \u0060Dispatchers.Main\u0060 the UI freezes) \u2014 the Kotlin form of blocking on a task. Use \u0060delay(\u2026)\u0060, which suspends only this coroutine. Where the blocking work is not a sleep but a call that cannot be made suspending, move it off the dispatcher with \u0060withContext(Dispatchers.IO) { \u2026 }\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/GlucoseDataReceiver.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f84030c2f93e17dd39aa1372b01c755a056dfb0a703a6992e4946e465bfea9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!ReceiveData.eiob.isNaN() \u0026\u0026 !ReceiveData.isIobCobObsolete()\u0060 appears character-identically in 2 files \u2014 mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt, wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ec2c34218ad8a55e0876064f9c1bdeb05b3c11a35aff8a84e1f0ac22885e99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!ReceiveData.isIobCobObsolete() \u0026\u0026 !ReceiveData.iob.isNaN()\u0060 appears character-identically in 2 files \u2014 common/src/main/java/de/michelinside/glucodatahandler/common/receiver/BroadcastServiceAPI.kt, mobile/src/main/java/de/michelinside/glucodatahandler/watch/WatchDrip.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":"common/src/main/java/de/michelinside/glucodatahandler/common/receiver/BroadcastServiceAPI.kt"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1e7a71bd9d5ee56a353a18da08997e9a8f99a481a86fa290e4c9374bc23ada"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!ReceiveData.isObsoleteLong() \u0026\u0026 sharedPref.getBoolean(Constants.SHARED_PREF_SHOW_OTHER_UNIT, false)\u0060 appears character-identically in 2 files \u2014 mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt, wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc57b1a8b2045e7e0b0b982b46ea25d85573c211ae430cbfd0bea4490d4cb30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!sharedPref.contains(Constants.SHARED_PREF_SOURCE_JUGGLUCO_WEBSERVER_ENABLED) || !sharedPref.contains(Constants.SHARED_PREF_SOURCE_JUGGLUCO_\u2026\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt, common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5390525447f0f19d7422ed360fb00c6ca342a014429edcc9c8987a4a8f15c7ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Build.VERSION.SDK_INT \u003E= Build.VERSION_CODES.S \u0026\u0026 !Utils.canScheduleExactAlarms(this)\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt, mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1706d4f888f66e68e49b683874ee8de09020ad0e10e69b9403d73734fabaef9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ReceiveData.isObsoleteShort() \u0026\u0026 !ReceiveData.isObsoleteLong()\u0060 appears character-identically in 8 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt, auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarMediaBrowserService.kt, common/src/main/java/de/michelinside/glucodatahandler/common/utils/BitmapUtils.kt, mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca9ad6fb0e1a4828b11afeaa058e7d635e7a167d95074c89e46fff389c91f30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ReceiveData.sensorStartTime \u003E 0 \u0026\u0026 !GlucoDataUtils.isSensorExpired(this)\u0060 appears character-identically in 2 files \u2014 mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt, wear/src/main/java/de/michelinside/glucodatahandler/WearActivity.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":"mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.kt"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"269ac81c5eca50953fbbd929338dbd80838de0dff3ca2b73cd04be36e362e217"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ReceiveData.source == DataSource.LIBRELINK \u0026\u0026 !sharedPref.contains(Constants.SHARED_PREF_LLU_5_WARNING_SHOWN)\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt, mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c773da8ddefebe861b986d1045b6659af57579f0e1ed9a3e24aaf720c4b77c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Utils.isValidTime(prefStart!!.getTimeString()) \u0026\u0026 Utils.isValidTime(prefEnd!!.getTimeString()) \u0026\u0026 prefWeekdays.values.isNotEmpty()\u0060 appears character-identically in 2 files \u2014 mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmGeneralFragment.kt, mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.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":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmGeneralFragment.kt"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9aa88af81363477c85ad405727ea0123afb375da1e62a6787e386015b1a20e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060alarmManager != null \u0026\u0026 alarmPendingIntent != null\u0060 appears character-identically in 2 files \u2014 common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt, common/src/main/java/de/michelinside/glucodatahandler/common/service/StartupTrigger.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":"common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8980fd927e8d69fd4effcad549b97259308f9983ba5117afe8a350dc401dcd4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060chartBitmap == null \u0026\u0026 GlucoDataService.isServiceRunning\u0060 appears character-identically in 2 files \u2014 common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartBitmapHandler.kt, mobile/src/main/java/de/michelinside/glucodatahandler/notification/PermanentNotification.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":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartBitmapHandler.kt"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"300ab0940d95144bcb22896870311b2ac775ccf9904eabe28e36d466f2bf90ae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dataSource == NotifySource.BROADCAST || dataSource == NotifySource.MESSAGECLIENT\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarMediaBrowserService.kt, auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarNotification.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":"auto/src/main/java/de/michelinside/glucodataauto/android_auto/CarMediaBrowserService.kt"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f13223f7ecc19572b17fca87b224f18a275d74879a8f1c520697604c1ea14f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dataSource == NotifySource.DB_DATA_CHANGED \u0026\u0026 extras != null\u0060 appears character-identically in 2 files \u2014 mobile/src/main/java/de/michelinside/glucodatahandler/healthconnect/HealthConnectManager.kt, mobile/src/main/java/de/michelinside/glucodatahandler/transfer/NightscoutUploader.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":"mobile/src/main/java/de/michelinside/glucodatahandler/healthconnect/HealthConnectManager.kt"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32ccdf671fe8c88f3d71db7864b48aab6c0e15c0faff65120aa8fcfabb7b6f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060intent.hasExtra(Constants.ALARM_SNOOZE_EXTRA_START_APP) \u0026\u0026 intent.getBooleanExtra(Constants.ALARM_SNOOZE_EXTRA_START_APP, true)\u0060 appears character-identically in 2 files \u2014 mobile/src/main/java/de/michelinside/glucodatahandler/notification/SnoozeAlarmReceiver.kt, wear/src/main/java/de/michelinside/glucodatahandler/SnoozeAlarmReceiverWear.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":"mobile/src/main/java/de/michelinside/glucodatahandler/notification/SnoozeAlarmReceiver.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"968548d828764dec063ef3c53c27c2d5470db6c854d3bd043ef77acdad1edb22"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060iobText.isNotEmpty() \u0026\u0026 cobText.isNotEmpty()\u0060 appears character-identically in 2 files \u2014 wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt, wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.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":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7297b73c7e64b86584ddf93e3e5f9b224ec4bf7df3f597f718f03367ae77495"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060iobText.isNotEmpty() || cobText.isNotEmpty()\u0060 appears character-identically in 2 files \u2014 wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt, wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.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":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseGraphTileService.kt"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5d24d4fe867aa3b038da4348eaa632bd1a7a62578036516ffbddfb8879d605"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.isNullOrEmpty() || key == Constants.SHARED_PREF_SOURCE_AAPS_ENABLED\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt, common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b2bbfafdfb1d4aa95d66aaaf8a9cb1fd8e9de02b6fdc0cb1727915a625ecab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.isNullOrEmpty() || key == Constants.SHARED_PREF_SOURCE_BYODA_ENABLED\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt, common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"1598a7f6a530eff47b63609b1b8f4a86647534be0d28f604b58df48371fa1b1b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.isNullOrEmpty() || key == Constants.SHARED_PREF_SOURCE_DIABOX_ENABLED\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt, common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dba51c1e43ca40d6ede5f015fc69dab8ad34cd5847e400de77adf4c30f6f33a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.isNullOrEmpty() || key == Constants.SHARED_PREF_SOURCE_EVERSENSE_ENABLED\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt, common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c57c8a1ed6397419ef83f1109fcf54f42a0a8dc5bb4ed6da3844b2d8f285db5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.isNullOrEmpty() || key == Constants.SHARED_PREF_SOURCE_JUGGLUCO_ENABLED\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt, common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf2b523d7a3d34831de2be3b7c1c6647bb1d9cda8bfa4c2f85e4d1912724b15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.isNullOrEmpty() || key == Constants.SHARED_PREF_SOURCE_LIBRE_PATCHED_ENABLED\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt, common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"3453be826ba45c26ee724aa65428ac380d88bb35afc60f4bf58d70783e2be6f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.isNullOrEmpty() || key == Constants.SHARED_PREF_SOURCE_NOTIFICATION_ENABLED\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt, common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9899387817273749b044b58f6f0121febe100f118a64cfdccb5b4cd27b84d353"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.isNullOrEmpty() || key == Constants.SHARED_PREF_SOURCE_XDRIP_ENABLED\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt, common/src/main/java/de/michelinside/glucodatahandler/common/service/ReceiverManager.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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7203a8fc59b53c0c8e6c1db06c8f5bd92c1909a57c9043a3527a3fe806fe9c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prefSources != null \u0026\u0026 preferenceManager.sharedPreferences != null\u0060 appears character-identically in 2 files \u2014 common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt, common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOnlineFragment.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":"common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff71ad998fb5aead8e8d3413e7319d1a6d445fe61c1c1edb3e6e5f843c1fd8b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060recreateThread == null || !recreateThread!!.isAlive\u0060 appears character-identically in 2 files \u2014 common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartBitmap.kt, common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartCreator.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":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartBitmap.kt"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9891d378576aef57710740470e633c516b5dbd4717c3b215ca587140940c6c93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060restorePersistedValue || defaultValue == null\u0060 appears character-identically in 2 files \u2014 common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreference.kt, mobile/src/main/java/de/michelinside/glucodatahandler/preferences/VibratePatternPreference.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":"common/src/main/java/de/michelinside/glucodatahandler/common/ui/SelectReceiverPreference.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7873abbd21ae035f0453f8372a3ec79de0dc5673e0c18530b01b2ea5be700d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060secondEnableKey != null \u0026\u0026 !updateEnablePrefs.contains(secondEnableKey)\u0060 appears character-identically in 3 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt, common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt, mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2626f3406bb3f8a42760632cfa2a7d3ab6b8a6f0905cbfc5e02aebe06a9462e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sensorAge.isNotEmpty() || otherUnit.isNotEmpty()\u0060 appears character-identically in 2 files \u2014 wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt, wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseValueTileService.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":"wear/src/main/java/de/michelinside/glucodatahandler/tile/GlucoseDetailsTileService.kt"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d74908c8d8239bb03790ce742562aa708c97d23ed1530a47407c0be3574cd0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sharedPref.contains(Constants.SHARED_PREF_SOURCE_NOTIFICATION_ENABLED) \u0026\u0026 sharedPref.getBoolean(Constants.SHARED_PREF_SOURCE_NOTIFICATION_EN\u2026\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt, common/src/main/java/de/michelinside/glucodatahandler/common/receiver/NotificationReceiver.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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f67154a0a980d2687520826601fa7e6d8572c8377eff33dc00c25af9b441200"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sharedPref.getBoolean(Constants.SHARED_PREF_SOURCE_JUGGLUCO_ENABLED, true) \u0026\u0026 sharedPref.getBoolean(Constants.SHARED_PREF_NIGHTSCOUT_ENABLED\u2026\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt, common/src/main/java/de/michelinside/glucodatahandler/common/SettingsMigrator.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":"auto/src/main/java/de/michelinside/glucodataauto/GlucoDataServiceAuto.kt"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac66a07a4ada38eb75029c01fa8601f1f92e431219781a3db24662a7b2cc6f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060startTime \u003E 0 \u0026\u0026 endTime \u003E 0 \u0026\u0026 startTime \u003C= endTime\u0060 appears character-identically in 2 files \u2014 mobile/src/main/java/de/michelinside/glucodatahandler/healthconnect/HealthConnectManager.kt, mobile/src/main/java/de/michelinside/glucodatahandler/transfer/NightscoutUploader.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":"mobile/src/main/java/de/michelinside/glucodatahandler/healthconnect/HealthConnectManager.kt"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdb21491d861dcdfb1b38c154d69689032083bd0c6d23788003a0d353e493a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060super.checkPreferenceChanged(sharedPreferences, key, context) || trigger\u0060 appears character-identically in 4 files \u2014 common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DexcomShareSourceTask.kt, common/src/main/java/de/michelinside/glucodatahandler/common/tasks/LibreLinkSourceTask.kt, common/src/main/java/de/michelinside/glucodatahandler/common/tasks/MedtrumSourceTask.kt, common/src/main/java/de/michelinside/glucodatahandler/common/tasks/MultiPatientSourceTask.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":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/DexcomShareSourceTask.kt"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a7f5d226641cc873a8c245a5f9d1a3e03c3860ef923cb038894dd6aee023e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060supportFragmentManager.backStackEntryCount \u003C supportFragmentManager.fragments.size \u0026\u0026 supportFragmentManager.fragments[supportFragmentManage\u2026\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt, mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AppSettingsActivity.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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/AppSettingsActivity.kt"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0316d1a73119baaa51c4521393a1554e3f260a4bf86f11e03c7b186216ac30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060time \u003E 0 \u0026\u0026 (System.currentTimeMillis()- ReceiveData.time) \u003C (60*60 * 1000) \u0026\u0026 !GdhUncaughtExecptionHandler.isOutOfMemoryException(excMsg)\u0060 appears character-identically in 2 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt, mobile/src/main/java/de/michelinside/glucodatahandler/MainActivity.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":"auto/src/main/java/de/michelinside/glucodataauto/MainActivity.kt"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8408e7aed5fa22fe062f153275b8974476517a88d079f550ab8fda8c095800"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060updateEnablePrefs.isEmpty() || updateEnablePrefs.contains(key!!)\u0060 appears character-identically in 3 files \u2014 auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt, common/src/main/java/de/michelinside/glucodatahandler/common/preferences/SourceOfflineFragment.kt, mobile/src/main/java/de/michelinside/glucodatahandler/preferences/SettingsFragmentBase.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":"auto/src/main/java/de/michelinside/glucodataauto/preferences/SettingsFragmentBase.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec630da7c1f544130a8161516e98b4e1e53c491c3acb177c7a348e9cc8f49fc9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060uri != null \u0026\u0026 uri.toString().isNotEmpty()\u0060 appears character-identically in 2 files \u2014 mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt, wear/src/main/java/de/michelinside/glucodatahandler/settings/AlarmTypeActivity.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":"mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ad9a06fe92cfba2039ea1a0acb2efb29fac2c808bca933012f7fff1d0efd13"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060waitForUpdateThread != null \u0026\u0026 waitForUpdateThread!!.isAlive \u0026\u0026 waitForUpdateThread!!.id != Thread.currentThread().id\u0060 appears character-identically in 2 files \u2014 wear/src/main/java/de/michelinside/glucodatahandler/complications/ActiveComplicationHandler.kt, wear/src/main/java/de/michelinside/glucodatahandler/complications/ChartComplication.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":"wear/src/main/java/de/michelinside/glucodatahandler/complications/ActiveComplicationHandler.kt"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1357563d92f759d5d18e43331d02fa6132acc203e12962e04ff64947c4420b8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060NightscoutSourceTask.parsePebbleIobCob\u0060 is public and takes \u0060jsonObject: JSONObject\u0060 from its caller, and it calls itself at line 51 with a piece of \u0060jsonObject\u0060 \u2014 the function is not \u0060tailrec\u0060, so every call is a real frame \u2014 and nowhere in \u0060NightscoutSourceTask.parsePebbleIobCob\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. On the JVM\u0027s default 1 MB thread stack a recursive walk throws \u0060StackOverflowError\u0060 from about 500\u20132,000 levels on a cold first call and 6,000\u201317,000 once warmed up (OpenJDK 21 and 25; Android\u0027s threads are smaller). kotlinx.serialization\u0027s \u0060parseToJsonElement\u0060 accepts nested arrays to any depth and Android\u0027s built-in \u0060org.json\u0060 sets no limit, while Jackson 2.15\u002B stops at 1,000 \u2014 on a cold JVM past the point the walk fails; Gson 2.12\u002B and Moshi stop at 255. \u0060StackOverflowError\u0060 is an \u0060Error\u0060, not an \u0060Exception\u0060: a \u0060catch (e: Exception)\u0060 around the call does not stop it, and on Android an uncaught one ends the process. Thread a depth argument through \u0060NightscoutSourceTask.parsePebbleIobCob\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack or a \u0060DeepRecursiveFunction\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/src/main/java/de/michelinside/glucodatahandler/common/tasks/NightscoutSourceTask.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"781877ffaaf227f1b28c694a0cc286135f464209518ebea8846c532221502745"}},{"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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bc1bd38556d3e46fd46bbc2f2256ae955308a9f56797a3e7491a4fc4cb3149"}},{"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":"common/src/main/java/de/michelinside/glucodatahandler/common/utils/Utils.kt"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9ac0cb3f4e0057f26a32a4132bad6732aafda36cbae70e0d7dfdb4484290ff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (exc: 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":"common/src/main/java/de/michelinside/glucodatahandler/common/chart/ChartBitmap.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"74748eeee9e70130dd7e1326a46f0c40fa6a3cbb6fc22091ee7e0f5b7fb5e273"}},{"ruleId":"X5","level":"note","message":{"text":"Not-null assertions (\u0060!!\u0060) override null safety: ~20.9 \u0060!!\u0060 not-null assertions per 1k Kotlin product lines \u2014 859 across the 41083 line(s) of the 225 Kotlin file(s) read (generated, test and sample code not counted). Densest: mobile/src/main/java/de/michelinside/glucodatahandler/preferences/AlarmTypeFragment.kt (64), common/src/main/java/de/michelinside/glucodatahandler/common/tasks/LibreLinkSourceTask.kt (39), common/src/main/java/de/michelinside/glucodatahandler/common/notification/AlarmNotificationBase.kt (37). Each one tells the compiler to trust the author about null and becomes a \u0060NullPointerException\u0060 the first time the author is wrong. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ce0e76a36774b1cbb2ede64da71daf948ff69b7883191b635533af629445543"}}],"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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-926","guid":"0d9b5579-5549-555a-8a97-f9cc14f3ad4a","name":"Improper Export of Android Application Components","shortDescription":{"text":"Improper Export of Android Application Components"},"helpUri":"https://cwe.mitre.org/data/definitions/926.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]}],"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":11,"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."]}]}