{"$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":"ByteMachineTest.WHEN_NumericRangesAreAdded_THEN_TheyWorkCorrectly (cyclomatic 59): ByteMachineTest.WHEN_NumericRangesAreAdded_THEN_TheyWorkCorrectly has cyclomatic complexity 59 (threshold 15). 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":"src/test/software/amazon/event/ruler/ByteMachineTest.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe3186a50411e9543d82ec5172aeba70e4988bac27a21e7828f10cd59d20437"}},{"ruleId":"D1","level":"warning","message":{"text":"RuleCompiler.processMatchExpression (cyclomatic 46): RuleCompiler.processMatchExpression has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/RuleCompiler.java"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bac6e811b8c0dbc18d1799a83f57558b905df76169d1c92326b1e976e26a01a"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonRuleCompiler.processMatchExpression (cyclomatic 42): JsonRuleCompiler.processMatchExpression has cyclomatic complexity 42 (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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa03ba5b13e5fb32637e2989b8e23b20165ddd596ddd68e526f3a2c42557b142"}},{"ruleId":"D1","level":"warning","message":{"text":"Ruler.matches (cyclomatic 38): Ruler.matches has cyclomatic complexity 38 (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":"src/main/software/amazon/event/ruler/Ruler.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e805d84cd1454163183d1c2def212c996d7f915441916837bfb4b5df41c5454c"}},{"ruleId":"D1","level":"warning","message":{"text":"ByteMachine.doTransitionOn (cyclomatic 37): ByteMachine.doTransitionOn 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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40d1c5fa90f0735d1571a2af101bfb4d867eca6742b62a8a83dd56b74c94743"}},{"ruleId":"D1","level":"warning","message":{"text":"ByteMachine.findRangePattern (cyclomatic 35): ByteMachine.findRangePattern has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"141038f34579ef8014ee3a992656046ddc3521d34c46288330e9e57f764234d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ByteMachine.addEndOfMatch (cyclomatic 26): ByteMachine.addEndOfMatch has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"e961e3d6ed1b1991e86e86d495a81c5a88a96046188fcb4d2f0827cd6bb655d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ByteMachine.addRangePattern (cyclomatic 24): ByteMachine.addRangePattern has cyclomatic complexity 24 (threshold 15). 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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0902d97ac7327109ec39a0e6cd9fa3484c97d53090bc8a5296003cf974a383"}},{"ruleId":"D1","level":"warning","message":{"text":"ByteMachine.deleteRangePattern (cyclomatic 24): ByteMachine.deleteRangePattern has cyclomatic complexity 24 (threshold 15). 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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5dab595e16e2c665cac48b7928cd833e2c00833da1708ee3029e4242982500"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericMachine.addStep (cyclomatic 23): GenericMachine.addStep has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/GenericMachine.java"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a06e768057900a46321b74168e5edae052bfa4b976f32011c2beb641c6bc073"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericMachine.deleteStep (cyclomatic 22): GenericMachine.deleteStep has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/GenericMachine.java"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7d487ffd0d53224a764509d3a667ccc1e6a3147f05e482a744c003a9401a2c"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonRuleCompiler.processNumericMatchExpression (cyclomatic 18): JsonRuleCompiler.processNumericMatchExpression has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"328921249008eaedc5ec8ab0fec479f56a76b1f9b59d8fcb44c2aad7fe3c1b58"}},{"ruleId":"D1","level":"warning","message":{"text":"RuleCompiler.processNumericMatchExpression (cyclomatic 18): RuleCompiler.processNumericMatchExpression has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/RuleCompiler.java"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bac085e88723d38d67177a86d9041b59c7ee93e4804b3db1f3c55d50e141952"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonRuleCompiler.writeRules (cyclomatic 17): JsonRuleCompiler.writeRules has cyclomatic complexity 17 (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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda5080c18e49579d028e0c7b99d2032e714fea32545b2ef57fc79b68e978225"}},{"ruleId":"D1","level":"warning","message":{"text":"ByteMachineTest.WHEN_ShortcutTransAddedAndDeleted_THEN_TheyWorkCorrectly (cyclomatic 16): ByteMachineTest.WHEN_ShortcutTransAddedAndDeleted_THEN_TheyWorkCorrectly has cyclomatic complexity 16 (threshold 15). 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":"src/test/software/amazon/event/ruler/ByteMachineTest.java"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc9222df3ff462943652387dfe678f201c9d8ec7e2482949edb8301be141280"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleCompiler.processMatchExpression (cognitive 217): RuleCompiler.processMatchExpression has cognitive complexity 217 (threshold 15). Drivers by points: if/else 204, error handling 10, boolean chains 3 (nesting depth added 167). 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":"src/main/software/amazon/event/ruler/RuleCompiler.java"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8d8fbf9767f3b38da671ce076cabae550dbb9a08832dac592c79142e8cc1c5"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonRuleCompiler.processMatchExpression (cognitive 166): JsonRuleCompiler.processMatchExpression has cognitive complexity 166 (threshold 15). Drivers by points: if/else 147, error handling 10, match/switch 7, boolean chains 2 (nesting depth added 125). 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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"7526af738670863c1c190b9a157c7e00fc0dc9783e015d9ce35c8e2bfd842309"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMachineTest.WHEN_NumericRangesAreAdded_THEN_TheyWorkCorrectly (cognitive 126): ByteMachineTest.WHEN_NumericRangesAreAdded_THEN_TheyWorkCorrectly has cognitive complexity 126 (threshold 15). Drivers by points: loops 66, if/else 52, boolean chains 8 (nesting depth added 60). 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":"src/test/software/amazon/event/ruler/ByteMachineTest.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13a01cd8f7b522b0744b7b3a5c373f9b4765ec1c963171f7597c448e7a89297"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMachine.findRangePattern (cognitive 82): ByteMachine.findRangePattern has cognitive complexity 82 (threshold 15). Drivers by points: if/else 54, loops 26, boolean chains 2 (nesting depth added 48). 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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66fe68e3a93ef3a470bf2ba48e49721a57384c5a7f6a0a63e2c03fa48716ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericMachine.deleteStep (cognitive 63): GenericMachine.deleteStep has cognitive complexity 63 (threshold 15). Drivers by points: if/else 43, loops 14, boolean chains 3, ternaries 3 (nesting depth added 40). 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":"src/main/software/amazon/event/ruler/GenericMachine.java"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a5f245324278f2fde660b42d492015d82ae880569d1086088ba582c7f17bde"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMachine.doTransitionOn (cognitive 55): ByteMachine.doTransitionOn has cognitive complexity 55 (threshold 15). Drivers by points: if/else 35, loops 9, boolean chains 7, match/switch 4 (nesting depth added 33). 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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f270e1b632b036ccc551e245cf5e0841ed3c6232d271689df0c59b5b0529a6"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonRuleCompiler.processNumericMatchExpression (cognitive 48): JsonRuleCompiler.processNumericMatchExpression has cognitive complexity 48 (threshold 15). Drivers by points: if/else 47, error handling 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a43c4d4397aae65006926cf26cf727aa9c67b05e0427972bf30d7d0f447a08"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleCompiler.processNumericMatchExpression (cognitive 48): RuleCompiler.processNumericMatchExpression has cognitive complexity 48 (threshold 15). Drivers by points: if/else 47, error handling 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/RuleCompiler.java"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"095c1852e9e28cd18d3d4d9a3cf4d396c7b736b2ced39a124c9da1e25aa540f0"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMachine.addEndOfMatch (cognitive 45): ByteMachine.addEndOfMatch has cognitive complexity 45 (threshold 15). Drivers by points: if/else 29, loops 6, boolean chains 5, ternaries 5 (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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc830373755d28b4ed0c0c5a719eb10d1408d917f5a107e4290abf2107f0002"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericMachine.addStep (cognitive 45): GenericMachine.addStep has cognitive complexity 45 (threshold 15). Drivers by points: if/else 30, loops 8, boolean chains 4, ternaries 3 (nesting depth added 20). 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":"src/main/software/amazon/event/ruler/GenericMachine.java"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f96198a5fbaee08f92560568a61ce34ce34c7b82b18b6d0bcce0f672bee2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMachine.addRangePattern (cognitive 43): ByteMachine.addRangePattern has cognitive complexity 43 (threshold 15). Drivers by points: loops 26, if/else 14, boolean chains 2, ternaries 1 (nesting depth added 20). 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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce205a186353a0e0396939b9c200b182f0aad5cc6854969614b6231d94a84fa6"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMachine.deleteRangePattern (cognitive 43): ByteMachine.deleteRangePattern has cognitive complexity 43 (threshold 15). Drivers by points: loops 26, if/else 15, boolean chains 2 (nesting depth added 20). 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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"36938de5cd8e74f6d24bc1650b2a733a3b28823f58537d128e2f147ff445753f"}},{"ruleId":"D2","level":"warning","message":{"text":"Ruler.matches (cognitive 37): Ruler.matches has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20, boolean chains 11, error handling 3, ternaries 2, match/switch 1 (nesting depth added 13). 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":"src/main/software/amazon/event/ruler/Ruler.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7288a25d4c7463cb2877e23656e64add9cfb1ef3aeedf6829d2e9df3d8b8976e"}},{"ruleId":"D2","level":"warning","message":{"text":"MachineComplexityEvaluator.getMatchesAccessibleFromEachTransition (cognitive 31): MachineComplexityEvaluator.getMatchesAccessibleFromEachTransition has cognitive complexity 31 (threshold 15). Drivers by points: loops 17, if/else 14 (nesting depth added 21). 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":"src/main/software/amazon/event/ruler/MachineComplexityEvaluator.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7aa91ad9d2696fab67fec0ddeb71171572cc609b2f8c4e83e3d1da05853fe9e"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMachine.findMatchPattern (cognitive 29): ByteMachine.findMatchPattern has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17, loops 11, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b36e735eb522431cf0abdadce87ad1a225ba547ec970c1070519774ea414570"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldIndex.getConsistent (cognitive 29): FieldIndex.getConsistent has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19, loops 6, ternaries 4 (nesting depth added 19). 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":"src/main/software/amazon/event/ruler/StructuredFinder.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ab5eda220e07cfc659a99ca700f1ffeffd932fa0938cb557734694d6ac0505"}},{"ruleId":"D2","level":"warning","message":{"text":"MachineComplexityEvaluator.evaluate (cognitive 28): MachineComplexityEvaluator.evaluate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18, loops 9, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/MachineComplexityEvaluator.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27828f55c91c2b37b960f4d6c8a7e8e2320d643eaaaaf4d1496fa7ef73b5c87"}},{"ruleId":"D2","level":"warning","message":{"text":"StructuredFinder.walk (cognitive 26): StructuredFinder.walk has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, loops 6, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/StructuredFinder.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff2e8614760dd5d74495ba41e7ca69d5051d7c77799e6874bd82251d346d14b"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMachine.deleteMatchStepForWildcard (cognitive 24): ByteMachine.deleteMatchStepForWildcard has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15, boolean chains 6, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b39b6814ea6f92e4061a2aa7153d4fce4863bfb2815d24a9513788cf33f0070"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMachineTest.WHEN_ShortcutTransAddedAndDeleted_THEN_TheyWorkCorrectly (cognitive 22): ByteMachineTest.WHEN_ShortcutTransAddedAndDeleted_THEN_TheyWorkCorrectly has cognitive complexity 22 (threshold 15). Drivers by points: loops 22 (nesting depth added 7). 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":"src/test/software/amazon/event/ruler/ByteMachineTest.java"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d82afd3ffe2edd350c4eac41e3fdc709ff4a09ffcc549ada9580edf5d3a0291"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMap.getTransitionForAllBytes (cognitive 20): ByteMap.getTransitionForAllBytes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, 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":"src/main/software/amazon/event/ruler/ByteMap.java"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1024ceb650d393a40c7064ae3d29bc907fbbebb6ec131ca3ef29c2793eb3edee"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonRuleCompiler.processAnythingButValuesSetMatchExpression (cognitive 20): JsonRuleCompiler.processAnythingButValuesSetMatchExpression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8, error handling 4, loops 3, match/switch 3, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d51351a88d442b79341f674ed44a1e1a4a4ca9a4bea9079924d41f5243e308a"}},{"ruleId":"D2","level":"warning","message":{"text":"WildcardParser.parse (cognitive 19): WildcardParser.parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 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":"src/main/software/amazon/event/ruler/input/WildcardParser.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"929ac78680fa701294e4f3111f295a9a8746757a0647ae02f1547ad95507fc49"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMachine.deleteMatchStep (cognitive 19): ByteMachine.deleteMatchStep has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e211e0938d9c0e3fccea89b2b15ab8aecc0ad81512f99df874a541101280c233"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonRuleCompiler.writeRules (cognitive 17): JsonRuleCompiler.writeRules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, error handling 3, loops 2, match/switch 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcc022d6789f93ead02a892defda7b0b425aaede75c5c29ba4b772940dbeaf4"}},{"ruleId":"D2","level":"warning","message":{"text":"Ruler.matchesOneOf (cognitive 17): Ruler.matchesOneOf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, loops 5 (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":"src/main/software/amazon/event/ruler/Ruler.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3b6bb4150843e9c58408335485588e682eda69deb661f4a399c7b054f49b97"}},{"ruleId":"D2","level":"warning","message":{"text":"StructuredFinderTest.perfRun (cognitive 17): StructuredFinderTest.perfRun has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, error handling 3, ternaries 3, boolean chains 1, loops 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":"src/test/software/amazon/event/ruler/StructuredFinderTest.java"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd8c8948cd923e4188dafd8dc74df5337762bf4639cfbc6e0e2fe99cefba69e"}},{"ruleId":"D2","level":"warning","message":{"text":"IntIntMap.shiftKeys (cognitive 16): IntIntMap.shiftKeys has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 3, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/IntIntMap.java"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4922661dc6bf0a21d68ca578e24a82fb757eac46e6c068ae0cc5954ae6f088bc"}},{"ruleId":"D2","level":"warning","message":{"text":"ByteMachineTest.WHEN_PatternAdded_THEN_ItCouldBeFound_AndReturnNullForOtherPatternSearch (cognitive 16): ByteMachineTest.WHEN_PatternAdded_THEN_ItCouldBeFound_AndReturnNullForOtherPatternSearch has cognitive complexity 16 (threshold 15). Drivers by points: loops 11, if/else 4, boolean chains 1 (nesting depth added 5). 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":"src/test/software/amazon/event/ruler/ByteMachineTest.java"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d29747d5eb115bf7792d059a3ec9c81ac6e04cfeeba39c7d7a0a8a9902e105"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ByteMachine: TooManyMethods \u2014 73 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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b509910a3d3d78256722d3a967960862ee27a6f2b9ad2195dc1e4c75b6e34c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ruler/ByteMachine.java: FileTooLong \u2014 1152 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: ByteMachine (45-2119). 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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2494146bd3d880e8da8a0aef18197e661ecf7ee2b99d0b107d0fb9602da0ec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GenericMachine: 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":"src/main/software/amazon/event/ruler/GenericMachine.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb61f8240006112303324750bc48baa13561b6f573a196c94bea22a8fcd54c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsonRuleCompiler: TooManyMethods \u2014 36 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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddfff22bfcfa1542ec3e1f0781701c3f72601768ac23a7a93db98cc4cc0e225"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ruler/JsonRuleCompiler.java: FileTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: JsonRuleCompiler (52-882). 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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4faaeb4af460c9d5c18d3e9000c52e25cfe37bcc62d9341f7bad30f63c5505a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Patterns: TooManyMethods \u2014 32 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":"src/main/software/amazon/event/ruler/Patterns.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b8fd331d7d652d3c78a14e2068d4ab98c866d00d2acbb72e07b07a431cb8cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RuleCompiler: TooManyMethods \u2014 32 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":"src/main/software/amazon/event/ruler/RuleCompiler.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2287f38d49dc08f0ea892602f5f555f69daf6b399f67c67bae1277d22d0e1635"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ruler/RuleCompiler.java: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: RuleCompiler (35-840). 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":"src/main/software/amazon/event/ruler/RuleCompiler.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89e2f0cffba2f816c6e0242933767224e2085ae8f53c3c7be287a704b35f5d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:347-367 | src/main/software/amazon/event/ruler/RuleCompiler.java:246-266 \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. 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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4b06357e836dadec6bc6e40775c46d4f094c0794e5819c581d1b9dba8c1eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/main/software/amazon/event/ruler/ACFinder.java:153-170 | src/main/software/amazon/event/ruler/Finder.java:143-160 \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":"src/main/software/amazon/event/ruler/ACFinder.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"663e6d221be5db5941f51a4f696bdde763ebc956ab18146192a5399bae16ef1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:198-211 | src/main/software/amazon/event/ruler/JsonRuleCompiler.java:244-257 | src/main/software/amazon/event/ruler/RuleCompiler.java:206-219 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/software/amazon/event/ruler/JsonRuleCompiler.java:198\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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0bf4f2358e15cdf1ffc58ee0e3a1bcb1e0c8eb08b447d0bc41f87d6e62e2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/software/amazon/event/ruler/ACTask.java:64-76 | src/main/software/amazon/event/ruler/Task.java:87-99 \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 \u0060src/main/software/amazon/event/ruler/ACTask.java:64\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":"src/main/software/amazon/event/ruler/ACTask.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad065e0885e23d990165f5320ea99d9b70826f054bc6fa60d9d33c3f569e2ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/software/amazon/event/ruler/ByteMachine.java:720-732 | src/main/software/amazon/event/ruler/ByteMachine.java:737-749 \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 \u0060src/main/software/amazon/event/ruler/ByteMachine.java:720\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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"3982cfb68326745f2a675cf87e0d8134512daaae5d638731772a1de2aaaefc31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/software/amazon/event/ruler/Event.java:290-302 | src/main/software/amazon/event/ruler/Event.java:349-361 \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 \u0060src/main/software/amazon/event/ruler/Event.java:290\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":"src/main/software/amazon/event/ruler/Event.java"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2912620bcb8eea749a85cb76bb4758b002b0270ed7113735e9b9fa8c942fcb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:620-632 | src/main/software/amazon/event/ruler/RuleCompiler.java:524-536 \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 \u0060src/main/software/amazon/event/ruler/JsonRuleCompiler.java:620\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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dd4f14bd1a1183c0fd9a008c23183aa4f53bb8d56f8c4437748d790af33dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/software/amazon/event/ruler/CIDR.java:165-176 | src/main/software/amazon/event/ruler/CIDR.java:200-211 \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 \u0060src/main/software/amazon/event/ruler/CIDR.java:165\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":"src/main/software/amazon/event/ruler/CIDR.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f2f77d09660351d613b9995495e2a94d34ba4b6525ab483ffa42fb06ab6093"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:178-190 | src/main/software/amazon/event/ruler/JsonRuleCompiler.java:219-230 \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 \u0060src/main/software/amazon/event/ruler/JsonRuleCompiler.java:178\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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"133a12d7af4c34d7b06afb64011bb8652371d49e1e9597b1169dac07a665816c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:694-705 | src/main/software/amazon/event/ruler/RuleCompiler.java:573-584 \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 \u0060src/main/software/amazon/event/ruler/JsonRuleCompiler.java:694\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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10e7b72e5a6bed2e2dad50de711b132db4808ca18de9eea47f8f8dd0914e356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:857-868 | src/main/software/amazon/event/ruler/RuleCompiler.java:694-705 \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 \u0060src/main/software/amazon/event/ruler/JsonRuleCompiler.java:857\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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b387ff5f3983470c54fe880f750bbd1b5ef61570e54c35b511e646a6fdc084b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/software/amazon/event/ruler/Event.java:265-276 | src/main/software/amazon/event/ruler/Event.java:328-338 \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. 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":"src/main/software/amazon/event/ruler/Event.java"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2dc280c747d3fe8b9de8533b8e8108b143d9c47567288b76fc269ddb0f4b62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:812-822 | src/main/software/amazon/event/ruler/RuleCompiler.java:651-661 \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 \u0060src/main/software/amazon/event/ruler/JsonRuleCompiler.java:812\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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c8b2e3921b35b89fd04b071f1e4d0eddfffb78d78b6af32bf2a6ff4a38ee5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:562-571 | src/main/software/amazon/event/ruler/JsonRuleCompiler.java:587-596 | src/main/software/amazon/event/ruler/RuleCompiler.java:466-475 | src/main/software/amazon/event/ruler/RuleCompiler.java:491-500 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c24f793cf0fa8fb7a2e5fe227b3c28f17d4a02ca52e82cf0f6841d9de80e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/software/amazon/event/ruler/ByteMachine.java:980-989 | src/main/software/amazon/event/ruler/ByteMachine.java:996-1005 \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 \u0060src/main/software/amazon/event/ruler/ByteMachine.java:980\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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4633ca9f3961cbfaef6d978399208a37f48cd9168491e9851634ff8a50b9818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:409-418 | src/main/software/amazon/event/ruler/RuleCompiler.java:301-310 \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 \u0060src/main/software/amazon/event/ruler/JsonRuleCompiler.java:409\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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6f3e640efd6afcb56ac98084da733119d73923497c98e5ab07011f46799011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:483-492 | src/main/software/amazon/event/ruler/RuleCompiler.java:387-396 \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 \u0060src/main/software/amazon/event/ruler/JsonRuleCompiler.java:483\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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"9975110d53c1c4ba10c7ecaa6c2ac3624b1b35edd0642d900232133ebc424dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:546-555 | src/main/software/amazon/event/ruler/RuleCompiler.java:450-459 \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 \u0060src/main/software/amazon/event/ruler/JsonRuleCompiler.java:546\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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1f082064c41f6ab567d3d4463d639d700179fbed417fe758303ef5206bc51c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:656-665 | src/main/software/amazon/event/ruler/JsonRuleCompiler.java:719-728 \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 \u0060src/main/software/amazon/event/ruler/JsonRuleCompiler.java:656\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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d173b13e166eba03358044eb87266a42433acbd4374230a6823c427e0653c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/software/amazon/event/ruler/ByteMachine.java:1104-1112 | src/main/software/amazon/event/ruler/ByteMachine.java:1136-1144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/software/amazon/event/ruler/ByteMachine.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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8443f19a08f24260f39a94046451b0dd72e664abfcbd05c36af96b74ffb520"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/software/amazon/event/ruler/JsonRuleCompiler.java:834-842 | src/main/software/amazon/event/ruler/RuleCompiler.java:671-679 \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 \u0060src/main/software/amazon/event/ruler/JsonRuleCompiler.java:834\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":"src/main/software/amazon/event/ruler/JsonRuleCompiler.java"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc370843d94cd181ee51ae1a8e283c4c5f8563aaabe985f23faaac3e83e7f320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/software/amazon/event/ruler/StructuredFinder.java:104-113 | src/main/software/amazon/event/ruler/StructuredFinder.java:140-148 \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 \u0060src/main/software/amazon/event/ruler/StructuredFinder.java:104\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":"src/main/software/amazon/event/ruler/StructuredFinder.java"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e971f1fb683c704cedc14d1868b95078a728960ca483e38f99901dfe30b9dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/main/software/amazon/event/ruler/ByteMachine.java:380-385 | src/main/software/amazon/event/ruler/ByteMachine.java:1147-1152 | src/main/software/amazon/event/ruler/ByteMachine.java:1310-1319 \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 \u0060src/main/software/amazon/event/ruler/ByteMachine.java:380\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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b411b7e8b272e59b85102be0729e5ef791ee8f6ff0e4d2a5cc683485eda1231a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/software/amazon/event/ruler/ByteMachine.java:333-340 | src/main/software/amazon/event/ruler/ByteMachine.java:1092-1097 \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 \u0060src/main/software/amazon/event/ruler/ByteMachine.java:333\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":"src/main/software/amazon/event/ruler/ByteMachine.java"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2913f1e1d973a2d8d444e4824147c2d34c2de6a6cbe65c69d73f555ba78ba21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/software/amazon/event/ruler/Event.java:100-105 | src/main/software/amazon/event/ruler/Event.java:116-121 \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 \u0060src/main/software/amazon/event/ruler/Event.java:100\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":"src/main/software/amazon/event/ruler/Event.java"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c8a7ba2dfe83a14926cf868cb298c6ee1c71ced8af158609f5bdfc593d1696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/software/amazon/event/ruler/GenericMachine.java:86-91 | src/main/software/amazon/event/ruler/GenericMachine.java:95-100 \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 \u0060src/main/software/amazon/event/ruler/GenericMachine.java:86\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":"src/main/software/amazon/event/ruler/GenericMachine.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"483aea8cdcf951ee46297c12eddaee1157e5d45f1279bbb4e4c7d9ec39303760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/software/amazon/event/ruler/ByteMap.java:47-51 | src/main/software/amazon/event/ruler/ByteMap.java:63-67 \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 \u0060src/main/software/amazon/event/ruler/ByteMap.java:47\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":"src/main/software/amazon/event/ruler/ByteMap.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4a7e6775f2b7ac881c0bf42aa38a1d1f684e8bebdd485a051114d8a8ae11b7"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: src/main/software/amazon/event/ruler/StructuredFinder.java. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4822ccc1ff5367ff793251445de0c1c424a10423807bdc14a4be05dd660d3a18"}},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","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":"6b36976e76898d65b767138c71f8a3264d5bc7be30b13d5131a9c2617cf3ba09"},"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":"9ad69e63ebaab03b827d06139d4170627b45b3f76ff8e3e6dac058135037adc1"},"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":"Dormant codebase: 24 of 30 significant files have no living knowledge \u2014 the codebase as a whole is dormant, not 24 separate risks. Re-engage owners or document before change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4c69f1e54b7dd6fe9029dd02df6ba8f8145b789f2f18dbdaa086c40ded49dba6"}},{"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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.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":6,"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."]}]}