{"$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":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D38","name":"OSV Dependency Vulnerabilities","shortDescription":{"text":"OSV Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D38","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"StreamingHprofReader.readRecords (cyclomatic 60): StreamingHprofReader.readRecords has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-hprof/src/main/java/shark/StreamingHprofReader.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4637c9fba5bd6b544463c46112a64fcfc5d8693d57d9a201fbb26f6b164ffc1c"}},{"ruleId":"D1","level":"warning","message":{"text":"HprofPrimitiveArrayStripper.stripPrimitiveArrays (cyclomatic 43): HprofPrimitiveArrayStripper.stripPrimitiveArrays has cyclomatic complexity 43 (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":"shark/shark-hprof/src/main/java/shark/HprofPrimitiveArrayStripper.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d86d6b2c8e3628bae8d9aa78ad161bb4250d13c8ad7809e4c603d04b7160c50"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.onHprofRecord (cyclomatic 41): Builder.onHprofRecord has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-graph/src/main/java/shark/internal/HprofInMemoryIndex.kt"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7c29f583b33fc3ee116f03595b30e8f588a4c4592e032bd7979e8681f3943c"}},{"ruleId":"D1","level":"warning","message":{"text":"ObjectGrowthDetector.traverseHeapDiffingShortestPaths (cyclomatic 37): ObjectGrowthDetector.traverseHeapDiffingShortestPaths has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark/src/main/java/shark/ObjectGrowthDetector.kt"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce34556cc6a62c54bbe339f7ef63136063d36c3f5321f90e530e6a9a26c197d"}},{"ruleId":"D1","level":"warning","message":{"text":"Neo4JCommand.dumpEdges (cyclomatic 23): Neo4JCommand.dumpEdges has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-cli/src/main/java/shark/Neo4JCommand.kt"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7952fc33b41d66671ffcf59522cb8d509ef54708b3eb98a77a135c37369b9ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"HeapDumpRenderer.render (cyclomatic 20): HeapDumpRenderer.render has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/HeapDumpRenderer.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"053b3711aebe39619fde8840a2dd9dcb4fa5e29b88485e8463abb98cf9de7f33"}},{"ruleId":"D1","level":"warning","message":{"text":"AndroidObjectInspectorsKt.unwrapComponentContext (cyclomatic 20): AndroidObjectInspectorsKt.unwrapComponentContext has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-android/src/main/java/shark/AndroidObjectInspectors.kt"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e05ef6ea49bf42ddc9c6d7394cb7d404506a61ac35d4a70cca4289e52b46682"}},{"ruleId":"D1","level":"warning","message":{"text":"RealLeakTracerFactory.computeLeakStatuses (cyclomatic 20): RealLeakTracerFactory.computeLeakStatuses has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark/src/main/java/shark/RealLeakTracerFactory.kt"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d8c42c9be9cce0ac8ba7a53563e73698468fc08d3a6f0f81157fe74afdb048"}},{"ruleId":"D1","level":"warning","message":{"text":"HeapGrowthCommand.run (cyclomatic 19): HeapGrowthCommand.run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-cli/src/main/java/shark/HeapGrowthCommand.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca66609935aac01d3ec35cea23477168ef2887158b98e5bbbf6682315bd06590"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamingRecordReaderAdapter.asHprofTags (cyclomatic 19): StreamingRecordReaderAdapter.asHprofTags has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-hprof/src/main/java/shark/StreamingRecordReaderAdapter.kt"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1695503839ac759d3bade7d31363265789ca77cdcf5c75d1d8b8a9ba2ae7de"}},{"ruleId":"D1","level":"warning","message":{"text":"MatchingGcRootProvider.provideGcRoots (cyclomatic 17): MatchingGcRootProvider.provideGcRoots 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":"shark/shark/src/main/java/shark/MatchingGcRootProvider.kt"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bcd90b152e3baeeae8920bcbd850a802073166593a0a5ff181d6f4485c3259"}},{"ruleId":"D1","level":"warning","message":{"text":"HprofExplorerScreen.heapValueAsString (cyclomatic 16): HprofExplorerScreen.heapValueAsString has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/HprofExplorerScreen.kt"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c601e78a89beb784d2f1f00a64d0188d8fae633cdb575ed2a38bd9f6fd5bae"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingHprofReader.readRecords (cognitive 135): StreamingHprofReader.readRecords has cognitive complexity 135 (threshold 15). Drivers by points: if/else 125, match/switch 6, loops 4 (nesting depth added 102). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-hprof/src/main/java/shark/StreamingHprofReader.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"caacdaceb92819f2d21aa122cff64f0ad3dd156b8d63c8b254ba4e39fce915f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectGrowthDetector.traverseHeapDiffingShortestPaths (cognitive 66): ObjectGrowthDetector.traverseHeapDiffingShortestPaths has cognitive complexity 66 (threshold 15). Drivers by points: if/else 47, loops 12, boolean chains 4, match/switch 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark/src/main/java/shark/ObjectGrowthDetector.kt"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f39f57e099cce88fb2a69c3e20ef5ca61be6b6823371598d2a7994315c30618"}},{"ruleId":"D2","level":"warning","message":{"text":"LeakCanaryFileProvider.parsePathStrategy (cognitive 42): LeakCanaryFileProvider.parsePathStrategy has cognitive complexity 42 (threshold 15). Drivers by points: if/else 41, loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/LeakCanaryFileProvider.kt"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06bed64d392c0509f66215c917153d7eb3bb24f345bf0e3bb0d24e35b521e57"}},{"ruleId":"D2","level":"warning","message":{"text":"HprofPrimitiveArrayStripper.stripPrimitiveArrays (cognitive 42): HprofPrimitiveArrayStripper.stripPrimitiveArrays has cognitive complexity 42 (threshold 15). Drivers by points: if/else 25, match/switch 12, loops 4, boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-hprof/src/main/java/shark/HprofPrimitiveArrayStripper.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"210b7826eab5aa292daf132503f6037ba1513fc28d89c5d9871e26a57300c8e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.onHprofRecord (cognitive 39): Builder.onHprofRecord has cognitive complexity 39 (threshold 15). Drivers by points: if/else 34, loops 4, match/switch 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-graph/src/main/java/shark/internal/HprofInMemoryIndex.kt"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ca783a8d8c47d8251dae46f1014dc43640412a13dfefdfee1c93ea9fcb34a0"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidObjectInspectorsKt.unwrapComponentContext (cognitive 38): AndroidObjectInspectorsKt.unwrapComponentContext has cognitive complexity 38 (threshold 15). Drivers by points: if/else 31, match/switch 4, boolean chains 2, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-android/src/main/java/shark/AndroidObjectInspectors.kt"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0caf06e78ae943169ee4a9f34603c59319a7b1b1143a5c3ed475e38f71139d0"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayLeakAdapter.getConnectorType (cognitive 37): DisplayLeakAdapter.getConnectorType has cognitive complexity 37 (threshold 15). Drivers by points: if/else 30, match/switch 7 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/DisplayLeakAdapter.kt"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ea04f30bf139a2813a0403554511709e2fb588db422f71c44a56160f3bc895"}},{"ruleId":"D2","level":"warning","message":{"text":"HeapGrowthCommand.run (cognitive 37): HeapGrowthCommand.run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18, match/switch 11, loops 7, boolean chains 1 (nesting depth added 22). 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":"shark/shark-cli/src/main/java/shark/HeapGrowthCommand.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fece7078007de861ccc1f0524f8b065a88cae3b88ad6b3c1c4e648fa9be8b620"}},{"ruleId":"D2","level":"warning","message":{"text":"HeapDumpTrigger.checkRetainedCount (cognitive 31): HeapDumpTrigger.checkRetainedCount has cognitive complexity 31 (threshold 15). Drivers by points: if/else 30, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/HeapDumpTrigger.kt"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d69845a92c5b3e89d79464e2e74a2e6891cc7f6fc625c2e262799f80563d65b"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingRecordReaderAdapter.asHprofTags (cognitive 29): StreamingRecordReaderAdapter.asHprofTags has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23, boolean chains 6 (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":"shark/shark-hprof/src/main/java/shark/StreamingRecordReaderAdapter.kt"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b694a7741a011802c83f41fd19bbab4797297e64736916e86b68a0424443e199"}},{"ruleId":"D2","level":"warning","message":{"text":"RealLeakTracerFactory.computeLeakStatuses (cognitive 24): RealLeakTracerFactory.computeLeakStatuses has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, match/switch 8, loops 4, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark/src/main/java/shark/RealLeakTracerFactory.kt"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"793c1384183d74832f0f247e888f29063bc2c0781c2e1fa342f201b0f5a7bf82"}},{"ruleId":"D2","level":"warning","message":{"text":"TreemapLayout.squarifyRatio (cognitive 23): TreemapLayout.squarifyRatio has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 5, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-app/src/main/java/org/leakcanary/screens/TreemapLayout.kt"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd1d595cfeb87391a578a9e2c12e2aaec56683ab109e1a8d867a38536a1b10e"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldInstanceReferenceReader.read (cognitive 23): FieldInstanceReferenceReader.read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 5, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark/src/main/java/shark/FieldInstanceReferenceReader.kt"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed35484401cb1dfa10075a3899fcf43f1d112dba664fd09f463f07459ee33a4"}},{"ruleId":"D2","level":"warning","message":{"text":"DominatorTree.updateDominated (cognitive 22): DominatorTree.updateDominated has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, loops 6, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark/src/main/java/shark/DominatorTree.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3124b6d8a510ecf8e788e32189ae2aedb3f6677b93398085ba5752edbdd7e53"}},{"ruleId":"D2","level":"warning","message":{"text":"HeapDumpRenderer.render (cognitive 20): HeapDumpRenderer.render has cognitive complexity 20 (threshold 15). Drivers by points: loops 8, if/else 5, match/switch 4, boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/HeapDumpRenderer.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00d39d6213d308cc2e610236e35c97b36f4e13873bed5b38c33d60196e2bb07"}},{"ruleId":"D2","level":"warning","message":{"text":"VIEW.inspect (cognitive 20): VIEW.inspect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-android/src/main/java/shark/AndroidObjectInspectors.kt"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5693e2ee8fa686ff294ef4b598aaf1468f0398bfcb78b91431cfd98d013c0248"}},{"ruleId":"D2","level":"warning","message":{"text":"LeakTraceWrapper.wrapLine (cognitive 19): LeakTraceWrapper.wrapLine has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/LeakTraceWrapper.kt"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f09e3be0c6e380ee455dadd414936eeb881cd7ca643fd3b93803dda039d06a"}},{"ruleId":"D2","level":"warning","message":{"text":"LeakTraceWrapper.wrapLine (cognitive 19): LeakTraceWrapper.wrapLine has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-app/src/main/java/org/leakcanary/util/LeakTraceWrapper.kt"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee86e09f28177276151ee3a61ea1480c5505cc865db4bf181e7cabce3cd4f298"}},{"ruleId":"D2","level":"warning","message":{"text":"CONTEXT_WRAPPER.inspect (cognitive 19): CONTEXT_WRAPPER.inspect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-android/src/main/java/shark/AndroidObjectInspectors.kt"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4024ed80e087b1a87acb792319cf5bb21acb2983f0dee1fc60d3f8efbfcf6618"}},{"ruleId":"D2","level":"warning","message":{"text":"Neo4JCommand.dumpEdges (cognitive 19): Neo4JCommand.dumpEdges has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, match/switch 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-cli/src/main/java/shark/Neo4JCommand.kt"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9f5e5d9cca6389e4fc07f84eb34c57c5fced5e231d9cf04a399bbb9f2d617a"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayLeakAdapter.bindConnectorRow (cognitive 18): DisplayLeakAdapter.bindConnectorRow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, match/switch 3, boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/DisplayLeakAdapter.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdfc5d520d874801905f1768037b305afceeea3aa8a74053ea4db8391759881"}},{"ruleId":"D2","level":"warning","message":{"text":"LeakScreenKt.LeakScreen (cognitive 17): LeakScreenKt.LeakScreen has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-app/src/main/java/org/leakcanary/screens/LeakScreen.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3797127dcbcf7471ddc7cba223f1e680fbcd636bd02f27ce75e6e1a9be6d429c"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalSharedHashMapReferenceReader.read (cognitive 16): InternalSharedHashMapReferenceReader.read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"shark/shark/src/main/java/shark/internal/InternalSharedExpanderHelpers.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b453242a808d8a3eaba02065a27ad4a1b2501ecf5fd0de6e47de3927a75ff3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shark/AndroidReferenceMatchers.kt: FileTooLong \u2014 1103 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: class (50-1682). 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":"shark/shark-android/src/main/java/shark/AndroidReferenceMatchers.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5c641d9b740c1a0e46ee24fa07e117d5ca41866000dfac83679149eb0783d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HprofRecordReader: TooManyMethods \u2014 64 methods. 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":"shark/shark-hprof/src/main/java/shark/HprofRecordReader.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"136e75bb6952afbf496aac3ae1c906752402291e03f34e8f2e108c23f4883625"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shark/AndroidObjectInspectors.kt: FileTooLong \u2014 693 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: class (40-936). 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":"shark/shark-android/src/main/java/shark/AndroidObjectInspectors.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f090a9225511b3c28f9e23ff17255f7a99dd8c109602d531aa1cf580f7f9790"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/HprofInMemoryIndex.kt: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: stickyClassGcRootIds (70-788). 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":"shark/shark-graph/src/main/java/shark/internal/HprofInMemoryIndex.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10074e0bda76453c356b426ba0eb251dee43430ea3e10e8e82eb447c89a890a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shark/Neo4JCommand.kt: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: Neo4JCommand (79-694). 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":"shark/shark-cli/src/main/java/shark/Neo4JCommand.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08e25cbe1cc5d32e1774488f84f4f261e934f109b3b042266f9bdc481c6ba68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:384-403 | shark/shark-graph/src/main/java/shark/internal/hppc/LongObjectScatterMap.kt:333-352 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:384\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":"shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"34dffd9add102b0f877159d475912ed090d6eb88b1c86445d0fc4609c8293b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/ui/TimeFormatter.kt:23-41 | leakcanary/leakcanary-app/src/main/java/org/leakcanary/util/TimeFormatter.kt:23-41 \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 \u0060leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/ui/TimeFormatter.kt:23\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":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/ui/TimeFormatter.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b47ecb82b42cff6a3e24130eec45428a5c20aef2288aaf7f7d0d55a4f945e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/LeakTraceWrapper.kt:110-127 | leakcanary/leakcanary-app/src/main/java/org/leakcanary/util/LeakTraceWrapper.kt:110-127 \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":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/LeakTraceWrapper.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b32500dccbe44e82ad5aabe17a48984fbb8c610a3bd22f14c395bfb872c7db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:95-110 | shark/shark-graph/src/main/java/shark/internal/hppc/LongObjectScatterMap.kt:91-106 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:95\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"351b1f3e8739a38a7c029fef220815538ba307c2bc9dfe0dd138c74d3a6c4712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/AndroidDebugHeapAnalyzer.kt:163-177 | leakcanary/leakcanary-android-instrumentation/src/main/java/leakcanary/internal/InstrumentationHeapAnalyzer.kt:71-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/AndroidDebugHeapAnalyzer.kt:163\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":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/AndroidDebugHeapAnalyzer.kt"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b38d582c2e358181d47c8ea10017494fe0b2b8bbae0813ed9cb5bfd64e5aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/LeakTraceWrapper.kt:29-43 | leakcanary/leakcanary-app/src/main/java/org/leakcanary/util/LeakTraceWrapper.kt:29-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/LeakTraceWrapper.kt:29\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":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/LeakTraceWrapper.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53f1f660241a0d0c8ecb64b82326299140cfa884679e33dff06a944d9ec13b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:323-337 | shark/shark-graph/src/main/java/shark/internal/hppc/LongObjectScatterMap.kt:272-286 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:323\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":"shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df6c5e55b19e66a9dbd02ebf8ce13dffe7e9c0866c2851d54ca0b413fd94b09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/AndroidDebugHeapAnalyzer.kt:145-158 | leakcanary/leakcanary-android-instrumentation/src/main/java/leakcanary/internal/InstrumentationHeapAnalyzer.kt:53-66 \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 \u0060leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/AndroidDebugHeapAnalyzer.kt:145\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/AndroidDebugHeapAnalyzer.kt"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bc554c99259c7a311f0bd04d39727498f5d3facc6cea145dabb737055ccc2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): shark/shark-hprof-test/src/main/kotlin/shark/HprofWriterHelper.kt:138-151 | shark/shark-hprof-test/src/main/kotlin/shark/HprofWriterHelper.kt:193-206 \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 \u0060shark/shark-hprof-test/src/main/kotlin/shark/HprofWriterHelper.kt:138\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":"shark/shark-hprof-test/src/main/kotlin/shark/HprofWriterHelper.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35808602a38dc9ef465e5f817209d1d2bda6e821dcac7a14f984f07512b4d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:237-251 | shark/shark-graph/src/main/java/shark/internal/hppc/LongObjectScatterMap.kt:185-199 | shark/shark-graph/src/main/java/shark/internal/hppc/LongScatterSet.kt:135-147 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:237\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":"shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1078dbe4d7f16da25cf2ef797561161f8a4e6e0a7c33b1c8367204c7805cd89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/HeapDumpTrigger.kt:247-259 | leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/HeapDumpTrigger.kt:367-379 \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":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/HeapDumpTrigger.kt"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"10edf26f6466a51f8a3cfe9783fdbc25fb60cba839b62839ecb36cf2f329f2bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): shark/shark-graph/src/main/java/shark/internal/ClassFieldsReader.kt:34-46 | shark/shark-hprof/src/main/java/shark/HprofRecordReader.kt:238-252 \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":"shark/shark-graph/src/main/java/shark/internal/ClassFieldsReader.kt"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c214028fd4f985019693e06a93dda37862de573c1789241297ab29a820d763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:120-132 | shark/shark-graph/src/main/java/shark/internal/hppc/LongObjectScatterMap.kt:116-128 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92ecd5ee1d218bdea02a3a1d201a0b34f99187bd73b2287f7e91185ab393117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): shark/shark/src/main/java/shark/ApacheHarmonyInstanceRefReaders.kt:42-54 | shark/shark/src/main/java/shark/ApacheHarmonyInstanceRefReaders.kt:63-76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shark/shark/src/main/java/shark/ApacheHarmonyInstanceRefReaders.kt:42\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":"shark/shark/src/main/java/shark/ApacheHarmonyInstanceRefReaders.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7833875c4799e861a83f047476d7ed5d831fa4dc05c28d0d8c62fe8f8e57edb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): shark/shark/src/main/java/shark/OpenJdkInstanceRefReaders.kt:42-54 | shark/shark/src/main/java/shark/OpenJdkInstanceRefReaders.kt:63-75 \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 \u0060shark/shark/src/main/java/shark/OpenJdkInstanceRefReaders.kt:42\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":"shark/shark/src/main/java/shark/OpenJdkInstanceRefReaders.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf239be012a28d33eca569924b5b30736de9ab7fb6c581d1bd806b86e9d06608"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): shark/shark-cli/src/main/java/shark/Neo4JCommand.kt:254-264 | shark/shark/src/main/java/shark/RealLeakTracerFactory.kt:519-529 \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 \u0060shark/shark-cli/src/main/java/shark/Neo4JCommand.kt:254\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":"shark/shark-cli/src/main/java/shark/Neo4JCommand.kt"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1396c430d0f4090cc47c267412b6897472fd092caafc7a09cacf97e2ccf94de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:298-308 | shark/shark-graph/src/main/java/shark/internal/hppc/LongObjectScatterMap.kt:246-256 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt:298\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":"shark/shark-graph/src/main/java/shark/internal/hppc/LongLongScatterMap.kt"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1e8548c0d1819960b3a12269e67a79eb86ed3d3d21c86372853a0968a44e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): shark/shark-cli/src/main/java/shark/Neo4JCommand.kt:313-322 | shark/shark-cli/src/main/java/shark/Neo4JCommand.kt:623-632 \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 \u0060shark/shark-cli/src/main/java/shark/Neo4JCommand.kt:313\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":"shark/shark-cli/src/main/java/shark/Neo4JCommand.kt"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b66762dace003b9e35e1821d21f10092467b5129e372ff1e41e3ee7fa00b0b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): shark/shark/src/main/java/shark/AndroidReferenceReaders.kt:293-301 | shark/shark/src/main/java/shark/internal/InternalSharedExpanderHelpers.kt:75-83 \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 \u0060shark/shark/src/main/java/shark/AndroidReferenceReaders.kt:293\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":"shark/shark/src/main/java/shark/AndroidReferenceReaders.kt"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2c2da33e006811f86dfb0670747ef71cefdf5bb3755d42a9052a96b93d2e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): shark/shark-graph/src/main/java/shark/internal/ClassFieldsReader.kt:110-117 | shark/shark-graph/src/main/java/shark/internal/FieldValuesReader.kt:38-45 | shark/shark-hprof/src/main/java/shark/HprofRecordReader.kt:442-449 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shark/shark-graph/src/main/java/shark/internal/ClassFieldsReader.kt:110\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":"shark/shark-graph/src/main/java/shark/internal/ClassFieldsReader.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"66aad4b8ab4551aa5a0378140e71018db542eff3566cc4b6d4409f65c9c6b2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): shark/shark-graph/src/main/java/shark/internal/PagedUnsortedByteEntries.kt:88-95 | shark/shark-graph/src/main/java/shark/internal/PagedUnsortedByteEntries.kt:116-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-graph/src/main/java/shark/internal/PagedUnsortedByteEntries.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c10e1847a55a921f7bbb1dbda4f42965856f7e18be47c78868e2b283cd06a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): shark/shark-graph/src/main/java/shark/internal/UnsortedByteEntries.kt:134-141 | shark/shark-graph/src/main/java/shark/internal/UnsortedByteEntries.kt:168-175 \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":"shark/shark-graph/src/main/java/shark/internal/UnsortedByteEntries.kt"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7abe0219bedd703faca8c6a5361b603c6ceb258439e0eb5fa6e89536b33485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): shark/shark-graph/src/main/java/shark/internal/UnsortedByteEntries.kt:97-102 | shark/shark/src/main/java/shark/internal/FieldIdReader.kt:63-68 \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 \u0060shark/shark-graph/src/main/java/shark/internal/UnsortedByteEntries.kt:97\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":"shark/shark-graph/src/main/java/shark/internal/UnsortedByteEntries.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fd4dd530721e223020f63fba30c93fc7012bdd425f2ff76fcfd79a3aadba1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): shark/shark-graph/src/main/java/shark/internal/ByteSubArray.kt:92-96 | shark/shark-graph/src/main/java/shark/internal/UnsortedByteEntries.kt:98-102 | shark/shark/src/main/java/shark/internal/FieldIdReader.kt:64-68 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shark/shark-graph/src/main/java/shark/internal/ByteSubArray.kt:92\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":"shark/shark-graph/src/main/java/shark/internal/ByteSubArray.kt"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e15c003f1216a7cfb1721a9b17b864f1a57fa8bf2d1a79799f88d9a65919730"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/HeapDumpScreen.kt:117-121 | leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/LeaksScreen.kt:52-56 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/activity/screen/HeapDumpScreen.kt"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"af066b71862e08099d9eb740e77d07db06cfeba2fb269bfd1c449d2a77f0d464"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: shark/shark-graph/src/main/java/shark/internal/HprofInMemoryIndex.kt: shark/shark-graph/src/main/java/shark/internal/HprofInMemoryIndex.kt changed 2 times in last 90 days, max complexity 41. 1 of those changes was a fix/bug commit, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-graph/src/main/java/shark/internal/HprofInMemoryIndex.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d0535cf5bd5107719f50864fc924bfb7fc07917dbd4a244f0c06903707667a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: shark/shark-android/src/main/java/shark/AndroidObjectInspectors.kt: shark/shark-android/src/main/java/shark/AndroidObjectInspectors.kt changed 2 times in last 90 days, max complexity 20. 1 of those changes was a fix/bug commit, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shark/shark-android/src/main/java/shark/AndroidObjectInspectors.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"352a60f2b3305ae637e3d43d77f2f844b97566a79f7fe2e2480015511e760a01"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 7 significant file(s) lose their only recent owner: shark/shark-graph/src/main/java/shark/internal/HprofInMemoryIndex.kt, shark/shark/src/main/java/shark/ObjectGrowthDetector.kt, leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/HeapDumpTrigger.kt, shark/shark-graph/src/main/java/shark/internal/UnsortedByteEntries.kt, shark/shark-graph/src/main/java/shark/internal/SortedBytesMap.kt, object-watcher/object-watcher-android-androidx/src/main/java/leakcanary/internal/ViewModelClearedWatcher.kt, leakcanary/leakcanary-android-core/src/main/java/leakcanary/ToastEventListener.kt. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"45b37958ef17e8f8a7d053eea76501d154d80c938527d96f83662437f9d5af37"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: plumber/plumber-android-core/src/main/java/leakcanary/AndroidLeakFixes.kt, leakcanary/leakcanary-android-core/src/main/java/leakcanary/internal/Notifications.kt, plumber/plumber-android-core/src/main/java/leakcanary/FixedWindowCallback.java, leakcanary/leakcanary-android-release/src/main/java/leakcanary/ProcessInfo.kt. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"673013eefebbbca024c518d0cc194cbbadec9472192bd422ee21857f4c3b1c09"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (14 single-owned of 139 analysed files in total, counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). They are anonymized user #3 (2 file(s)), anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"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":"c80dca565b7addf45deb8318304c24d455a4728a3eee1235988797ba07070971"},"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"}}]},{"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":"3f24cd2d7437babffa17560a4abd3ebb43f76493c23e407417ec053405a413cb"},"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"}}]},{"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":"21fb7b0f0caacef12f470df760ea77b743af471f50708245a694360ae88f4d96"},"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"}}]},{"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":"ca61bceba8b0c35f1810bc07bd3e914a2057aac434662663b001a77941c0e9d9"},"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"}}]},{"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":"da239b2735a15edc795c0b1835962707d1a8aa85ffe892af8611d0b638fb5090"},"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"}}]},{"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":"26037a393fff3bb1a153a8c22449a8b627d69a4471a4103792b49a30d462fa97"},"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"}}]},{"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":"699f1f698e9ce136b4f3273029ae2d15e5e64c24edcbd0c3dd755e5097d5e560"},"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"}}]},{"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":"a70ad95836bb7ddd726f1be5a0366a5443e76e667064891a9cefcf56288370c9"},"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"}}]},{"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":"afb8280b270171ec9ccbaaa772c28429a01216b9d98c02ddf4f008bef5c0b12d"},"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"}}]},{"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":"262c8917888e41802823342d64479fa664756e31bdbbdff75c2e9988f2d40166"},"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"}}]},{"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":"8e94483c7030367c9a674ffa863237a27cdfe0be2a8dd5245cd1c9c950af2b7e"},"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"}}]},{"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":"8b1dd107d3751c64cdd4ce019981af9276939b3b792bc96bac2652a144d11c84"},"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"}}]},{"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":"73e1bb4aafbeedc08500a0f60ab55ac16f59f628caf0b9dbe91f4b82291554c5"},"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"}}]},{"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":"0eb4882852f10b052dcda9e819f1651ce0c3a289f5801fa9767741a715bd9699"},"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"}}]},{"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":"aaade4e2fc99a306e52c90ea02ec2073bc215ad1c8f021056a867957fc612d5d"},"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"}}]},{"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":"eade52d6e815265a54d69407f76749be58e7637dcb57addb157e1d75e5f6e9c4"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"note","message":{"text":"knowledge concentrated in recent work \u2014 freshness signal contradicted by repo activity: File-level freshness contradicts repo activity: 32 commits in the last 90 days, yet 116 of 139 significant files carry no living knowledge. Those two readings cannot both be true, so the per-file recency signal is treated as unreliable here and freshness is not scored for this run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e461071eb7c3d0d8a5f27dee27c23fcaef1256b0b0ff28c50eb743e940dbe9d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: AndroidXFragmentDestroyWatcher.kt \u2194 AndroidOFragmentDestroyWatcher.kt: \u0060object-watcher/object-watcher-android-androidx/src/main/java/leakcanary/internal/AndroidXFragmentDestroyWatcher.kt\u0060 and \u0060object-watcher/object-watcher-android-core/src/main/java/leakcanary/internal/AndroidOFragmentDestroyWatcher.kt\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"object-watcher/object-watcher-android-androidx/src/main/java/leakcanary/internal/AndroidXFragmentDestroyWatcher.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdc8be8ab5f3ea8bb0d42ccd54c9a0615c3614a311f41d290f90ebb2fb9399a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ActivityWatcher.kt \u2194 AndroidOFragmentDestroyWatcher.kt: \u0060object-watcher/object-watcher-android-core/src/main/java/leakcanary/ActivityWatcher.kt\u0060 and \u0060object-watcher/object-watcher-android-core/src/main/java/leakcanary/internal/AndroidOFragmentDestroyWatcher.kt\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"object-watcher/object-watcher-android-core/src/main/java/leakcanary/ActivityWatcher.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0cfeb8f96351d48a8cc051c03ee32aebb4f4c763420e52f031352816e6b9d3"}},{"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"}},{"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"}},{"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"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-926","guid":"0d9b5579-5549-555a-8a97-f9cc14f3ad4a","name":"CWE-926","shortDescription":{"text":"CWE-926"},"helpUri":"https://cwe.mitre.org/data/definitions/926.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":19,"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."]}]}