{"$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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"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"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"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"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"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"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"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":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"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":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"ImageProcessing.OnUserUpdate (cyclomatic 103): ImageProcessing.OnUserUpdate has cyclomatic complexity 103 (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":"samples/olc/41 - 8BitsImProc/Program.vb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"01daa232287cb5034125d332d8559b1f7d9c263a9396d4bbd424d7d110004741"}},{"ruleId":"D1","level":"warning","message":{"text":"Machine.EmulateCycle (cyclomatic 92): Machine.EmulateCycle has cyclomatic complexity 92 (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":"samples/misc/Chip8/Machine.vb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a8c3ea20e4bf443287ef503f253eed402f8ce97485a5eb523a425df3d477ca"}},{"ruleId":"D1","level":"warning","message":{"text":"CellRoad.CalculateAdjacency (cyclomatic 91): CellRoad.CalculateAdjacency has cyclomatic complexity 91 (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":"samples/olc/40 - CarCrimeCity2/CellRoad.vb"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d784e328f4e1054a31d896362066ade36c23bfedd901888ad0d4fc3ac17d539f"}},{"ruleId":"D1","level":"warning","message":{"text":"CarCrime.OnUserUpdate (cyclomatic 75): CarCrime.OnUserUpdate has cyclomatic complexity 75 (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":"samples/olc/36 - CarCrimeCity1/Program.vb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"570ecd781570fa83cf0d22fefea40acea52f362531bc420df0c8c2e2d9c9f65f"}},{"ruleId":"D1","level":"warning","message":{"text":"PathFinding_FlowFields.OnUserUpdate (cyclomatic 67): PathFinding_FlowFields.OnUserUpdate has cyclomatic complexity 67 (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":"samples/olc/35 - PathFinding_WaveProp/Program.vb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"686f22fcd4b833f0b7d7013456d83bfbbc15a34d47a49b0ec70ac2b699f25a66"}},{"ruleId":"D1","level":"warning","message":{"text":"PixelGameEngine.EngineThread (cyclomatic 62): PixelGameEngine.EngineThread 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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":3470}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2f460b234e7e06ba3d51f40c6c7b0b376f7391d5d1819f8084591323a6ba12"}},{"ruleId":"D1","level":"warning","message":{"text":"PipeLine.RasterTriangle (cyclomatic 53): PipeLine.RasterTriangle has cyclomatic complexity 53 (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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b8efe12f7e832b5a9b977af0bd1353797a6dca25adc23c35049a8ad47c1e7c"}},{"ruleId":"D1","level":"warning","message":{"text":"PixelGameEngine.FillTriangle (cyclomatic 46): PixelGameEngine.FillTriangle has cyclomatic complexity 46 (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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":2869}}}],"partialFingerprints":{"codehealthFindingId/v1":"2731f23fb422b13227368062ba895e327a79e5c3d522b1d26af77e85f77e2420"}},{"ruleId":"D1","level":"warning","message":{"text":"Pge2C02.Clock (cyclomatic 45): Pge2C02.Clock has cyclomatic complexity 45 (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":"samples/olc/45 - NESp4/Pge2C02.vb"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d57231ef22837687a5b957d24d9e4185f19a0adfb582f03b61bf6e740677e3f"}},{"ruleId":"D1","level":"warning","message":{"text":"Gfx3D.TexturedTriangle (cyclomatic 38): Gfx3D.TexturedTriangle has cyclomatic complexity 38 (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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f158523c246c19ecf7ee0a4dcbb3fab5c40d3155168ef41f1ae4db74278254a"}},{"ruleId":"D1","level":"warning","message":{"text":"RetroArcadeRacer.OnUserUpdate (cyclomatic 35): RetroArcadeRacer.OnUserUpdate 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":"samples/olc/05 - RetroArcadeRacer/Program.vb"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d44f6a98b80b4cfbe86807b42575e8bf9bb505d6eef6dcc5852f6483c1b885c"}},{"ruleId":"D1","level":"warning","message":{"text":"Pge2C02.PpuRead (cyclomatic 32): Pge2C02.PpuRead has cyclomatic complexity 32 (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":"samples/olc/45 - NESp4/Pge2C02.vb"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f95e831a102b963f796671fc1564d8ac17db14e4b8b0d0db123c91eebf5aff4"}},{"ruleId":"D1","level":"warning","message":{"text":"Minimaze.OnUserUpdate (cyclomatic 32): Minimaze.OnUserUpdate has cyclomatic complexity 32 (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":"samples/misc/Minimaze/Program.vb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"561d806441ae50e58cb22acb1ff18b0e6519a5617cea34fdbc6d1559610f3e76"}},{"ruleId":"D1","level":"warning","message":{"text":"Pge2C02.PpuWrite (cyclomatic 30): Pge2C02.PpuWrite has cyclomatic complexity 30 (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":"samples/olc/45 - NESp4/Pge2C02.vb"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"58302687affd83ac98bd35a1ef429b83be46a3ff88fe9fd9974ce9cdf2757d0b"}},{"ruleId":"D1","level":"warning","message":{"text":"Loader.New.ctor (cyclomatic 30): Loader.New.ctor has cyclomatic complexity 30 (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":"samples/misc/BLoad/Loader.vb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"45411dec0bf712f76833f8dffba83a3d90ecd93e4c11765f7da65abe963481e7"}},{"ruleId":"D1","level":"warning","message":{"text":"PolygonCollisions.OnUserUpdate (cyclomatic 29): PolygonCollisions.OnUserUpdate has cyclomatic complexity 29 (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":"samples/olc/37 - PolygonCollisions1/Program.vb"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0ab91c156f83abd8477b46f264f60d54817e2df0678fe737b6a2d3820dde59"}},{"ruleId":"D1","level":"warning","message":{"text":"SVirjeeFractal.OnUserUpdate (cyclomatic 29): SVirjeeFractal.OnUserUpdate has cyclomatic complexity 29 (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":"samples/graphics/SVirjeeFractal/Program.vb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d2b8f7366573fd85f243555f9ae7aeb14a8964d51928eb85904d3266da17e2"}},{"ruleId":"D1","level":"warning","message":{"text":"PixelGameEngine.DrawLine (cyclomatic 28): PixelGameEngine.DrawLine has cyclomatic complexity 28 (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 is NOT this file\u0027s highest cyclomatic complexity: PixelGameEngine.ConsoleColor2PixelColor (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"437be62c4c0919e23ff1f79a198f973c764e8108a466942f713b77f7572d023c"}},{"ruleId":"D1","level":"warning","message":{"text":"PixelGameEngine.Pge_WindowEvent (cyclomatic 28): PixelGameEngine.Pge_WindowEvent has cyclomatic complexity 28 (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 is NOT this file\u0027s highest cyclomatic complexity: PixelGameEngine.ConsoleColor2PixelColor (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e811656bd7fc0491268d5b28f3678ff707359b8d750624b74f201c5700cbdf9"}},{"ruleId":"D1","level":"warning","message":{"text":"CarCrimeCity.OnUserUpdate (cyclomatic 26): CarCrimeCity.OnUserUpdate 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":"samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa716d3a7a462091ea4e0349aa784b63a53e7727e2a8edb43b7fe627ac735811"}},{"ruleId":"D1","level":"warning","message":{"text":"CarCrimeCity.DoEditMode (cyclomatic 26): CarCrimeCity.DoEditMode 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":"samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3c7786dedb4cd9af394859f6acd842a3694bb66890d24f321a0ab3bc1e546c"}},{"ruleId":"D1","level":"warning","message":{"text":"PipeLine.Render (cyclomatic 25): PipeLine.Render 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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"3597272da7ba7478c490d0a4ade451b3e32cefef4c42ad90eced84fb62ae4177"}},{"ruleId":"D1","level":"warning","message":{"text":"Mazes.OnUserUpdate (cyclomatic 25): Mazes.OnUserUpdate 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":"samples/olc/03 - Mazes/Program.vb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e803ffaa3a448bf540c89086dead5bca5af76abba6aaee4672e1fdbd2ae30e5"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoBody.UpdateAuto (cyclomatic 25): AutoBody.UpdateAuto 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":"samples/olc/40 - CarCrimeCity2/Automata.vb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd81bae75507fc1c04e1aaa8b6a8fa99b0f1f11abfd14f121519f79c2f9d776"}},{"ruleId":"D1","level":"warning","message":{"text":"KimmieFish.OnUserUpdate (cyclomatic 25): KimmieFish.OnUserUpdate 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":"samples/misc/KimmieFish/Program.vb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7b6a2065a9550e0dc29c00f9b26c10a62dd02ec9a2f4a13ae42a32ce52252c"}},{"ruleId":"D1","level":"warning","message":{"text":"ShadowOfTheBeast.OnUserUpdate (cyclomatic 23): ShadowOfTheBeast.OnUserUpdate 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":"samples/games/SotB/Program.vb"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ceb65e67f8e31a688abf6a76d13bb37ea1fc91afc40fd14d4e17e28b9f68c68"}},{"ruleId":"D1","level":"warning","message":{"text":"Demo2C02.OnUserUpdate (cyclomatic 23): Demo2C02.OnUserUpdate 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":"samples/olc/45 - NESp4/Program.vb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"433c926e4fa0557cb4cfc03ecaf5f7aceb5bb44d8880a936d5e09ae05b4cc54f"}},{"ruleId":"D1","level":"warning","message":{"text":"Polymorphism.OnUserUpdate (cyclomatic 22): Polymorphism.OnUserUpdate 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":"samples/olc/38 - Polymorphism/Program.vb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8f9c5d0e3bdefe0e8dcd65e70d4491d4ebdecfc29e4309dd7e22d99b56f6c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Webcam.Compare (cyclomatic 22): Webcam.Compare 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":"samples/olc/10 - Webcam/Program.vb"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a5bfa6d253df26b30c28b85a7a77fa4296ebccb860c36323499e3391490ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"CityMap.CreateCity (cyclomatic 21): CityMap.CreateCity 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":"samples/olc/40 - CarCrimeCity2/CityMap.vb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"417dfc2afcea5941371cb8d04d9e2aed02c2900c570d016221515e0cbeb3b366"}},{"ruleId":"D1","level":"warning","message":{"text":"Pge2C02.CpuRead (cyclomatic 20): Pge2C02.CpuRead 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":"samples/olc/45 - NESp4/Pge2C02.vb"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d86ae2391acad43438cfd72a2524614aef9a6ed49d32797818701bd0770b516"}},{"ruleId":"D1","level":"warning","message":{"text":"Webcam.ClassifyOLC (cyclomatic 20): Webcam.ClassifyOLC 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":"samples/olc/10 - Webcam/Program.vb"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e39ab7d657174ccf9b65d9400d2e52c167159866d089b90a6d472125ac7835"}},{"ruleId":"D1","level":"warning","message":{"text":"Breakout.OnUserUpdate (cyclomatic 20): Breakout.OnUserUpdate 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":"samples/games/Breakout2/Program.vb"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc919fce4c4ff9e7000ae329594e337c2b2c18d5d5d2a9195048d177106a037"}},{"ruleId":"D1","level":"warning","message":{"text":"Waves.OnUserCreate (cyclomatic 20): Waves.OnUserCreate 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":"samples/misc/Waves/Program.vb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"864e3a19b38403fe0bd4fa029a3e717ac480c131e2aea21a349c3a8bae9c23a0"}},{"ruleId":"D1","level":"warning","message":{"text":"PathFinding_AStar.OnUserUpdate (cyclomatic 19): PathFinding_AStar.OnUserUpdate 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":"samples/olc/11 - PathFinding_AStar/Program.vb"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5556ef30c47cc9345e8722b4a9fa1892cd63c27a6b4ffbd8792abed38436a5f0"}},{"ruleId":"D1","level":"warning","message":{"text":"CarCrimeCity.LoadAssets (cyclomatic 18): CarCrimeCity.LoadAssets 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":"samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"82456337ce1a3f0e914a09d04c329193a992e0c491232da2fe0487e1cd5792eb"}},{"ruleId":"D1","level":"warning","message":{"text":"IsometricDemo.OnUserUpdate (cyclomatic 18): IsometricDemo.OnUserUpdate 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":"samples/olc/47 - IsometricTiles/Program.vb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e4225af2563f52cba1d5b253485dd0ed048fe84a031849b891b64a5f072230"}},{"ruleId":"D1","level":"warning","message":{"text":"Fireworks.OnUserUpdate (cyclomatic 18): Fireworks.OnUserUpdate 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":"samples/graphics/Fireworks/Program.vb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"57671ead563a87385c95c2de4853b0f25cc5e91b944da53f51af9a74547ea3f5"}},{"ruleId":"D1","level":"warning","message":{"text":"TextBox.Update (cyclomatic 17): TextBox.Update 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":"src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c64d3a8028f4b4d0c39afb208816ab657612e51bc97daff21f195e0a7eba50b"}},{"ruleId":"D1","level":"warning","message":{"text":"PixelGameEngine.DrawSprite (cyclomatic 17): PixelGameEngine.DrawSprite 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 is NOT this file\u0027s highest cyclomatic complexity: PixelGameEngine.ConsoleColor2PixelColor (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cba5141595edd98ca1e37566bf6315a98144e988efa04df319b9984ba95cea"}},{"ruleId":"D1","level":"warning","message":{"text":"ShadowCasting2D.CalculateVisibilityPolygon (cyclomatic 17): ShadowCasting2D.CalculateVisibilityPolygon 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":"samples/olc/33 - ShadowCasting2D/Program.vb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b018ef341bc5b7a92bb527f76213fcf22f45910163503ef397ff2d338b3126e"}},{"ruleId":"D1","level":"warning","message":{"text":"GameSettings.LoadConfigFile (cyclomatic 17): GameSettings.LoadConfigFile 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":"samples/olc/40 - CarCrimeCity2/GameSettings.vb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d721f662941b908a8c2eb0fddedca3373d038bee9f15cbe4ebbc31a7348b6d6"}},{"ruleId":"D1","level":"warning","message":{"text":"OlcGalaxy.OnUserUpdate (cyclomatic 17): OlcGalaxy.OnUserUpdate 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":"samples/olc/49 - ProcGenUniverse/Program.vb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"536e9275c9b462af47d18f7346250a8b8ac66f814e644292152a6bc0b2cf3fae"}},{"ruleId":"D1","level":"warning","message":{"text":"Breakout.OnUserUpdate (cyclomatic 17): Breakout.OnUserUpdate 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":"samples/olc/23 - Breakout/Program.vb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb49b30d77348fa53f0be46f36b926c57e676ae2eae4a3ac001819032d157404"}},{"ruleId":"D1","level":"warning","message":{"text":"PathFinding_AStar.OnUserCreate (cyclomatic 17): PathFinding_AStar.OnUserCreate 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":"samples/olc/11 - PathFinding_AStar/Program.vb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"575389d2a171bb2e4b2eefb208efa85ed61e61b378030c48bfcef591ce3bc29f"}},{"ruleId":"D1","level":"warning","message":{"text":"Asteroids.OnUserUpdate (cyclomatic 17): Asteroids.OnUserUpdate 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":"samples/olc/08 - Asteroids/Program.vb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"831564b6161fd9f0bfbe17037f7a01687b4b556dbedbaf8f3fb00fc4dee5a23e"}},{"ruleId":"D1","level":"warning","message":{"text":"RaytracingTex.OnUserCreate (cyclomatic 16): RaytracingTex.OnUserCreate 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":"samples/3d/RaytracingTex/Program.vb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda89964eab1c608bc6119d65504343b36dd1b2e98de445bbf0c2ec00d489195"}},{"ruleId":"D1","level":"warning","message":{"text":"AreaFill.OnUserUpdate (cyclomatic 16): AreaFill.OnUserUpdate 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":"samples/graphics/AreaFill/Program.vb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"69db4be54a16b775728c54631f256d60f002d881119bc8b4c4ec5cea45b7eef2"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageProcessing.OnUserUpdate (cognitive 210): ImageProcessing.OnUserUpdate has cognitive complexity 210 (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":"samples/olc/41 - 8BitsImProc/Program.vb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e087aab301d347fbe4fd4942d12d3493da97580da8d76b91988824fb4fdf69"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelGameEngine.EngineThread (cognitive 158): PixelGameEngine.EngineThread has cognitive complexity 158 (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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":3470}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae25bed628641fd3e8aaf4a94714d037fc54e6f3a1cd37f9b12811725abfde4"}},{"ruleId":"D2","level":"warning","message":{"text":"CarCrime.OnUserUpdate (cognitive 130): CarCrime.OnUserUpdate has cognitive complexity 130 (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":"samples/olc/36 - CarCrimeCity1/Program.vb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3384368b539df7727c4c53b48c19eecd9d4343691c62140b7318c0cfa5797e6"}},{"ruleId":"D2","level":"warning","message":{"text":"PathFinding_FlowFields.OnUserUpdate (cognitive 109): PathFinding_FlowFields.OnUserUpdate has cognitive complexity 109 (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":"samples/olc/35 - PathFinding_WaveProp/Program.vb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"816570fea7cfb24dacee1e0892eb0037a110a7370d1e40e2c0440f0f07034d74"}},{"ruleId":"D2","level":"warning","message":{"text":"Machine.EmulateCycle (cognitive 106): Machine.EmulateCycle has cognitive complexity 106 (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":"samples/misc/Chip8/Machine.vb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cb23f1820f3a2fa8f5c063f1c1d5fbcd09e31c45927c9913cd24b830eb7488"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelGameEngine.FillTriangle (cognitive 104): PixelGameEngine.FillTriangle has cognitive complexity 104 (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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":2869}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c56de1348b0916db0bac4928e06d16052ac241fa7d0d9c809b1c3b70c96bc76"}},{"ruleId":"D2","level":"warning","message":{"text":"PipeLine.RasterTriangle (cognitive 102): PipeLine.RasterTriangle 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f0b3305aee4ba20dfc509a9757f06140d0780516dae66c00692f7dd448bcb9"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoBody.UpdateAuto (cognitive 69): AutoBody.UpdateAuto has cognitive complexity 69 (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":"samples/olc/40 - CarCrimeCity2/Automata.vb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b22cf514e844a34043b56183a71046119fa7a0b517da57690a9f3da7084c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"Pge2C02.Clock (cognitive 68): Pge2C02.Clock has cognitive complexity 68 (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":"samples/olc/45 - NESp4/Pge2C02.vb"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"feef4c840b395e29760c4877d1aa34b7f240cd5826918f41a0915a600c867454"}},{"ruleId":"D2","level":"warning","message":{"text":"RaytracingTex.OnUserCreate (cognitive 65): RaytracingTex.OnUserCreate has cognitive complexity 65 (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":"samples/3d/RaytracingTex/Program.vb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd5a06d45a3f3f5c4216ead7e65bd14a1aac803f042d195d50da34b5eda37cc"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelGameEngine.DrawLine (cognitive 62): PixelGameEngine.DrawLine 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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":2486}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c46cce01e5db0a2db4d18bef420f9f00f181bc72d631f63a19eb5289aac5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Gfx3D.TexturedTriangle (cognitive 60): Gfx3D.TexturedTriangle 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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b835bd4c8d8f66e47082cd2785834fe7ba3fdc0c107f9aaf15ee30d7a5a0d60"}},{"ruleId":"D2","level":"warning","message":{"text":"Minimaze.OnUserUpdate (cognitive 57): Minimaze.OnUserUpdate 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":"samples/misc/Minimaze/Program.vb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a1aa4d81a830474689274fb3ad059a0bd08410cd220557938f8d97bdbd32a4"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelGameEngine.DrawStringProp (cognitive 56): PixelGameEngine.DrawStringProp 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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":3233}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f6a278181661f78917bfaef89e9fffa9d1be131c883c822ca19680cab9ee94"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelGameEngine.DrawString (cognitive 55): PixelGameEngine.DrawString has cognitive complexity 55 (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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":3155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6837745131a612cc03cb3298ee64734c249e1e63d0c0dd0a335240be12706265"}},{"ruleId":"D2","level":"warning","message":{"text":"RetroArcadeRacer.OnUserUpdate (cognitive 54): RetroArcadeRacer.OnUserUpdate has cognitive complexity 54 (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":"samples/olc/05 - RetroArcadeRacer/Program.vb"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19a59320b4c64256a0e82f91bc8fc774992bf4a417d826cf5bdaeec4c08c2fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Pge2C02.PpuRead (cognitive 53): Pge2C02.PpuRead 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":"samples/olc/45 - NESp4/Pge2C02.vb"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9f58d1593239875608fdd6154f506e9d6e83e5f811d41f47d0caf521178437"}},{"ruleId":"D2","level":"warning","message":{"text":"PipeLine.Render (cognitive 52): PipeLine.Render 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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65e167a48d8d9522611d886e22d06e1bf5e40dd4a90dec1e8cca27bdb15b399"}},{"ruleId":"D2","level":"warning","message":{"text":"ShadowCasting2D.ConvertTileMapToPolyMap (cognitive 52): ShadowCasting2D.ConvertTileMapToPolyMap 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":"samples/olc/33 - ShadowCasting2D/Program.vb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb02b6ca74765f24dc122117aadf3c50e2188efab775a933f4250d5023e5325"}},{"ruleId":"D2","level":"warning","message":{"text":"ShadowCasting2D.CalculateVisibilityPolygon (cognitive 52): ShadowCasting2D.CalculateVisibilityPolygon 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":"samples/olc/33 - ShadowCasting2D/Program.vb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"843d3a08400ce0b02b7c77b8fee03ac4bee09e995ee51ad6fdbbcd4e0f4125c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Pge2C02.PpuWrite (cognitive 50): Pge2C02.PpuWrite has cognitive complexity 50 (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":"samples/olc/45 - NESp4/Pge2C02.vb"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d83d3ba535eb4b650ada887d31efb5ba09fc436d8dfd1ee1cad4db11d960f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Mazes.OnUserUpdate (cognitive 49): Mazes.OnUserUpdate 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":"samples/olc/03 - Mazes/Program.vb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4809108c0976759482e7c699547836fdfe9a1b3863b13b43c207747884d6379"}},{"ruleId":"D2","level":"warning","message":{"text":"Mesh.LoadOBJFile (cognitive 47): Mesh.LoadOBJFile 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea3236a484006d9e7cb83e8715af71069d87e1c31c77f5e4cc025be480e3135"}},{"ruleId":"D2","level":"warning","message":{"text":"CarCrimeCity.OnUserUpdate (cognitive 47): CarCrimeCity.OnUserUpdate 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"039406bca5b7fd87d5ff01942529677f410f00c0a804bb301a26c344ab21da77"}},{"ruleId":"D2","level":"warning","message":{"text":"Loader.New.ctor (cognitive 42): Loader.New.ctor 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":"samples/misc/BLoad/Loader.vb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1bef79f786aa81f97557ee33403741ad3e98634021f648205f30add38f2128"}},{"ruleId":"D2","level":"warning","message":{"text":"SVirjeeFractal.OnUserUpdate (cognitive 42): SVirjeeFractal.OnUserUpdate 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":"samples/graphics/SVirjeeFractal/Program.vb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe1629edae948f67288b9b27e39d67c98e5bcb46e0b799d61d7039a4d1aa526"}},{"ruleId":"D2","level":"warning","message":{"text":"Demo2C02.OnUserUpdate (cognitive 38): Demo2C02.OnUserUpdate has cognitive complexity 38 (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":"samples/olc/45 - NESp4/Program.vb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb17c2d67404acbd5b6f9261b4132b2c76aa0dfb4b77ff4079d58d90c28c9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"PathFinding_AStar.OnUserUpdate (cognitive 38): PathFinding_AStar.OnUserUpdate has cognitive complexity 38 (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":"samples/olc/11 - PathFinding_AStar/Program.vb"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0adc0a97d4ca7798b23122dc7ea517200729c834e7d0ee8f80ad3bab0cce4d"}},{"ruleId":"D2","level":"warning","message":{"text":"CarCrimeCity.DoEditMode (cognitive 37): CarCrimeCity.DoEditMode 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":"samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a449be477530580bb87328dadda583b312db73d5bd0c07e9adaa73eac879dcda"}},{"ruleId":"D2","level":"warning","message":{"text":"AreaFill.OnUserUpdate (cognitive 35): AreaFill.OnUserUpdate 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":"samples/graphics/AreaFill/Program.vb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"be38eb91afde81ce30b271c334859a33846dd02885a712e288db265d9b0b4720"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelGameEngine.DrawSprite (cognitive 34): PixelGameEngine.DrawSprite 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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc5ce1a50b4d7f5bd99b2fa8dfe6b4762c4cfff298c1629c384535400b13001"}},{"ruleId":"D2","level":"warning","message":{"text":"Webcam.Compare (cognitive 34): Webcam.Compare 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":"samples/olc/10 - Webcam/Program.vb"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d01002f53c724fff0d2281f4fec578ca9840948b56cc85e7e55ce52ae48509e"}},{"ruleId":"D2","level":"warning","message":{"text":"PathFinding_AStar.OnUserCreate (cognitive 34): PathFinding_AStar.OnUserCreate 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":"samples/olc/11 - PathFinding_AStar/Program.vb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a643ab09f3f38e9f779537166e6c812879e81ad18a84618f855c884f6bda0053"}},{"ruleId":"D2","level":"warning","message":{"text":"PolygonCollisions.OnUserUpdate (cognitive 33): PolygonCollisions.OnUserUpdate 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/37 - PolygonCollisions1/Program.vb"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb3607ac65cb5688d9fb41c4397b6db23161dafb74d57663449fa4dcfe95b3d"}},{"ruleId":"D2","level":"warning","message":{"text":"GameSettings.LoadConfigFile (cognitive 30): GameSettings.LoadConfigFile 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":"samples/olc/40 - CarCrimeCity2/GameSettings.vb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e516892f54a2493d2151b83f08e44b4fc834f708a1281db783f4066ac4b8a9"}},{"ruleId":"D2","level":"warning","message":{"text":"QBasic.Print (cognitive 30): QBasic.Print 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":"samples/misc/CoCo/Program.vb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7af08e7f31c9f8544c50c009f71601c8e16e1cc392d46e4bf9af8f7dc8e31dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Loader.RasterizeFragment (cognitive 30): Loader.RasterizeFragment 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":"samples/misc/BLoad/Loader.vb"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e339fce9c80e79037965e8a9ea10760293f6568b1df8357f846db2cf55935cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"Polymorphism.OnUserUpdate (cognitive 29): Polymorphism.OnUserUpdate has cognitive complexity 29 (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":"samples/olc/38 - Polymorphism/Program.vb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c776e24ee2d90ab4d8d941438136024e73082633ce98e7d11c5ead71f0bcbb2a"}},{"ruleId":"D2","level":"warning","message":{"text":"OlcGalaxy.OnUserUpdate (cognitive 29): OlcGalaxy.OnUserUpdate has cognitive complexity 29 (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":"samples/olc/49 - ProcGenUniverse/Program.vb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a2943261c6043682f8b65250745a5a255400d71e79b56476d3cc49112eb103"}},{"ruleId":"D2","level":"warning","message":{"text":"Webcam.ClassifyOLC (cognitive 29): Webcam.ClassifyOLC has cognitive complexity 29 (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":"samples/olc/10 - Webcam/Program.vb"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec2560fadbf5b1a9827373af0e523cd93917c0edfba61751ac1f993f5b290f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Fireworks.OnUserUpdate (cognitive 29): Fireworks.OnUserUpdate has cognitive complexity 29 (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":"samples/graphics/Fireworks/Program.vb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7bc1131a4d7c9030259a9cd058ba3516c6df63f8df694a8374007d22980173"}},{"ruleId":"D2","level":"warning","message":{"text":"ShadowOfTheBeast.OnUserUpdate (cognitive 28): ShadowOfTheBeast.OnUserUpdate 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":"samples/games/SotB/Program.vb"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d675e7bc184cb196c3f43fad2884c5d0be8f32f442e9404152536d439a3a7afb"}},{"ruleId":"D2","level":"warning","message":{"text":"CellRoad.CalculateAdjacency (cognitive 28): CellRoad.CalculateAdjacency 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":"samples/olc/40 - CarCrimeCity2/CellRoad.vb"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f98a693365745a35eff250d8abba3b67faaed16bf28b4dd37b0ff86c72868a8"}},{"ruleId":"D2","level":"warning","message":{"text":"GwBasic.QPrintRC (cognitive 27): GwBasic.QPrintRC has cognitive complexity 27 (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":"samples/misc/GwBasic/Program.vb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b013c9c7acb708c6fbd287411d0a1d6999de3cee0bd9324d470b12b2fef1859"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen.Print (cognitive 27): Screen.Print has cognitive complexity 27 (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":"samples/misc/Screen2/Program.vb"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fde734c0ce1c2579fc5d0915a62a579ab3dad77d019912ddbf085b906b0949"}},{"ruleId":"D2","level":"warning","message":{"text":"Demo2C02.OnUserUpdate (cognitive 26): Demo2C02.OnUserUpdate has cognitive complexity 26 (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":"samples/olc/44 - NESp3/Program.vb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a4a58bf88717544f6c48f429d7168b0163e3274537c42913de7fd4bdab2971"}},{"ruleId":"D2","level":"warning","message":{"text":"Breakout.OnUserUpdate (cognitive 26): Breakout.OnUserUpdate has cognitive complexity 26 (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":"samples/games/Breakout2/Program.vb"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a892c60deb1d21055740fb1175a51611bb787f11c675115f943ab488fbb61d4"}},{"ruleId":"D2","level":"warning","message":{"text":"KimmieFish.OnUserUpdate (cognitive 25): KimmieFish.OnUserUpdate has cognitive complexity 25 (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":"samples/misc/KimmieFish/Program.vb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d8c5d59448f04f9ed3b3b6d88038f0d91aa33e96ff387589e65f611d79854e"}},{"ruleId":"D2","level":"warning","message":{"text":"GameObjectQuad.StaticCollisionWith (cognitive 24): GameObjectQuad.StaticCollisionWith 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":"samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9fe2da407a5c12c76090d961452682f283350b899753ee0ccc591de251e81a"}},{"ruleId":"D2","level":"warning","message":{"text":"Asteroids.OnUserUpdate (cognitive 23): Asteroids.OnUserUpdate 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":"samples/olc/08 - Asteroids/Program.vb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7e2a3dd90f6f66b11ee96873dda44b3e0b995aaa8e1df70380cdff685c8b69"}},{"ruleId":"D2","level":"warning","message":{"text":"Chip8.OnUserUpdate (cognitive 23): Chip8.OnUserUpdate 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":"samples/misc/Chip8/Program.vb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb58d07d4d527e5b75754e7ca98c60ba1efc72300155ccef818295112c14e0f9"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelGameEngine.DrawPartialSprite (cognitive 22): PixelGameEngine.DrawPartialSprite 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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":3091}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fd8dcdf688c6076bdf4915eac63b5a23be24a08e4f7c265dae6d9347a504ed"}},{"ruleId":"D2","level":"warning","message":{"text":"CityMap.CreateCity (cognitive 22): CityMap.CreateCity 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":"samples/olc/40 - CarCrimeCity2/CityMap.vb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"432faefddd7df6b0be48ceedb83f48d88d2c293b7a0e29cda362c00381137b1c"}},{"ruleId":"D2","level":"warning","message":{"text":"Breakout.OnUserUpdate (cognitive 22): Breakout.OnUserUpdate 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":"samples/olc/23 - Breakout/Program.vb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd0b08eae9b2c061743edb3727013a68982bd32cf45dd92a51817ab90c0cbda"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelGameEngine.DrawCircle (cognitive 21): PixelGameEngine.DrawCircle 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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"779af8346db00d1e9c1251554f86d63d92da5d6d682c8b36e42f5fa0c806d303"}},{"ruleId":"D2","level":"warning","message":{"text":"HelloWorld.OnUserUpdate (cognitive 21): HelloWorld.OnUserUpdate 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":"samples/olc/02 - HelloWorld/Program.vb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa51587caac5f93d7649b0ab8ef6a2b0caf633273416c1bd93ef2d3226e3656e"}},{"ruleId":"D2","level":"warning","message":{"text":"GameOfLife.OnUserUpdate (cognitive 21): GameOfLife.OnUserUpdate 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":"samples/olc/04 - GameOfLife/Program.vb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba53846a53930c6e66689652d2168f10670e9b926b95499ff1679e9e43c0cf10"}},{"ruleId":"D2","level":"warning","message":{"text":"ShadowCasting2D.OnUserUpdate (cognitive 21): ShadowCasting2D.OnUserUpdate 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":"samples/olc/33 - ShadowCasting2D/Program.vb"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f7a0e1603b53cbbc828d69752d4915f1ed072bc84d64deace857593c6c1817"}},{"ruleId":"D2","level":"warning","message":{"text":"Cell.New.ctor (cognitive 21): Cell.New.ctor 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":"samples/olc/40 - CarCrimeCity2/Cell.vb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7104265d702fa2aa60affc3145e1eb32d85df15215ccd993fb20c6b00a6062"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelGameEngine.FloodFill (cognitive 19): PixelGameEngine.FloodFill 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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a53915f6e0b93fe9aaa695caac049ccb97164f05fbdcd0fd15157e2fbc597f2"}},{"ruleId":"D2","level":"warning","message":{"text":"PolygonCollisions.ShapeOverlap_DIAGS_STATIC (cognitive 19): PolygonCollisions.ShapeOverlap_DIAGS_STATIC 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":"samples/olc/37 - PolygonCollisions1/Program.vb"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"465a08552e9a69a578a8c030b96e6d7b0fb7e95a0d004d632dd6818d20dbfcce"}},{"ruleId":"D2","level":"warning","message":{"text":"PathFinding_AStar.Solve_AStar (cognitive 19): PathFinding_AStar.Solve_AStar 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":"samples/olc/11 - PathFinding_AStar/Program.vb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac12bde3dd8fcb0b8db8c9bea0a8f8d77eb8093487bdac1f576dd27d490577b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Cartridge.New.ctor (cognitive 17): Cartridge.New.ctor 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":"samples/olc/45 - NESp4/Cartridge.vb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"faadc668438a2fe24ebe02ea479bd96e08969d929eae16056005445cde92f649"}},{"ruleId":"D2","level":"warning","message":{"text":"TextBox.Update (cognitive 16): TextBox.Update 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":"src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c922aaeec7a6738f920be1ef74683465eda85201680312a32340577a8664b5"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelGameEngine.Pge_WindowEvent (cognitive 16): PixelGameEngine.Pge_WindowEvent 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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bb936ce1bf0d2cba29c71d47c3268c141f02b62628c289af8457fae48d2bbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Hat.OnUserCreate (cognitive 16): Hat.OnUserCreate 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":"samples/misc/CPET_Hat/Program.vb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b0b263d8c08feda6ab4c16f7ffb33d1c8d24062459f1fbb628b2a87ce5d00b"}},{"ruleId":"D2","level":"warning","message":{"text":"Playground.OnUserUpdate (cognitive 16): Playground.OnUserUpdate 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":"samples/graphics/_playground/Program.vb"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c15f450c1828024ffa887ead317790edef056d2fe540be591727d65732a54a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Gfx3D: ClassTooLong \u2014 1186 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 786 over it, 2.97\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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"195a7f4a02f8908c465f94ab13a0a9dedad808a50fc960d57b5a0a04bee8c4be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gfx3D.PipeLine.RasterTriangle: MethodTooLong \u2014 RasterTriangle runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"789c0a70a6dcba6fc79e74b0fe2ef8df1c0276ba246446f7b679488f8bdc87a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PGEX/Gfx3D.vb: FileTooLong \u2014 1187 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 687 over it, 2.37\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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cef6f20fce651d489598e3535c9ac102ac759d7e9c71fc4782bd132c6ba03e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SpecBAS: TooManyMethods \u2014 664 significant lines (blank, comment-only and punctuation-only lines excluded), 70 methods. The bar is 30 methods; this is 40 over it, 2.33\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":"src/vbPixelGameEngine/PGEX/SpecBAS.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ba2907c8bd6d06147d7d267e222f51ade6621bea0bfd5aa9942084ca454713"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: PGEX/SpecBAS.vb: FileTooLong \u2014 664 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 164 over it, 1.33\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":"src/vbPixelGameEngine/PGEX/SpecBAS.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99fce7ccde241bfe8cb4cd2d118b67f65c3a313d06921ed87328c46f0f02df9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gfx3D.PipeLine.Render: MethodTooLong \u2014 Render runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34d71078928e80ad5f003f7a1a13e2c28046c290491592930c1b7535bfa46f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Gfx3D.TexturedTriangle: MethodTooLong \u2014 TexturedTriangle 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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c56796c048749dcd4fce77e65662e76bb40460f1bbcc7f6ca0bb7794e3aeb60"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Gfx3D.PipeLine: ClassTooLong \u2014 496 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 96 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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb0154ee2f4290e433708144b2e27ab523878d1b487400620944c72a893c649"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Vf2d: TooManyMethods \u2014 110 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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":"src/vbPixelGameEngine/Vf2d.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d877fdd31a2adedb12735838d9d95b13fc6e0325a0642f9e340d7a4dfa2ac0d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Vi2d: TooManyMethods \u2014 100 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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":"src/vbPixelGameEngine/Vi2d.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e864c2f73c5c39c2637cd48f97eb283e77c4660e2cdec53217a2c440912918e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/vbPixelGameEngine/PGEX/Gfx3D.vb:1386-1429 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:1436-1470 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c858a3b720e7da95a49f4211f745a2545cdf62f5dba49e136affa0afe6af64d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): src/vbPixelGameEngine/PixelGameEngine.vb:3157-3202 | src/vbPixelGameEngine/PixelGameEngine.vb:3235-3283 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":3157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9e96abbfc6e99b0e9e1905858889384791a5abf332ded6faadd4c06838499b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb:254-272 | src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb:363-381 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7178ee7e130b520e6886cf6a86bf2274b2dd73d012f09f852442049be945270a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/vbPixelGameEngine/PixelGameEngine.vb:1938-1954 | src/vbPixelGameEngine/PixelGameEngine.vb:1959-1973 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"b730f52346f38b50bdcb8d031179f76f83e6768eac5594e7a413ace12a3d497d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/vbPixelGameEngine/PixelGameEngine.vb:2128-2142 | src/vbPixelGameEngine/PixelGameEngine.vb:2146-2158 \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aa366d60a91f06c1ecc45ba92a54e12516cb01d68dc048e871e18b04915e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/vbPixelGameEngine/PGEX/Gfx3D.vb:495-504 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:508-517 \u2014 These two members are one piece of code written twice and then edited apart: 10 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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"344026bde35e6a8b46114dc4512c32ce0d84b68c8f462558492f551293398d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/vbPixelGameEngine/PixelGameEngine.vb:3118-3132 | src/vbPixelGameEngine/PixelGameEngine.vb:3207-3222 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":3118}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c0abdda732d5c5efe9df32278d40356802dd0d5a1891dadc01d325066f40d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): src/vbPixelGameEngine/PGEX/Gfx2D.vb:45-48 | src/vbPixelGameEngine/PGEX/Gfx2D.vb:54-57 | src/vbPixelGameEngine/PGEX/Gfx2D.vb:63-66 | src/vbPixelGameEngine/PGEX/Gfx2D.vb:72-75 | src/vbPixelGameEngine/PGEX/Gfx2D.vb:80-83 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PGEX/Gfx2D.vb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca5eaa506626142129c61cc09bfc12259a1fce6a1a77b5ccd940b4969a818a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/vbPixelGameEngine/Pixel.vb:150-153 | src/vbPixelGameEngine/Pixel.vb:164-167 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"src/vbPixelGameEngine/Pixel.vb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"57530b9bae2900eb0e43e5ad831bf03a1195545049ca8bb7d0eb99d09d191607"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/vbPixelGameEngine/PGEX/Gfx3D.vb:787-794 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:798-805 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:809-816 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb49560596dcf750b5572ce4e6937e6c39e108cc6c90c4120c97f72022b9a2cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): src/vbPixelGameEngine/PGEX/Gfx3D.vb:33-33 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:41-41 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dea53c729ef178ed0253e8648a282dcef5e803aa4bfb9a9fb7bed819f27aafa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (93\u201398 lines \u00D7 2): src/vbPixelGameEngine/PGEX/Gfx3D.vb:1836-1933 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:1961-2053 \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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"c307d196f6dec16fe089b22faa6e92f6123801183f8986984b0df650300b8d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): src/vbPixelGameEngine/PGEX/Gfx3D.vb:292-336 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:357-401 \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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60fc5333b499098b6839fa62ef8706f92a067adabf7eb98a70a91f94b9d4522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201339 lines \u00D7 2): src/vbPixelGameEngine/PGEX/Gfx3D.vb:1389-1427 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:1439-1468 \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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"3929409db87235a3f160af2e43e0252a90aaef0d04cbd98eb8a86f5b969f6d6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/vbPixelGameEngine/PixelGameEngine.vb:2519-2542 | src/vbPixelGameEngine/PixelGameEngine.vb:2546-2569 \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11e347a4aa4ff071996634670bd62e98c61b8098563e6ab89d4fb653f5efa02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb:256-272 | src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb:365-381 \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":"src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"542bf7828cf4ecb0e5904879ab19ed13edb1e54bef5da75d5de4f38b159f4c7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/vbPixelGameEngine/PGEX/Gfx3D.vb:1063-1075 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:1098-1112 \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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"941b7733a61d0247e57c9d82c6085edbca711ae09081b8af1a25b4bff7d5bb47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/vbPixelGameEngine/PixelGameEngine.vb:1942-1953 | src/vbPixelGameEngine/PixelGameEngine.vb:1962-1973 \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ab8a65e39a24a78f2c1495bc5465db8c5cc34ef26b5e833402eb706f21f0ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/vbPixelGameEngine/PixelGameEngine.vb:2964-2968 | src/vbPixelGameEngine/PixelGameEngine.vb:3031-3035 \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":2964}}}],"partialFingerprints":{"codehealthFindingId/v1":"2067f04dab0c77b7f87e2609ff92c5dfa62d7e15cb2123b77c71061d28686dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb:254-262 | src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb:363-371 | src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb:839-847 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PGEX/QuickGui/QuickGui.vb"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4899d46b91518343412fefec960a156c1028d387f22375090a780537f8a3e1d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/vbPixelGameEngine/PixelGameEngine.vb:3180-3188 | src/vbPixelGameEngine/PixelGameEngine.vb:3261-3269 \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":3180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0b202c45fb50dd068222da1b51133f8339b47b99c1a55cfdfca86aa9c8386d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/vbPixelGameEngine/PGEX/Gfx3D.vb:1778-1787 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:1788-1797 \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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6e57e0d0aad89a9bbacf464bcb6f1a5a1b481d83c5a5b6f4c3cf7a3e867b3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/vbPixelGameEngine/PGEX/Gfx3D.vb:1011-1018 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:1019-1026 \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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"22129b5e97fb841b43f80a280e3081287f011cef3f062b10322e97fa6bb4fd84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/vbPixelGameEngine/PixelGameEngine.vb:1992-2001 | src/vbPixelGameEngine/PixelGameEngine.vb:2040-2047 \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6db4c6ea35dbd6edcce7632af69301d4e171fc66b6fdc75bb9dd5dce22f8a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 4): src/vbPixelGameEngine/PGEX/Gfx3D.vb:1076-1077 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:1081-1086 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:1113-1114 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:1125-1130 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ac58d55c4a078dca654f39a2680647b6d361f7f4d697c8678adfaa666e9778"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/vbPixelGameEngine/PixelGameEngine.vb:2080-2085 | src/vbPixelGameEngine/PixelGameEngine.vb:2094-2099 \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5669b2efeb2590feb7355b420da8e2cdc5404cf4aef12e4d1ce4d1d52d45861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/vbPixelGameEngine/PGEX/Gfx3D.vb:789-793 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:810-814 \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, \u0060src/vbPixelGameEngine/PGEX/Gfx3D.vb:815\u0060 calls \u0060M\u0060 and \u0060src/vbPixelGameEngine/PGEX/Gfx3D.vb:794\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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e818cef6d613c8a8b489f913157ebc59eb544d237250ebe3918470d9fc972f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/vbPixelGameEngine/PGEX/Gfx3D.vb:798-802 | src/vbPixelGameEngine/PGEX/Gfx3D.vb:809-813 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/vbPixelGameEngine/PGEX/Gfx3D.vb:802\u0060 calls \u0060M\u0060 and \u0060src/vbPixelGameEngine/PGEX/Gfx3D.vb:813\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":"src/vbPixelGameEngine/PGEX/Gfx3D.vb"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa25d0540425e083528b315e989e927c5a4aeffe2662b6a7cff3a3b2cd12743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/vbPixelGameEngine/PixelGameEngine.vb:4050-4058 | src/vbPixelGameEngine/PixelGameEngine.vb:4332-4340 \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":4050}}}],"partialFingerprints":{"codehealthFindingId/v1":"be06c35ce6c0d897e4f5783a786a9a80e933c885dcbbd4674e3b09d4c1ccbd94"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): samples/olc/43 - NESp2/Pge6502.vb:1202-1212 | samples/olc/43 - NESp2/Pge6502.vb:1278-1288 | samples/olc/43 - NESp2/Pge6502.vb:1292-1302 | samples/olc/44 - NESp3/Pge6502.vb:1181-1191 | samples/olc/44 - NESp3/Pge6502.vb:1253-1263 | samples/olc/44 - NESp3/Pge6502.vb:1267-1277 \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":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"129d31f9d7d7f87923e689c28eb51c62ef65823b481bbff471cf4550a75f8b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): samples/olc/44 - NESp3/Pge2C02.vb:22-94 | samples/olc/45 - NESp4/Pge2C02.vb:388-460 \u2014 These two members are one piece of code written twice and then edited apart: 73 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":"samples/olc/44 - NESp3/Pge2C02.vb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e7e57af2a5a4019be2a897c215eeb6f7b94b4ae4254c9f52a76ffd492fd20a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): samples/olc/45 - NESp4/Pge2C02.vb:713-755 | samples/olc/45 - NESp4/Pge2C02.vb:761-795 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"samples/olc/45 - NESp4/Pge2C02.vb"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9527976c476df2f4f91622c656162ea2b84ddc03e348714051072a87bee6b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): samples/olc/37 - PolygonCollisions1/Program.vb:202-239 | samples/olc/37 - PolygonCollisions1/Program.vb:246-290 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"samples/olc/37 - PolygonCollisions1/Program.vb"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"035d11ee599995c4203622689e42c5c30da01630b86ee518b392a39a4a301790"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): samples/misc/CoCo/Program.vb:122-147 | samples/misc/GwBasic/Program.vb:59-75 | samples/misc/Screen2/Program.vb:76-93 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/misc/CoCo/Program.vb"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"834e8ed6bfde7f6ef607962e5376902997ac2dea7156d2723242cc506ac8d1e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): samples/olc/45 - NESp4/Pge6502.vb:104-129 | samples/olc/45 - NESp4/Pge6502.vb:138-154 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"samples/olc/45 - NESp4/Pge6502.vb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f95d8f9b0fa1f84009e84f59dbc32d752c33bb1e6bcf4e2ea858ced80e7dbc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): samples/olc/45 - NESp4/Pge6502.vb:743-765 | samples/olc/45 - NESp4/Pge6502.vb:796-810 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"samples/olc/45 - NESp4/Pge6502.vb"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e2027359915ed8a341ccd740e8e47f1706e352f24c22e818142789ba553001"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): samples/olc/44 - NESp3/Pge6502.vb:838-848 | samples/olc/45 - NESp4/Pge6502.vb:838-848 | samples/olc/45 - NESp4/Pge6502.vb:1181-1191 | samples/olc/45 - NESp4/Pge6502.vb:1253-1263 | samples/olc/45 - NESp4/Pge6502.vb:1267-1277 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/44 - NESp3/Pge6502.vb"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e90ce181276d731f741fd9829f4347410150797b76562c7eb33b154d809d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): samples/olc/44 - NESp3/Pge6502.vb:171-224 | samples/olc/45 - NESp4/Pge6502.vb:171-224 \u2014 These two members are one piece of code written twice and then edited apart: 54 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":"samples/olc/44 - NESp3/Pge6502.vb"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"392210c286985dc7e7d2700f6c865d9acc5cd9716ac6a8d71fd567fae467a6ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb:322-329 | samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb:333-340 \u2014 These two members are one piece of code written twice and then edited apart: 8 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":"samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"5439a106bbc46feefa8e89bf433b5c3fbd7c989a7ecb1747ff3b0fe2a7bbea1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): samples/olc/40 - CarCrimeCity2/CellPlane.vb:38-49 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:832-836 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"samples/olc/40 - CarCrimeCity2/CellPlane.vb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d626c745df1f728fe1a661af7cd57ff31b063ffc461c9684c70286eb335123b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): samples/olc/43 - NESp2/Pge6502.vb:875-883 | samples/olc/44 - NESp3/Pge6502.vb:854-862 | samples/olc/45 - NESp4/Pge6502.vb:854-862 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd551e32fe004fb2dc0f908db00f6508516d878fb5322b4b018152f70d2eccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): samples/olc/43 - NESp2/Pge6502.vb:889-897 | samples/olc/44 - NESp3/Pge6502.vb:868-876 | samples/olc/45 - NESp4/Pge6502.vb:868-876 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e83476d7404e88497b34e515a8c22807fe37a95df923ed96c3d5541b060114"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): samples/olc/43 - NESp2/Pge6502.vb:903-911 | samples/olc/44 - NESp3/Pge6502.vb:882-890 | samples/olc/45 - NESp4/Pge6502.vb:882-890 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40effb6446846277ab7a01b642d0b170018ae63c25ec427e743fb6da96b0517"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): samples/olc/43 - NESp2/Pge6502.vb:926-934 | samples/olc/44 - NESp3/Pge6502.vb:905-913 | samples/olc/45 - NESp4/Pge6502.vb:905-913 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"9838311b8a803d78fd952824e42436575738d16c2f8387c430833fb0ff8e1d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): samples/olc/43 - NESp2/Pge6502.vb:940-948 | samples/olc/44 - NESp3/Pge6502.vb:919-927 | samples/olc/45 - NESp4/Pge6502.vb:919-927 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d05cd2f30d75bc19e5905468c4a4c89c225eb9975a952cc40e3b16f178e56f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): samples/olc/43 - NESp2/Pge6502.vb:954-962 | samples/olc/44 - NESp3/Pge6502.vb:933-941 | samples/olc/45 - NESp4/Pge6502.vb:933-941 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"01556c6dcbe2507f10d7596dd9db17e4ada023394a3b805d3a6c0cd5b9fa86b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): samples/olc/43 - NESp2/Pge6502.vb:985-993 | samples/olc/44 - NESp3/Pge6502.vb:964-972 | samples/olc/45 - NESp4/Pge6502.vb:964-972 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd86a74451490d95005f4272c4c91f26905ec0ebd6c93e8b5e32f354d9f3acf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): samples/olc/43 - NESp2/Pge6502.vb:999-1007 | samples/olc/44 - NESp3/Pge6502.vb:978-986 | samples/olc/45 - NESp4/Pge6502.vb:978-986 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f07aefc6856ef51589681684313f9e08d9e5861ca80e5a9c102785a118a672"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): samples/olc/44 - NESp3/Cartridge.vb:109-115 | samples/olc/45 - NESp4/Cartridge.vb:120-126 \u2014 These two members are one piece of code written twice and then edited apart: 7 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":"samples/olc/44 - NESp3/Cartridge.vb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f192125c9fc4023383ead77d133311598ee1a50d6dc42711be0d29d8414cd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): samples/olc/43 - NESp2/Pge6502.vb:445-448 | samples/olc/44 - NESp3/Pge6502.vb:424-427 | samples/olc/45 - NESp4/Pge6502.vb:424-427 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"49042f2136486579fe5722ce18a744301e5d18e488e2a004a67a8a54b283de9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): samples/olc/44 - NESp3/Cartridge.vb:129-135 | samples/olc/45 - NESp4/Cartridge.vb:140-146 \u2014 These two members are one piece of code written twice and then edited apart: 7 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":"samples/olc/44 - NESp3/Cartridge.vb"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92b8bde3b4370ab5f18fbaaaca949e2a5ef49b4413d3d62b9a74fc96364ed1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): samples/misc/XmasTree/Program.vb:114-115 | samples/misc/Boxes/Program.vb:80-81 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"samples/misc/XmasTree/Program.vb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f7fea19ab8ffbd8eff39ce0106184d82cb8bd7280ff4dc80a46800e8cec7be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): samples/graphics/Loxodrome/Program.vb:20-23 | samples/graphics/Shapes/Program.vb:7-11 | samples/misc/10print/Program.vb:6-9 | samples/misc/CoCo/Program.vb:6-9 | samples/misc/SnowBalls/Program.vb:14-17 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: 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. 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. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/Loxodrome/Program.vb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"147382efd95830d3cb384c5c278bacab70cd25b281158c836a512ccaa2e12a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (84 lines \u00D7 2): samples/olc/44 - NESp3/Pge6502.vb:257-340 | samples/olc/45 - NESp4/Pge6502.vb:257-340 \u2014 \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 and \u0060samples/olc/45 - NESp4/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 10 separate duplicated blocks between them, totalling at least 201 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/44 - NESp3/Pge6502.vb"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"585e96fbc527a0fb2222852130e37f43139a7c7cdb5cc4290ed75c6b7380534a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): samples/olc/44 - NESp3/Program.vb:56-103 | samples/olc/45 - NESp4/Program.vb:74-121 \u2014 \u0060samples/olc/44 - NESp3/Program.vb\u0060 and \u0060samples/olc/45 - NESp4/Program.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060samples/olc/44 - NESp3/Program.vb:105\u0060 calls \u0060GetKey\u0060, \u0060Reset\u0060 and \u0060samples/olc/45 - NESp4/Program.vb:123\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":"samples/olc/44 - NESp3/Program.vb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a610696c6eeeb27ad7fc2a38927d36f2f82132a27ec4a16c1a315382ac449d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201348 lines \u00D7 3): samples/olc/43 - NESp2/Pge6502.vb:249-296 | samples/olc/44 - NESp3/Pge6502.vb:249-289 | samples/olc/45 - NESp4/Pge6502.vb:249-289 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97b2cd3880dc4b938d4be9250e9adffae866ff5d9e0b5ca1fa9753963b4bfd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 3): samples/misc/CoCo/CharMap.vb:1033-1075 | samples/misc/GwBasic/CharMap.vb:776-818 | samples/misc/Screen2/CharMap.vb:776-818 \u2014 \u0060samples/misc/CoCo/CharMap.vb\u0060 and \u0060samples/misc/GwBasic/CharMap.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 43 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/misc/CoCo/CharMap.vb"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"367d5949e4a3b46e41c2f0d390c54e144c1992fbc0d42f661897b9c0bf4efc38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:104-129 | samples/olc/44 - NESp3/Pge6502.vb:104-129 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf33b2843cd6aa99c6b07e1eac47000b83d2aac3174c799fe86659b6759b33e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:764-786 | samples/olc/44 - NESp3/Pge6502.vb:743-765 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"54db5949a54d8e0513212d3af68f9bef8bc1b8ba8cd7a10da2772f8e33780e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): samples/olc/40 - CarCrimeCity2/CellRoad.vb:173-193 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:305-325 \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":"samples/olc/40 - CarCrimeCity2/CellRoad.vb"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66359ad1dcd0119c711ec6cebce4ef4a40a7b338bb7894dd35234bc5e5d6fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:64-84 | samples/olc/44 - NESp3/Pge6502.vb:64-84 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c983be310c4315e27d2b74d3b09e79970a91e72c04e14298dd8217fd47840ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): samples/misc/XmasTree/Program.vb:59-78 | samples/misc/XmasTree/Program.vb:88-107 \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":"samples/misc/XmasTree/Program.vb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d419fd762bd4a1d26e2af0395d5c20727fa396044da2f8eabc9461418f489e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:138-154 | samples/olc/44 - NESp3/Pge6502.vb:138-154 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9611447e62ec05a513417494d4af2693eacf6bb46ceb6b6d2a44dcfb6c28e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): samples/olc/44 - NESp3/Program.vb:172-188 | samples/olc/45 - NESp4/Program.vb:185-201 \u2014 \u0060samples/olc/44 - NESp3/Program.vb\u0060 and \u0060samples/olc/45 - NESp4/Program.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/44 - NESp3/Program.vb"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb4971586b890e5cf77e81345193bf86fd5a1bf815d058c51ff674c5093a8f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb:678-693 | samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb:712-728 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7f959ee937d3608c0b5afb37c4240e3a879f2b90ff591e38ae0b22a669a4a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:817-831 | samples/olc/44 - NESp3/Pge6502.vb:796-810 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c7f4e675cf121ae1120c7e76a482afb54c0f3b84cb1d41e04ca540aad28d7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb:566-579 | samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb:583-596 \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":"samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"036abd254e683359574f01f8c43a29502c8265061b2b9351029db7de93ef8d22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:968-979 | samples/olc/44 - NESp3/Pge6502.vb:947-958 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"f382eee7f36fe2136e897bf9bd050e97dbba0452d05f2ddbb3e4ec62ad6698a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8): samples/olc/40 - CarCrimeCity2/CellRoad.vb:131-141 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:145-155 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:159-169 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:173-183 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:272-282 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:283-293 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:294-304 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:305-315 \u2014 all 8 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 after the matched lines, \u0060samples/olc/40 - CarCrimeCity2/CellRoad.vb:142\u0060 calls \u0060addTrack\u0060 and \u0060samples/olc/40 - CarCrimeCity2/CellRoad.vb:184\u0060 does not \u2014 after which the two agree again for 4 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":"samples/olc/40 - CarCrimeCity2/CellRoad.vb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6074d24d4a0dee550fd2bcb14ddd340fe7ddba5ce133374df26f34e97e96d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): samples/olc/40 - CarCrimeCity2/CellRoad.vb:128-138 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:142-152 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:156-166 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:170-180 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:184-194 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:316-326 \u2014 all 6 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, \u0060samples/olc/40 - CarCrimeCity2/CellRoad.vb:124\u0060 calls \u0060addTrack\u0060 and \u0060samples/olc/40 - CarCrimeCity2/CellRoad.vb:139\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":"samples/olc/40 - CarCrimeCity2/CellRoad.vb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"84676613ed17664e5c45fbba9ba22292f848ea5101639e69a404ea0909e0a9c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): samples/olc/43 - NESp2/Pge6502.vb:625-635 | samples/olc/44 - NESp3/Pge6502.vb:604-614 | samples/olc/45 - NESp4/Pge6502.vb:604-614 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"9520cbd498c763e157b71972da458480d86e97487562d64c37f2a7835de6dc85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): samples/olc/43 - NESp2/Pge6502.vb:657-667 | samples/olc/44 - NESp3/Pge6502.vb:636-646 | samples/olc/45 - NESp4/Pge6502.vb:636-646 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d039999ded3910f1baf1c40199beff0c10a4b0744cc560c689934fa417adc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): samples/olc/37 - PolygonCollisions1/Program.vb:95-105 | samples/olc/37 - PolygonCollisions1/Program.vb:144-154 \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":"samples/olc/37 - PolygonCollisions1/Program.vb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c14877c2b328fa5fc95a1b323898254cd7894616c47c69e308c4add4dcc7ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 10): samples/olc/40 - CarCrimeCity2/CellRoad.vb:128-137 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:142-151 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:156-165 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:170-179 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:184-193 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:272-281 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:283-292 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:294-303 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:305-314 | samples/olc/40 - CarCrimeCity2/CellRoad.vb:316-325 \u2014 all 10 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, \u0060samples/olc/40 - CarCrimeCity2/CellRoad.vb:124\u0060 calls \u0060addTrack\u0060 and \u0060samples/olc/40 - CarCrimeCity2/CellRoad.vb:139\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":"samples/olc/40 - CarCrimeCity2/CellRoad.vb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6869485fefdda693798689390ffb82fc523e64878a0157a63f7d114bc7cae7a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): samples/olc/44 - NESp3/Program.vb:140-149 | samples/olc/45 - NESp4/Program.vb:153-162 \u2014 \u0060samples/olc/44 - NESp3/Program.vb\u0060 and \u0060samples/olc/45 - NESp4/Program.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/44 - NESp3/Program.vb"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"960896a3d6b97df4fe71ac342d76a4bc49c1f3cc9769d13ea374a34dc2ee3219"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): samples/misc/Chip8/Machine.vb:151-157 | samples/misc/Chip8/Machine.vb:163-169 \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":"samples/misc/Chip8/Machine.vb"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd462fb0ab507b186189729223cc02840fb6e6e6a111e96d4dd51ead9f77d93d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1306-1314 | samples/olc/44 - NESp3/Pge6502.vb:1281-1289 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"442b86afcb248186318cff9b11b8074ab1ef0c7da612206360e2baee65c72b0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): samples/olc/43 - NESp2/Pge6502.vb:1205-1212 | samples/olc/43 - NESp2/Pge6502.vb:1281-1288 | samples/olc/43 - NESp2/Pge6502.vb:1295-1302 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f74a6bc737ca91b573d42b1de6bfaf01870b7541308b1e6e4e29b36ad9d6f97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): samples/olc/44 - NESp3/Pge6502.vb:1184-1191 | samples/olc/44 - NESp3/Pge6502.vb:1256-1263 | samples/olc/44 - NESp3/Pge6502.vb:1270-1277 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/44 - NESp3/Pge6502.vb"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"532819c99500555e56826f58448411a4bdcf8afc5faac076505143d1cacee548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): samples/olc/45 - NESp4/Pge6502.vb:1184-1191 | samples/olc/45 - NESp4/Pge6502.vb:1256-1263 | samples/olc/45 - NESp4/Pge6502.vb:1270-1277 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/45 - NESp4/Pge6502.vb"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3980f86edffd4416490a921a1e052c57f4bd803760e03c40193e1d226c782b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 10): samples/misc/KimmieFish/Program.vb:46-52 | samples/misc/KimmieFish/Program.vb:54-57 | samples/misc/KimmieFish/Program.vb:58-61 | samples/misc/KimmieFish/Program.vb:62-65 | samples/misc/KimmieFish/Program.vb:66-69 | samples/misc/KimmieFish/Program.vb:81-88 | samples/misc/KimmieFish/Program.vb:90-93 | samples/misc/KimmieFish/Program.vb:94-97 | samples/misc/KimmieFish/Program.vb:98-101 | samples/misc/KimmieFish/Program.vb:102-105 \u2014 all 10 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 after the matched lines, \u0060samples/misc/KimmieFish/Program.vb:58\u0060 calls \u0060Line\u0060 and \u0060samples/misc/KimmieFish/Program.vb:53\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":"samples/misc/KimmieFish/Program.vb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cacc9f762a0af8c88f19c7d178a309f4e15b6660f4168f2530a0913d16c0b14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): samples/olc/37 - PolygonCollisions1/Program.vb:161-167 | samples/olc/37 - PolygonCollisions1/Program.vb:170-176 \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":"samples/olc/37 - PolygonCollisions1/Program.vb"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0d2375f71647d9fca8536837822add7fe8914709200f09a93fa70c358ab51d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/44 - NESp3/Pge2C02.vb:90-94 | samples/olc/45 - NESp4/Pge2C02.vb:456-460 \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":"samples/olc/44 - NESp3/Pge2C02.vb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5492f7eb974a333a06318095f3c1a892183bd3ed91962f57a30683d58e1b58fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): samples/olc/43 - NESp2/Pge6502.vb:324-329 | samples/olc/43 - NESp2/Pge6502.vb:330-335 | samples/olc/43 - NESp2/Pge6502.vb:336-341 | samples/olc/43 - NESp2/Pge6502.vb:342-347 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac78646ad241920ac74200f9de0b81d5091ed42f8436f6c856baaee23c193372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): samples/olc/37 - PolygonCollisions1/Program.vb:110-115 | samples/olc/37 - PolygonCollisions1/Program.vb:118-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/37 - PolygonCollisions1/Program.vb"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"31752d6a5f35257ef11fc161028036b0acddb8d8097e81d35ae766d8bbf48bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:915-920 | samples/olc/44 - NESp3/Pge6502.vb:894-899 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bffa2fb58dca425d409778927b378cc0f2e6c82467484dfa60855d4960e5d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1278-1282 | samples/olc/44 - NESp3/Pge6502.vb:1253-1257 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a98c524432208078d6da86c900b19f67b00a37ffe4c8160becaa8a8af573933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1292-1296 | samples/olc/44 - NESp3/Pge6502.vb:1267-1271 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ca05de820e493e2dabd57f2eda35f7b5780e628bbeeab1968dfce16b5f74d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): samples/olc/45 - NESp4/Pge2C02.vb:730-735 | samples/olc/45 - NESp4/Pge2C02.vb:736-741 \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":"samples/olc/45 - NESp4/Pge2C02.vb"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"89273eb75c75ae763a171da5338c61dbce6ee935facfa874f24457053e690dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): samples/olc/45 - NESp4/Pge2C02.vb:772-777 | samples/olc/45 - NESp4/Pge2C02.vb:778-783 \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":"samples/olc/45 - NESp4/Pge2C02.vb"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b533e2c3986919a60853b7a8755d0a0a3e382c51042454ee571d35e0e77a234"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/vbPixelGameEngine/PGEX/SpecBAS.vb:681-685 | src/vbPixelGameEngine/PGEX/SpecBAS.vb:687-691 \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":"src/vbPixelGameEngine/PGEX/SpecBAS.vb"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"182e09c85bc04850472d426f9cb6845cca774cd96bc3139f98bede2e590dd5a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): samples/olc/37 - PolygonCollisions1/Program.vb:224-229 | samples/olc/37 - PolygonCollisions1/Program.vb:270-275 \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":"samples/olc/37 - PolygonCollisions1/Program.vb"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ea3f612a3a20ca70dd98cd1c11dfc7559a05fbaaebdd57f114687698fb23fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb:152-157 | samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb:158-162 \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":"samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"790df2b129feca30141e725449abd340d1ae0c8b81b1acc71103ee60893ce256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 6): samples/misc/KimmieFish/Program.vb:55-58 | samples/misc/KimmieFish/Program.vb:59-62 | samples/misc/KimmieFish/Program.vb:70-74 | samples/misc/KimmieFish/Program.vb:91-94 | samples/misc/KimmieFish/Program.vb:95-98 | samples/misc/KimmieFish/Program.vb:106-110 \u2014 all 6 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, \u0060samples/misc/KimmieFish/Program.vb:58\u0060 calls \u0060Line\u0060 and \u0060samples/misc/KimmieFish/Program.vb:54\u0060 does not \u2014 after which the two agree again for 4 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":"samples/misc/KimmieFish/Program.vb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e41a830439211a3c741b3dac79570c8cfa517bfde7f598035823b9c9e8cc5a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): samples/olc/43 - NESp2/Program.vb:118-131 | samples/olc/44 - NESp3/Program.vb:154-167 | samples/olc/45 - NESp4/Program.vb:167-180 \u2014 \u0060samples/olc/44 - NESp3/Program.vb\u0060 and \u0060samples/olc/45 - NESp4/Program.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Program.vb"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"76476395df6ed61ac1f950032e41e5e69b9a357b43b26e763cad4b749075f708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): samples/misc/GwBasic/CharMap.vb:824-834 | samples/misc/Screen2/CharMap.vb:824-834 \u2014 \u0060samples/misc/GwBasic/CharMap.vb\u0060 and \u0060samples/misc/Screen2/CharMap.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 54 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/misc/GwBasic/CharMap.vb"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fe8d9a77bad3bd6bbf6abe4e4a80d27039d7abf073a689468c27a10cde91d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): samples/olc/43 - NESp2/Pge6502.vb:570-575 | samples/olc/44 - NESp3/Pge6502.vb:549-554 | samples/olc/45 - NESp4/Pge6502.vb:549-554 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"368f1f9a9307517a59f62a83a4a974b05454b36bd857aebc50ec63a83b4ce88d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): samples/olc/43 - NESp2/Pge6502.vb:583-593 | samples/olc/44 - NESp3/Pge6502.vb:562-572 | samples/olc/45 - NESp4/Pge6502.vb:562-572 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e60ff623a4d3129ec7e1115013622fc3923546285eae6c978a8eb48c3d6531"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): samples/olc/43 - NESp2/Pge6502.vb:601-611 | samples/olc/44 - NESp3/Pge6502.vb:580-590 | samples/olc/45 - NESp4/Pge6502.vb:580-590 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb70ae65978477af4af8ec59043ed4dd05ebed701f072b00cca09c82950f6219"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): samples/olc/43 - NESp2/Pge6502.vb:643-648 | samples/olc/44 - NESp3/Pge6502.vb:622-627 | samples/olc/45 - NESp4/Pge6502.vb:622-627 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"96380ef721ed7b048c2bc152b6ab129366537c16503564d9cc518977d25da7d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:848-852 | samples/olc/44 - NESp3/Pge6502.vb:827-831 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5de467b1081c3905183b5859c267916c2b28c4b6a6c3d66d85cb653626d2c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): samples/olc/43 - NESp2/Pge6502.vb:876-883 | samples/olc/43 - NESp2/Pge6502.vb:890-897 | samples/olc/44 - NESp3/Pge6502.vb:855-862 | samples/olc/44 - NESp3/Pge6502.vb:869-876 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dc18ba72c8eb70fcd0f8b16c5243662cafe6f2058a4e984f7a5c03af77b732"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): samples/olc/43 - NESp2/Pge6502.vb:904-911 | samples/olc/43 - NESp2/Pge6502.vb:941-948 | samples/olc/44 - NESp3/Pge6502.vb:883-890 | samples/olc/44 - NESp3/Pge6502.vb:920-927 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4a5801142c0b3567a5b490f4ebdfb5047067c7db8fd7a6c383590bb51bb707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): samples/olc/43 - NESp2/Pge6502.vb:927-934 | samples/olc/43 - NESp2/Pge6502.vb:955-962 | samples/olc/44 - NESp3/Pge6502.vb:906-913 | samples/olc/44 - NESp3/Pge6502.vb:934-941 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1335b244d78ab50e4d366a5db97468c398ca7d8932cd72d62a921495621b7ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): samples/olc/43 - NESp2/Pge6502.vb:986-993 | samples/olc/43 - NESp2/Pge6502.vb:1000-1007 | samples/olc/44 - NESp3/Pge6502.vb:965-972 | samples/olc/44 - NESp3/Pge6502.vb:979-986 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e80aef06a3bafdc5afabe3b2811f2be4b8766c352830897c7387a36d1439a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1042-1047 | samples/olc/44 - NESp3/Pge6502.vb:1021-1026 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"784229d38a8d4b029cea28206d67c1717f53df3c40a60c4d527f71f12d9d4f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1054-1059 | samples/olc/44 - NESp3/Pge6502.vb:1033-1038 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4379ccd8d788216b28b706d000201125aad647beeb2d2fe58a094d0b0957d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1066-1071 | samples/olc/44 - NESp3/Pge6502.vb:1045-1050 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b2545fd99155ed7006bdd338c62faac8936c1e28a6fc3c472e24764fc0ffb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1078-1083 | samples/olc/44 - NESp3/Pge6502.vb:1057-1062 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"424dc4d61cfa6347b97c0bf504561ada587b942973a74385ebf5d295de8559d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1110-1114 | samples/olc/44 - NESp3/Pge6502.vb:1089-1093 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94cc30b47ba453320f6ea3db19e784c59d84091de1f46032e3c1e65aa1ac405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1121-1126 | samples/olc/44 - NESp3/Pge6502.vb:1100-1105 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"05be37ef3485e5870dbefd901e0d4c13beed8b4667022c46dcd52ad92b7cd4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): samples/olc/43 - NESp2/Pge6502.vb:1159-1165 | samples/olc/44 - NESp3/Pge6502.vb:1138-1144 | samples/olc/45 - NESp4/Pge6502.vb:1138-1144 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98293309d250665b896ead95d73257460fe3e26fc6fa2331872e2d2b5ece56b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1172-1176 | samples/olc/44 - NESp3/Pge6502.vb:1151-1155 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a3fe9150beb1ca6978b050bd05d8920c9a58e3ebfbec1f49f3d2610c934bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1183-1187 | samples/olc/44 - NESp3/Pge6502.vb:1162-1166 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"866b27a7c04fe8152093b46a41444925952d311ca94fd5b85d05eff5b877f5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1194-1198 | samples/olc/44 - NESp3/Pge6502.vb:1173-1177 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a683d0b4c8f9f8f42040417c8d8fce2d949a99aca1969da4ecba9f148354c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1231-1235 | samples/olc/44 - NESp3/Pge6502.vb:1206-1210 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"23532825f58e9d6e29326c6e985d303bb49f98c48d114566db8aaebccab5f163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1250-1254 | samples/olc/44 - NESp3/Pge6502.vb:1225-1229 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8545c4591f9b3d9cf9699c209223882bb7b028bda358414811e11cc4b08b486c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/43 - NESp2/Pge6502.vb:1261-1265 | samples/olc/44 - NESp3/Pge6502.vb:1236-1240 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2ecbfa0fa01a242a28a000e4fbea7f884586d57483824d206b8c60a1618cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): samples/olc/43 - NESp2/Pge6502.vb:1318-1323 | samples/olc/44 - NESp3/Pge6502.vb:1293-1298 | samples/olc/45 - NESp4/Pge6502.vb:1293-1298 \u2014 \u0060samples/olc/43 - NESp2/Pge6502.vb\u0060 and \u0060samples/olc/44 - NESp3/Pge6502.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 36 separate duplicated blocks between them, totalling at least 358 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/43 - NESp2/Pge6502.vb"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc55253b76f1c79ef99b4576e0f5781ee4e277b6b9ade940e0e12c9519840a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): samples/olc/44 - NESp3/Cartridge.vb:34-38 | samples/olc/45 - NESp4/Cartridge.vb:34-38 \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":"samples/olc/44 - NESp3/Cartridge.vb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0821ce10f016974b6d9b308cab31f618c2348babf0b87c06f767b65593c59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): samples/olc/44 - NESp3/Cartridge.vb:99-105 | samples/olc/45 - NESp4/Cartridge.vb:110-116 \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":"samples/olc/44 - NESp3/Cartridge.vb"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7c23466824c12e82a41e845e19fd4cc559ad265193a6d1fa4f9923431cc6a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): samples/olc/44 - NESp3/Cartridge.vb:119-125 | samples/olc/45 - NESp4/Cartridge.vb:130-136 \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":"samples/olc/44 - NESp3/Cartridge.vb"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f79da0cebbc734afc5a091b5acc0c18f8f24b71970b0504b74000d6cb761e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): samples/olc/44 - NESp3/Mapper000.vb:16-20 | samples/olc/44 - NESp3/Mapper000.vb:24-28 | samples/olc/45 - NESp4/Mapper000.vb:16-20 \u2014 \u0060samples/olc/44 - NESp3/Mapper000.vb\u0060 and \u0060samples/olc/45 - NESp4/Mapper000.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 5 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/44 - NESp3/Mapper000.vb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e116605bb1606952fdc0152138276b7b98749022d89f3e98111a4d8587b743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): samples/olc/44 - NESp3/Program.vb:36-48 | samples/olc/45 - NESp4/Program.vb:38-51 \u2014 \u0060samples/olc/44 - NESp3/Program.vb\u0060 and \u0060samples/olc/45 - NESp4/Program.vb\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 103 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/44 - NESp3/Program.vb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5583317cf09395c623a0fdec6a13c2bf97063fedfed1696e1b4f49fa2cb7a9"}},{"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":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/_playground/Program.vb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfcf3e7e75e5541dfd45c48c3d1e52c7e97d36a6f4777091103f0a196f2b64d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027TODO: Raw write to the screen, does not currently operate in a \u0022console\u0022 style. \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":"samples/misc/CoCo/Program.vb"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d8945095a9db387d9769484156c6141655062a1795f52b36d79bac5264e9e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027        \u0027 TODO: Get % chance of vehicle spawn from lua script \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":"samples/olc/40 - CarCrimeCity2/CarCrimeCity.vb"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d339ccb6a3d267e9c8d3fc00662adca4e883233624c91246e6b4b9c00ca3f2ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027TODO: \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":"samples/olc/40 - CarCrimeCity2/CityMap.vb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8567db0435c223c98e56e94a32bdb9cd5248b40e6c59ec69951207fd41e9b34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027TODO: \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":"samples/olc/40 - CarCrimeCity2/CityMap.vb"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88f737bb4f9c1d16b79536ef821e19ac085f08114e9e125bd3cdc12969c782c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027TODO: Need to determine actual (default) color palette for QB64 - the below is currently based on SpecBAS. \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":"src/vbPixelGameEngine/PGEX/QB64.vb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a9f4bc01d2254fc021353151e92a52da1d177957cc23cf3d1c20954c80a437"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027TODO: SP_CompSimpson \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":"src/vbPixelGameEngine/PGEX/SpecBAS.vb"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98d7fe139f92edc43d25e4ab3e48d412637b9246a4c73606cb71e456427e4c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027TODO: Linux? \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95cfff04a89efbb74b18de7b15f3f1136863ece808cff751c7db8124a2ca63d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027TODO: Linux? \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"987111a1e3a67773cb4fe03c52b3157bc28bc43a58d71d87620fad380cc6fc9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027TODO: Linux? \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feed8f2086bcbe1abc7fb21d64845d24e3a3a15b8ef61f0aa0ae2c9b46e1baa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027TODO: Possibly limit to a maximum? \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adff0548d822b87c4dbcc18030f57fc7c16b629b7b80b24a3506155891c0518"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027TODO: WM_MOUSELEAVE is working *once*, not sure why... \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":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":4176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6eceb7123c301751aef792027dc72dcf192a6f86913923e8dec86daa208c62"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: 01 - Empty: 24 project(s) carry only a thin slice of real code; \u006001 - Empty\u0060 has 21 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.07 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/01 - Empty/01 - Empty.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb9854a903c4e8b9f9bf7642cb2f6a71174d977b7594096f89805c3bb73b8ff"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: ArchSpiral: 24 project(s) carry only a thin slice of real code; \u0060ArchSpiral\u0060 has 28 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.06 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/ArchSpiral/ArchSpiral.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00142b8e5f05c4a2b94e676dd595b19fa2b813ee4b68dbd3f81bf12c44f2d0be"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: DottyContours: 24 project(s) carry only a thin slice of real code; \u0060DottyContours\u0060 has 33 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.04 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/DottyContours/DottyContours.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bf6c982877244c1a814a61818e7030331647d40d5da42d181f7e32f6ed40ef"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: Loxodrome: 24 project(s) carry only a thin slice of real code; \u0060Loxodrome\u0060 has 35 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.04 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/Loxodrome/Loxodrome.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cce00ab3eb955aa9edf92b06b4b0a17a8d042bd44107d770418cd48b3a4b8b4"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: LissajousCurves: 24 project(s) carry only a thin slice of real code; \u0060LissajousCurves\u0060 has 36 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.04 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/math/LissajousCurves/LissajousCurves.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ad02a4ce6621b0ad461d28aac2830c0677268eb2b6aca1fbe9186c780d73ef"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: Spiral: 24 project(s) carry only a thin slice of real code; \u0060Spiral\u0060 has 37 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.03 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/misc/Spiral/Spiral.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68882cc7a075d73c17911dfaf22750a39bc705d006a12847af31c64e3bf5efa"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: FakeVoronoiPlasma: 24 project(s) carry only a thin slice of real code; \u0060FakeVoronoiPlasma\u0060 has 37 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.03 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/FakeVoronoiPlasma/FakeVoronoiPlasma.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"331138648afb19cccdc4d20a5e527518f6d0a9407e5450fa22bd4737da45c1dd"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: BamCymbal: 24 project(s) carry only a thin slice of real code; \u0060BamCymbal\u0060 has 38 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.03 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/BamCymbal/BamCymbal.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a90809848f4592c56dad545db58edc0d234a8f4d7182802d9313cac399033f"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: 34 - SpriteTransforms: 24 project(s) carry only a thin slice of real code; \u006034 - SpriteTransforms\u0060 has 39 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.03 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/34 - SpriteTransforms/34 - SpriteTransforms.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"390f235f6bda0262563447cd238eaac33c8afe02f633ab7fb01b15604d481f4a"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: Batoidea: 24 project(s) carry only a thin slice of real code; \u0060Batoidea\u0060 has 39 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.03 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/Batoidea/Batoidea.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e475a031aa780bf15bf78632ab4cfe5e5a4eb440ac42138a23f72d7943bb4c97"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: Explode: 24 project(s) carry only a thin slice of real code; \u0060Explode\u0060 has 39 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.03 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/Explode/Explode.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"136864fd31c920c940de195c4828eb39c5466ece81b2637271185b03294ad808"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: 6502_Boxes: 24 project(s) carry only a thin slice of real code; \u00606502_Boxes\u0060 has 41 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.02 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/6502_Boxes/6502_Boxes.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8ea2aea7b0b6b142b8779f34b465ebcf15d3c7ee52d0201a33831c1eb75864"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: AlphaSparkles: 24 project(s) carry only a thin slice of real code; \u0060AlphaSparkles\u0060 has 41 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.02 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/AlphaSparkles/AlphaSparkles.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1150bd03fd215ee68644522f72460e3576ab2cae50b0fcf126524e62871e066"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: ArtCircles2: 24 project(s) carry only a thin slice of real code; \u0060ArtCircles2\u0060 has 41 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.02 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/ArtCircles2/ArtCircles2.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26937bd30087fdf90ea338e6f727a5722da7b36b4b912f2bc54471ed338a3e7d"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: BubbleUniverse: 24 project(s) carry only a thin slice of real code; \u0060BubbleUniverse\u0060 has 42 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.02 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/misc/BubbleUniverse/BubbleUniverse.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab62bebd807730e8ee4a62c6dcb438d779a4dcdcf832cadd9436545108fcccc"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: Plinko: 24 project(s) carry only a thin slice of real code; \u0060Plinko\u0060 has 42 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.02 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/math/Plinko/Plinko.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3983630134f3021b305b895440d2656c98fd1f5b5fe21ea1e0888ee45e3edc3d"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: BanthorpePlot: 24 project(s) carry only a thin slice of real code; \u0060BanthorpePlot\u0060 has 42 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.02 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/BanthorpePlot/BanthorpePlot.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26951e1d118a2e76360d478eb0b4dbe23f7755d141d513aba2f932ee95b79153"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: 4501_Polys: 24 project(s) carry only a thin slice of real code; \u00604501_Polys\u0060 has 44 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.02 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/4501_Polys/4501_Polys.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e972273aa5f96d89a221b6e363517bbfca8e0cf44106d0facfd16ef0511d482"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: AmigaBall: 24 project(s) carry only a thin slice of real code; \u0060AmigaBall\u0060 has 44 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.02 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/AmigaBall/AmigaBall.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2da78b0ab2bf7398776eefb236ab6194a78616ed7571724d1d8ae29d51544d"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: Spirograph: 24 project(s) carry only a thin slice of real code; \u0060Spirograph\u0060 has 46 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.01 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/misc/Spirograph/Spirograph.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef78902379e522b482ad7f950db610ca2ac886e684bbfec85a5e9b7fc911ddf5"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: FlippyHexMaze: 24 project(s) carry only a thin slice of real code; \u0060FlippyHexMaze\u0060 has 46 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.01 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/FlippyHexMaze/FlippyHexMaze.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e675c4df2186c49a0f29b032177c5067579b8afb1358e94e8a76c72b6d39bf"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: Shapes: 24 project(s) carry only a thin slice of real code; \u0060Shapes\u0060 has 48 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.01 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/Shapes/Shapes.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca63d9596e56d25c70df872fd3c2fa4f4bd5b949e46fe8b3f2bca1875b6a93d"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: Balls3: 24 project(s) carry only a thin slice of real code; \u0060Balls3\u0060 has 49 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.01 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/misc/Balls3/Balls3.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ccebcf00fdecc4881aa246cdcf23776a8e390d63f035803deb0724e5091536"}},{"ruleId":"D18","level":"note","message":{"text":"Thin analysable surface across projects: Gears: 24 project(s) carry only a thin slice of real code; \u0060Gears\u0060 has 49 significant line(s). The mean analysable-surface weight is 92 %; this project lowers Solution Shape by about 0.01 point(s). Consolidate it or grow it into a substantial, well-scoped assembly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/graphics/Gears/Gears.vbproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3133d7829d4f8f628fb867896ad3bdb6bb4ae472e6db026d6ccc789146a97e40"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get the current window style\u0022 repeats the code it sits on: 4 of its 4 words (get, current, window, style) are already in \u0060Dim currentStyle = Win32.GetWindowLong(m_hWnd, GWL_STYLE)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1dde7fef145b7e470dfb6ddf6da8fefbbc2063eef397d4631b467d0defd221"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Initialize CapsLock state from OS\u0022 repeats the code it sits on: 4 of its 5 words (initialize, caps, lock, state) are already in \u0060InitializeCapsLockState()\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":3527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a84a58973b0c09b3a284861f9db841d3075146538440bc12bec146f3ce3c62"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create Device Context\u0022 repeats the code it sits on: 3 of its 3 words (create, device, context) are already in \u0060m_glDeviceContext = Win32.GetDC(m_hWnd)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":4101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca59094ecaaf37d36b842c7ec5ef4aa0e554f5df64e1b80c55dd670d548f12fa"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create XRender Picture for the window\u0022 repeats the code it sits on: 4 of its 4 words (create, render, picture, window) are already in \u0060pge_WindowPicture = X11.XRenderCreatePicture(pge_Display, pge_Window, pge_RenderFormat, 0, IntPtr.Zero)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vbPixelGameEngine/PixelGameEngine.vb"},"region":{"startLine":4379}}}],"partialFingerprints":{"codehealthFindingId/v1":"1347305774b69a6142176aea3e91378c3476c50595e8b0eaea6d0cf903e7fe51"}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5929e453af82f1b57447a7f9365bf16bc52cb090c09b595a562e98cec4b6eb3"},"properties":{"dependency":{"package":"Microsoft.DotNet.ILCompiler","version":"10.0.11","advisory":"[GHSA redacted]","reachability":{"kind":"production","file":"samples/graphics/Loxodrome/Loxodrome.vbproj"}}}},{"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":"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":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060samples/olc/10 - Webcam/10 - Webcam.vbproj\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"samples/olc/10 - Webcam/10 - Webcam.vbproj"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d1ac2839adc237d749e814c5eaa7d3ea251bc0236e6197d620d8d55bbaad4c"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}}],"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-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"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":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"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":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]}],"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":1,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}