{"$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":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"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"]}}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"JsonReader.doPeek (cyclomatic 41): JsonReader.doPeek 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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"128518137b0c74f3d08854b434e8a7d81eb3bd5df6ecb70341646b715138e2c9"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonReader.peekNumber (cyclomatic 36): JsonReader.peekNumber has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e67c83376919b7fae2da7e68c10523c08c68945ed76a7bbd0a02609143f46d"}},{"ruleId":"D1","level":"warning","message":{"text":"ISO8601Utils.parse (cyclomatic 29): ISO8601Utils.parse has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/bind/util/ISO8601Utils.java"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaa6ff57c7e6c4031dc3a7893ad5897c255e683f022e7817d1760d6144d3739"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonReader.readEscapeCharacter (cyclomatic 25): JsonReader.readEscapeCharacter has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e692ceadcb92c15ed216bb135d09f0989d7d9a5c46a9642bdf0b4ce01bd893a"}},{"ruleId":"D1","level":"warning","message":{"text":"GsonTypes.resolve (cyclomatic 24): GsonTypes.resolve has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/GsonTypes.java"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c382ce018c5eec9771280dc9143981435abb3d12d3dcc25cedae75ec2b7d90"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonReader.nextUnquotedValue (cyclomatic 24): JsonReader.nextUnquotedValue has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"92620de0d658b1f4bafe43a9f513c43ee63eeccdc6244bbdf545affc68ff0f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkedTreeMap.rebalance (cyclomatic 22): LinkedTreeMap.rebalance has cyclomatic complexity 22 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/LinkedTreeMap.java"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8495b3f74c814b7d2aed622a2063a98b0e0628cea757f17bc66a961049bee9d"}},{"ruleId":"D1","level":"warning","message":{"text":"ReflectiveTypeAdapterFactory.getBoundFields (cyclomatic 21): ReflectiveTypeAdapterFactory.getBoundFields has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/bind/ReflectiveTypeAdapterFactory.java"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c863212e355777b473af038eee81427e527e2c3d1fc506f9b46ae072869b22de"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonReader.skipValue (cyclomatic 19): JsonReader.skipValue 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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86078673621c217aaed2e9433d75c847f0bb5dc0eeb1ffbd386f1c6b2d64d66"}},{"ruleId":"D1","level":"warning","message":{"text":"UtcDateTypeAdapter.parse (cyclomatic 17): UtcDateTypeAdapter.parse 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":"extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2422854e345344c39f093836a4063acaa9b8b6dc2ff2ea82f85d2e4f53a1dd58"}},{"ruleId":"D1","level":"warning","message":{"text":"10.create (cyclomatic 16): 10.create 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":"gson/src/main/java/com/google/gson/internal/bind/JavaTimeTypeAdapters.java"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8cc60b345fa34927c5e134294c0326a81ba8b72296afbe43f2ecbfb1cf3642"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonReader.peekKeyword (cyclomatic 16): JsonReader.peekKeyword 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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43e3ea66f62bae156a5eb15e0fec5d0a0c3291b23b3b6e8742060135a314fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"GsonTypes.resolve (cognitive 85): GsonTypes.resolve has cognitive complexity 85 (threshold 15). Drivers by points: if/else 57, ternaries 19, loops 7, boolean chains 2 (nesting depth added 61). 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":"gson/src/main/java/com/google/gson/internal/GsonTypes.java"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ef8462d71cf8ec5f71123bec7f49c40642668a72608ddca227f4f0da545bac"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader.doPeek (cognitive 73): JsonReader.doPeek has cognitive complexity 73 (threshold 15). Drivers by points: if/else 51, match/switch 18, boolean chains 4 (nesting depth added 42). 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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a0dff311d1c16ecdd1717d85d84c5f50c1408343876192154a4d83fcc9b410"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader.peekNumber (cognitive 58): JsonReader.peekNumber has cognitive complexity 58 (threshold 15). Drivers by points: if/else 42, boolean chains 11, match/switch 2, ternaries 2, loops 1 (nesting depth added 26). 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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec34de01d8dcd9eca376804164f21cc9a50f278e2d8419b33f924f98aa493bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ReflectiveTypeAdapterFactory.getBoundFields (cognitive 56): ReflectiveTypeAdapterFactory.getBoundFields has cognitive complexity 56 (threshold 15). Drivers by points: if/else 45, loops 7, boolean chains 4 (nesting depth added 35). 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":"gson/src/main/java/com/google/gson/internal/bind/ReflectiveTypeAdapterFactory.java"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"393bc494276b6b3f3c2e17ccde2a66646c1fa664d82c5da8049566d071062f9a"}},{"ruleId":"D2","level":"warning","message":{"text":"ISO8601Utils.parse (cognitive 55): ISO8601Utils.parse has cognitive complexity 55 (threshold 15). Drivers by points: if/else 39, boolean chains 6, match/switch 5, ternaries 4, error handling 1 (nesting depth added 26). 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":"gson/src/main/java/com/google/gson/internal/bind/util/ISO8601Utils.java"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a811262edb566751ac3fea494a14b9ddeb2330f175d2b115bc2aedfaddb293"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkedTreeMap.rebalance (cognitive 55): LinkedTreeMap.rebalance has cognitive complexity 55 (threshold 15). Drivers by points: if/else 31, ternaries 18, boolean chains 5, loops 1 (nesting depth added 31). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/LinkedTreeMap.java"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3286a277d22cf6b20a1928680adc0e466c00f87fbe3dbe23165b2b501148573"}},{"ruleId":"D2","level":"warning","message":{"text":"GsonTypes.equals (cognitive 32): GsonTypes.equals has cognitive complexity 32 (threshold 15). Drivers by points: if/else 29, boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/GsonTypes.java"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3897a32774dc24cbec44b0766144bfb00f1bdd144ca10536143408343c7ca071"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader.nextNonWhitespace (cognitive 30): JsonReader.nextNonWhitespace has cognitive complexity 30 (threshold 15). Drivers by points: if/else 25, match/switch 3, boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce46369d218547542ae67e901e98f265a866fba7c154942f66cc42cf87c82a2"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonTreeReader.peek (cognitive 26): JsonTreeReader.peek has cognitive complexity 26 (threshold 15). Drivers by points: if/else 23, ternaries 3 (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":"gson/src/main/java/com/google/gson/internal/bind/JsonTreeReader.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"df166f8200801056582f540ca0fea2f4105de9739f328e04b647bc093634d5fc"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkedTreeMap.find (cognitive 26): LinkedTreeMap.find has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15, ternaries 8, loops 2, boolean chains 1 (nesting depth added 12). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/LinkedTreeMap.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"da16897eb8352b63e3a0a71291f27b4ceb126772ff27bac0bb8715e2683d8eac"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader.nextQuotedValue (cognitive 26): JsonReader.nextQuotedValue has cognitive complexity 26 (threshold 15). Drivers by points: if/else 22, loops 3, 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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5083272812f846730301a2c94c3ff9f9b83a6a6b3ac5c5d83895d7a07af84336"}},{"ruleId":"D2","level":"warning","message":{"text":"UtcDateTypeAdapter.parse (cognitive 25): UtcDateTypeAdapter.parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, boolean chains 2, error handling 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c9787df76271b48611c658e58fc77493d9f3ac54669e340ebfcc9290f00064"}},{"ruleId":"D2","level":"warning","message":{"text":"CollectionsDeserializationBenchmark.timeCollectionsReflectionStreaming (cognitive 25): CollectionsDeserializationBenchmark.timeCollectionsReflectionStreaming has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, loops 10 (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":"metrics/src/main/java/com/google/gson/metrics/CollectionsDeserializationBenchmark.java"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ad543e304b8df3d21507041e144612cb341e52771dd9ca7b7dc6eb2f27c481"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonElementTypeAdapter.read (cognitive 24): JsonElementTypeAdapter.read has cognitive complexity 24 (threshold 15). Drivers by points: if/else 21, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/bind/JsonElementTypeAdapter.java"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4821d598b954eb0aa7fe86f59333efc7422ef2a49a651da398049ed4f64a166"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonTreeReader.getPath (cognitive 24): JsonTreeReader.getPath has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, boolean chains 4, 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":"gson/src/main/java/com/google/gson/internal/bind/JsonTreeReader.java"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"23717643046590edfc47f1fe98afea5c94d836431afb7b8b1e1604e2f6453b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonAdapterAnnotationTypeAdapterFactory.getTypeAdapter (cognitive 23): JsonAdapterAnnotationTypeAdapterFactory.getTypeAdapter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, ternaries 8, boolean chains 2 (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":"gson/src/main/java/com/google/gson/internal/bind/JsonAdapterAnnotationTypeAdapterFactory.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"83282bdd8d65a3cb2fbf29b73c3c471b5b1c74fa1ae99ecb90461bc129066e42"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectTypeAdapter.read (cognitive 23): ObjectTypeAdapter.read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/bind/ObjectTypeAdapter.java"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9960e6f10d402ab623d60016a623c8c8ebd18be758849d85752aee38a6b5b3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeToken.verifyNoTypeVariable (cognitive 23): TypeToken.verifyNoTypeVariable has cognitive complexity 23 (threshold 15). Drivers by points: loops 14, if/else 9 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/reflect/TypeToken.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"80eba8a6028e01bb9d3f75391572fa30a116b5f414931c4d3ec1e09ceb0dd377"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoTypeAdapter.deserialize (cognitive 21): ProtoTypeAdapter.deserialize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, loops 6, boolean chains 1, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"proto/src/main/java/com/google/gson/protobuf/ProtoTypeAdapter.java"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3086ad1dc9b901cd907ea46a66969c2872ad6dd4d09269fbea7eefb1b921535"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader.nextInt (cognitive 21): JsonReader.nextInt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, error handling 4, ternaries 4, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"06110d3d572da5961008a423ff7e05947e26fe0b5ca49a6f1b3d44ec264e3ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader.readEscapeCharacter (cognitive 21): JsonReader.readEscapeCharacter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 5, loops 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd60fb2831736b9bd62d4629bcb7a9f726d020a2a616d5f3cd413f702cc3d109"}},{"ruleId":"D2","level":"warning","message":{"text":"Adapter.read (cognitive 20): Adapter.read has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 3, loops 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":"proto/src/main/java/com/google/gson/protobuf/LegacyProtoTypeAdapterFactory.java"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0977de38f89d2b23475180f40133a3206b4e5b7e758c9e23345d3dcc545491bb"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonElementTypeAdapter.write (cognitive 20): JsonElementTypeAdapter.write has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, loops 9, boolean chains 1 (nesting depth added 9). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/bind/JsonElementTypeAdapter.java"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc9414815ea75d9f11379885f6de9afafb2cf7d5784c8042056165fb13ce84c"}},{"ruleId":"D2","level":"warning","message":{"text":"BagOfPrimitivesDeserializationBenchmark.timeBagOfPrimitivesReflectionStreaming (cognitive 19): BagOfPrimitivesDeserializationBenchmark.timeBagOfPrimitivesReflectionStreaming has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, loops 6 (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":"metrics/src/main/java/com/google/gson/metrics/BagOfPrimitivesDeserializationBenchmark.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c738d1ec41ce71c2ec052fe0668fee30882ab85634d62cc7a405bb7ef466328"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader.nextLong (cognitive 19): JsonReader.nextLong has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, error handling 4, ternaries 4, 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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9dd9f270a8e92112da81b23cd8e4902d79088da12766c79903e6c777827427"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader.peekKeyword (cognitive 18): JsonReader.peekKeyword has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 8, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fdd2d5df8f95ace5b1c8dcc871f5be8f88c2280fb2877ac2c5b65523ca1740"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader.nextUnquotedValue (cognitive 17): JsonReader.nextUnquotedValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, loops 3, match/switch 3, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"925585af84a2b96f5f51694ad57aa5f311da3013db57efc30561a7564e171224"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonReader.skipValue (cognitive 17): JsonReader.skipValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, match/switch 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad2c5a0f55cf47c61f4d92692f185957261e00f5d8a4756b3e1fa3dd116ac96"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonPrimitive.equals (cognitive 16): JsonPrimitive.equals has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/JsonPrimitive.java"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"087888b76ba1bed8a457616f6cc56b7498f2ad836a61e2b8e686deb5369890f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stream/JsonReader.java: FileTooLong \u2014 1039 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"863cb0fe1aecf9eaebc24c84c019c95ac53c22ad0315559c6c9f9c684e0c9fa6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsonReader: TooManyMethods \u2014 46 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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c5eec9921a2789a935b18559e8a5098f92a62ce9e1c06a63f8b5190c2f5cfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bind/TypeAdapters.java: FileTooLong \u2014 745 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: TypeAdapters (63-1093). 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":"gson/src/main/java/com/google/gson/internal/bind/TypeAdapters.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae39b1e0e698793360b8b4813073036a2857ff48de9c8157ce77310b19694de"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GsonBuilder: TooManyMethods \u2014 40 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":"gson/src/main/java/com/google/gson/GsonBuilder.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6965582926cdd2b602d0e5f8db8a72ff6fdb91f63246bae30880209f75f0a6ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Gson: TooManyMethods \u2014 35 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":"gson/src/main/java/com/google/gson/Gson.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b499ad44134124a2a70d247e8d6d2b37d4ad6468d6bccb702d36e96768e79f17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsonArray: TooManyMethods \u2014 33 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":"gson/src/main/java/com/google/gson/JsonArray.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36c127d353dde5b9f8dd78ecb15eec5b70c62e66708276d2061635f402343d9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsonTreeReader: TooManyMethods \u2014 31 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":"gson/src/main/java/com/google/gson/internal/bind/JsonTreeReader.java"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11e0beb62377084dec94d0e53bf16007ab09b57fd96b2bed42cabcf19ccaf43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): gson/src/main/java/com/google/gson/stream/JsonReader.java:1206-1223 | gson/src/main/java/com/google/gson/stream/JsonReader.java:1289-1306 \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 \u0060gson/src/main/java/com/google/gson/stream/JsonReader.java:1206\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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b665372353bd3a9d2373265ea0e8510b90d0cf481fa8441e6673faf8fd97be48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): gson/src/main/java/com/google/gson/stream/JsonReader.java:1104-1119 | gson/src/main/java/com/google/gson/stream/JsonReader.java:1355-1370 \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 \u0060gson/src/main/java/com/google/gson/stream/JsonReader.java:1104\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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ac87c451aeab51114afc001384c0f0c6a3ae32a7e0f1cd9c2adcb20751318c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): gson/src/main/java/com/google/gson/internal/bind/JavaTimeTypeAdapters.java:123-137 | gson/src/main/java/com/google/gson/internal/bind/JavaTimeTypeAdapters.java:176-190 | gson/src/main/java/com/google/gson/internal/bind/JavaTimeTypeAdapters.java:217-231 \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 \u0060gson/src/main/java/com/google/gson/internal/bind/JavaTimeTypeAdapters.java:123\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":"gson/src/main/java/com/google/gson/internal/bind/JavaTimeTypeAdapters.java"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffb91ed477783060ac7aacbf0fc3b8bc85fc41c1fb77784676b68ecd654cdbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): metrics/src/main/java/com/google/gson/metrics/BagOfPrimitivesDeserializationBenchmark.java:67-81 | metrics/src/main/java/com/google/gson/metrics/CollectionsDeserializationBenchmark.java:79-93 \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 \u0060metrics/src/main/java/com/google/gson/metrics/BagOfPrimitivesDeserializationBenchmark.java:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"metrics/src/main/java/com/google/gson/metrics/BagOfPrimitivesDeserializationBenchmark.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7897cfefe4cfef25b80879c17bc90b1771e51fa6f72e14977227cee5123b4d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): gson/src/main/java/com/google/gson/internal/bind/TypeAdapters.java:1009-1023 | gson/src/main/java/com/google/gson/internal/bind/TypeAdapters.java:1033-1047 \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 \u0060gson/src/main/java/com/google/gson/internal/bind/TypeAdapters.java:1009\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":"gson/src/main/java/com/google/gson/internal/bind/TypeAdapters.java"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d21195368885b77d0f3b3607d995fd01e5f57e03a78265810e7fe663916c2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:148-161 | gson/src/main/java/com/google/gson/internal/bind/util/ISO8601Utils.java:155-169 \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 \u0060extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:148\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":"extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37f0c67b9133b254775d98700602e7dbe8e2489c1ab8cfff8ac653bf13262ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): test-shrinker/src/main/java/com/example/Main.java:132-145 | test-shrinker/src/main/java/com/example/Main.java:210-223 \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 \u0060test-shrinker/src/main/java/com/example/Main.java:132\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":"test-shrinker/src/main/java/com/example/Main.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16625c3577a641b62ea46b2bc197ef6bdc3afe911572d3367880fb1f757f5f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gson/src/main/java/com/google/gson/internal/bind/TypeAdapters.java:196-208 | gson/src/main/java/com/google/gson/internal/bind/TypeAdapters.java:231-243 \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 \u0060gson/src/main/java/com/google/gson/internal/bind/TypeAdapters.java:196\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":"gson/src/main/java/com/google/gson/internal/bind/TypeAdapters.java"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"838f8457e001ca0d2e116690d7ec7e539438f7842328a83ff0acc73768360298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): gson/src/main/java/com/google/gson/internal/LinkedTreeMap.java:397-409 | gson/src/main/java/com/google/gson/internal/LinkedTreeMap.java:422-434 \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":"gson/src/main/java/com/google/gson/internal/LinkedTreeMap.java"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4991901679bcae4a49ed5174e13a014acd7543cebe41f7745b2593352117293a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:170-180 | gson/src/main/java/com/google/gson/internal/bind/util/ISO8601Utils.java:191-201 \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 \u0060extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:170\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":"extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91758b09f2a19ace85f19c828d50709646004f3595b0e6070288bbb9d257ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:219-229 | gson/src/main/java/com/google/gson/internal/bind/util/ISO8601Utils.java:290-300 \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 \u0060extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:219\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":"extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5267b975f6fa1142f2313a27dcc6659f975a5eacbf4e4677640c1555c0c25dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:258-267 | gson/src/main/java/com/google/gson/internal/bind/util/ISO8601Utils.java:335-344 \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 \u0060extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:258\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":"extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59ade480ba863e1ef805301c5fd02a636aa4f317550d83983fd59210e34ef39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): gson/src/main/java/com/google/gson/internal/sql/SqlDateTypeAdapter.java:58-67 | gson/src/main/java/com/google/gson/internal/sql/SqlTimeTypeAdapter.java:59-68 \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 \u0060gson/src/main/java/com/google/gson/internal/sql/SqlDateTypeAdapter.java:58\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/sql/SqlDateTypeAdapter.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84f309f563d2ce8743d5c4eb407968508421fe09ca5c1894794cff60688a24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:105-113 | gson/src/main/java/com/google/gson/internal/bind/util/ISO8601Utils.java:121-129 \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 \u0060extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:105\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":"extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"27880a82ead75d446069213b71fdbc808ccaad62f10729b6d671b8152aca584f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): metrics/src/main/java/com/google/gson/metrics/BagOfPrimitivesDeserializationBenchmark.java:110-118 | metrics/src/main/java/com/google/gson/metrics/CollectionsDeserializationBenchmark.java:128-136 \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 \u0060metrics/src/main/java/com/google/gson/metrics/BagOfPrimitivesDeserializationBenchmark.java: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":"metrics/src/main/java/com/google/gson/metrics/BagOfPrimitivesDeserializationBenchmark.java"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e1fb9693b9e0c976a602c18ea63fee0d68c95064e001154a7cc45f03e161bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gson/src/main/java/com/google/gson/internal/bind/CollectionTypeAdapterFactory.java:51-59 | gson/src/main/java/com/google/gson/internal/bind/MapTypeAdapterFactory.java:140-148 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/bind/CollectionTypeAdapterFactory.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b7fe1078bbf717c5a886f1ac5e194c87b5b084a2fd5207d98bfdaad5e35f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): gson/src/main/java/com/google/gson/Gson.java:689-697 | gson/src/main/java/com/google/gson/Gson.java:768-776 \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 \u0060gson/src/main/java/com/google/gson/Gson.java:689\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":"gson/src/main/java/com/google/gson/Gson.java"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9f1b8706acde5ff3178cd8b81529b9a75577b5014a807b512cb085668676aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:96-103 | gson/src/main/java/com/google/gson/internal/bind/util/ISO8601Utils.java:112-119 \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 \u0060extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java:96\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":"extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e52406b6ea1c5c5a7e28cfc951fb4d8e8af84d5a63db9a2af8051e8abb82070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): gson/src/main/java/com/google/gson/stream/JsonReader.java:1094-1101 | gson/src/main/java/com/google/gson/stream/JsonReader.java:1345-1352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060gson/src/main/java/com/google/gson/stream/JsonReader.java:1094\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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5c909e084da1af54df26938b48003bbb54166fe027bdf4e0e435725fcd04e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): gson/src/main/java/com/google/gson/internal/LinkedTreeMap.java:330-336 | gson/src/main/java/com/google/gson/internal/LinkedTreeMap.java:337-343 | gson/src/main/java/com/google/gson/internal/LinkedTreeMap.java:355-361 \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 \u0060gson/src/main/java/com/google/gson/internal/LinkedTreeMap.java:330\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":"gson/src/main/java/com/google/gson/internal/LinkedTreeMap.java"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"258aaa3d5061a850a1e100a2c66081287585abffa9d038fa766f98cc4ac88e96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gson/src/main/java/com/google/gson/internal/bind/JsonTreeReader.java:265-271 | gson/src/main/java/com/google/gson/internal/bind/JsonTreeReader.java:289-295 \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 \u0060gson/src/main/java/com/google/gson/internal/bind/JsonTreeReader.java:265\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gson/src/main/java/com/google/gson/internal/bind/JsonTreeReader.java"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"19633b89733c424f75adc607cb3296835c68806810940aafa62f924b5319d824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): gson/src/main/java/com/google/gson/internal/bind/JsonTreeReader.java:370-376 | gson/src/main/java/com/google/gson/stream/JsonReader.java:1499-1505 \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":"gson/src/main/java/com/google/gson/internal/bind/JsonTreeReader.java"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6306b094acfd641649bd09d893e0db0fe2605d639c513c394ed0b98bce3dd641"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): metrics/src/main/java/com/google/gson/metrics/CollectionsDeserializationBenchmark.java:66-71 | metrics/src/main/java/com/google/gson/metrics/CollectionsDeserializationBenchmark.java:110-115 \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 \u0060metrics/src/main/java/com/google/gson/metrics/CollectionsDeserializationBenchmark.java:66\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":"metrics/src/main/java/com/google/gson/metrics/CollectionsDeserializationBenchmark.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dcd1d84ce7a008bc492246998db892f10d362c7bb9e0c61293f3f9c1b6b452"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gson/src/main/java/com/google/gson/stream/JsonReader.java: gson/src/main/java/com/google/gson/stream/JsonReader.java changed 2 times in last 90 days, max complexity 41. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, 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":"gson/src/main/java/com/google/gson/stream/JsonReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a7dac1c689eaf41d749f62d1e4ae7295fac21aa89a16af0ad6f7a9994dc764"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 6 significant file(s) lose their only recent owner: gson/src/main/java/com/google/gson/JsonObject.java, gson/src/main/java/com/google/gson/internal/bind/JsonAdapterAnnotationTypeAdapterFactory.java, gson/src/main/java/com/google/gson/FieldNamingPolicy.java, gson/src/main/java/com/google/gson/TypeAdapterFactory.java, gson/src/main/java/com/google/gson/internal/bind/TypeAdapterRuntimeTypeWrapper.java, gson/src/main/java/com/google/gson/internal/NonNullElementWrapperList.java. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e4fbb6cf04c29f5dde8b436e12b4249f6c2b0e906394d22e5cca460fb09204ec"}},{"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 (9 single-owned of 72 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 #2 (2 file(s)), anonymized user #3 (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":"91fd58c4bb14451bd01738ed9ed9cafd45057397ec9153d7ec757a077fa391e5"},"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":"a62aad4ae88a9410b5216bb3b2c59555408bf327a70b5c0bb04259f584dec269"},"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":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 20 of 72 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 largest first: proto/src/main/java/com/google/gson/protobuf/ProtoTypeAdapter.java, extras/src/main/java/com/google/gson/typeadapters/RuntimeTypeAdapterFactory.java, extras/src/main/java/com/google/gson/typeadapters/UtcDateTypeAdapter.java (and 17 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"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-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-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":5,"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."]}]}