{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"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":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D18","name":"Solution Shape","shortDescription":{"text":"Solution Shape"},"helpUri":"https://codehealth.canine.dev/dimensions/D18"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Stage3.EnemySpawn (cyclomatic 65): Stage3.EnemySpawn has cyclomatic complexity 65 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage3/Stage3.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc258d2b3fb72eef5c0b3256ccff64fd34a874a2411219b6b0f4b065f573b60"}},{"ruleId":"D1","level":"warning","message":{"text":"Stage2.EnemySpawn (cyclomatic 62): Stage2.EnemySpawn has cyclomatic complexity 62 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf14beb8c6bc4baba45ea436ebc4699e13d7c5a290bdc82d24fb076d8f64e48e"}},{"ruleId":"D1","level":"warning","message":{"text":"Stage4.EnemySpawn (cyclomatic 58): Stage4.EnemySpawn has cyclomatic complexity 58 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6890b1a13221973725b7cbc46d953ce803985c96541183ed72d969e7d57756"}},{"ruleId":"D1","level":"warning","message":{"text":"B6S0.Render (cyclomatic 42): B6S0.Render has cyclomatic complexity 42 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0832fede20a2775166fb1ad76471f6eb29740515efb8e8427880af655408f3c0"}},{"ruleId":"D1","level":"warning","message":{"text":"Textures.Load (cyclomatic 36): Textures.Load has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ResourcePack/Class1.vb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0cd67cc07e7c79a3a60aebc7c9e54c02d8470232dcbd10eaa4e24d0101b093"}},{"ruleId":"D1","level":"warning","message":{"text":"PropertyBoard.Update (cyclomatic 35): PropertyBoard.Update has cyclomatic complexity 35 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/PropertyBoard.xaml.vb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa84611e02a680c88a54b1b757b25b683db0a4852084cc75407274d509a8a6a8"}},{"ruleId":"D1","level":"warning","message":{"text":"Stage1.EnemySpawn (cyclomatic 33): Stage1.EnemySpawn has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage1/Stage1.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3cfec2d036955495c6455cc9856521c77d0280a65c5f43e63cbca310e7c304"}},{"ruleId":"D1","level":"warning","message":{"text":"B2S0.Render (cyclomatic 26): B2S0.Render has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5516dd0396ae7e5af20b4eb01a81557adfa4cb9d445b99e7d129c49f10dcdd4e"}},{"ruleId":"D1","level":"warning","message":{"text":"B3S0.Render (cyclomatic 26): B3S0.Render has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage3/Stage3.vb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f202d35f46f01d15dfb8dcad13c65a2a3b38995b57889278495e2c0c1d3be9e"}},{"ruleId":"D1","level":"warning","message":{"text":"B7S3.Render (cyclomatic 26): B7S3.Render has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage5/Stage5.vb"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ada62ab2379dba06832200790d32cabe22c3ddcced5ec4ec5047334e069fac4"}},{"ruleId":"D1","level":"warning","message":{"text":"Player.Player_Move (cyclomatic 25): Player.Player_Move has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Player.vb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64d25e273f624fb4a6f8d041dd4d34c68bb05e61f0097ea3b545ccb5659fce8"}},{"ruleId":"D1","level":"warning","message":{"text":"Player.Appearance (cyclomatic 22): Player.Appearance has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Player.vb"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9c49d9faf5747e21752716fe7ca560039cc2bf4f7047f8b105fb46569bfc23"}},{"ruleId":"D1","level":"warning","message":{"text":"Pl0B.Render (cyclomatic 22): Pl0B.Render has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/PlayerBullet.vb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f492534e08eda9a0389416944f440de088715c01a9777f7314ce98ca66d620d"}},{"ruleId":"D1","level":"warning","message":{"text":"Item.Item_Move (cyclomatic 21): Item.Item_Move has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Item.vb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"790271ceaec1ea8f43dfb94ae9cbf0da3b908935a138d9d54996958b457246d3"}},{"ruleId":"D1","level":"warning","message":{"text":"St6Enm.B8S4B4 (cyclomatic 21): St6Enm.B8S4B4 has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcf65915aac21d5f8e085b4b975baf310591bb422a8cf52736f4312f146542f"}},{"ruleId":"D1","level":"warning","message":{"text":"B6S1.Render (cyclomatic 21): B6S1.Render has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1607f3a19a8c6abc4a49bd8624dcafdd0f0cde14996ca43d8de1f748f95b5c0a"}},{"ruleId":"D1","level":"warning","message":{"text":"PL1B.Render (cyclomatic 20): PL1B.Render has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/PlayerBullet.vb"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f0c3b31ff8a69693772748791d50fc43c1973e7c49e16c9cff4f79b6746576"}},{"ruleId":"D1","level":"warning","message":{"text":"B6S2.Render (cyclomatic 19): B6S2.Render has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"e185417811a737976e4e8144129e2f03f845519732e456cb26172e00436e99cc"}},{"ruleId":"D1","level":"warning","message":{"text":"Item.Collect (cyclomatic 18): Item.Collect has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Item.vb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"557ccb9c1f486aed23cc90d09c0237b2db441055727b6d88cc77c754b1edf9a9"}},{"ruleId":"D1","level":"warning","message":{"text":"St2Enm.B2S0B2 (cyclomatic 18): St2Enm.B2S0B2 has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f247c20e12054c179b9c4204fd97ab4da381c2599443c4fa9c09a72565755f"}},{"ruleId":"D1","level":"warning","message":{"text":"B4S0.Render (cyclomatic 18): B4S0.Render has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage3/Stage3.vb"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a3aa9e34db14e8ed8a00909fbf22c5d43cfc9363d82f67dc13c4688f273a7e"}},{"ruleId":"D1","level":"warning","message":{"text":"St6Enm.B8S1B2 (cyclomatic 17): St6Enm.B8S1B2 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (St6Enm.B8S1B3) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc604c31a1905db43cd415696051ec0a058c3370c63cf46f1aa27f90f413e18"}},{"ruleId":"D1","level":"warning","message":{"text":"St6Enm.B8S1B3 (cyclomatic 17): St6Enm.B8S1B3 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (St6Enm.B8S1B2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6beb3ce4a9901d2125413cc1719ee5abde098e673059096ae5be8e55b0ac60"}},{"ruleId":"D1","level":"warning","message":{"text":"B4S1.Render (cyclomatic 16): B4S1.Render has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage3/Stage3.vb"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ad96ca3d213891431a2af5d8f812326837c193db3f2955fad3958e7b11ee17"}},{"ruleId":"D2","level":"warning","message":{"text":"B6S0.Render (cognitive 74): B6S0.Render has cognitive complexity 74 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"828d924b84bbd47ef99fac1bec217e7ba39f2c90cf2c566a776f97a161279ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"Stage2.EnemySpawn (cognitive 62): Stage2.EnemySpawn has cognitive complexity 62 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ff7f3b1b6c5941951393b754e3aaf9ae883cfaa0da6e71f7fd36f6cf309c6b"}},{"ruleId":"D2","level":"warning","message":{"text":"B7S3.Render (cognitive 60): B7S3.Render has cognitive complexity 60 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage5/Stage5.vb"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"88986010ddc35edc1e36069de08dac2c3964cf45758cd2fcca2c3386b1a8cef9"}},{"ruleId":"D2","level":"warning","message":{"text":"B6S1.Render (cognitive 57): B6S1.Render has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e9b6c8497a2aa1c973e1a377af1fc8db846cb9413661b9e937e85d047f5a74"}},{"ruleId":"D2","level":"warning","message":{"text":"Pl0B.Render (cognitive 56): Pl0B.Render has cognitive complexity 56 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/PlayerBullet.vb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"475e23607fc7de5a83996cf5eabdcd8ed1cd63c63563bcceec0ecf5e89a8dfaf"}},{"ruleId":"D2","level":"warning","message":{"text":"Stage3.EnemySpawn (cognitive 53): Stage3.EnemySpawn has cognitive complexity 53 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage3/Stage3.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e173aeef238d1b92389dce6d56437b565dc71c7e16f0110fb1b1037f7f2cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"Player.Player_Move (cognitive 52): Player.Player_Move has cognitive complexity 52 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Player.vb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1542990577984e758744ab4ed88a0170717ac06bf37969781ac0ed7a30eed10a"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyBoard.Update (cognitive 49): PropertyBoard.Update has cognitive complexity 49 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/PropertyBoard.xaml.vb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07fb9c8569adf8c2662c794015912bfb4d06288517b995f2bafe770bf037d10"}},{"ruleId":"D2","level":"warning","message":{"text":"Stage1.EnemySpawn (cognitive 44): Stage1.EnemySpawn has cognitive complexity 44 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage1/Stage1.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"93685c1eec187f2229cb5151a942757a59a09ef0c2b51b5e09d4f0df8feb66b3"}},{"ruleId":"D2","level":"warning","message":{"text":"B3S0.Render (cognitive 44): B3S0.Render has cognitive complexity 44 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage3/Stage3.vb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9523b73ad3ac2396357fda478bdfb2ad9ff58440057a51a5c71a0d79f693b050"}},{"ruleId":"D2","level":"warning","message":{"text":"B4S0.Render (cognitive 44): B4S0.Render has cognitive complexity 44 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage3/Stage3.vb"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9af7697ce785bdf4988bcf4807343782bceef5bd7b63b0e1b2cbb038608a47"}},{"ruleId":"D2","level":"warning","message":{"text":"Stage4.EnemySpawn (cognitive 44): Stage4.EnemySpawn has cognitive complexity 44 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6691774152be08a223050f124f18750e2c23f0830a8d504d444abdfdb0b5f70"}},{"ruleId":"D2","level":"warning","message":{"text":"B4S1.Render (cognitive 43): B4S1.Render has cognitive complexity 43 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage3/Stage3.vb"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c69f4f0a30200ee942d27cf048b46d232519de16ea9785ccf2bc1e0fe64634"}},{"ruleId":"D2","level":"warning","message":{"text":"Textures.Load (cognitive 42): Textures.Load has cognitive complexity 42 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ResourcePack/Class1.vb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dd700e644f6ff52e8aedb17a05be852834fde75cd25f5cc6f9b5a2cc693aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"PL1B.Render (cognitive 42): PL1B.Render has cognitive complexity 42 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/PlayerBullet.vb"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb93e3495777a0c3d7bfb324a20f6fe9c149715fd6d4a237ef343ab83ff24f0b"}},{"ruleId":"D2","level":"warning","message":{"text":"St2Enm.B2S0B2 (cognitive 41): St2Enm.B2S0B2 has cognitive complexity 41 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8f13a9e0447354ec9bcff0c877f5708cafff3859c69ed873c49e52b47ef0c4"}},{"ruleId":"D2","level":"warning","message":{"text":"B6S2.Render (cognitive 41): B6S2.Render has cognitive complexity 41 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8bc733ccf048c6cc759cd64395443c41942dc237798970b4cc09fbb984de39"}},{"ruleId":"D2","level":"warning","message":{"text":"Player.Appearance (cognitive 37): Player.Appearance has cognitive complexity 37 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Player.vb"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b5bc4001a33710fe0a3cb40e38584cc45b2b4193f8072f6f0fe2d19a88cf84"}},{"ruleId":"D2","level":"warning","message":{"text":"St6Enm.B8S1B2 (cognitive 35): St6Enm.B8S1B2 has cognitive complexity 35 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (St6Enm.B8S1B3) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c547aea3c37907a592ddb76c8e18be58caa1f4f9183e0a2150858024dcf10e"}},{"ruleId":"D2","level":"warning","message":{"text":"St6Enm.B8S1B3 (cognitive 35): St6Enm.B8S1B3 has cognitive complexity 35 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (St6Enm.B8S1B2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d22db416b3ff4c51b6749c254929b27e6c6eda0952ddccdaf558efe40f9a29e"}},{"ruleId":"D2","level":"warning","message":{"text":"B2S0.Render (cognitive 35): B2S0.Render has cognitive complexity 35 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"28447b1b47d090fcf2fe57117d0f8d4608471fbf71c1051e7494493e5e60f67f"}},{"ruleId":"D2","level":"warning","message":{"text":"B7S4.Render (cognitive 34): B7S4.Render has cognitive complexity 34 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage5/Stage5.vb"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ce95c75e2ed47d9bdfced2ce3316487faa3e08ca0910f05b3f933276a84a64"}},{"ruleId":"D2","level":"warning","message":{"text":"B8S4.Render (cognitive 30): B8S4.Render has cognitive complexity 30 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b18039d0422f4e65b16acba9434f6782c16f61b083004a21192eb6f4d3d849"}},{"ruleId":"D2","level":"warning","message":{"text":"Item.Collect (cognitive 28): Item.Collect has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Item.vb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95e2f0176322229903dd163fa047f7073ad8a25f008802607f464cee2f3fb69"}},{"ruleId":"D2","level":"warning","message":{"text":"St6Enm.B8S4B4 (cognitive 24): St6Enm.B8S4B4 has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0ec9d1e14b038ea07187dd0e108835ed9c3124c814c8118f8b3f77a485d971"}},{"ruleId":"D2","level":"warning","message":{"text":"B1S1.Render (cognitive 23): B1S1.Render has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"20662275f4e617c53a471694aafbb330f68bdf3b38aa6f22db8e37ce201f7243"}},{"ruleId":"D2","level":"warning","message":{"text":"SpellCard.Render (cognitive 22): SpellCard.Render has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/SpellCard.vb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c403e42be6a6473635aafc7f423201c9f1fa42440800d33e010d8e5d704f4e7f"}},{"ruleId":"D2","level":"warning","message":{"text":"Item.Item_Move (cognitive 21): Item.Item_Move has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Item.vb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff7f16f8528e7d2ff5020c6a919b8738918663aaac72fbc3da3ebb3755744c0"}},{"ruleId":"D2","level":"warning","message":{"text":"B8S2.Render (cognitive 21): B8S2.Render has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f5e2e3a9ecc1c20963ac0112820a5a5fc117ad7c85cfda12162c75174847c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Boss.Boss_Move (cognitive 20): Boss.Boss_Move has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Enemy.vb"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acc4f750962313b6526e6f618de6caa6ed4c8ee7d5ccd9992ad347014ffb73f"}},{"ruleId":"D2","level":"warning","message":{"text":"B0S2.Render (cognitive 20): B0S2.Render has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage1/Stage1.vb"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6770e3122051120a72ee60def1295a574cf5da6d42491c72ed3617a4c967997c"}},{"ruleId":"D2","level":"warning","message":{"text":"B2S1.Render (cognitive 20): B2S1.Render has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af68501cbafd6154c7a5db393d8fb213ad50e5081d0cd0d5d0ec59e2a44c5d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Bullet.Judge (cognitive 19): Bullet.Judge has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Bullet.vb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"295c81d6eb106b9fe79a7b07b9f01962fd99c9a5750ad8e333b8c288ea242400"}},{"ruleId":"D2","level":"warning","message":{"text":"St2Enm.S2W8 (cognitive 19): St2Enm.S2W8 has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa0bead1dd326601160df7111902b7321ad14fc21cd911e46ecb97bf4721ae6"}},{"ruleId":"D2","level":"warning","message":{"text":"B8S0.Render (cognitive 18): B8S0.Render has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1bb0043daac83c15a33640e148f983bf8cd58d961d65701290f6c00e9e0c10"}},{"ruleId":"D2","level":"warning","message":{"text":"B1S0.Render (cognitive 18): B1S0.Render has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b957263bb1adb5020f20a1b2ec9e3694091116e36f8364fa0458982aa8b3a17"}},{"ruleId":"D2","level":"warning","message":{"text":"St2Enm.S2W7 (cognitive 18): St2Enm.S2W7 has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1cb49331ba122844398380c388d60e2bc7418baf34a3b47c34e3cd4041e313"}},{"ruleId":"D2","level":"warning","message":{"text":"B7S1.Render (cognitive 18): B7S1.Render has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage5/Stage5.vb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fddb198063f07db01f9d1727d6ab5a734cda1ca1bb64826a1e761d82ec1b222"}},{"ruleId":"D2","level":"warning","message":{"text":"B8S3.Render (cognitive 17): B8S3.Render has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f33ec848753a1f9f1ee068fe3e663538f3886a1cd7ab2eba001230186db73b6"}},{"ruleId":"D2","level":"warning","message":{"text":"St2Enm.S2W6B1 (cognitive 17): St2Enm.S2W6B1 has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd72dbaf8b0d611482d79e406afb17ac999329651effa65d56769547c253065"}},{"ruleId":"D2","level":"warning","message":{"text":"Boss.DefaultMove (cognitive 16): Boss.DefaultMove has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Enemy.vb"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03f1ac53feee6a289a6db54fc5c847b3c6f604da0548d37dd32e1cd6e378e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"St4Enm.S4W2 (cognitive 16): St4Enm.S4W2 has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52820e1afbda1a2725f3280e17594e1810d59858d1449ef71bb7786663aa960"}},{"ruleId":"D2","level":"warning","message":{"text":"St4Enm.S4W3 (cognitive 16): St4Enm.S4W3 has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2955638556d33de753800e66a676699dd2aaabcabeab35f6d724c911d524f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Stage2/Stage2.vb: FileTooLong \u2014 949 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 449 over it, 1.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cdb425594bb09f326a59cb3ed4aaf57170106a6dafdfdc112befd6d1eb1b3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Stage4/Stage4.vb: FileTooLong \u2014 872 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 372 over it, 1.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57f43e3f608f1d2835039b898b4106ac2a5ed626d09661d1c18b93c84271393"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stage3.EnemySpawn: MethodTooLong \u2014 EnemySpawn runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage3/Stage3.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec279ead7ffa645aa9d943686792bf499894dbbcb826d9408bb7b15d4273e433"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Stage6/Stage6.vb: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 284 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0334eb23333c1cf8f5c5ec5cc94a689545714757a700e2b6239914668569a3f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Textures.Load: MethodTooLong \u2014 Load runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ResourcePack/Class1.vb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"09903a2f5e086004a402bf628385e77af66686d86072b86bf4ca687c870b030d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PropertyBoard.Init: MethodTooLong \u2014 Init runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/PropertyBoard.xaml.vb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"34226509faaecf19522519906c9fc59c684fb84c54173dc9951c52961dea9fee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Stage3/Stage3.vb: FileTooLong \u2014 635 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 135 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage3/Stage3.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"655792445808d4de364c1a9a692699088dc61e104968379d577cfba76f4868fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stage2.EnemySpawn: MethodTooLong \u2014 EnemySpawn runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acb882a0f8cc574b0d664a1879329648ec1bad322b884b7d9ad5961c27c01a4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: St2Enm: ClassTooLong \u2014 497 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 97 over it, 1.24\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6644417761704bcbed767c4baa36aa2e88ac7b1efd254aa44f96b14ecb7668e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stage4.EnemySpawn: MethodTooLong \u2014 EnemySpawn runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage4/Stage4.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e3487f5520070a5306a42f0d8c37b7a45194d405c234b715e106af30c7b6d3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PlayerBullet: ClassTooLong \u2014 487 significant lines (blank, comment-only and punctuation-only lines excluded), 3 methods. The bar is 400 significant lines; this is 87 over it, 1.22\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/PlayerBullet.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"536698df165651586bb2e2594a182abd6bf1bcd308508f670abe51033a86d5da"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Enemy: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/Enemy.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0413a066eb676f89fd2b1faf45e0d670b9daf4697955f4d1f5f465b288eb29a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlayerBullet.Pl0B.Render: MethodTooLong \u2014 Render runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/PlayerBullet.vb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf114fd5235ed8828d607e96ecb8b0609bfeadd7e59f388500a9067c81d95e61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PropertyBoard.Update: MethodTooLong \u2014 Update runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"AgSTG/PropertyBoard.xaml.vb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8857f15c2e6a0a0b056c2fb9a9339068433dcd9a5331ce12b1b10d47dcd57e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Stage2/Stage2.vb:218-230 | Stage2/Stage2.vb:383-395 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4c983d091385796b402624db706c00d992ae694f3c8370d4daac9edd7a0226"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): Stage1/Stage1.vb:19-41 | Stage2/Stage2.vb:19-41 | Stage3/Stage3.vb:19-41 | Stage4/Stage4.vb:19-41 | Stage5/Stage5.vb:20-42 | Stage6/Stage6.vb:18-42 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage1/Stage1.vb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3540855c72abb1127181a1b87990136f6be9cc571aaffa6fb6ef2e56c191ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 6): Stage1/Stage1.vb:22-38 | Stage2/Stage2.vb:22-38 | Stage3/Stage3.vb:22-38 | Stage4/Stage4.vb:22-38 | Stage5/Stage5.vb:23-39 | Stage6/Stage6.vb:22-39 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage1/Stage1.vb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3d6ba4c25520584db011a99415ac25a53183c90eacf9f2122e3b51b2e1b662"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): Stage6/Stage6.vb:759-773 | Stage6/Stage6.vb:780-794 \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":"Stage6/Stage6.vb"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f86228cfc151eeef838ea3f5bc830c4dcabcd882dbf7ffa197dcf84593023f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): TH07/ClearPage.vb:33-46 | TH07/FailPage.vb:49-62 \u2014 before extracting anything, compare \u0060TH07/ClearPage.vb\u0060 and \u0060TH07/FailPage.vb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TH07/ClearPage.vb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"034803d2d4fba3a5c319788f906f80a00e12a613881499ab04f7805285a4fd0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): AgSTG/STG.xaml.vb:295-305 | AgSTG/STG.xaml.vb:307-317 \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":"AgSTG/STG.xaml.vb"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8538a089e52149dbcef4bffc12b773f098f1b3d49abb059071ee798dcf60f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ResourcePack/Class1.vb:74-82 | ResourcePack/Class1.vb:83-90 \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":"ResourcePack/Class1.vb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a499b86ee991547a99c47f42d2551d4b13208aa1e59fabf87fdb70823ca09dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): TH07/ClearPage.vb:14-20 | TH07/FailPage.vb:17-23 | TH07/PausePage.vb:14-20 \u2014 before extracting anything, compare \u0060TH07/ClearPage.vb\u0060 and \u0060TH07/FailPage.vb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TH07/ClearPage.vb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4332816bfb7ab1d28415e1f623d6062aca1d323cb5582e8f9befd8e30eb14680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 4): Stage2/Stage2.vb:221-227 | Stage2/Stage2.vb:228-230 | Stage2/Stage2.vb:386-392 | Stage2/Stage2.vb:393-395 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Stage2/Stage2.vb:227\u0060 calls \u0060Add\u0060, \u0060Bullet\u0060 and \u0060Stage2/Stage2.vb:230\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d07d0599c5302b57302d09d9c2a47ed6afd43e4e77e968a6b12f548a5542d69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): TH07/ClearPage.vb:50-54 | TH07/FailPage.vb:65-69 | TH07/PausePage.vb:36-40 \u2014 before extracting anything, compare \u0060TH07/ClearPage.vb\u0060 and \u0060TH07/FailPage.vb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note what the matched lines are: every one of them assigns one field to another, so the block is a hand-written mapper between two data shapes rather than behaviour with a helper inside it. Extracting one shared function only works if both sites map the SAME pair of types in the same direction \u2014 check that first, because inverse or differently-typed mappers have no single function they can both call. Where they do not, the moves that exist are a generated or reflective mapper, a common embedded/base type the fields live on once, or accepting the run and covering it with a test that fails when a field is added to one side only."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TH07/ClearPage.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4580b08194681459e4893ebcd8cb43770b700cfc24d06925926d3b704aebaa98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): TH07/ClearPage.vb:57-61 | TH07/FailPage.vb:72-76 | TH07/PausePage.vb:43-47 \u2014 before extracting anything, compare \u0060TH07/ClearPage.vb\u0060 and \u0060TH07/FailPage.vb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TH07/ClearPage.vb"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24ce0f61cd4be7f798a863667b3dc7f3b22c7459c0aa5733a38a3060a14bd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ResourcePack.TH07/Class1.vb:142-151 | ResourcePack/Class1.vb:222-231 \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":"ResourcePack.TH07/Class1.vb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ad2f70e470caf627dae6206f07eb270a7956c3897e1d6af26bdb0708f261b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Stage3/Stage3.vb:631-640 | Stage4/Stage4.vb:802-810 | Stage5/Stage5.vb:473-481 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage3/Stage3.vb"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee68df5c896526079bb402ca66a98ad4397fee7bb06cc98e93aa586ba7783fbd"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ResourcePack: ResourcePack: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0dd3b47027a1ea6d74719f78e68ec587934dee525e1db4df59f34b2791a9cbdb"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: ResourcePack.TH07: ResourcePack.TH07: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"38e6658bf77fa926015346e4c372f167d179fb4bf2b9dbe4bf46482f8ee8ba7e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: AgSTG.Core: AgSTG.Core: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"07624b3630295c90ed1e56bc55cb13b4e92f415aa509a58a3f92327dd21d2a0b"}},{"ruleId":"D8","level":"error","message":{"text":"No automated tests: No automated tests \u2014 no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (xUnit, NUnit or MSTest), and run it in CI so the gap cannot reopen."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3132564c6310e5d01a231f252a02d5d2f5a542c0a8fa29a14c89693f1e3df871"}},{"ruleId":"D9","level":"note","message":{"text":"No tests found: No test suite could be collected \u2014 no discoverable tests to count. If this repository does test, wiring the suite to a framework a runner can collect (xUnit, NUnit or MSTest) is what makes it countable here; a pipeline step that invokes a runner is not evidence on its own, because a runner over an empty suite passes. Tests written as plain executables or shell/PowerShell harnesses are not collectible this way and are not scored here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9bf64cbb5a4ae13d6bcd01fa3bc8d2879d860c73bc67f176ee3c2cecb8adce3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ResourcePack/Class1.vb: ResourcePack/Class1.vb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Textures.Load at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-02-26..2026-05-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-02-26 21:59:15 \u002B08:00\u0027 --until=\u00272026-05-27 21:59:15 \u002B08:00\u0027 --full-history --no-merges -- ResourcePack/Class1.vb\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ResourcePack/Class1.vb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7ff8e980cd71dafa793ba50820b6aa7857e40e5982761c2ef89bd2e1996247"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Stage6/Stage6.vb: Stage6/Stage6.vb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in St6Enm.B8S4B4 at line 776. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-02-26..2026-05-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-02-26 21:59:15 \u002B08:00\u0027 --until=\u00272026-05-27 21:59:15 \u002B08:00\u0027 --full-history --no-merges -- Stage6/Stage6.vb\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage6/Stage6.vb"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"647762a3c1c57aee4e757a84a136515ca6c9db0118189ed13525876f5c97422d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Stage2/Stage2.vb: Stage2/Stage2.vb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in St2Enm.B2S0B2 at line 874. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-02-26..2026-05-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-02-26 21:59:15 \u002B08:00\u0027 --until=\u00272026-05-27 21:59:15 \u002B08:00\u0027 --full-history --no-merges -- Stage2/Stage2.vb\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Stage2/Stage2.vb"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9743f30ad6da0cdd63e76559c210ffde3f623d2fb4967faa696960d469799e9"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The README claims to be the best VB STG engine and states it has migrated to .NET 10 while replacing six example projects but never explains what AgSTG does or how to install/use it. State what the project is (an embedded STG game engine for VB) and give a one-line usage goal, such as \u0027run an existing example\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Readme.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5d5366cfdf2af4510d66fe3e9a6b973ad5995cde707397c3dfd1970cd50281"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no installation or build instructions: The README contains no installation/build or setup instructions. Add steps to install .NET 10 SDK, add the project to a solution, and run the first example."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Readme.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c7c314925767d8832b1a2f29daecc0317e204ec6f5c3ec82540f2b942ff91f"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no usage examples: There are no usage examples in the README. Show how to run an existing example (e.g. \u0027dotnet run --project AgSTG\u0027) or describe what each command does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Readme.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5b96ab3a6142d656cc5e65e37ff19e533042c9116d6378a604d53a1568f388"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 11 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, it found no a build/run or getting-started section, no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise \u2014 or with no heading at all \u2014 is not seen and this row may understate what the document covers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5fc8f78bec0b6b3daab9d9139ba49b687f61b54f8310b64c159df9616f47e38e"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"M3","level":"note","message":{"text":"No src/ separation: Production code isn\u0027t grouped under a src/ folder \u2014 it\u0027s spread across several top-level directories, so there\u0027s no one place that says \u0027this is the product\u0027."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"M3","level":"note","message":{"text":"Inconsistent root namespaces: Only 3/12 projects share a common root namespace \u2014 the code\u0027s module identity is inconsistent."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c8031c9fb77ad97c2e4a8ddb29978f4bf30140d481913bd7fde8b5adbbb83ede"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README claims embedded branch exists but evidence shows no Embedded project \u2014 searched for: \u0060Embedded\u0060. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest files (package.json, *.csproj, *.props, *.slnx, *.yml, Dockerfile); the README\u0027s own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read \u2014 a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5f5818f99de9266babecd1819098c720924f79a8ace6777b8ee75353127d13ea"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README claims Release publishes Windows-only; evidence shows AgSTG.Core/bin/ and Stage1-Stage6 projects exist for net10.0-windows7.0 (Windows) only \u2014 reported by the model that read the README against this repository; no term search was run for this one, so nothing here has been checked against the tree. Treat it as a reading to confirm, not as a measured contradiction: verify it against the code before acting on it, and if the footprint it describes does exist, this row is wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"340bd42487163c17625ed59406fa360ad02232a0b8f68e65e4c9dac8c74ecea2"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets \u2014 CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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":0,"secretScannerRunsExcluded":0}}}]}