{"$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":"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":"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":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"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":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"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":"SurveyRecordProcessor.generateBluetoothSurveyRecord (cyclomatic 48): SurveyRecordProcessor.generateBluetoothSurveyRecord has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java holds 6 of the 31 methods over the threshold \u2014 including the worst \u2014 and 80 of the 237 points over it (34%), 2.5\u00D7 the next-largest file (networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java at 32). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd35f830e1bd1060b49508ade8769a031a9a3c62fa4d5dc51d6ae2daac031e8"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserUtils.convertNetworkInfo (cyclomatic 47): ParserUtils.convertNetworkInfo has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f7c7fcce8a6ee31c5f26cc20caab088e57ae12e55eed71cf9b49e42d783964"}},{"ruleId":"D1","level":"warning","message":{"text":"NsAnalyticsUploadWorker.doWork (cyclomatic 34): NsAnalyticsUploadWorker.doWork has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/NsAnalyticsUploadWorker.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f954663bfb719086926a24dee34e1cdc792fe071879c311f81a24152fced97e"}},{"ruleId":"D1","level":"warning","message":{"text":"SurveyRecordProcessor.generateNrSurveyRecord (cyclomatic 31): SurveyRecordProcessor.generateNrSurveyRecord has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java holds 6 of the 31 methods over the threshold \u2014 including the worst \u2014 and 80 of the 237 points over it (34%), 2.5\u00D7 the next-largest file (networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java at 32). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"684b28bc5515efe30eda2de737703f2fbd4e0d69ac9db56b150136fd0118841b"}},{"ruleId":"D1","level":"warning","message":{"text":"SurveyOrchestrator.reconcile (cyclomatic 28): SurveyOrchestrator.reconcile has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/SurveyOrchestrator.kt"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"033397a56be0112ad1f5095797b68c02048372b335dae4297d52e84d8282407f"}},{"ruleId":"D1","level":"warning","message":{"text":"DbUploadStore.onCellularBatch (cyclomatic 27): DbUploadStore.onCellularBatch has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d16ced9ae9dddb65e4b65df7a975bc153f97ec4a0981aa597bf5b17d676fd90"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkSurveyService.updateLocationListener (cyclomatic 27): NetworkSurveyService.updateLocationListener has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc6b065e0d856aee968db3993afe700366d07e208fe3fcf3e45f82077c64cb5"}},{"ruleId":"D1","level":"warning","message":{"text":"SurveyRecordProcessor.generateLteSurveyRecord (cyclomatic 27): SurveyRecordProcessor.generateLteSurveyRecord has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java holds 6 of the 31 methods over the threshold \u2014 including the worst \u2014 and 80 of the 237 points over it (34%), 2.5\u00D7 the next-largest file (networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java at 32). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4c7274215585550026d9d473067039829b944eacae28bf003f7c35f11c2453"}},{"ruleId":"D1","level":"warning","message":{"text":"SurveyRecordProcessor.generateGsmSurveyRecord (cyclomatic 25): SurveyRecordProcessor.generateGsmSurveyRecord has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java holds 6 of the 31 methods over the threshold \u2014 including the worst \u2014 and 80 of the 237 points over it (34%), 2.5\u00D7 the next-largest file (networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java at 32). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b04cb0b0ed6df804f954adfd49288ecec731a5cd176af2cfa90d3e09c7bdf5"}},{"ruleId":"D1","level":"warning","message":{"text":"ScoutWifiFields.cipherSuite (cyclomatic 24): ScoutWifiFields.cipherSuite has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/scout/wifi/ScoutWifiFields.kt"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"068a3ee8fa7ef8fcaa6712cb44460e9c90bceb6fd168bdcabde9fcc93005936c"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkSurveyService.applyListenerTypes (cyclomatic 24): NetworkSurveyService.applyListenerTypes 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. This is NOT this file\u0027s highest cyclomatic complexity: NetworkSurveyService.onSharedPreferenceChanged (cyclomatic 27) 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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"efceaf5f97f938e02d00ede145f191640728a04b1700dfc8cad03b5b84cd9fca"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkSurveyService.toggleUploadRecordSavingLocked (cyclomatic 23): NetworkSurveyService.toggleUploadRecordSavingLocked has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: NetworkSurveyService.onSharedPreferenceChanged (cyclomatic 27) 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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c09b29f4ab0e85727a266697a75b3a9d5cfd07d3b5ef2769c1fc71534b06b0"}},{"ruleId":"D1","level":"warning","message":{"text":"SurveyRecordProcessor.generateUmtsSurveyRecord (cyclomatic 22): SurveyRecordProcessor.generateUmtsSurveyRecord 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java holds 6 of the 31 methods over the threshold \u2014 including the worst \u2014 and 80 of the 237 points over it (34%), 2.5\u00D7 the next-largest file (networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java at 32). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9ebe9dd2e5f9a5cd5cc6ce9f02f458f91ebb28e431157a29824793ba0ca90e"}},{"ruleId":"D1","level":"warning","message":{"text":"WifiListContentKt.WifiListContent (cyclomatic 21): WifiListContentKt.WifiListContent 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/WifiListContent.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53490b5c57f6d288fe08b26e00c8e04bf95ac877750c0a038312c1030019d2e"}},{"ruleId":"D1","level":"warning","message":{"text":"ScoutWifiFields.akmSuite (cyclomatic 20): ScoutWifiFields.akmSuite has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/scout/wifi/ScoutWifiFields.kt"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f99fe576847ea72bbcf230c034ce186d84c3360a08b6f3a8839a0612002e62"}},{"ruleId":"D1","level":"warning","message":{"text":"SurveyEventMessages.message (cyclomatic 20): SurveyEventMessages.message 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/SurveyEventMessages.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6368823ef589af458a5846a6cb26dcee5ab01234011e29e2b1b91028b5c0fdc2"}},{"ruleId":"D1","level":"warning","message":{"text":"NsAnalyticsUploadTracker.handleUploadWorkChanges (cyclomatic 18): NsAnalyticsUploadTracker.handleUploadWorkChanges 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/nsanalytics/NsAnalyticsUploadTracker.kt"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"220f321b74201d8a9614ff9e5b29be14d87102b7827aeba40bb55b07797eb7fe"}},{"ruleId":"D1","level":"warning","message":{"text":"DeviceStatusCsvLogger.convertToObjectArray (cyclomatic 18): DeviceStatusCsvLogger.convertToObjectArray has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/DeviceStatusCsvLogger.java"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f070f4c4a8e531da0f07482a2eb2268bf363bb6fdf505b53748f04d0dec73a"}},{"ruleId":"D1","level":"warning","message":{"text":"LteCsvLogger.convertToObjectArray (cyclomatic 18): LteCsvLogger.convertToObjectArray has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"384fa80fda0c26de520d4028593752c4e7c999b81da59879273c0b55c8b170a3"}},{"ruleId":"D1","level":"warning","message":{"text":"NrCsvLogger.convertToObjectArray (cyclomatic 18): NrCsvLogger.convertToObjectArray has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/NrCsvLogger.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"948839411ce7906bbb4fece4b1fffc14745d3a05bf4fe0ceaaaa25c8f4e829b7"}},{"ruleId":"D1","level":"warning","message":{"text":"OuiRepository.lookup (cyclomatic 17): OuiRepository.lookup has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/data/oui/OuiRepository.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f86c9fb8292ac31c66eb27d48e000ac27f80c814e4a753e31bc614ca4cb81b"}},{"ruleId":"D1","level":"warning","message":{"text":"SatelliteTableKt.HeaderCell (cyclomatic 17): SatelliteTableKt.HeaderCell has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/status/SatelliteTable.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"173b8342c9efb6a7bb89c07e777606a75fc5284f2df29f8a30dd74feda2c705f"}},{"ruleId":"D1","level":"warning","message":{"text":"SurveyOrchestrator.startOrUpdate (cyclomatic 17): SurveyOrchestrator.startOrUpdate has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/SurveyOrchestrator.kt"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8654f5a325ce331c9f74e5a3bd6bd730e2e29c1a0e818b01d5d30cb892ef16"}},{"ruleId":"D1","level":"warning","message":{"text":"SurveySetupMigration.migrateUpgradingUser (cyclomatic 17): SurveySetupMigration.migrateUpgradingUser has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/survey/setup/SurveySetupMigration.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63f2aa705ce0cf8d80706bf13631adb8037308873225f43a58aa1d4511b1480"}},{"ruleId":"D1","level":"warning","message":{"text":"SurveyEventMessages.scoutItemRes (cyclomatic 17): SurveyEventMessages.scoutItemRes 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/SurveyEventMessages.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8184ba7615f481b10e46395104584ec9932636c2e723b2f05c0df326cc4a29b"}},{"ruleId":"D1","level":"warning","message":{"text":"SurveyRecordProcessor.processCellInfo (cyclomatic 17): SurveyRecordProcessor.processCellInfo 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java holds 6 of the 31 methods over the threshold \u2014 including the worst \u2014 and 80 of the 237 points over it (34%), 2.5\u00D7 the next-largest file (networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java at 32). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"73be81cefbf70f9f85eaf29e41f735e13aa10a877b354877635a15dd938b9d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyMdmMapper.map (cyclomatic 16): LegacyMdmMapper.map 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":"networksurvey/src/main/java/com/craxiom/networksurvey/survey/mdm/LegacyMdmMapper.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"951e1066120861ac2f5b76ccf0345c4f62ce7e27e3c17edcc840ec9d742981ae"}},{"ruleId":"D1","level":"warning","message":{"text":"ServingCellSummary.from (cyclomatic 16): ServingCellSummary.from 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/map/ServingCellSummary.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa8d6930b6a667a8cdc88d75e7dc020c45a5a0fbfb13ec34685ed2747c9b88d"}},{"ruleId":"D1","level":"warning","message":{"text":"NsAnalyticsDialogsKt.NsAnalyticsDialogs (cyclomatic 16): NsAnalyticsDialogsKt.NsAnalyticsDialogs 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/nsanalytics/NsAnalyticsDialogs.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"780019c06a40f89cb7f3b145f3728d052d9e697bb3e7d9fc952b424ad106ddf7"}},{"ruleId":"D1","level":"warning","message":{"text":"CdrSmsObserver.onChange (cyclomatic 16): CdrSmsObserver.onChange 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":"networksurvey/src/main/java/com/craxiom/networksurvey/listeners/CdrSmsObserver.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"592526d003d1894b7eb03c605f757e8ee5f53ad819089e06e674247874a6e370"}},{"ruleId":"D1","level":"warning","message":{"text":"DbUploadStore.mapNrRecordToEntity (cyclomatic 16): DbUploadStore.mapNrRecordToEntity 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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1b61928390072b3461fc4463a991d30d19cfcf18e1ba7ee92fcf1346fbf49b"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserUtils.convertNetworkInfo (cognitive 109): ParserUtils.convertNetworkInfo has cognitive complexity 109 (threshold 15). Drivers by points: if/else 41 (104 pts), boolean chains 5 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5416541c53346cc2ee78d839a9d45a443333d89476cef26202d2789cdd1fef"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyRecordProcessor.generateBluetoothSurveyRecord (cognitive 94): SurveyRecordProcessor.generateBluetoothSurveyRecord has cognitive complexity 94 (threshold 15). Drivers by points: if/else 32 (61 pts), loops 4 (19 pts), boolean chains 10, ternaries 3 (4 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d669b02dfdcc58a76013dc41b5fe4276f7883df2c382df1fa311438901efa7"}},{"ruleId":"D2","level":"warning","message":{"text":"NsAnalyticsUploadWorker.doWork (cognitive 65): NsAnalyticsUploadWorker.doWork has cognitive complexity 65 (threshold 15). Drivers by points: if/else 25 (51 pts), match/switch 2 (7 pts), boolean chains 5, error handling 1, loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/NsAnalyticsUploadWorker.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2c53528a56588122862d5d1be39c000284112042530a0be5f4efdfec045d91"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyOrchestrator.reconcile (cognitive 42): SurveyOrchestrator.reconcile has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (31 pts), loops 5, boolean chains 4, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/SurveyOrchestrator.kt"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3849c77e85f44246578e300c6076b43b6dfb230787bea8ec975b88ac534c0e95"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkSurveyService.updateLocationListener (cognitive 40): NetworkSurveyService.updateLocationListener has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 7, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd8525ca4248960766763fe01075b1f0c3ac83b36dedcb9cd5bb1533b578fea"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyRecordProcessor.generateNrSurveyRecord (cognitive 38): SurveyRecordProcessor.generateNrSurveyRecord has cognitive complexity 38 (threshold 15). Drivers by points: if/else 27 (34 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"312a2422291959ca8c58866d3e8f4b6cea731fdd6feed01b94f1bce6a2eb0520"}},{"ruleId":"D2","level":"warning","message":{"text":"DbUploadStore.onCellularBatch (cognitive 37): DbUploadStore.onCellularBatch has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (33 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"944ff38c20c9003ea4af442c1421e795e68f846110c2d9af86cc3bbe88a55777"}},{"ruleId":"D2","level":"warning","message":{"text":"CdrSmsObserver.onChange (cognitive 36): CdrSmsObserver.onChange has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (27 pts), error handling 2 (8 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/listeners/CdrSmsObserver.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"016e0aa316c273e59de4283f55eee1d6fb310e497bfe6f72f3aec00a836fdd62"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyRecordProcessor.generateLteSurveyRecord (cognitive 34): SurveyRecordProcessor.generateLteSurveyRecord has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 4 (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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b58f4d5a6d04f275b2b1200d8ac7179e6fd6a4114417e530064e9561f7736e"}},{"ruleId":"D2","level":"warning","message":{"text":"NsAnalyticsUploadTracker.handleUploadWorkChanges (cognitive 33): NsAnalyticsUploadTracker.handleUploadWorkChanges has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (29 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/nsanalytics/NsAnalyticsUploadTracker.kt"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"79de75756ec3cdfaa9098bd9f690c769f3f81c86a0866fd92fc636bac384b809"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkSurveyService.toggleUploadRecordSavingLocked (cognitive 33): NetworkSurveyService.toggleUploadRecordSavingLocked has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 7, error handling 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcb0159053286283bc6f233d325dc02b62609b53ea1341d4b4e79b89a8b5ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"ServingCellSummary.from (cognitive 32): ServingCellSummary.from has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21 (31 pts), match/switch 1 (nesting depth added 10). 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/map/ServingCellSummary.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3b0762c58aeb511a610e8c6482e93f97483287491986bd55ed0f551906f127"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyRecordProcessor.generateGsmSurveyRecord (cognitive 31): SurveyRecordProcessor.generateGsmSurveyRecord has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 8 (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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"abec7cec3887b85546b9b390db5abba4d3631db2cb1e9e8344c04eae6cc20252"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyRecordProcessor.processCellInfo (cognitive 31): SurveyRecordProcessor.processCellInfo has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 2 (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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"490c24dd83e2c8aaacb9cb93619b1a61b978208a64cf32b187c433cf93254a6c"}},{"ruleId":"D2","level":"warning","message":{"text":"ScoutLinkController.runLink (cognitive 29): ScoutLinkController.runLink has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), error handling 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/scout/ScoutLinkController.kt"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e64b5a31bcdc5b5ad15641e3c57cc7f8ec8c2a973cc8350e0cdcec3b367877"}},{"ruleId":"D2","level":"warning","message":{"text":"WifiListContentKt.WifiListContent (cognitive 29): WifiListContentKt.WifiListContent has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/WifiListContent.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dbd8624a4395bd55f391e398d96edbd9e13ad412bf474e9d4c74b76d1a3ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyRecordProcessor.generateUmtsSurveyRecord (cognitive 29): SurveyRecordProcessor.generateUmtsSurveyRecord has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (27 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c76b0432018a1804575396d3177cccb1087b7f7771190fcc87ac5f48a5e0dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"TowerKey.from (cognitive 27): TowerKey.from has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/model/TowerKey.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d1fcd9df6c860c307b2448a50815dea92dfa1ed02fc26d1e6bce5b3fafe544"}},{"ruleId":"D2","level":"warning","message":{"text":"TowerMapLibreViewModel.searchForTower (cognitive 27): TowerMapLibreViewModel.searchForTower has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 1, error handling 1 (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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5b1d9377f372792762dc26dc2a1878e940f315227835eb2d73e278077a1a66"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyedPointSheetKt.PointDetails (cognitive 26): SurveyedPointSheetKt.PointDetails has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/SurveyedPointSheet.kt"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"451dcb390f67b60ec26a5d7f9d1b6646bc5931f3fd4f5357460a85615c5669da"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyEventMessages.scoutItemRes (cognitive 25): SurveyEventMessages.scoutItemRes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/SurveyEventMessages.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0137fc3e2685b167a4bc4ff2e7786136d6178b5a8942bcdae5165674162cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"CellularController.initializeCellularScanningResources (cognitive 25): CellularController.initializeCellularScanningResources has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d5a8cc76775ec146f3bbd917ebbed2fbc84a8a5800fed3a10c445ac0a24e14"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkSurveyService.generateDeviceStatus (cognitive 25): NetworkSurveyService.generateDeviceStatus has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (25 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfab96c5fbddedc6e4978bcc673b1c16a2c2f54915517e4a350aa74bedc63b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyRecordProcessor.generateGnssSurveyRecord (cognitive 25): SurveyRecordProcessor.generateGnssSurveyRecord has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (25 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b00471d413ec12756cb93f3a59a7739b14a143acd02074a7446545f1cb63845"}},{"ruleId":"D2","level":"warning","message":{"text":"UploadSettingsScreenKt.UploadSettingsScreen (cognitive 23): UploadSettingsScreenKt.UploadSettingsScreen has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/settings/UploadSettingsScreen.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbebbfb55ca93d1ce6d04090353d6600a6f0cd5337a234c97a518bc6f981f67"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkSurveyService.toggleNsAnalyticsScanningLocked (cognitive 23): NetworkSurveyService.toggleNsAnalyticsScanningLocked has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), error handling 3 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b746e201473db244b7743c8e43e386f1986e4d09e38c6c4c7fd1264e8d5bbc9"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchlistDetectionManager.findMatch (cognitive 22): WatchlistDetectionManager.findMatch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/watchlist/WatchlistDetectionManager.kt"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d07e3efa0f08ee9c85ee784ad1f7eb08b4d0a1dee86632691f1ae29e3667fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyMdmMapper.map (cognitive 22): LegacyMdmMapper.map has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/survey/mdm/LegacyMdmMapper.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6ad9ea0c007d2567555ff7caf0da7aeed6ef5bed25d67306e5220ae0bcdd2f"}},{"ruleId":"D2","level":"warning","message":{"text":"CombinedFiltersBottomSheetKt.CombinedFiltersBottomSheet (cognitive 22): CombinedFiltersBottomSheetKt.CombinedFiltersBottomSheet has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CombinedFiltersBottomSheet.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9578b6ef5813cb6d9b0fb83fcc2c855e74141221410e75350736898f5c6733cc"}},{"ruleId":"D2","level":"warning","message":{"text":"CellularController.runSingleScan (cognitive 22): CellularController.runSingleScan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 3, loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce4388a90ede64ba68857d443505af4ead728c35498c7489dfc111d6949220f"}},{"ruleId":"D2","level":"warning","message":{"text":"GnssController.startGnssRecordScanning (cognitive 22): GnssController.startGnssRecordScanning has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (22 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/GnssController.java"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"095b9362554beef7d9b2e66d8489c9316f92c4e80ea785ff151155f0e732f653"}},{"ruleId":"D2","level":"warning","message":{"text":"BatteryMonitor.checkThresholdCrossing (cognitive 22): BatteryMonitor.checkThresholdCrossing has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/BatteryMonitor.java"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"68762afbad93d922bd149b67b27c1afc6fac1cb81d40b3c27809b2358f3288a3"}},{"ruleId":"D2","level":"warning","message":{"text":"GrpcConnectionService.onStartCommand (cognitive 22): GrpcConnectionService.onStartCommand has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/GrpcConnectionService.java"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7531cf8aaf3ba12285fdf2f6009f37ec92adc69257d5a668f8d21731bab0097e"}},{"ruleId":"D2","level":"warning","message":{"text":"OtaChunkSender.run (cognitive 21): OtaChunkSender.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (3 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":"networksurvey/src/main/java/com/craxiom/networksurvey/scout/firmware/OtaChunkSender.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31d4f585d7097a403f836282acefe90ce21a7044616e8e61b8431da5544d37c"}},{"ruleId":"D2","level":"warning","message":{"text":"Radiotap.header (cognitive 21): Radiotap.header has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/scout/raw/Radiotap.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f748160378629c8783bdeb417a0522dc471ac4db61169da658c6337f1e2fccd"}},{"ruleId":"D2","level":"warning","message":{"text":"LogFilesContentKt.LogFilesContent (cognitive 21): LogFilesContentKt.LogFilesContent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (20 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/logfiles/LogFilesContent.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e90759fcebfd730705795f0fd79cc2dcc168abcc658f01b5e16edfb037cdc9"}},{"ruleId":"D2","level":"warning","message":{"text":"3.run (cognitive 21): 3.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 3, loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a6dc889a56235ad6a0191446bd430aa9451fd6336d77a2a9df01c3ab9e2bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyRecordProcessor.generateWiFiBeaconSurveyRecord (cognitive 21): SurveyRecordProcessor.generateWiFiBeaconSurveyRecord has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b33cd354bd8b9e3a1ea3de65c2ceb2870266ccef026e15a5e441ffc84c5c0b"}},{"ruleId":"D2","level":"warning","message":{"text":"ServingCellMapper.lte (cognitive 20): ServingCellMapper.lte has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20. 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/details/model/ServingCellMapper.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"16435dc7fb535465367bfa005457c9ab7a352d2733d5d0bef5b4d802fd4ab6e7"}},{"ruleId":"D2","level":"warning","message":{"text":"MapLibreMapKt.lifecycleObserver (cognitive 20): MapLibreMapKt.lifecycleObserver has cognitive complexity 20 (threshold 15). Drivers by points: error handling 4 (9 pts), if/else 5 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/MapLibreMap.kt"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c668cf2d785cff503a4ab0065ee075718ac034b6c9cfccc1dce8e061ef5818a4"}},{"ruleId":"D2","level":"warning","message":{"text":"ScoutPlateKt.ScoutPlate (cognitive 20): ScoutPlateKt.ScoutPlate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/ScoutPlate.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d94cdd5c8d2660ba84693dd64a5c416dae008c8f76942d49bf44dc5b84b7c9b"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyOrchestrator.applyFileLogging (cognitive 19): SurveyOrchestrator.applyFileLogging has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 3, 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":"networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/SurveyOrchestrator.kt"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7cf6b7ee2c633f299e8fb08dee7b42ec93646235dd69d2a52b87ffbf460fa2"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyRecordProcessor.generateCdmaSurveyRecord (cognitive 19): SurveyRecordProcessor.generateCdmaSurveyRecord has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebddd88eee181b7def7bbfe808dc6ad61d92560786caca335894168d11abf226"}},{"ruleId":"D2","level":"warning","message":{"text":"TowerMapScreenKt.MapMessages (cognitive 18): TowerMapScreenKt.MapMessages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/TowerMapScreen.kt"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"79190a65f066c5c0b070f47785d21ba668e2a59be8520f5c57de53993670a9c3"}},{"ruleId":"D2","level":"warning","message":{"text":"ServingCellMapper.nr (cognitive 18): ServingCellMapper.nr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/details/model/ServingCellMapper.kt"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21d0f8c5a691c94465adbafb2cd600aef1b05cc95eb8233740a83ab7473b6c4"}},{"ruleId":"D2","level":"warning","message":{"text":"NsAnalyticsDialogsKt.NsAnalyticsDialogs (cognitive 18): NsAnalyticsDialogsKt.NsAnalyticsDialogs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, match/switch 1 (nesting depth added 5). 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/nsanalytics/NsAnalyticsDialogs.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42d465cfaccd342df5740a9d8adca75cdbdc0817d70d868875b080e595958e3"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyUiStateMapper.destinationRows (cognitive 18): SurveyUiStateMapper.destinationRows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/model/SurveyUiStateMapper.kt"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1b5beda48d7f4317fbf44c1e1b5f1a1bdae65fecac5af812f92219b14bb10a"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkSurveyService.applyListenerTypes (cognitive 18): NetworkSurveyService.applyListenerTypes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacd4077ac4edfd024460cecfd8b73f06261d830a55d797fa3b6c74a9f2b6573"}},{"ruleId":"D2","level":"warning","message":{"text":"CommunityDatabasesScreenKt.CommunityDatabasesContent (cognitive 17): CommunityDatabasesScreenKt.CommunityDatabasesContent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/community/CommunityDatabasesScreen.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bbf91d516a455b6c7881062d9dfc7608e6fb1accde8ac621a575d8634608d0"}},{"ruleId":"D2","level":"warning","message":{"text":"NsAnalyticsConnectionViewModel.toggleAutoUpload (cognitive 17): NsAnalyticsConnectionViewModel.toggleAutoUpload has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/nsanalytics/NsAnalyticsConnectionViewModel.kt"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d6f68b781f1d1a7c1457649d4b8df4f6c3ed0d60eb32d92e6d1e489f6e7232"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyUiStateMapper.map (cognitive 17): SurveyUiStateMapper.map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/model/SurveyUiStateMapper.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71e5ef5ce8eb836500fb44429cd34b04129cb31a74ee00e815a9cf8757a6c42"}},{"ruleId":"D2","level":"warning","message":{"text":"DeviceStatusCsvLogger.convertToObjectArray (cognitive 17): DeviceStatusCsvLogger.convertToObjectArray has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 13, 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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/DeviceStatusCsvLogger.java"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"001f219e00e0b9d92d70a5a0843d1386a0388894b62d74c77ee1306f8c7c9198"}},{"ruleId":"D2","level":"warning","message":{"text":"LteCsvLogger.convertToObjectArray (cognitive 17): LteCsvLogger.convertToObjectArray has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 17. 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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13a7424244527bbbc30d206d9fee661b91795c2e865e76c4784ee60f6aa8223"}},{"ruleId":"D2","level":"warning","message":{"text":"NrCsvLogger.convertToObjectArray (cognitive 17): NrCsvLogger.convertToObjectArray has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 17. 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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/NrCsvLogger.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"10860917f56e29dd51a39b8181133df501424bf29d6e4bfc451686993d1c8eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"CellularController.buildNetworkTechnologyInfo (cognitive 17): CellularController.buildNetworkTechnologyInfo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d8330198c77e93596c21a0d11f179ffe1b28e0178919dd653ee589e59385b5"}},{"ruleId":"D2","level":"warning","message":{"text":"MqttBrokerEditorContentKt.MqttBrokerEditorContent (cognitive 16): MqttBrokerEditorContentKt.MqttBrokerEditorContent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/mqtt/MqttBrokerEditorContent.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1053a7d771b0991275f45bbddb763dcd0ea9f0aa3e23ff94da79f9f9dbc3e03"}},{"ruleId":"D2","level":"warning","message":{"text":"CredentialSecureStorage.migrateFromPlainTextIfNeeded (cognitive 16): CredentialSecureStorage.migrateFromPlainTextIfNeeded has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 4, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/CredentialSecureStorage.kt"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3eb6fda15dd7b5bdd4ba1ba9ef481515c176f18f09d9d62ec914dd5c660102"}},{"ruleId":"D2","level":"warning","message":{"text":"SurveyRecordProcessor.generateEmptyGnssSurveyRecord (cognitive 16): SurveyRecordProcessor.generateEmptyGnssSurveyRecord has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (16 pts) (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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"2699883d5e9ceac7eba84475070f6d0837b9062d364c1858cf04e238b0fe8ed3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NetworkSurveyService: TooManyMethods \u2014 199 methods. The bar is 30 methods; this is 169 over it, 6.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08b1aeae0a60b98461449d0cfaf86c0559b8098c1a84976230ee7e638a198df"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NetworkSurveyService: ClassTooLong \u2014 1782 significant lines (blank, comment-only and punctuation-only lines excluded), 199 methods. The bar is 400 significant lines; this is 1382 over it, 4.46\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bdbed95b84bbce332bdbb0e05b58c090a1663e8cdbe092256e303a80a6a8f9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SurveyRecordProcessor: TooManyMethods \u2014 117 methods. The bar is 30 methods; this is 87 over it, 3.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8ac43e5189c3e67d12fafe2a739b399ec5f1b0496b49c6556d09926a8af2c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/NetworkSurveyService.java: FileTooLong \u2014 1947 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: NetworkSurveyService (185-4586). The bar is 500 significant lines; this is 1447 over it, 3.89\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb4a56a6c748c2734e4e293b9da62ae830c517f4ab0f88c3d6e894f74e2e72f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SurveyRecordProcessor: ClassTooLong \u2014 1369 significant lines (blank, comment-only and punctuation-only lines excluded), 117 methods. The bar is 400 significant lines; this is 969 over it, 3.42\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e285e33e65bee1e66aeeb857da867071d89c5001c0bf6b3ea7b0498d0c5d599"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/SurveyRecordProcessor.java: FileTooLong \u2014 1528 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: SurveyRecordProcessor (173-3619). The bar is 500 significant lines; this is 1028 over it, 3.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2ac1691ca9197055a7dfb25d19b19ac10f0c9d0b4e44b48e63240beae0e6ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CombinedFiltersBottomSheetKt.CombinedFiltersBottomSheet: MethodTooLong \u2014 CombinedFiltersBottomSheet runs 210 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CombinedFiltersBottomSheet.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b809c5a05736741015bb6d8879c1cb9281c8d93e68bd81b23fa75acbcffaef16"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TowerMapLibreViewModel: ClassTooLong \u2014 762 significant lines (blank, comment-only and punctuation-only lines excluded), 50 methods. The bar is 400 significant lines; this is 362 over it, 1.91\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"748c356481f88e2c53f46ce72fa9a5ecc847af5c0992d69b5755b66ec4406712"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GrpcConnectionService: 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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/GrpcConnectionService.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d9f3d4100ffb280069104a5e870e382c50e1fe92a72bd8a4575b02730c6779"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AcknowledgmentsRepository.getLibraryAcknowledgments: MethodTooLong \u2014 getLibraryAcknowledgments runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/data/AcknowledgmentsRepository.kt"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f70560a130d2c979af3928bc44ff00014f5793345fdcf0e424e13d417fe9d9a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TowerMapLibreViewModel: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1dc68f9db8b48a7af6435c426ec35713d285e15915cbc6e7d018cebe99357b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/TowerMapLibreViewModel.kt: FileTooLong \u2014 819 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: TowerMapLibreViewModel (76-1434). The bar is 500 significant lines; this is 319 over it, 1.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b2835333fae14cc38dfdfa543fddc76089f29dc0ff55aaca7fc5241b8ab63c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GrpcConnectionService: ClassTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded), 53 methods. The bar is 400 significant lines; this is 238 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/GrpcConnectionService.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9266b90770c38d4836d940312be697ba5656d29dea79994852ce6c4216b636"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CellularController: ClassTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 220 over it, 1.55\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2087001e85fef01794e23cd799af508ac0d7389eb85f0152720ee6678a07cc18"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PreferenceUtils: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efdb7e810d6b56c26d2477ee11c8a8767c398ace3cb9b02fcd0ade5399817fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppNavigationKt.mainGraph: MethodTooLong \u2014 mainGraph runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/AppNavigation.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa1bf9d5b1fe5d112890027786cd7b29442db7e241dda23f20495958c5884f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CellularController: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a4813ce788532660cd557e8a92104c9db33530f159a4ccb827ef82229f53ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/GrpcConnectionService.java: FileTooLong \u2014 713 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: GrpcConnectionService (86-1416). The bar is 500 significant lines; this is 213 over it, 1.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/GrpcConnectionService.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90fe5a9e929961c31c15bef5aeba02a9155d94e866cbbf8238b473fa5d8bb2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controller/CellularController.java: FileTooLong \u2014 671 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: CellularController (65-1460). The bar is 500 significant lines; this is 171 over it, 1.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb9ef9effca180345ca5552ea39f12358aea85ad84b47d9b88888970e19d1cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScreenActions: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. Most of these members implement survey.SurveyActions (32 of 38 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/SurveyScreen.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0413e5af51590d796d48257543db81e897c92340c37b07675d981c2ececa5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ParserUtils.convertNetworkInfo: MethodTooLong \u2014 convertNetworkInfo runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb82a59128d9fc54f2834d33c7938c675836b6230137e075525db71a95b7921"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SurveyViewModel: 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/SurveyViewModel.kt"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c1ba208ee001c4fe798be91c00816b3eca08be576de0ca158dcda17b13d5fa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NsAnalyticsUploadWorker: ClassTooLong \u2014 464 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 64 over it, 1.16\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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/NsAnalyticsUploadWorker.kt"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4467867ec52fad8d7af36b04d3639c266fb792103f807e8e80932eb1f58e517b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BluetoothController: ClassTooLong \u2014 457 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 57 over it, 1.14\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/BluetoothController.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f9819c409d3cafe97571405d6f174538a0c9a9e7ea44ef330e71f409ce01f8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BatteryPauseState: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/model/BatteryPauseState.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac8c828f9d808f22ef9a20a05f4950557ac33812b6ad5988a32203787e45ba7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WatchlistScreenKt.WatchlistScreen: MethodTooLong \u2014 WatchlistScreen runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistScreen.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3117fb235dd93c1dd479336cd244752199256d32da230b0506b26cf563ddb7c6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BluetoothController: 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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/BluetoothController.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8038b0d6b85c96eef7e2e8643bf743d9b9cc328f4d3b3bf7556ee9f70c42f3c2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NsAnalyticsSecureStorage: 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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/NsAnalyticsSecureStorage.kt"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6acf6f02f6d4bf1b511441c41ce06dc8870c33925b86d8c79b59ab33271ab7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UploadSettingsScreenKt.UploadSettingsScreen: MethodTooLong \u2014 UploadSettingsScreen runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/settings/UploadSettingsScreen.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae602cd9caa7bd53793bdab75d0831060bae1aab2abc61d434bfc41c1be9f05"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WifiClientsController: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/WifiClientsController.kt"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d5313f7d612f4503e694ea080bc2fcb1d67cfe14e00f3b0579e32af7af402d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WifiController: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/WifiController.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a819ca0c804e6a46c6b95f76a639b535325330ef3366ce5c9a0c9eb6dd3ea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (45 shared lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt:132-238 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/SsidExclusionListScreen.kt:111-214 \u2014 These two members are variants of one another: 45 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dde3df83a7c052b1e562252e5ab0b299c322b416cd5d91049b2df1a5448e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:227-241 | networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:293-312 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb51bb055ac3ce279edd154eb81ec83bb21659067930ce5e19c72b79d1d70f7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (11 members, 50\u002B identical tokens): networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java:3354-3444 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:983-1039 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1384-1494 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1503-1587 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1596-1712 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1721-1871 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1911-2087 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2186-2273 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2318-2545 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2556-2644 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2653-2707 \u2014 These 11 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 11 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":3354}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc98e256ac5307f1ff799661c9fe5aff0ebb6f868b67df3b9e33cee43b2e4490"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java:110-139 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java:79-106 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/DeviceStatusCsvLogger.java:83-126 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/GnssCsvLogger.java:84-114 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java:80-108 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java:88-125 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/NrCsvLogger.java:87-122 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/PhoneStateCsvLogger.java:81-121 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/UmtsCsvLogger.java:81-110 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/WifiCsvLogger.java:87-127 \u2014 These 10 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 10 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 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bec4d536e0883cc7e338b4e86a790bfa131dee746fba81c1ed69dfe6f1eeeb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:238-258 | networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:277-318 | networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:354-382 | networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:399-419 | networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:850-901 | networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:933-979 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75ef95ae0f61c515d5d844173e3a3ac141bf07bd1dbd8ac714a8b38a4f77f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:421-449 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:452-481 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:484-517 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:520-553 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:556-594 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8888cafb9f06296d97799fbfd290f9fb3369e078c7dfab0b5b60bfdc9c9c27"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:274-291 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:294-311 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:314-331 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:334-351 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6f6ff43bb2a487256864266b21d796ad38d1e0719df3c7ad407c83805e56b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/GeosubmitJsonFormatter.java:65-82 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/GeosubmitJsonFormatter.java:85-102 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/GeosubmitJsonFormatter.java:105-124 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/GeosubmitJsonFormatter.java:127-145 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/GeosubmitJsonFormatter.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1eb41583d753391f4fca52556b5a09fbac031ca6a962ec5b81f4f8a52d8ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/model/CellularRecordWrapper.java:98-135 | networksurvey/src/main/java/com/craxiom/networksurvey/util/CellularUtils.java:335-380 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/model/CellularRecordWrapper.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9239682b2970043dcf4493d174ee663dfac73a3405c636e6182b696a4ec18501"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (82 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:905-986 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1063-1156 \u2014 These two members are one piece of code written twice and then edited apart: 82 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"3562e0d42fcbb43d6cfcb7eff44f0bdd526ed81bc682eb1f1bc0958cad67e260"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/scout/clients/ScoutClientRecords.kt:35-64 | networksurvey/src/main/java/com/craxiom/networksurvey/scout/clients/ScoutClientRecords.kt:73-106 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/scout/clients/ScoutClientRecords.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaf1403eb53048254ef62c4f538a2d963e8c090ce4281d18a8450e63eae978a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistDetailRows.kt:90-138 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistHistoryRows.kt:132-182 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistDetailRows.kt"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeba84a309bbe38a712f6fdcc95abfa3adf3d44007920185b9964802e8c87edf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/theme/Color.kt:18-58 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/theme/Color.kt:61-101 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/theme/Color.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"772613fa0f416a654440f3fd180fc8a73e1a4d7499b17b4482a9085293135a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:193-224 | networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:256-290 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ee1df46977b942414a287a0e88a56caed52b3526b6aeaafdcc8d63f0a3404c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/logging/WifiClientCsvLogger.java:62-75 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/WifiProbeCsvLogger.java:65-81 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/WifiClientCsvLogger.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba157ed919fc820445da82d241a095a11084fc56dbf12f00c4860530a2ac832"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 29\u002B corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/details/BluetoothDetailsScreen.kt:233-263 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/list/BluetoothListContent.kt:171-210 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/WifiListContent.kt:261-289 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/components/WifiBlockedNotice.kt:29-60 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 29 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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/details/BluetoothDetailsScreen.kt"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"770ff449035a9c16d1216c890b89ec58dbd4646a5ad7e7501d1af0d848ea16e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/common/NsFilterPill.kt:39-58 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/components/WifiModeTabs.kt:136-161 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/common/NsFilterPill.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1808ff734a936a78401317cd0320702cc041cd68ddca7557a54a6b4f3eda89bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/scout/wifi/ScoutWifiFields.kt:78-96 | networksurvey/src/main/java/com/craxiom/networksurvey/scout/wifi/ScoutWifiFields.kt:100-116 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/scout/wifi/ScoutWifiFields.kt"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c271db072982763e9c7a79b54c24e05ca6b50e34b4130c5b52284bc09200b23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/bands/BandFilterBar.kt:129-155 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/bands/BandFilterBar.kt:158-181 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/bands/BandFilterBar.kt"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f73c33a11dbcfefce66a7c651a8cb7ce5cac1296591e3c059c72da12cf2f921"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/HomeNavigation.kt:132-155 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/HomeNavigation.kt:158-178 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/HomeNavigation.kt"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bced1f19d064e5003965926c0ae2199c9d271152bda0f04075a98d35219b8c64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 39\u002B corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/BluetoothController.java:286-328 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:410-449 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/GnssController.java:242-280 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/WifiController.java:291-333 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 39 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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/BluetoothController.java"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"58500b54f918b945243837616419f2a35098f46976c95e5e819685f7c2e3d34f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/AppNavigation.kt:366-399 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/AppNavigation.kt:402-430 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/AppNavigation.kt"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"3814013a0025af16a9340e59dd2a2b372f9dd02629812b0262c74f8b8977a8b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/details/model/CellularNeighbors.kt:88-95 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/details/model/CellularNeighbors.kt:97-105 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/details/model/CellularNeighbors.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"991311e6bf79fa8dbd8daeebd9e4473880baa487958fa1bf0cf03cd11405273e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/list/BluetoothListContent.kt:226-240 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/WifiListContent.kt:314-328 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/list/BluetoothListContent.kt"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba87d7d1741430929a1af1005f0e7306014df09bafad7219226330c6b7f498d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/CalculatorViewModel.kt:199-221 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/CalculatorViewModel.kt:228-249 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/CalculatorViewModel.kt"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c1af3b1862eaf03b034827d5aa0468acd0449486a1299fc3d078abfd000ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/SurveyedPoints.kt:116-136 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/TowerSymbols.kt:225-250 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/SurveyedPoints.kt"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7b27064f0c9f59872a028f4cfe158999a4d2ca62525772627ebf4e01a0f1af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/services/BatteryMonitor.java:293-320 | networksurvey/src/main/java/com/craxiom/networksurvey/services/BatteryMonitor.java:326-353 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/BatteryMonitor.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ad8df8ccebcea24925c8ad40b474270e8a4991d4f87d7b000b162cf4cb1dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/list/model/BluetoothDisplayFilter.kt:28-40 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/model/WifiDisplayFilter.kt:36-48 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/list/model/BluetoothDisplayFilter.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e761283cd65f3c925b204be75010ff593bbf67edf4f1fc8d505da029c0f5636"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/services/GrpcConnectionService.java:777-800 | networksurvey/src/main/java/com/craxiom/networksurvey/services/GrpcConnectionService.java:808-824 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/GrpcConnectionService.java"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de2b174c5e305caf20392036e62e345830fbbca3ad2a6bd5f9d5d9f8236fc47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/DeepLinkDispatcher.kt:37-52 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/DeepLinkDispatcher.kt:54-68 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/DeepLinkDispatcher.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d24e9e86c0610cef37fba31024712642124dc70b9e56149789844b4a4132103"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:54-75 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/NsAnalyticsDataStore.java:43-67 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e72f63579811adec4abe0d3764330656c4861958ae30581d558018d8d0d9b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/ocid/OpenCelliDCsvFormatter.java:103-112 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/ocid/OpenCelliDCsvFormatter.java:115-124 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/ocid/OpenCelliDCsvFormatter.java:127-137 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/ocid/OpenCelliDCsvFormatter.java:140-150 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/ocid/OpenCelliDCsvFormatter.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5a56394a004fe1752336d3e9550c0da8a40f068ea4cbbc3a3aa6d1472b702a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/MissionSessionTracker.kt:124-145 | networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/MissionSessionTracker.kt:152-167 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/MissionSessionTracker.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2e34c445b4e2097f488487e3609964b2aed4d9da53a0c1a5524087fa5a0c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/fragments/model/MqttConnectionSettings.java:169-178 | networksurvey/src/main/java/com/craxiom/networksurvey/fragments/model/MqttConnectionSettings.java:182-199 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/fragments/model/MqttConnectionSettings.java"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbfc4983cea3e577c9c968f2328a302723b572855e0ce1c2db5508d0be32239"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/NsAnalyticsDataStore.java:138-154 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/NsAnalyticsDataStore.java:171-187 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/NsAnalyticsDataStore.java"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbce29304483882b0e36fbba80fe7a765d4dca766a0095105d287cd322958e62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/oui/OuiLookupScreen.kt:237-261 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/oui/OuiLookupScreen.kt:264-283 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/oui/OuiLookupScreen.kt"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0d2c363dc1dbc20b03c16fd060b7f17858f602ca5f8da240c232b439ae617e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1361-1375 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1381-1399 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa28068e593034d603d4383ed465b5e6a8fa2e3c3b353568f62bf907e14f21b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/data/plmn/PlmnRepository.kt:110-121 | networksurvey/src/main/java/com/craxiom/networksurvey/data/plmn/PlmnRepository.kt:124-135 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/data/plmn/PlmnRepository.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b1fc85efce94beb6b4bfc88ea7e1318402bf2c836612c81addafacad7a977d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1177-1188 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1194-1205 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ab9b46f60d20a257afa750612fb725219ee67c4d939d40b155697a80fea63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2864-2884 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2914-2928 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2936-2956 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":2864}}}],"partialFingerprints":{"codehealthFindingId/v1":"f638e29d52abdcc5491cc4bb5248c51bcf31fd036a10a276373f8a87dcbab84a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:519-534 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1324-1341 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e112e8c8eaeedf0ee9490563a0e2692ad772ae58f96c760c793c73dcd75dbc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideRows.kt:45-55 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/SsidExclusionRows.kt:34-44 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideRows.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c04c7c9482642169b858349c6aafd6bbd6e4182bea8623ae30d32bfe93a0754"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java:1506-1518 | networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java:1528-1540 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6212968b1005b5e729e29526e7e3f219d83b6b1694b68cee4c0afc1decde64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java:85-103 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/CsvRecordLogger.java:204-225 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"518da514e2436585172ce9b77e8a4a87e58fd2585f89f392f2ea25da3f43c19f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java:1388-1405 | networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java:1440-1460 | networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java:1672-1689 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"89618ef94710ed0f24364edea0815fee70a5d1c8724fc31558b2e5420bb82362"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/LiveDestinationRows.kt:59-69 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/StillToDoPanel.kt:45-55 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/LiveDestinationRows.kt"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"805c39fde2b5cceb5a7d43f8a1a8806e46ddffa0fe8963ed6b44cb01bca331c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/nsanalytics/NsAnalyticsRegistrationFlow.kt:64-75 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/nsanalytics/NsAnalyticsRegistrationFlow.kt:121-133 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/nsanalytics/NsAnalyticsRegistrationFlow.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd726d21cb3bd02df943f29d5f4ae131457b4852ecf08973e7e01a1e1568bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/BeaconDbUploadClient.java:38-50 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/ocid/OpenCelliDUploadClient.java:44-54 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/BeaconDbUploadClient.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8621c5e68f7a56b0577e09af3611f21eafdbc65c1fdd18099a2fe040e977c909"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 15\u002B corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:3022-3037 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:3045-3060 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:3068-3083 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:3092-3107 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:3116-3130 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:3341-3356 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:3416-3431 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:3604-3618 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":3022}}}],"partialFingerprints":{"codehealthFindingId/v1":"9479ddc787360cc698668854197512ce4ddc0e02838057ba573b002cb9038e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java:50-55 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java:58-63 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/NrCsvLogger.java:57-62 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"510b94bd0851f0006c92a7c11b55fab3b2937f485c8dc10f26b51882467d784c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/logging/WifiCsvLogger.java:61-68 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/WifiProbeCsvLogger.java:46-50 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/WifiCsvLogger.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3581d15dbe0198bbdff05f15c675f6821116e1807553d8a51aaca1e13681d394"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/plmn/PlmnLookupScreen.kt:279-289 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistHistoryScreen.kt:291-301 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/plmn/PlmnLookupScreen.kt"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c2035df12c940245d62fdb072fb6964ee3d27159c2c781962354f158d88bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/model/CellularRecordWrapper.java:41-49 | networksurvey/src/main/java/com/craxiom/networksurvey/model/ConstellationFreqKey.java:56-61 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/model/CellularRecordWrapper.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81297fb79fcdab84a4c57e486ac8a9600ee2e7365440f64ea22f99cc71ef4c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/scout/wifi/ScoutCaptureSource.kt:199-211 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/WifiRawController.kt:221-232 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/scout/wifi/ScoutCaptureSource.kt"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5755c689b5c94b7d902b4f8fdc382cfd6fa7ba272bb41258bfe6e460c26c9ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/survey/model/Destination.kt:31-34 | networksurvey/src/main/java/com/craxiom/networksurvey/survey/model/RecordType.kt:39-42 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/survey/model/Destination.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66e0593e4106a98f1ed80bebf10df01a2e63ed751bffdd1060112b6d56dcb29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): networksurvey/src/main/java/com/craxiom/networksurvey/ui/common/NsManagedLockSheet.kt:33-41 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/sheets/WhatGoesWhereSheet.kt:66-74 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/common/NsManagedLockSheet.kt"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3556b97b1e954d53cb5dc10912999d057c1fd27bc90f3d58b03ab8f44e10bc36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt:157-180 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/SsidExclusionListScreen.kt:136-159 \u2014 before extracting anything, compare \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/SsidExclusionListScreen.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt:157\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5acf359256693efd2bfbbeaebd2d1f6041f801ca42d1981953cfad1d345ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/util/CryptoManager.kt:95-117 | networksurvey/src/main/java/com/craxiom/networksurvey/util/NsAnalyticsCryptoManager.kt:95-117 \u2014 before extracting anything, compare \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/CryptoManager.kt\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/NsAnalyticsCryptoManager.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/CryptoManager.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed02a5f89edb4e5fdbeed18047d99c900301adca095c289c55b7b4f2ad1c1c9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistDetailRows.kt:104-124 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistHistoryRows.kt:147-167 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistDetailRows.kt:104\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistDetailRows.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a53fa9aadc1b0dce2911da494d2d6ddd13cdac2f1e2d27b9e5dcf7f5419d2f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/util/CryptoManager.kt:70-88 | networksurvey/src/main/java/com/craxiom/networksurvey/util/NsAnalyticsCryptoManager.kt:70-88 \u2014 before extracting anything, compare \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/CryptoManager.kt\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/NsAnalyticsCryptoManager.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/CryptoManager.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"014e282d392ded0c28bbc0a638bd3c0306585411dbb4b7ed54d3f38516d2c409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/util/CryptoManager.kt:47-63 | networksurvey/src/main/java/com/craxiom/networksurvey/util/NsAnalyticsCryptoManager.kt:47-63 \u2014 before extracting anything, compare \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/CryptoManager.kt\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/NsAnalyticsCryptoManager.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/CryptoManager.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4301d8bb22ddde8f1b1e026ebb586501b879c501e735a5168464b3eb53c55b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/grpc/GrpcServerContent.kt:113-128 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/mqtt/MqttBrokersContent.kt:118-132 \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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/grpc/GrpcServerContent.kt:113\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/grpc/GrpcServerContent.kt"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be073f96c36b70ec04f2b2be73a70fcf9085ad333dd3feb899f986b59f3a1e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CellSearchBottomSheet.kt:155-169 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CellSearchBottomSheet.kt:195-209 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CellSearchBottomSheet.kt:155\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CellSearchBottomSheet.kt"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5b94213f45ebf394e18e09c57f415e48f33a5787d5c35a516a1d83f1b68bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CombinedFiltersBottomSheet.kt:235-249 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CombinedFiltersBottomSheet.kt:271-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CombinedFiltersBottomSheet.kt:235\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CombinedFiltersBottomSheet.kt"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1e9101cbd55c9a013c088072a4eed5be42d3c687da28b341f1fa979481bf31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt:139-152 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/SsidExclusionListScreen.kt:118-131 \u2014 before extracting anything, compare \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/SsidExclusionListScreen.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt:139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf91800a7a8b5c7634b8eddeea5e8ff6fb408a4fa0afcf308f9d6d9750f69d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/community/CommunityDatabasesScreen.kt:189-202 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/logfiles/LogFilesContent.kt:182-195 \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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/community/CommunityDatabasesScreen.kt:189\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/community/CommunityDatabasesScreen.kt"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"437f70bf10cb4e792117a7d98b2655b9e17cbc12b0803aec7abb710b8a0733d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/logfiles/LogFilesContent.kt:180-194 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/mqtt/MqttBrokersContent.kt:122-134 \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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/logfiles/LogFilesContent.kt:180\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/logfiles/LogFilesContent.kt"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"608f80da216b5a0913ca9192775d795a12e2816aee97bc47c18f025193bbdcc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/DestinationRows.kt:102-113 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/LiveDestinationRows.kt:80-89 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/StillToDoPanel.kt:60-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/DestinationRows.kt:102\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/DestinationRows.kt"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bf2cb6766fe5a439f85a831909f985a7080737bcabb0ea9c8297e853803e60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/bands/BandFilterBar.kt:144-155 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/bands/BandFilterBar.kt:170-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/bands/BandFilterBar.kt:144\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/bands/BandFilterBar.kt"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c358be235f1083dff96fabef6eaab1b4d47e4eab57daebc72e883e1bbaeb9c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/TowerBottomSheet.kt:360-371 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/TowerBottomSheet.kt:521-532 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/TowerBottomSheet.kt:360\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/TowerBottomSheet.kt"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"143e6d089d6f39ac849d70ef123de6884db25d9bc99226b3da8c7969f2624c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistRows.kt:137-150 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistScreen.kt:99-110 \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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistRows.kt:137\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistRows.kt"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"160889717d9f75e3277375fb5362295b80e6682a7cacf48f28be1e239fff3f4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/details/BluetoothDetailsRoute.kt:39-49 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/details/WifiDetailsRoute.kt:49-59 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/details/BluetoothDetailsRoute.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a2a6dc22b5ca47e1e987261630d997d987a005455b654d4d5de7a348ea9851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/AppNavigation.kt:373-383 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/AppNavigation.kt:409-419 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/AppNavigation.kt:373\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/AppNavigation.kt"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2e07e5b5b7dac7039630144ac3fef8c9369192d39dd89440970747270b5bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt:145-154 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt:162-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt:145\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"244e682727312d98ce322f395375ed5f6bd531359b1cd3823c17442d59292bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt:179-188 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt:196-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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt:179\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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce9f034a62568f97d258dc073ce4a1c9a49a0379d2ee9229eb83ee474311af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt:145-153 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt:162-170 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt:179-187 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt:196-204 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt:145\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/SurveyedPointDetails.kt"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e0fef43cf031c475bcee30061b0140408bd633528772228e07a5704951b796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/scout/clients/ScoutClientRecords.kt:41-51 | networksurvey/src/main/java/com/craxiom/networksurvey/scout/clients/ScoutClientRecords.kt:79-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/scout/clients/ScoutClientRecords.kt"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"423b9717f3a84d777717abf1444583ef611073c9475c902de1caebee71ec5885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CellSearchBottomSheet.kt:217-224 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CellSearchBottomSheet.kt:270-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/CellSearchBottomSheet.kt"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b9fce5a11abe69c4da7385bdda3d3ad985d1e2881009d35e3878267988159f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/common/NsManagedLockSheet.kt:53-60 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/sheets/WhatGoesWhereSheet.kt:79-87 \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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/common/NsManagedLockSheet.kt:53\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/common/NsManagedLockSheet.kt"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a53d98184415e273e2fc0699a0fd27fa1d2f5a995520b85b23b2e22880983b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt:192-201 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/watchlist/WatchlistScreen.kt:139-145 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/SsidExclusionListScreen.kt:171-177 \u2014 before extracting anything, compare \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/SsidExclusionListScreen.kt\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt:192\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorOverrideScreen.kt"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8ead8cda5d5b2f88dbc41826725ff3fc19443db135447af99b99e265bbb573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorAddSheet.kt:94-100 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorAddSheet.kt:108-114 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorAddSheet.kt:94\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/ProviderColorAddSheet.kt"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"171a94a639aaf0248dcc806b589c285f6b3b50c9bf7d6b6e8c2129be0a98c553"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/clients/WifiClientRow.kt:56-62 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/clients/WifiClientsContent.kt:169-175 \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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/clients/WifiClientRow.kt:56\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/clients/WifiClientRow.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d947aee61bca23d8a04e9958d0bb0c61ab03168bc985d610c3e4b26b02b24b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/spectrum/SpectrumInterpolator.kt:39-43 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/spectrum/SpectrumInterpolator.kt:47-52 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/spectrum/SpectrumInterpolator.kt:47\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/spectrum/SpectrumInterpolator.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b80b57b5f5332316efa9b55e6f08fd31763f7efefb998592c6bed0417e38f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/plmn/components/PlmnRow.kt:93-97 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/plmn/components/PlmnRow.kt:266-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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/plmn/components/PlmnRow.kt:93\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/plmn/components/PlmnRow.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f321af2020dddea335943f1b6b5f88e1d3032891b787b246a7faf30dcb466f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/LineString.kt:79-88 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/LineString.kt:90-99 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/SearchResultSymbols.kt:64-73 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/LineString.kt"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0c7ccd54b726847a663573adb4ebc9f9f6369b76930a2ccbc12a72f91c803f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/RawFramesConfirmation.kt:78-86 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/sheets/SurveyDialogs.kt:24-32 \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/RawFramesConfirmation.kt"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"228417af3fcc229b8ca4c96eb5f6dde66bd9104e640f4ef80d89299719fca11f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/model/WifiSpectrum24ViewModel.kt:18-26 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/model/WifiSpectrum5Group1ViewModel.kt:18-26 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/model/WifiSpectrum5Group2ViewModel.kt:18-26 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/model/WifiSpectrum5Group3ViewModel.kt:18-26 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/model/WifiSpectrum6ViewModel.kt:18-26 \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 5 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/model/WifiSpectrum24ViewModel.kt"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b7633241303acba675e2c24e8a92b427432b4eba9595ae41ca84b73515965c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/util/NsAnalyticsDeepLinkHandler.kt:48-56 | networksurvey/src/main/java/com/craxiom/networksurvey/util/WatchlistDeepLinkHandler.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. 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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/NsAnalyticsDeepLinkHandler.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d440b0ca811dc61b25dfd813fa6b71f1b19667ec51d99eafbb71ae48d0476d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt:848-859 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt:865-876 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt:848\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c6e393ec51abf748290de5c2bec27764e64f2085368a908e249777f2c64d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt:882-893 | networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt:899-910 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt:882\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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12548a41e71ea063c446a85a5ab37226d4c0dd052e9a249d7c11e18ee839d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/data/plmn/PlmnRepository.kt:113-121 | networksurvey/src/main/java/com/craxiom/networksurvey/data/plmn/PlmnRepository.kt:127-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/data/plmn/PlmnRepository.kt:113\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":"networksurvey/src/main/java/com/craxiom/networksurvey/data/plmn/PlmnRepository.kt"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ac6e9927b723a630df11881d3d8eeb7f35f4b4bd42b3cdb1f4e1f8cdad34ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2559-2600 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2658-2699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2655\u0060 calls \u0060now\u0060, \u0060elapsedRealtime\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2557\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"705167c3639d885f2951dc4702a5b8db166e54b63dc9be87c1cda5d013790238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201332 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:922-953 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1091-1120 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:922\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"61616a5eed478bcc6f6812918d60d65adce967c44cc121d754c27d631be2a376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 8): networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:988-1009 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1411-1432 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1530-1551 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1624-1645 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1756-1777 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1983-2004 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2194-2215 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2330-2351 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"518f77773530c57e338b9c9dafe795e25b06846d2fc51939221c7d9e927de66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1653-1673 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1787-1807 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1653\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, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1785\u0060 calls \u0060setConnectionStatus\u0060, \u0060toConnectionStatus\u0060, \u0060setCellBandwidthsIfActive\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1652\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a118936eaa1bd9a4c7cb2d1b651f5e3ad038ea72fa951f43a5c83468ae2990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:959-977 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1126-1144 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:959\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1146\u0060 calls \u0060postDelayed\u0060, \u0060getEffectiveScanRateMs\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:978\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d82addc0ca0c8b2a0d694111544acb5fa17855ca78f208d480a01becb00ce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/BeaconDbUploadClient.java:104-121 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/ocid/OpenCelliDUploadClient.java:141-158 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/BeaconDbUploadClient.java"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a82eecd2177abec2d45ecaade464f3030a1c9341025dbdc63520e0b571861dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 10): networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:998-1014 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1421-1436 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1540-1555 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1634-1649 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1766-1781 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1993-2008 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2204-2219 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2340-2355 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2582-2597 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2681-2696 \u2014 all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:998\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"24597b53151bc014960724e02409090a92152538159b542d6b350831f03f027d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java:164-177 | networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java:231-244 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java:164\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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e689e6378e024b4e6cc8c120e7553c99ede2754825c58e34b3e561256830462f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:275-287 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:295-307 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:315-327 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:335-347 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060data\u0060 to \u0060GsmRecordData\u0060 in one and \u0060UmtsRecordData\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9190a40d7123c10e65960799d3399b6639983d99800737b704c686635a6d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:426-437 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:457-468 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:489-500 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:525-536 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060record\u0060 to \u0060GsmRecordData\u0060 in one and \u0060UmtsRecordData\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb1511e2a6b3208bc3a2eeeb0a2aaf7f5a87fa1b50cf456bf2f1a80dd872a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/listeners/CdrSmsObserver.java:86-96 | networksurvey/src/main/java/com/craxiom/networksurvey/listeners/CdrSmsObserver.java:107-117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/listeners/CdrSmsObserver.java:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"networksurvey/src/main/java/com/craxiom/networksurvey/listeners/CdrSmsObserver.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"79af7b6c4fd6ce95ad9178c66921d8dcbbdcd00bc141a55cb52db3f0796dfb0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java:3148-3158 | networksurvey/src/main/java/com/craxiom/networksurvey/util/LocationUtils.java:35-45 \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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java:3148\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":3148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6faccef342409f4f2a9492704038002624e39d43bb52598a4d15647729a2f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1363-1372 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1386-1395 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java:1363\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/CellularController.java"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ab61f7666af43ebbce5a6187639034b6ef5b23853b4cb2c1cb369b4dc4f25b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java:274-283 | networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java:317-326 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8334293a46ab3a5260644e14cd5a1cdae81a1ff7ad5537c1c9b5e5d65d2367"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java:113-121 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java:82-90 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/GnssCsvLogger.java:87-95 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java:83-91 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java:93-101 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/NrCsvLogger.java:90-98 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/PhoneStateCsvLogger.java:104-112 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/UmtsCsvLogger.java:84-92 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/WifiCsvLogger.java:95-103 \u2014 before extracting anything, compare \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java:113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java:91\u0060 calls \u0060getLteBandwidth\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java:111\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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ada40961c04d9ae451ef5b4c1b8675f630e3eb6e093d24e5f41fa4dc26be68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/fragments/CodeScannerFragment.java:38-46 | networksurvey/src/main/java/com/craxiom/networksurvey/fragments/NsAnalyticsQrScannerFragment.java:39-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/fragments/CodeScannerFragment.java:38\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/fragments/CodeScannerFragment.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71300631d9988c731428f5004b5ea7381361c65bbdfb02e57628ff269d5fbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:216-224 | networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:282-290 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:216\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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9f7ed7ad062d0d964676abf02fe6dd1973d780538598be3a96973660e733f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:239-246 | networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:278-285 | networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:355-362 | networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:400-407 | networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:851-858 | networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:934-941 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java:239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"940b96bdd5d4a9a43db14c2d7ac48c94dedd2f01ff619c7126e7258a0750a61a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:423-430 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:454-461 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:486-493 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:522-529 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:558-565 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060record\u0060 to \u0060GsmRecordData\u0060 in one and \u0060UmtsRecordData\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:431\u0060 calls \u0060getGroupNumber\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:566\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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcab5cb139be24fb22599d3fe4161d1b6da0d1b1d47472a6c207a873d4a395f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 10): networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java:113-119 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java:82-88 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/DeviceStatusCsvLogger.java:95-101 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/GnssCsvLogger.java:87-93 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java:83-89 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java:93-99 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/NrCsvLogger.java:90-96 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/PhoneStateCsvLogger.java:104-110 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/UmtsCsvLogger.java:84-90 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/WifiCsvLogger.java:95-101 \u2014 before extracting anything, compare \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java:113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java:91\u0060 calls \u0060getLteBandwidth\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java:111\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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/BluetoothCsvLogger.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab0339a74e7df504350a3c461969d2711f2c7294981727141da39ed73919dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/GeosubmitJsonFormatter.java:66-72 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/GeosubmitJsonFormatter.java:86-92 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/GeosubmitJsonFormatter.java:106-112 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/GeosubmitJsonFormatter.java:128-134 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060record\u0060 to \u0060GsmRecordEntity\u0060 in one and \u0060UmtsRecordEntity\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/GeosubmitJsonFormatter.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd7571a3fe46e9aa42783e7590e768c6853d7840e3e02569398ea0296fda682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java:156-167 | networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java:223-234 | networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java:266-277 | networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java:309-320 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed72388371b59bd754da88281d13b956443fb7b9e72f17db3d9492f5a0f8e38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:235-241 | networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:306-312 \u2014 both copies are in the same file, so extract the block 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:235\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4095adda942a66243ae38640b0de6d77eb68fff460811210920910d4d2c2a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 11): networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java:3367-3372 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:991-996 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1414-1419 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1533-1538 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1627-1632 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1759-1764 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1986-1991 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2197-2202 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2333-2338 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2562-2567 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:2661-2666 \u2014 there are 11 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 11 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java:3367\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":3367}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc0369fdcbf02a2881ad4fe7fc5098e02d4655363350ebb0f18e7616b7fd686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:444-449 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:476-481 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:548-553 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java:444\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060record\u0060 to \u0060GsmRecordData\u0060 in one and \u0060UmtsRecordData\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/DbUploadStore.java"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4485abdb91b2d2dc292aa1018c4d5f3b045acd3d4eb689f9c9a5827064cad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java:119-125 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/NrCsvLogger.java:116-122 \u2014 before extracting anything, compare \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/NrCsvLogger.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java:119\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae529ea2ff065017c997a78854bf7e4b3e0c6b311835893c94fa37e115bf8418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:228-233 | networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:294-299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ad54ba6c16601e281a0930bd8cae2fea389aa7d7ff9fe8d98057db2abaa312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java:100-103 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java:104-108 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/NrCsvLogger.java:113-116 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/UmtsCsvLogger.java:106-110 \u2014 before extracting anything, compare \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 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 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java:104\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java:103\u0060 calls \u0060getDeviceSerialNumber\u0060, \u0060getLocationAge\u0060, \u0060valueOf\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java:108\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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ae59b5a42655eb96ba23c23e28113538e981405a936f131d70cb76a7dbf58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1437-1439 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1558-1562 | networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1652-1656 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1558\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1557\u0060 calls \u0060setGroupNumber\u0060, \u0060get\u0060, \u0060setServingCell\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java:1437\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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fa6d2fc3a9c5a6f90540437f900abf4dda38599ce219ed377b708e8dafd6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java:297-301 | networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java:340-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/ParserUtils.java"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"129e07902501141190ae4d15655864f1a13166be496b775ad570e91853fe2bfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:249-253 | networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:323-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java:249\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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0472d463096c0267c8d0a6d967098e595520799131b6a20f3db8b886501dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java:64-72 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/DeviceStatusCsvLogger.java:68-76 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/GnssCsvLogger.java:69-77 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java:65-73 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/LteCsvLogger.java:73-81 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/NrCsvLogger.java:72-80 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/PhoneStateCsvLogger.java:66-74 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/UmtsCsvLogger.java:66-74 \u2014 before extracting anything, compare \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/logging/GsmCsvLogger.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060record\u0060 to \u0060CdmaRecord\u0060 in one and \u0060DeviceStatus\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/CdmaCsvLogger.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"26226cbdde2afa2965ae90d822a73b5fe46b873ad2ad051f47984b2b37a9d534"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/BeaconDbUploadClient.java:57-63 | networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/ocid/OpenCelliDUploadClient.java:61-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/BeaconDbUploadClient.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bfd3cfececbb2a84a94c314e266d4fd62c5debbc21b35d97031507f94bca3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/BluetoothController.java:535-546 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/GnssController.java:469-480 | networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/WifiController.java:401-412 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/BluetoothController.java"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e8a6a8dbcd596416dae06a5a927ec79a750058187951fdb7fe66362dc204d6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CalculatorViewModel (LCOM4 6): CalculatorViewModel\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/CalculatorViewModel.kt"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0b2bb7575dc5a96d50c6a311f51d8d164845404fd781f9d1a7fff59545010c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java: networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in SurveyRecordProcessor.generateBluetoothSurveyRecord at line 2317. 2 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-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 10:09:03 -05:00\u0027 --until=\u00272026-11-07 10:09:03 -05:00\u0027 --full-history --no-merges -- networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f1711884119b2c9f8312a07e531298c518d18bb45801ac61c08fa560775938"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java: networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in NetworkSurveyService.updateLocationListener at line 3063. 5 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-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 10:09:03 -05:00\u0027 --until=\u00272026-11-07 10:09:03 -05:00\u0027 --full-history --no-merges -- networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd839b5dd4e4f4da46a0bbad1364b1fabc3649626ae4c280ec7436ebd88433a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/SurveyOrchestrator.kt: networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/SurveyOrchestrator.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in SurveyOrchestrator.reconcile at line 189. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 10:09:03 -05:00\u0027 --until=\u00272026-11-07 10:09:03 -05:00\u0027 --full-history --no-merges -- networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/SurveyOrchestrator.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":"networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/SurveyOrchestrator.kt"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc55dc672d6c03060c7147fb9c3b80d6bf436a850c615f39b1f47d1dfbf98a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/NsAnalyticsUploadWorker.kt: networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/NsAnalyticsUploadWorker.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in NsAnalyticsUploadWorker.doWork at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 10:09:03 -05:00\u0027 --until=\u00272026-11-07 10:09:03 -05:00\u0027 --full-history --no-merges -- networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/NsAnalyticsUploadWorker.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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/NsAnalyticsUploadWorker.kt"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcb510c1929d57d45fab48d3fa39adaa490fff4ecf58e051e61ceceb961e80e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/SurveyEventMessages.kt: networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/SurveyEventMessages.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in SurveyEventMessages.message at line 23. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 10:09:03 -05:00\u0027 --until=\u00272026-11-07 10:09:03 -05:00\u0027 --full-history --no-merges -- networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/SurveyEventMessages.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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/SurveyEventMessages.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b617c4c443fc64f045e6e1a1e3bdecc1cefd950d82ca1b8c5b69c53e6dab2c69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/WifiListContent.kt: networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/WifiListContent.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in WifiListContentKt.WifiListContent at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 10:09:03 -05:00\u0027 --until=\u00272026-11-07 10:09:03 -05:00\u0027 --full-history --no-merges -- networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/WifiListContent.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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/WifiListContent.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"63247e7fae454f11591be69df9b302007aee25604f10a0ed938a228c11105507"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/StillToDoPanel.kt: networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/StillToDoPanel.kt changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is StillToDoPanelKt.StillToDoPanel at line 39), 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 data, copy and layout bugs found while preparing the 2.0 docs\u201D; \u201CFix the follow-ups from testing v2 on a phone\u201D; \u201CFix what the pre-merge review of v2 found\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-09..2026-11-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-09 10:09:03 -05:00\u0027 --until=\u00272026-11-07 10:09:03 -05:00\u0027 --full-history --no-merges -- networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/StillToDoPanel.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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/components/StillToDoPanel.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c54b5569c4c314ca84ce8e20ea5d4088cc8dfb8ca2373891c6e826761932c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO It is unclear how to map the 320 MHz channels \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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/WifiUtils.java"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed1aa8989be9f04fd1e0ff114902cdb8e80169207672fb9b8894704a2506a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME we don\u0027t ever use the registered at time, delete it or use it \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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/NsAnalyticsSecureStorage.kt"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7f630476d516d8464162187a2b23ae88b72fbe7973cab2bcee5672bb61b4b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME do we store the full QR data and then the part? We only need to store it once \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":"networksurvey/src/main/java/com/craxiom/networksurvey/util/NsAnalyticsSecureStorage.kt"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f1236d0b191061726e1894aaefc89217c15391828e4aa299466edb704328ff"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME I don\u0027t think I need this camera update \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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/MapUpdater.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"577c40e68ffe3a84fa80994e0e42cb07bd58fb1867b91482261ba034d1ce0493"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - surface this state message in UI somewhere, like when user returned from Settings like before? For now just disable logging option in Settings, will surface in Dashboard later \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":"networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/gnss/data/SharedGnssMeasurementManager.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc98a08ad920b0180ae6171b2e70d908baf3ab9f7235f391cdb9042067de190"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - surface this state message in UI somewhere, like when user returned from Settings like before?  For now just disable logging option in Settings, will surface in Dashboard later \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":"networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/gnss/data/SharedGnssMeasurementManager.kt"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc1c96cad6c9894797949013f33c386a9cf4a8e4e6cefb0937e00bbf1b6b607"}},{"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 \u0060networksurvey/build.gradle\u0060 makes this repository a deployable product (line 2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/build.gradle"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b232ad2063bcf86fe01b5f0a53725d0a17a38270f4ba04d7a52c6a07b4b7c95"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060LibUIUtils\u0060 spells \u0060UI\u0060 where 55 names in the project spell it \u0060Ui\u0060: 55 of 56 names in project networksurvey spell the token \u0060Ui\u0060 (55 of 56; unit: names in project networksurvey containing \u0060Ui\u0060). Peers: com.craxiom.networksurvey.ui.acknowledgments.AcknowledgmentsUiState (networksurvey/src/main/java/com/craxiom/networksurvey/ui/acknowledgments/AcknowledgmentsViewModel.kt:43); com.craxiom.networksurvey.ui.bluetooth.list.model.BluetoothListUiState (networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/list/model/BluetoothListUiState.kt:32); com.craxiom.networksurvey.ui.cellular.TowerMapUiStateKt (networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/TowerMapUiState.kt:1); com.craxiom.networksurvey.ui.cellular.TowerMapUiState (networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/TowerMapUiState.kt:21); TowerMapUiStateKt.rememberTowerMapUiState (networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/TowerMapUiState.kt:39). Rename to \u0060LibUiUtils\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/util/LibUIUtils.kt"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7d6dffd0221c2bf8eb0b27d8100e7053f88d940dfac7c56ac714fdebad0042"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060uploadToBeaconDB\u0060 spells \u0060DB\u0060 where 29 names in the project spell it \u0060Db\u0060: 29 of 30 names in project networksurvey spell the token \u0060Db\u0060 (29 of 30; unit: names in project networksurvey containing \u0060Db\u0060). Peers: SurveyRecordDao.getGsmRecordCountForUpload(beaconDb) (networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/dao/SurveyRecordDao.java:31); SurveyRecordDao.getGsmRecordsForUpload(beaconDb) (networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/dao/SurveyRecordDao.java:34); SurveyRecordDao.markGsmRecordsAsUploadedToBeaconDb (networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/dao/SurveyRecordDao.java:40); SurveyRecordDao.getCdmaRecordCountForUpload(beaconDb) (networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/dao/SurveyRecordDao.java:44); SurveyRecordDao.getCdmaRecordsForUpload(beaconDb) (networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/dao/SurveyRecordDao.java:47). Rename to \u0060uploadToBeaconDb\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/beacondb/BeaconDbUploadClient.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec433420769a23a24e1aa370771236980dcea26263f7f0884e51796d793334e"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060generateClientID\u0060 spells \u0060ID\u0060 where 61 names in the project spell it \u0060Id\u0060: 61 of 62 names in project networksurvey spell the token \u0060Id\u0060 (61 of 62; unit: names in project networksurvey containing \u0060Id\u0060). Peers: NrSecondaryCellSighting.isUsableFor(currentServingCellId) (networksurvey/src/main/java/com/craxiom/networksurvey/fragments/model/NrSecondaryCellSighting.java:33); CdrMmsObserver.queryAddresses(mmsId) (networksurvey/src/main/java/com/craxiom/networksurvey/listeners/CdrMmsObserver.java:113); CdrMmsObserver.submitEvent(subscriptionId) (networksurvey/src/main/java/com/craxiom/networksurvey/listeners/CdrMmsObserver.java:146); ICellularSurveyRecordListener.onCellularBatch(subscriptionId) (networksurvey/src/main/java/com/craxiom/networksurvey/listeners/ICellularSurveyRecordListener.java:82); ICellularSurveyRecordListener.onNetworkType(subscriptionId) (networksurvey/src/main/java/com/craxiom/networksurvey/listeners/ICellularSurveyRecordListener.java:93). Rename to \u0060generateClientId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/PreferenceUtils.java"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ba1eb1ab16729bc96978a0e5f32962bed7734db75995ace47b2f089224c6e3"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a1bd1aaa9e94ac15d0ddaf797252aee75d22258eedb0c48c9cd50c0540a5a8b"},"properties":{"commitSha":"76acef047afc4530885d70a82127d60fee76ddb0"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e398daf6185089a5ec601cbce1b61bb7eb16f63cc9d5a4e5659f8dfb0868d575"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ac1f2cc92980fb07174c10575e4b37d81c44bab8333014f744d59cc4385e47d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"363f16b7e9a0c795966df41aa917bd05e9a2034c4c9eb09b654bd0896190aae1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4b9fae17677891b8ecb42a411c7fdc6004e93a47a2d591fefdb8ff34b5d338c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"266a126b6d7972be8caf329ba83b00fa8f6b25dd28ccb8dd13db3eca2fe18a8a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"464b94db038f4cc5ea21be509499c457060ba36fae2784ff18ec193c8a86f339"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04ddb10a1651cb7df8056c80c4dec70ef626c8ee0f683326dd8d443b471d35fb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b24f735aacdffed713a18c713fe1123680fe9d89e167be1dca538694e7984d4e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eec2d84bde1b1feb4ba03d782ff022f7c005fa20e9512278408d5b0598b76026"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ae5d49a4508a422d1fed00c74d42c1ca735ee092d6bbee8969e6690587e0662"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41f465fba517ca7d0ad7cf54240b50b80446bb625a18c8b070d19ff0fa0c048c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dcd98370f21fa71cfc1219e6151d4d49488ed2c2349f2a65abe18650d75639e9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79a358a840db35d283fea3d9eb9a3893000872cbccf0790102627b60616892eb"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"67b215a5ee1628480f722e8831617b9057a7e49fd74e2c06cf914dc851f2ed63"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"623e36d0c1663a1a36342814bded8c1eca16da3ec088598b82fca57f1accd8fc"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"939d06d819545c3d0550cc9ff3472f1b3dc3d96d308e43a330caac61baae45d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8060acc373496ddc7338884b7bc770f35e1050a853915a3554ef1bc09fc0e9f6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb9d3151be4a430803cac0afdb5084a5531c073c57b06fdefb4dccd44e600a1c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"509f1d3f93ca5adcdb00ad35fd906bde9a9025abd8169887b73cd59aec821c0e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"009d7d92da1a47513f754cc04c0fbe41b566b49a26c25104b8aa830e16083d41"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94534611e54fd2f32d50fdc4b91f728c34dc148d3b701ebd517cf259da241077"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e950aae13d528ff4373bc83249616d6d4e57e6c927fc4c2844bec7849596e89"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"264781e0e762d89c19fa411ace15f9f6e6b09c050cbf66638c1405a8ea75b6d4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e136bf99acdce2b78828adb04add6830831b29e7b1473a3ca2657d8c9a99933"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0252673632ff181cefe79712e6fdc3f93bdb10a9586d5a6c6b01d9a39bed1bcc"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da300b0fd559dbfddfc5ff4ecd0ea43f1a5ba760f00e1822bdaaf27718fd5423"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"9d52657b2f4dc2e37c8203ec6c115e6e110d4332cb99b770e2e5da7c3d3fe71a"},"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":"D35","level":"warning","message":{"text":"Change-coupling hub: TowerSymbols.kt \u2192 TowerMapScreen.kt, TowerMapLibreViewModel.kt, MapLibreMap.kt, MapUpdater.kt, TowerBottomSheet.kt: \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/TowerSymbols.kt\u0060 changes together with 5 other files \u2014 \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/TowerMapScreen.kt\u0060, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt\u0060, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/MapLibreMap.kt\u0060, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/MapUpdater.kt\u0060, \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/TowerBottomSheet.kt\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/TowerSymbols.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"226ecbcf0e41edb4dc3ecdcfbfcaab2d5f59a2a43c0b317936e50e1265ad30dc"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: TowerMapScreen.kt \u2194 MapUpdater.kt: \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/TowerMapScreen.kt\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/MapUpdater.kt\u0060 change together 70% of the time (14 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) 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 14 shared commits counted here, the most recent 3 are \u006082e9a07b\u0060 Load towers onto the map through a session tile cache; \u0060d2f458a9\u0060 Use string MCC/MNC across the app to preserve leading zeros; \u00609a3f4d6b\u0060 #95 Add multi-tower display on the map with comments field support \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/TowerMapScreen.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcdc4be50a2a4ae157426bb868ae690b610a9842af2bceebfa74df9ef1e7453"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: MapLibreMap.kt \u2194 MapUpdater.kt: \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/MapLibreMap.kt\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/MapUpdater.kt\u0060 change together 65% of the time (11 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). 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 11 shared commits counted here, the most recent 3 are \u006082e9a07b\u0060 Load towers onto the map through a session tile cache; \u00609a3f4d6b\u0060 #95 Add multi-tower display on the map with comments field support; \u006021522455\u0060 Backup approaches to cleanup maplibre location listener when exiting \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/MapLibreMap.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c948605da21b7ebb824cae249a626fe9302d8c43df6ede8123b5552ec9ebad"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: TowerMapScreen.kt \u2194 MapLibreMap.kt: \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/TowerMapScreen.kt\u0060 and \u0060networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/MapLibreMap.kt\u0060 change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006082e9a07b\u0060 Load towers onto the map through a session tile cache; \u0060d345a731\u0060 Use different colors in the tower list and for the tower icons on the\u2026; \u0060ebfe7be6\u0060 Switch to OpenFreeMap if MapTiler has hit the limit or is unavailable \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/TowerMapScreen.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba7113080b2be92d7f61785e9f55e8a96b0ff09897bf932a089c24ad51b7d7f"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9359b7920472068d9fb5d8204d0208a8cf438164140bee1c9c88fe8f9ab8ad57"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ea3a6cb9e8f0b6653b4f38d7c3684bd78d0e0b8a044087e1a928863c402b664"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bf78cf5845300b528fe9de6a73436244d39070a8d94f12920642161826e34f1"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: SurveyRecordDao (35 abstract methods): \u0060SurveyRecordDao\u0060 declares 35 abstract methods: \u0060deleteAllCdmaRecords\u0060, \u0060deleteAllGsmRecords\u0060, \u0060deleteAllLteRecords\u0060, \u0060deleteAllNrRecords\u0060, \u0060deleteAllUmtsRecords\u0060, \u0060deleteAllWifiRecords\u0060, \u0060deleteUploadedCdmaRecords\u0060, \u0060deleteUploadedGsmRecords\u0060, \u0060deleteUploadedLteRecords\u0060, \u0060deleteUploadedNrRecords\u0060, \u0060deleteUploadedUmtsRecords\u0060, \u0060deleteUploadedWifiRecords\u0060, \u0060getCdmaRecordCountForUpload\u0060, \u0060getCdmaRecordsForUpload\u0060, \u0060getGsmRecordCountForUpload\u0060, \u0060getGsmRecordsForUpload\u0060, \u0060getLteRecordCountForUpload\u0060, \u0060getLteRecordsForUpload\u0060, \u0060getNrRecordCountForUpload\u0060, \u0060getNrRecordsForUpload\u0060, \u0060getUmtsRecordCountForUpload\u0060, \u0060getUmtsRecordsForUpload\u0060, \u0060getWifiRecordCountForUpload\u0060, \u0060getWifiRecordsForUpload\u0060, \u0060markCdmaRecordsAsUploadedToBeaconDb\u0060, \u0060markCdmaRecordsAsUploadedToOcid\u0060, \u0060markGsmRecordsAsUploadedToBeaconDb\u0060, \u0060markGsmRecordsAsUploadedToOcid\u0060, \u0060markLteRecordsAsUploadedToBeaconDb\u0060, \u0060markLteRecordsAsUploadedToOcid\u0060, \u0060markNrRecordsAsUploadedToBeaconDb\u0060, \u0060markNrRecordsAsUploadedToOcid\u0060, \u0060markUmtsRecordsAsUploadedToBeaconDb\u0060, \u0060markUmtsRecordsAsUploadedToOcid\u0060, \u0060markWifiRecordsAsUploadedToBeaconDb\u0060. Counted over its ABSTRACT methods, once per signature; \u0060default\u0060, \u0060static\u0060 and \u0060private\u0060 methods and constants 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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/dao/SurveyRecordDao.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0662153cd965e099d068af7fc349e35a745341d7b381f054d4ce8ee6b051488b"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: SurveyedPointDao (19 abstract methods): \u0060SurveyedPointDao\u0060 declares 19 abstract methods: \u0060insert\u0060, \u0060inBounds\u0060, \u0060inBoundsWhere\u0060, \u0060inBoundsRecent\u0060, \u0060byIds\u0060, \u0060coarse\u0060, \u0060coarseDominant\u0060, \u0060markUploaded\u0060, \u0060count\u0060, \u0060observeCount\u0060, \u0060observeCountByKind\u0060, \u0060observeSources\u0060, \u0060kindsSince\u0060, \u0060observeLatestNsAnalyticsMissionId\u0060, \u0060missionStartTime\u0060, \u0060observeMaxId\u0060, \u0060trimUploadedOldest\u0060, \u0060trimOldest\u0060, \u0060clear\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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/dao/SurveyedPointDao.kt"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"af45be5b3d7e262631d33a1ed22e7454a1c70f74bac231de368a1d3dd3e40029"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: SurveyOutputs (21 abstract methods): \u0060SurveyOutputs\u0060 declares 21 abstract methods: \u0060activeTypes\u0060, \u0060isRunning\u0060, \u0060probeDestination\u0060, \u0060probeRecordType\u0060, \u0060communityTargets\u0060, \u0060autoIncludePhoneState\u0060, \u0060mqttSendsWithoutRecordTypes\u0060, \u0060setFileLoggingEnabled\u0060, \u0060startMqtt\u0060, \u0060updateMqttTypes\u0060, \u0060stopMqtt\u0060, \u0060startNsAnalytics\u0060, \u0060updateNsAnalyticsTypes\u0060, \u0060stopNsAnalytics\u0060, \u0060startGrpc\u0060, \u0060updateGrpcTypes\u0060, \u0060stopGrpc\u0060, \u0060startCommunity\u0060, \u0060updateCommunityTypes\u0060, \u0060stopCommunity\u0060, \u0060endMissionSession\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":"networksurvey/src/main/java/com/craxiom/networksurvey/survey/engine/SurveyOutputs.kt"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3ad162d327bc00fe608af3e885806405a3ce4f1da2504cfdf26e2e44d7baf5"}},{"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":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add spotbugs with find-sec-bugs (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/android.yaml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060build.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":"build.gradle"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6315a7594cc33d6b975417119bbbeb33eef8acada489d1b9fa646cbfb1507a6"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Build.VERSION.SDK_INT \u003E= Build.VERSION_CODES.S \u0026\u0026 locationManager.isProviderEnabled(LocationManager.FUSED_PROVIDER)\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java, networksurvey/src/main/java/com/craxiom/networksurvey/util/LocationUtils.java. 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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2420e66b4b8512181b363814f8c07811f1ef1153576c7f4e0fdb65571e1e7786"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060batteryMonitor != null \u0026\u0026 batteryMonitor.isPausedDueToBattery()\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/AutoUploadManager.java, networksurvey/src/main/java/com/craxiom/networksurvey/services/NetworkSurveyService.java. 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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/uploader/AutoUploadManager.java"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2bec1585056d5b7ff6da34bc0036f6f053de92038d37b606d637fe8d6e19fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bluetoothRecords == null || bluetoothRecords.isEmpty()\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/NsAnalyticsDataStore.java, networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java. 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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/NsAnalyticsDataStore.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a46f2a6c4074b9d88baa181637bc1875fa927ddd8994c1d993faf8120e34eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wifiBeaconRecords == null || wifiBeaconRecords.isEmpty()\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/NsAnalyticsDataStore.java, networksurvey/src/main/java/com/craxiom/networksurvey/services/SurveyRecordProcessor.java. 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":"networksurvey/src/main/java/com/craxiom/networksurvey/logging/db/NsAnalyticsDataStore.java"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c057858b7626ae5fead7fc34ae0d439c11c3d8d8fb903d215fa4c24a49482e04"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!context.hasPermission(Manifest.permission.ACCESS_FINE_LOCATION) || !context.hasPermission(Manifest.permission.ACCESS_COARSE_LOCATION)\u0060 appears character-identically in 5 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/gnss/data/SharedGnssMeasurementManager.kt, networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/gnss/data/SharedGnssStatusManager.kt, networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/gnss/data/SharedLocationManager.kt, networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/gnss/data/SharedNmeaManager.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":"networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/gnss/data/SharedGnssMeasurementManager.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"04494eff7a7b9f35fa26505fe8ccbdabbe8b2043ce90297cc1f79aa43befbb6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!listState.isScrollInProgress \u0026\u0026 listState.firstVisibleItemIndex == 0 \u0026\u0026 listState.firstVisibleItemScrollOffset == 0\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/list/BluetoothListContent.kt, networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/WifiListContent.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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/list/BluetoothListContent.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc39edea4873821f8bcc57a39da3de949795f460412553c5aebd6da1e8097a67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!settings.liveViews || (last != null \u0026\u0026 nowMs - last \u003C settings.snapshotIntervalMs)\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/scout/clients/ScoutClientPipeline.kt, networksurvey/src/main/java/com/craxiom/networksurvey/scout/wifi/ScoutWifiPipeline.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":"networksurvey/src/main/java/com/craxiom/networksurvey/scout/clients/ScoutClientPipeline.kt"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"efef2547a1e6dda4a2ff3c6274f5ab94a35d65c60ff61221332c7ba520bb6ea0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060form.allTypesManaged \u0026\u0026 form.allDestinationsManaged\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/model/RecordingUiMapper.kt, networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/model/SurveyUiStateMapper.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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/survey/model/RecordingUiMapper.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"32909fe3f1c608a4e5164cd1cdde40408bbf0b6baf59fe80b22b0ba23c13970a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it?.cellularRecord != null \u0026\u0026 CellularUtils.isServingCell(it.cellularRecord)\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt, networksurvey/src/main/java/com/craxiom/networksurvey/ui/map/MapTabViewModel.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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/TowerMapLibreViewModel.kt"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87a0773e873d9f91f24a557b0e9f74b034bd9eda7a6f61f133dae101d5eadef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060locationManager != null \u0026\u0026 !LocationManagerCompat.isLocationEnabled(locationManager)\u0060 appears character-identically in 4 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/GnssEnvironment.kt, networksurvey/src/main/java/com/craxiom/networksurvey/ui/bluetooth/list/model/BluetoothEnvironment.kt, networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/details/CellularEnvironment.kt, networksurvey/src/main/java/com/craxiom/networksurvey/ui/wifi/model/WifiEnvironment.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":"networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/GnssEnvironment.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"00eacbc579463301a8f40f1c563744530505280be3358366b83b88fa3c0cbfbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060maxWidth \u003E= GNSS_TWO_PANE_MIN_WIDTH \u0026\u0026 maxWidth \u003E maxHeight\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/sky/SkyPage.kt, networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/status/StatusPage.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":"networksurvey/src/main/java/com/craxiom/networksurvey/gpstest/ui/sky/SkyPage.kt"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb57505ac069ef66795ebbb4bd7f13781dbe38c60ab4105f0a01b95657d6c9c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pausedForBattery || pausedForBackpressure\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/notification/SurveyNotificationState.kt, networksurvey/src/main/java/com/craxiom/networksurvey/ui/main/SurveyStatusViewModel.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":"networksurvey/src/main/java/com/craxiom/networksurvey/notification/SurveyNotificationState.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb44bb6650e186324cdb005b1fae0fb3779dcd844e97bed98ad904e0d16787c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.result == ResultCode.RESULT_CODE_OK || response.result == ResultCode.RESULT_CODE_INCOMPATIBLE\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/scout/firmware/FirmwareInstaller.kt, networksurvey/src/main/java/com/craxiom/networksurvey/scout/link/ScoutSession.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":"networksurvey/src/main/java/com/craxiom/networksurvey/scout/firmware/FirmwareInstaller.kt"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c30b3e12653b5e45108e40965909defa1b7ba7eb9de0d15fb21043e7b58065f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scoutManager.pairedScout.value != null \u0026\u0026 scoutManager.wifiSource.value == WifiSource.SCOUT\u0060 appears character-identically in 2 files \u2014 networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/WifiClientsController.kt, networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/WifiRawController.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":"networksurvey/src/main/java/com/craxiom/networksurvey/services/controller/WifiClientsController.kt"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc538315b4bc84e3cd4dc45359e7a9ce89f1241c9c32a19f2d4c0cc5c1f39212"}},{"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":"networksurvey/src/regular/java/com/craxiom/networksurvey/util/NsCrashReporter.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e769db5a00c9aeb1280e62903471304619c919f0692d403d0e069340a81ea66a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/util/CellularUtils.java"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd5d608c42659b3469828f4a4866b47b8b9e62fe0f563c6262e77ac8755efe4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (t: Throwable)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/oui/OuiLookupViewModel.kt"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf3ca474e4476e4fe945cd77ede131109a1548a1d669bc5d96962076262ba71"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/nsanalytics/NsAnalyticsRegistration.kt"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a5a29eba7a46d808cd2c3412b81c3d1d5740938139ab3e8ff19c0329d6d791"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (t: Throwable)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/manufacturer/ManufacturerUiState.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fff21f0f11334dcd2a44d15332f43ed90d329ce254756c22752abf77d7e20b"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/Circle.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74d823e535fa36b7e85aeb9b35cf1f5bc6f468d66c6f300feab5a73b3ff6207"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/Circle.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e76cbd10efb3623b0ac8a2c4e6b29fdf500501fe188ba625779f9c214bb368"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/Circle.kt"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b89cba2b933406f8d37a16b7c19b8be9a3ef4ffcdc7373d5bbf9b23a8454a6"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/Circle.kt"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f271fb127aeec7ec050c1dbb625a08093d66fa42550dbbb8e19cb0ad2c842a7a"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/Circle.kt"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cba9c6de04c9ca42c15f93bc24a1baa8f85b6b92b3556d680a835848766560"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/Circle.kt"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ca31bcd43ce399b9779d591e09e38ea5e9e3dfaffd255c355d2f5097670a41"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/DistanceSymbol.kt"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c5620f0e3c88a12e01b8599000ec28b416e1413d5b189cdec341f73d188e0a"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/LineString.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2be5d5dc2e5067a1f9c93f140b8ce9c4234fbd08b3d5422c3398062b078945"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/LineString.kt"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2002c431771b0c5d2eebbcd4951317ebed3d099f89dae7d0c11bd5ccc420beed"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/LineString.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd3647e2e3c2a40019bec893724cb986a363242585f7db2b974235d90bd9492"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/LineString.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f8de5a01d50f4375ae8e74b159cf1bf0552c97fa4b807635907678143a835b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/LineString.kt"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"475c32fb1bf2cdb999a92bf1097c12af384b76d25fbaf6327c0a7f2c16610028"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/SearchResultSymbols.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a700c710cb9632f1bd84f2f8c12f009d42f08dde46cf0ad464d3380667740eb5"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/SearchResultSymbols.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1cdab1ef171f165766a1b2938386bd5653d1975f049f88d940e2a1d5fceef9"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/SurveyedPoints.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4c6dbb314a51ea0b59eec1444ade6591517c0626ec9740447532c627e27ccc"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/SurveyedPoints.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77dde40c92ea9716012571e6e538ce3edd31b01a0b73447784efe01049eb79c"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/TowerSymbols.kt"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb9c41d5f9e30718f79a0c1948013719508adb41adc95bbed36c2d5eb53158c"}},{"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":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/towermap/TowerSymbols.kt"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cc1166374bf8a886c5b099447e324e420f6eae2d1d3d5a46f3408260844c9a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/ui/cellular/model/SurveyedPointsController.kt"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8050ebc051364f55a1c37d8afe94a2451bfe44f45549f3f92cf1e2863e8fae7f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (t: Throwable)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/data/ManufacturerResolver.kt"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"50401ae104bce8e7c03644c322cacb4f2e32a2bf397bec995ea1c47fa2d0f4b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (t: Throwable)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/data/ManufacturerResolver.kt"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adb7e8071d37ef03b4c45f6b28b24ccc438dba5c152d09af12674e1ea70d7c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (t: Throwable)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"networksurvey/src/main/java/com/craxiom/networksurvey/data/oui/OuiRepository.kt"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0004af1a26f00341e839ea5b97cdee0a61a6423768cc3a986ed3562453605cc5"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-926","guid":"0d9b5579-5549-555a-8a97-f9cc14f3ad4a","name":"Improper Export of Android Application Components","shortDescription":{"text":"Improper Export of Android Application Components"},"helpUri":"https://cwe.mitre.org/data/definitions/926.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":36,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}