{"$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":"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":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"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"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Program.Main (cyclomatic 706): Program.Main has cyclomatic complexity 706 (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":"UnZ/Program.vb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb5697dc2682a93b1a6bbe5371321072512bc04818818bc7e8516a83e8eb3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Decode.DecodeCode (cyclomatic 210): Decode.DecodeCode has cyclomatic complexity 210 (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":"UnZ/Decode.vb"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ddf8664b1547d785c8d7c1bdcad1f7936e1227db77166daab8e5b1588265e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Decode.DumpOpcode (cyclomatic 163): Decode.DumpOpcode has cyclomatic complexity 163 (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":"UnZ/Decode.vb"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"074817e7ec35b06f5890763a01139d8d7cbda654c42d48bb601847b1e45d5ab0"}},{"ruleId":"D1","level":"warning","message":{"text":"Opcode.PseudoCode (cyclomatic 159): Opcode.PseudoCode has cyclomatic complexity 159 (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":"UnZ/Decode.vb"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"74301f834e25bd1003daa4235e9f0b072ec538331d8babda131496c56a32d81e"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.DecodePropertyData (cyclomatic 65): Program.DecodePropertyData 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":"UnZ/Program.vb"},"region":{"startLine":3421}}}],"partialFingerprints":{"codehealthFindingId/v1":"60364a816fdf93e78a417f030b1130a5a58a3620aadcbf6e063e046dc99376db"}},{"ruleId":"D1","level":"warning","message":{"text":"Opcode.PrintVerbose (cyclomatic 35): Opcode.PrintVerbose 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":"UnZ/Decode.vb"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce584d989117602c1687a69a029b6be44a1ac04b20f9d8247ee56377bf033b6c"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.ScanForZilchGrammarTableV2 (cyclomatic 34): Program.ScanForZilchGrammarTableV2 has cyclomatic complexity 34 (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":"UnZ/Program.vb"},"region":{"startLine":3179}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a70b0e743d8014263f5a72c6af812cabde7e2a4131cd05a68b756a97d7ef11"}},{"ruleId":"D1","level":"warning","message":{"text":"Decode.DecodeRoutine (cyclomatic 31): Decode.DecodeRoutine has cyclomatic complexity 31 (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":"UnZ/Decode.vb"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e15fe71fdc8b5183edb510c703a10a354f8934b6dca0e76f79cafef403b70c"}},{"ruleId":"D1","level":"warning","message":{"text":"Helper.ExtractZString (cyclomatic 31): Helper.ExtractZString has cyclomatic complexity 31 (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":"UnZ/Helper.vb"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"892a0fa8ba013952b4e758b10488b63a16c2bf7d7ba966f8b2ddab3c2eac5c20"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.ScanForGrammarTableV1 (cyclomatic 31): Program.ScanForGrammarTableV1 has cyclomatic complexity 31 (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":"UnZ/Program.vb"},"region":{"startLine":2837}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd3603c5b4822916d85b08635af90cdae982d9cbf43072228eb4c41b0e5609c"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.DecodeGrammarsInformV2 (cyclomatic 25): Program.DecodeGrammarsInformV2 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":"UnZ/Program.vb"},"region":{"startLine":3817}}}],"partialFingerprints":{"codehealthFindingId/v1":"054e1738cffcddf7915644baf0f8b280234a2da2e4d432ac76778726c96e0a52"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.DecodeGrammarsInformV3 (cyclomatic 24): Program.DecodeGrammarsInformV3 has cyclomatic complexity 24 (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":"UnZ/Program.vb"},"region":{"startLine":3885}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4b702e2f370f006ad84535fd9711a65b28592b8bfff6ffd57e17aec83ad093"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.DecodeGrammarsInformV1 (cyclomatic 23): Program.DecodeGrammarsInformV1 has cyclomatic complexity 23 (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":"UnZ/Program.vb"},"region":{"startLine":3766}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d24c725e49b268af4c7381c398e6f8e69d34767ece88007dc67beb04fac9f0b"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.ScanForInformGrammarTableV2 (cyclomatic 22): Program.ScanForInformGrammarTableV2 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":"UnZ/Program.vb"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f04cce7d214385f95ffbdb0ca2b95b03c06151bbcf3f58dbbfef9fccd82aa9"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.DecodeGrammarsZilV1 (cyclomatic 19): Program.DecodeGrammarsZilV1 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":"UnZ/Program.vb"},"region":{"startLine":3607}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e21fd62a11243f6d481607fca323214608176bc1eccdcec7199b78f07350b6c"}},{"ruleId":"D1","level":"warning","message":{"text":"PropertyAnalyser.Init (cyclomatic 19): PropertyAnalyser.Init 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":"UnZ/PropertyAnalyser.vb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a116ae36c497ff5184ad7901125a02636186cae5f32fe14ddc60630395e5550"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.DecodeGrammarsZilV2 (cyclomatic 18): Program.DecodeGrammarsZilV2 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":"UnZ/Program.vb"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b8468a4ed4d5099de1b2e0dae01f25f8720328020a50f2cc66116e12d0dd3f"}},{"ruleId":"D1","level":"warning","message":{"text":"Decode.TextVariable (cyclomatic 17): Decode.TextVariable 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Decode.vb"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfec16374c339c1b3e8c01c0cbaca5191adb3837983899668b16eb11bddd533"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.ScanForZilV1PrepositionTable (cyclomatic 17): Program.ScanForZilV1PrepositionTable 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":3318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0fa1ebd4b2babe928395b3e123e3f741dbe467c352fe09f6f307b54aac79ca"}},{"ruleId":"D1","level":"warning","message":{"text":"Decode.DecodeOperands (cyclomatic 16): Decode.DecodeOperands 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":"UnZ/Decode.vb"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5efbe876290be1f63f0a761329774a96798d268633ce558480ca45df818089c"}},{"ruleId":"D1","level":"warning","message":{"text":"Program.ScanForInformGrammarTableV3 (cyclomatic 16): Program.ScanForInformGrammarTableV3 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":"UnZ/Program.vb"},"region":{"startLine":3037}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb729350f8d8aa0cf6249edb3a7956b5513900bf2740cd3df8b28649482a322"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.Main (cognitive 2327): Program.Main has cognitive complexity 2327 (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 file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5ac5a9364f99fc74ec9eb4fab545b00ce874cde35671268ee74f787059bc02"}},{"ruleId":"D2","level":"warning","message":{"text":"Decode.DumpOpcode (cognitive 382): Decode.DumpOpcode has cognitive complexity 382 (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":"UnZ/Decode.vb"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd5d2a8ce95930ce4e6eab18d2f51c72fa72eb68e89e1d63be208c8bb65ecf8"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.DecodePropertyData (cognitive 239): Program.DecodePropertyData has cognitive complexity 239 (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 file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":3421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f4bd587f9c652cc28964e163d41865326a6a9b26a5f1dbc838fcb868d21e01"}},{"ruleId":"D2","level":"warning","message":{"text":"Opcode.PseudoCode (cognitive 123): Opcode.PseudoCode has cognitive complexity 123 (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":"UnZ/Decode.vb"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa4490b4f8e7904d761729f6bb5c0857fe235275abb4c25d3bc940318036853"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.ScanForZilchGrammarTableV2 (cognitive 122): Program.ScanForZilchGrammarTableV2 has cognitive complexity 122 (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 file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":3179}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ee08bce6f6dd4666a45935daafb3278f14c0b7b9040841bde6acd48bdf3c1c"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.ScanForGrammarTableV1 (cognitive 102): Program.ScanForGrammarTableV1 has cognitive complexity 102 (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 file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":2837}}}],"partialFingerprints":{"codehealthFindingId/v1":"faff0d8aea4e1f9b4253f50f0f3c5970e591066063203bbfa24a9131912d3eac"}},{"ruleId":"D2","level":"warning","message":{"text":"Decode.DecodeRoutine (cognitive 99): Decode.DecodeRoutine has cognitive complexity 99 (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":"UnZ/Decode.vb"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea63ce14ae69d6936c4eee8fde22333be5a2ba97d19b6424580c09774845201"}},{"ruleId":"D2","level":"warning","message":{"text":"Decode.DecodeCode (cognitive 84): Decode.DecodeCode has cognitive complexity 84 (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":"UnZ/Decode.vb"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dddc0132feb2422c40e3f7c79bb3ca244e287f303bd9fce638a980c02041b00"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.ScanForInformGrammarTableV2 (cognitive 84): Program.ScanForInformGrammarTableV2 has cognitive complexity 84 (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 file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"253059380e7b6465d7681b9ef299a3ca5642427348575ddcbd057259e0910ae4"}},{"ruleId":"D2","level":"warning","message":{"text":"Opcode.PrintVerbose (cognitive 71): Opcode.PrintVerbose has cognitive complexity 71 (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":"UnZ/Decode.vb"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c0cea8eb39a5013ad6c2ab87d5d36d5846bce0aec00378d71120ed2659a3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Helper.ExtractZString (cognitive 71): Helper.ExtractZString has cognitive complexity 71 (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":"UnZ/Helper.vb"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0062d5977dca8d79b972308166da11a99b382b76612914cdd1219b479fa55d"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.DecodeGrammarsZilV2 (cognitive 60): Program.DecodeGrammarsZilV2 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":3705}}}],"partialFingerprints":{"codehealthFindingId/v1":"11541d30b57afe8100381a436939846d320338849fabb38f665fd89069cd9bc0"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyAnalyser.Init (cognitive 58): PropertyAnalyser.Init has cognitive complexity 58 (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":"UnZ/PropertyAnalyser.vb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c19707e2a18822d3a1a58a24e28e3496528601f34e27c445ae99346011d9ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.ScanForInformGrammarTableV3 (cognitive 47): Program.ScanForInformGrammarTableV3 has cognitive complexity 47 (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 file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":3037}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0c42a9217e6b3e7fc7267c9853add82b46b579046b97281d306fcf7f4b0380"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.ScanForZilV1PrepositionTable (cognitive 47): Program.ScanForZilV1PrepositionTable has cognitive complexity 47 (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 file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":3318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ec4bbb2b5a518515daf10abacaffd493020cef76c39f46e32bea0307062978"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.DecodeGrammarsZilV1 (cognitive 42): Program.DecodeGrammarsZilV1 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":3607}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99d81dd81c09184c836dae04729df2b437a4dae56903aee7f99af1b3f2958f8"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyAnalyser.IdentifyZILGlobal (cognitive 35): PropertyAnalyser.IdentifyZILGlobal 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":"UnZ/PropertyAnalyser.vb"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"5550090e733e92c7d8e638373a82059823889beb8abebd79ea3143dcace3407d"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyAnalyser.Analyse (cognitive 34): PropertyAnalyser.Analyse 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":"UnZ/PropertyAnalyser.vb"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bec1f1b375945dcd7c693445baa772866d4a4025d8d7b40ca8d9fafb137e660"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.PrintObjectTree (cognitive 33): Program.PrintObjectTree has cognitive complexity 33 (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 file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":2686}}}],"partialFingerprints":{"codehealthFindingId/v1":"e706f3b661f9b9fbae70fd2c70ca56f2a4432444dbcf78cfb45bd17f1b90c478"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyAnalyser.IdentifyZILAdjective (cognitive 31): PropertyAnalyser.IdentifyZILAdjective has cognitive complexity 31 (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":"UnZ/PropertyAnalyser.vb"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3adb458860e85fce24f2852af58b2d9538cbac5a3746b5a6ca62dba2ed7f5d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Decode.TextVariable (cognitive 30): Decode.TextVariable 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":"UnZ/Decode.vb"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ee3e6d5035702a1d0f0213ebcfa5d5983270b328d5f9fb710b5ba215fdc8ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Decode.DecodeOperands (cognitive 23): Decode.DecodeOperands 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":"UnZ/Decode.vb"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"71af3032eaeaf8443809987632667d1f4f0e1ec7e4bb1c9a8ec7283c3f95e5a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Decode.TextNumber (cognitive 21): Decode.TextNumber 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":"UnZ/Decode.vb"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"901b72ed9f53c0bfcde2e28296415e29495efb74030a9af895d12a8d483a684a"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.DecodeGrammarsInformV2 (cognitive 21): Program.DecodeGrammarsInformV2 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":3817}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d666c3cbfbe4110f3f10dab139463800c426596eacb44db065bb6e795451aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.HexDump (cognitive 19): Program.HexDump 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf4b164b27ef2c6c964d2da5076d81cffe464307aec92fac95bc9f89c191ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.DecodeGrammarsInformV1 (cognitive 19): Program.DecodeGrammarsInformV1 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":3766}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60f475cb9c7504bb2e5b809bd9118dde86d844796a56d99cf4b997260fd0681"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.ScanForZilchGrammarTableV1 (cognitive 16): Program.ScanForZilchGrammarTableV1 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":3133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d329b06e51dd071606eeaebf943f2f56536f7786e520d29fadbd387f42d25173"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.DecodeGrammarsInformV3 (cognitive 16): Program.DecodeGrammarsInformV3 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: UnZ/Program.vb holds 15 of the 28 methods over the threshold \u2014 including the worst \u2014 and 2969 of the 3836 points over it (77%), 4.2\u00D7 the next-largest file (UnZ/Decode.vb at 713). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":3885}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c4e046c42bd92ca808dc969b9ed5c14ab53400e6ea6bfbe97fecb1de286151"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Program.Main: MethodTooLong \u2014 Main runs 2227 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2127 over it, 22.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":"UnZ/Program.vb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4ba8ee0218a6f0f4186e8ead5d138926add7b79c03d2a420753889aa730cab"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Program: ClassTooLong \u2014 3245 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 2845 over it, 8.11\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":"UnZ/Program.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce07fda5122ddd340baa9d71bcbdd33c5fcc50ee73918831b86506a8415b1f1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: UnZ/Program.vb: FileTooLong \u2014 3247 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2747 over it, 6.49\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":"UnZ/Program.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af3b4aaaafe52b992d30a1517655fb7ae2137cb8eb0bc91058ccb3da247bfee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Decode.DumpOpcode: MethodTooLong \u2014 DumpOpcode runs 424 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 324 over it, 4.24\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":"UnZ/Decode.vb"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9673601007c05aeaa3e64aa5a059d39ce8d6aecbfbeaeca7d603b899c55d897"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Decode: ClassTooLong \u2014 1615 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 1215 over it, 4.04\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":"UnZ/Decode.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdc39becb1dbf07f7c93ea4d5b39d9b44c8716c3b6dad736be6e7688f2a9d0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: UnZ/Decode.vb: FileTooLong \u2014 1615 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1115 over it, 3.23\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":"UnZ/Decode.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e040efdf1e24ad157a9b8c8ab0703bb53e8594ff1e475a5cb3c9fbd64d01e6d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Decode.Opcode.PseudoCode: MethodTooLong \u2014 PseudoCode runs 308 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 208 over it, 3.08\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":"UnZ/Decode.vb"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba07f81733d1b599426d465dfb419c5e76fd920c3c97f8837a11edd615460ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Decode.DecodeCode: MethodTooLong \u2014 DecodeCode runs 281 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 181 over it, 2.81\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":"UnZ/Decode.vb"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"234bcd83e6e6ba511a904823b7f1140a3a27e59b6c478e4678ef9588a9b6147f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Decode.Opcode.PrintVerbose: MethodTooLong \u2014 PrintVerbose runs 228 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 128 over it, 2.28\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":"UnZ/Decode.vb"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84eae5070e4f50f5eebf30136f4c938930e28c436946466aedb7c2907b5843a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Program.DecodePropertyData: MethodTooLong \u2014 DecodePropertyData runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\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":"UnZ/Program.vb"},"region":{"startLine":3421}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a994241373001ea2d94114393b5ff791ce8a26be4987509b23f381aa2dc3f6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Decode.Opcode: ClassTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 195 over it, 1.49\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":"UnZ/Decode.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"230195169004241d009a997b8b2208a2392646cba73bb225b45ecb38be5f48af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Decode.DecodeRoutine: MethodTooLong \u2014 DecodeRoutine runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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":"UnZ/Decode.vb"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8026d935d4cc3bef5382768d723d29ff7e52f858640ddb511d96041ae1c293"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): UnZ/Decode.vb:1463-1484 | UnZ/Decode.vb:1488-1509 \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":"UnZ/Decode.vb"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09b2509de302561e536b1543f39daf3c0ce1ddd0e8bf70bc3727dcc4ab997e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): UnZ/Program.vb:3785-3794 | UnZ/Program.vb:3914-3923 \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. 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":"UnZ/Program.vb"},"region":{"startLine":3785}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a73dea19554e6d823ad7a5a78cb157e6702be4c1de0b77539f86b4063c0509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): UnZ/Program.vb:3239-3246 | UnZ/Program.vb:3252-3259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060UnZ/Program.vb:3260\u0060 calls \u0060GetAdressFromWord\u0060, \u0060GetEntryAtAddress\u0060 and \u0060UnZ/Program.vb:3247\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":"UnZ/Program.vb"},"region":{"startLine":3239}}}],"partialFingerprints":{"codehealthFindingId/v1":"899ce22614233d400aa7d378ed04f2346e0d3453a10c6f746ba4bf9a4f11bd65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): UnZ/Decode.vb:1126-1132 | UnZ/Decode.vb:1170-1176 \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":"UnZ/Decode.vb"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1515ab76c11263ce02a34fa5e3a083cbe93406ad3247630b31f4000dd1e09d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 5): UnZ/Decode.vb:1066-1071 | UnZ/Decode.vb:1126-1131 | UnZ/Decode.vb:1261-1266 | UnZ/Decode.vb:1268-1271 | UnZ/Decode.vb:1275-1280 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060UnZ/Decode.vb:1258\u0060 calls \u0060DecodeOperands\u0060 and \u0060UnZ/Decode.vb:1123\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Decode.vb"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed656b35d33361a2740283ff46ad5a4759492f3202670c687c8713dd88c17950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): UnZ/PropertyAnalyser.vb:251-256 | UnZ/PropertyAnalyser.vb:265-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/PropertyAnalyser.vb"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7b2bf1060a6ef0d842daa7675ceb4ebe2f247b019d4e5d51d83d067085336e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): UnZ/Decode.vb:208-214 | UnZ/Decode.vb:220-226 \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":"UnZ/Decode.vb"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"812adf05d6d95956364c9385ef24d1be076dd027bfd577602166f479d931f356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): UnZ/Decode.vb:1134-1138 | UnZ/Decode.vb:1153-1157 | UnZ/Decode.vb:1181-1185 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060UnZ/Decode.vb:1150\u0060 calls \u0060DecodeOperands\u0060 and \u0060UnZ/Decode.vb:1178\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Decode.vb"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d045cc7a1a8073759c1c7f30c9efb3409f19da34c8622463b00b18f42247881e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DictionaryEntries (LCOM4 6): DictionaryEntries\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Helper.vb"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9c026feccd8f355f000b8a7899098bc4df4e785537e71fdf22670dabe174c1"}},{"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: UnZ/Decode.vb: UnZ/Decode.vb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Decode.DecodeOperands at line 1294. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-25..2026-08-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-25 14:24:19 \u002B02:00\u0027 --until=\u00272026-08-23 14:24:19 \u002B02:00\u0027 --full-history --no-merges -- UnZ/Decode.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":"UnZ/Decode.vb"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7398681cb210af411a7f009f944559d9264e9e973afec21b9c1a63f57f3abef3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 Todo: Skipping printing property analysis for the moment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060\u0027 REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c833a2c0945f7894d1a8c4e28ba77466bde679e32e09f36e534ebb3ec6943f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 Todo: Skip this at the moment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060\u0027 REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"UnZ/Program.vb"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f4fa2ccbd03e2753adcc987eddf80458e28b8112a2f1e7cce623df499d5295"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The README begins with \u0027UnZ 0.17 ... by Henrik \u00C5sman, (c) 2021-2026\u0027 and lists many command-line options before the help flag /? appears, giving no indication of what the project is or does overall. State a one-line description of UnZ\u0027s purpose so readers can find it without reading the shell block."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dbf18d06aa983c06246108610908ba99aae6784280b3aacd1a6655733d71be"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no usage examples: The usage section lists many command-line options (-a, -d, --abbrevs) but does not show how to run the tool or what output is expected. Add a one-line \u0027How to use it\u0027 line showing the simplest invocation (e.g. unz file.z) and its effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1355eb4e127a4bc9236772ce1c46f09510aa9286e7a06d1e47f308229df19049"}},{"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":"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 all sits under UnZ/ alongside the root build files, so the conventional src/ boundary between the product and its tooling isn\u0027t drawn."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"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"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}}],"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-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":0,"secretScannerRunsExcluded":0}}}]}