{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"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":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D18","name":"Solution Shape","shortDescription":{"text":"Solution Shape"},"helpUri":"https://codehealth.canine.dev/dimensions/D18"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"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":"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":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"FileIO.LoadOlder (cyclomatic 841): FileIO.LoadOlder has cyclomatic complexity 841 (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":"ADRIFT/FileIO.vb"},"region":{"startLine":7010}}}],"partialFingerprints":{"codehealthFindingId/v1":"810f42200c6b60b958fb6749ea815e42ae7da8f48bece5a1509ca47b2c48ba59"}},{"ruleId":"D1","level":"warning","message":{"text":"FileIO.Load500 (cyclomatic 572): FileIO.Load500 has cyclomatic complexity 572 (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":"ADRIFT/FileIO.vb"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e51248925569321dc35d8a8491e6f0cf6628bf4e3119d7776e0078b2ea1769"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.ExecuteSingleAction (cyclomatic 434): RunnerSession.ExecuteSingleAction has cyclomatic complexity 434 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bc868913534a9280b8293ebb9d4ba36a2fe882503f54625e942708adf7f990"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.PassSingleRestriction (cyclomatic 429): RunnerSession.PassSingleRestriction has cyclomatic complexity 429 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5541}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7743e76ab92ce9ccc3bf0554db7e1a1d884aa6feb64d33b1100a65dd28eb50"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedModule.ReplaceOOProperty (cyclomatic 334): SharedModule.ReplaceOOProperty has cyclomatic complexity 334 (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":"ADRIFT/Global.vb"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"446f9a30d883597b825714e2dbbd79d20f4354877eca6b3cffb6c9216e64255c"}},{"ruleId":"D1","level":"warning","message":{"text":"clsVariable.SetToExpression (cyclomatic 199): clsVariable.SetToExpression has cyclomatic complexity 199 (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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f0ec71b07adc236cf2b4d6def1389c7854af72ba1d27169fb5b0c82d7ba368"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.GetReference (cyclomatic 197): RunnerSession.GetReference has cyclomatic complexity 197 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b00c87ea2085b9bf9a2054bec0a696d04d6457a07a3353db4f43c4aed15bc1f"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedModule.ReplaceFunctions (cyclomatic 165): SharedModule.ReplaceFunctions has cyclomatic complexity 165 (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":"ADRIFT/Global.vb"},"region":{"startLine":3754}}}],"partialFingerprints":{"codehealthFindingId/v1":"795b76f49648fff9016b072c84ba8b082ecdcd0de17cf8ed0f75e226b1e69da0"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.AttemptToExecuteSubTask (cyclomatic 156): RunnerSession.AttemptToExecuteSubTask has cyclomatic complexity 156 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e2f67454696a018e28fc0ea9dcfe7d44339dcb9d5b05f4cfff3cebddfb8136"}},{"ruleId":"D1","level":"warning","message":{"text":"clsAction.Summary.Get (cyclomatic 147): clsAction.Summary.Get has cyclomatic complexity 147 (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":"ADRIFT/Item Classes/clsTask.vb"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ba65b3285c06a0ef9d55610bfc0bf6b66eee74c51edfceb6cf1c2108bdf5fb"}},{"ruleId":"D1","level":"warning","message":{"text":"clsRestriction.Summary.Get (cyclomatic 142): clsRestriction.Summary.Get has cyclomatic complexity 142 (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":"ADRIFT/Item Classes/clsTask.vb"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35c3c8d5bd48c80038385356f979fe0121da9e06dd2df6f4db6184590498b22"}},{"ruleId":"D1","level":"warning","message":{"text":"_Default.AppendHTML (cyclomatic 126): _Default.AppendHTML has cyclomatic complexity 126 (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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc8acb587f570ab0c308617038e10cf89c838ed0b6d6e6b97b895a575e12a49"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedModule.Source2HTML (cyclomatic 117): SharedModule.Source2HTML has cyclomatic complexity 117 (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":"ADRIFT/Global.vb"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc351e53f7d43c56ccc4f6b4831c070dacda1f8070429e1e9878ca77d6050ee"}},{"ruleId":"D1","level":"warning","message":{"text":"clsVariable.GetToken (cyclomatic 109): clsVariable.GetToken has cyclomatic complexity 109 (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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"084773dbef0a8fb2febfa084ad2f1c32c0c004395d74afa91a5af4a29f730986"}},{"ruleId":"D1","level":"warning","message":{"text":"FileIO.LoadActions (cyclomatic 98): FileIO.LoadActions has cyclomatic complexity 98 (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":"ADRIFT/FileIO.vb"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c92f76d65b3e17d8f81e54b51ce59693a2397991f5b11b56d6327602489397"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.GrabIt (cyclomatic 90): RunnerSession.GrabIt has cyclomatic complexity 90 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3536}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7f93635c465526a7597fe86adb71c1b08e6ea7e41bdd670a669561a0e08f44"}},{"ruleId":"D1","level":"warning","message":{"text":"clsObject.GuessPluralFromNoun (cyclomatic 83): clsObject.GuessPluralFromNoun has cyclomatic complexity 83 (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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1f30af4fa8207f256731251276fccc219b37220010a581e69edb862fef53c4"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.DoAutoComplete (cyclomatic 81): RunnerSession.DoAutoComplete has cyclomatic complexity 81 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7da3bf6379fdc7dd170e97018f992f6883843adffd0df5fb97c6819b33014b"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.RefineMatchingPossibilitesUsingRestrictions (cyclomatic 78): RunnerSession.RefineMatchingPossibilitesUsingRestrictions has cyclomatic complexity 78 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7380}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9f733282e779a9671db30bbcb8546cb1336b90bbbd44e4125247c2b2cd2028"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.AttemptToExecuteTask (cyclomatic 74): RunnerSession.AttemptToExecuteTask has cyclomatic complexity 74 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c277f88797d4b5c6fb73a49db814f9dc136567b7cf8858f803d1ac2748f581"}},{"ruleId":"D1","level":"warning","message":{"text":"mdlRunner.OutputClicked (cyclomatic 70): mdlRunner.OutputClicked has cyclomatic complexity 70 (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":"ADRIFT/Runner.vb"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e71cf5deb4076f843eb2d67c3f359789bb46b91d15d5d93f7b088664a07d89"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.InputMatchesCommand (cyclomatic 68): RunnerSession.InputMatchesCommand has cyclomatic complexity 68 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc8c668665d94b1cc29e846b2df0c03ff6351e32aa5023659c66dcc379a9fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"Map.DrawLinks (cyclomatic 65): Map.DrawLinks has cyclomatic complexity 65 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Map.vb"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"0018cff0e707c37881c01dba7730bec5105c2d4a4adb8e207926e08d15860a82"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.FindConversationNode (cyclomatic 64): RunnerSession.FindConversationNode has cyclomatic complexity 64 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3134}}}],"partialFingerprints":{"codehealthFindingId/v1":"871d844fc09b90ddcc66c5ef38f65aee027e3920498c99981150745cfa0b74e8"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.NotUnderstood (cyclomatic 58): RunnerSession.NotUnderstood has cyclomatic complexity 58 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4722}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad5333d48cc37c335599c8434e528165f1bcdb372c01ad6e02379f1f7a88b02"}},{"ruleId":"D1","level":"warning","message":{"text":"FileIO.LoadFile (cyclomatic 54): FileIO.LoadFile has cyclomatic complexity 54 (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":"ADRIFT/FileIO.vb"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b522a813fde036becff5979fdb066bb75fb322ceede816fefe71aca3926473d"}},{"ruleId":"D1","level":"warning","message":{"text":"StateStack.RestoreState (cyclomatic 53): StateStack.RestoreState 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":"ADRIFT/clsState.vb"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb68267b8c042b24d549b9b2dacb2f3d5c2b09c6305f53a26609021259fe4580"}},{"ruleId":"D1","level":"warning","message":{"text":"Map.RecalculateLinks (cyclomatic 53): Map.RecalculateLinks 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":"ADRIFT/Map.vb"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce703ff82e7ddc1b181762ab0df974e93a7d56b1ff6d61ae65552373872a7a0"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.EvaluateInput (cyclomatic 51): RunnerSession.EvaluateInput has cyclomatic complexity 51 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4530}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aea84f7b1b7d7191bd6972a02fecba7e82569be549e4e5eda8c3b494f2c332"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.GetGeneralTask (cyclomatic 46): RunnerSession.GetGeneralTask 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7700}}}],"partialFingerprints":{"codehealthFindingId/v1":"550f6b1abaa4680c328fb6ef9e6e7f169daccc5305813179bc79a80a237d911d"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.OpenAdventure (cyclomatic 43): RunnerSession.OpenAdventure has cyclomatic complexity 43 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33a34507e90815b4c74a9beec0b603412e6af83f9c0e148b18944e3d08687c5"}},{"ruleId":"D1","level":"warning","message":{"text":"FileIO.LoadRestrictions (cyclomatic 43): FileIO.LoadRestrictions has cyclomatic complexity 43 (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":"ADRIFT/FileIO.vb"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7569be92344d237743c48149e5aaf8ad4abb346dbeb9c61431e8cd707840b7"}},{"ruleId":"D1","level":"warning","message":{"text":"clsAdventure.GetNameFromKey (cyclomatic 41): clsAdventure.GetNameFromKey has cyclomatic complexity 41 (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":"ADRIFT/clsAdventure.vb"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9520a47f9626898296b1206019b1b9cbaa6579c95ea727af2b56b9cadefca7cf"}},{"ruleId":"D1","level":"warning","message":{"text":"clsMap.UpdateMap (cyclomatic 40): clsMap.UpdateMap has cyclomatic complexity 40 (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":"ADRIFT/clsMap.vb"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cb4a56a09ff4f63c55ad0cc5ab5b9534de86508ed1e2f012b91cfba46bb069"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.BuildAutos (cyclomatic 39): RunnerSession.BuildAutos has cyclomatic complexity 39 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4410}}}],"partialFingerprints":{"codehealthFindingId/v1":"368ec1e064ef960f4583e0f2db073e459a6e9652094859033de238f30e13f62d"}},{"ruleId":"D1","level":"warning","message":{"text":"clsSoundInterface.Extension (cyclomatic 38): clsSoundInterface.Extension 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":"ADRIFT/clsSound.vb"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aa723b214707d1fa4b2b16da1932b7c5b8587369025bd7f619fa865ccaca88"}},{"ruleId":"D1","level":"warning","message":{"text":"clsBlorb.OutputToFolder (cyclomatic 37): clsBlorb.OutputToFolder has cyclomatic complexity 37 (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":"ADRIFT/Blorb.vb"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff4e1bff7ef3f4c1986b50f8b4e37c377247f4a20581525a0942bded6fd96ba"}},{"ruleId":"D1","level":"warning","message":{"text":"mdlSound.PlaySound (cyclomatic 37): mdlSound.PlaySound has cyclomatic complexity 37 (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":"ADRIFT/clsSound.vb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a5872bdb41397546458e808656db5d94e0c81ecb947d6dcac15b6f137646dd"}},{"ruleId":"D1","level":"warning","message":{"text":"_Default.Page_Load (cyclomatic 37): _Default.Page_Load has cyclomatic complexity 37 (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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f0013993798ce0e952ac806c040b5476bcb562d9a768338aa42bfbbfff473a"}},{"ruleId":"D1","level":"warning","message":{"text":"FormChunk.LoadChunk (cyclomatic 34): FormChunk.LoadChunk has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Blorb.vb"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d01c6f339643161d4b0033e1ca27ac27287c9a4dfb0852e5b4bd5cf14257e88"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.SystemTasks (cyclomatic 34): RunnerSession.SystemTasks has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4869}}}],"partialFingerprints":{"codehealthFindingId/v1":"8601f223b9865df23b81d2ad8a43154c93a925027c83daf53b4e92a4f372e2ce"}},{"ruleId":"D1","level":"warning","message":{"text":"FileIO.SaveActions (cyclomatic 34): FileIO.SaveActions has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/FileIO.vb"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcba4e31a0de1e76cc40d9a8f46510db30896abd90eb14475247528d783332f0"}},{"ruleId":"D1","level":"warning","message":{"text":"frmRunner.txtInput_KeyDown (cyclomatic 34): frmRunner.txtInput_KeyDown has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/frmMonoRunner.vb"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe4805fca2e7f85e9d0e503e52d15424f1f876950f51960615603af37c75bdb"}},{"ruleId":"D1","level":"warning","message":{"text":"Map.DrawNode (cyclomatic 33): Map.DrawNode has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Map.vb"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccef6200b42d9974a980eef6a9ca1b1e16bcbd050b0484f19ca4f9dc22bcd23"}},{"ruleId":"D1","level":"warning","message":{"text":"Map.FindSpareLink (cyclomatic 33): Map.FindSpareLink has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Map.vb"},"region":{"startLine":3144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9002defe6e1d7230253ac9da31ab2ff320341b450e6cc95431e06992e957b433"}},{"ruleId":"D1","level":"warning","message":{"text":"clsProperty.PossibleValues.Get (cyclomatic 32): clsProperty.PossibleValues.Get 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":"ADRIFT/Item Classes/clsProperty.vb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5072341397cf15f845c7f0c3cfc0859bce323275507b877bef28cda39cc8276"}},{"ruleId":"D1","level":"warning","message":{"text":"clsAdventure.GetTypeFromKey (cyclomatic 29): clsAdventure.GetTypeFromKey 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":"ADRIFT/clsAdventure.vb"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2e2c6e7766c882beef7b42e631c23c340325b2126dc64c4ce234804fa84988"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.ExecuteConversation (cyclomatic 28): RunnerSession.ExecuteConversation 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7ae36291bc5cc7e1e7e0f52b7eecf1bf46f3bde25de081a95c20afe52f1765"}},{"ruleId":"D1","level":"warning","message":{"text":"clsProperty.Value.Set (cyclomatic 28): clsProperty.Value.Set 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Item Classes/clsProperty.vb"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"64606857da6599db184092409b4625bf0495e179e4f7461cad26477840efd12f"}},{"ruleId":"D1","level":"warning","message":{"text":"frmDebugger.Print (cyclomatic 27): frmDebugger.Print has cyclomatic complexity 27 (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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e633f3f3680303eb569e91c2bf1702b1b83e25c6286d0831c02d54c29a2ff7e6"}},{"ruleId":"D1","level":"warning","message":{"text":"clsObject.Location.Get (cyclomatic 27): clsObject.Location.Get has cyclomatic complexity 27 (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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c0d2edd29a3a3f898fb6e077cbbef3fbeba28de191466d7a43aca83f933010"}},{"ruleId":"D1","level":"warning","message":{"text":"clsAdventure.GetTypeFromKeyNice (cyclomatic 26): clsAdventure.GetTypeFromKeyNice 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":"ADRIFT/clsAdventure.vb"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e77e34ceb408f2c6f931f9dcfd72366e8c454c68f336acc7ed8c2ed3455a944"}},{"ruleId":"D1","level":"warning","message":{"text":"clsMap.AddNode (cyclomatic 26): clsMap.AddNode 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":"ADRIFT/clsMap.vb"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5b4dd36fe2e600f6b749471d114dd561f1fefbd29516f64f6cf29c2f44e166"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.UnderlineNouns (cyclomatic 26): RunnerSession.UnderlineNouns 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"333a68debd3091be2d7239fccf27b8dd17ba4e3042b3b5559f9564453975e25d"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.UncompleteTask (cyclomatic 26): RunnerSession.UncompleteTask 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"f524cd11dd6ffe97966a91700d85f224621e7622f4ee79e5688f498c9deb9190"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.DisplayAmbiguityQuestion (cyclomatic 26): RunnerSession.DisplayAmbiguityQuestion 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7ed7f76d85b2246eaace813f406389a398ea00de0405322c43106a2f6fbbbe"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.PossibleKeys (cyclomatic 26): RunnerSession.PossibleKeys 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b333a7bbdbc5327a4d4b814b9588a6325fd9fc6f6f884fa7e3cc5027d7321f59"}},{"ruleId":"D1","level":"warning","message":{"text":"FileIO.Set400SpecificTasks (cyclomatic 26): FileIO.Set400SpecificTasks 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":"ADRIFT/FileIO.vb"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"96dd847048aca5df896f55df7426d9f00f64344446c31c906f0b3e1b09707c78"}},{"ruleId":"D1","level":"warning","message":{"text":"StateStack.GetState (cyclomatic 24): StateStack.GetState has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsState.vb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1798e1abd550a93a035368b2d127102a4b11818b51cfce8e9ca1164c9be3f601"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.PrepareForNextTurn (cyclomatic 24): RunnerSession.PrepareForNextTurn has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9388af52ebff1e5d7d3e66d96c4ce945779fd5607d4733725e1008461e561db7"}},{"ruleId":"D1","level":"warning","message":{"text":"FileIO.SaveRestrictions (cyclomatic 24): FileIO.SaveRestrictions has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/FileIO.vb"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"571947d48d44c05a0145be1067c8dd80c2239d543178851def203090cc8b99df"}},{"ruleId":"D1","level":"warning","message":{"text":"FileIO.GetObKey (cyclomatic 24): FileIO.GetObKey has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/FileIO.vb"},"region":{"startLine":10395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3aec058e3332a2050820269acc0ab5b747fedf2366a37472291d4f6fa423e8"}},{"ruleId":"D1","level":"warning","message":{"text":"Map.GetLinkPoint (cyclomatic 23): Map.GetLinkPoint 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":"ADRIFT/Map.vb"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce6b3808038745ef1751cea5c792172b91391ea1051642af9ad4a5c427736f0"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.InputMatchesObjects (cyclomatic 21): RunnerSession.InputMatchesObjects 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":6861}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d34f3a329a659e4a6c36a3898f30a9b40e8636f305bdfaba6045720973a5473"}},{"ruleId":"D1","level":"warning","message":{"text":"frmDebugger.grdProperties_CellEndEdit (cyclomatic 21): frmDebugger.grdProperties_CellEndEdit 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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"b262e5f49140a206cd9c8f9fdd6fca9110adccdc813e52ae6b9f1df56ca1090a"}},{"ruleId":"D1","level":"warning","message":{"text":"clsLocation.ObjectsInLocation.Get (cyclomatic 21): clsLocation.ObjectsInLocation.Get 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":"ADRIFT/Item Classes/clsLocation.vb"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d44ffae95d625d2789c3ed2ab66327c659a191a04ab63cad0eda05f014e8ea"}},{"ruleId":"D1","level":"warning","message":{"text":"clsObject.LocationRoots.Get (cyclomatic 21): clsObject.LocationRoots.Get 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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ba4a0a1dab522179fa303d58409b0b4d61dd434b41060afdfb467ab1b1901e"}},{"ruleId":"D1","level":"warning","message":{"text":"clsObject.Children.Get (cyclomatic 21): clsObject.Children.Get 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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78fa2d66d1f7d53ef0dabeffd5ca6decee409bfd1da13883455cac067429dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"FileIO.ShouldWeLoadLibraryItem (cyclomatic 20): FileIO.ShouldWeLoadLibraryItem 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":"ADRIFT/FileIO.vb"},"region":{"startLine":2648}}}],"partialFingerprints":{"codehealthFindingId/v1":"4384213b0b26a79acd8cd9b2e5e4e20305a148199f95738516b634783ee4d32a"}},{"ruleId":"D1","level":"warning","message":{"text":"clsObject.ExistsAtLocation.Get (cyclomatic 20): clsObject.ExistsAtLocation.Get 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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a8306094680e987d510207cd1b005e79ec4144b1297211504842300c7fd537"}},{"ruleId":"D1","level":"warning","message":{"text":"clsAdventure.Tasks (cyclomatic 19): clsAdventure.Tasks 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":"ADRIFT/clsAdventure.vb"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"082a2b1af9a331b8aceeffaef6cb3155d4ed0461315787d715d73cb2db8c335c"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.PrintOutReferences (cyclomatic 19): RunnerSession.PrintOutReferences 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f698f2ad34a96ba4cf6a94951c6d8101084de5555d5c9dfc9e2a7b94f4565cfc"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.ExpandBlock (cyclomatic 19): RunnerSession.ExpandBlock 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4042}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96b6f4b08e3f250db08306858d9fcc309cda599eaed7173e4415f80ba427770"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.AmbWord (cyclomatic 18): RunnerSession.AmbWord 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. This is NOT this file\u0027s highest cyclomatic complexity: RunnerSession.GetReferenceKey (cyclomatic 19) 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3337}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14391ecf4bcbd663300bddf4ffc5045cd6e2bf937294fc880b59bdae2b52729"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.EvaluateRestrictionBlock (cyclomatic 18): RunnerSession.EvaluateRestrictionBlock 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. This is NOT this file\u0027s highest cyclomatic complexity: RunnerSession.GetReferenceKey (cyclomatic 19) 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":6732}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4326ddb262c42675e440e845790559780f8cf4fe2ef174256bff39a0748089"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.ProcessBlock (cyclomatic 18): RunnerSession.ProcessBlock 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. This is NOT this file\u0027s highest cyclomatic complexity: RunnerSession.GetReferenceKey (cyclomatic 19) 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":8458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74268b795f5923e79a2bbf3398cb41217856684a2473a9f5d6091ffc30fd0f5"}},{"ruleId":"D1","level":"warning","message":{"text":"clsCharacter.DeleteKey (cyclomatic 17): clsCharacter.DeleteKey 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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9603b80549779919377eb8ddc5b5943c7af0beafb985d060198ece52226ba3"}},{"ruleId":"D1","level":"warning","message":{"text":"clsCharacterLocation.ExistWhere.Set (cyclomatic 17): clsCharacterLocation.ExistWhere.Set 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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"550ac16bd64011b5c5b5f3c6420aff7fa735208e3d36ed6c67572728dab12d03"}},{"ruleId":"D1","level":"warning","message":{"text":"Map.RecalculateNodes (cyclomatic 17): Map.RecalculateNodes 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: Map.GetBezierAssister (cyclomatic 23) 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":"ADRIFT/Map.vb"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce984e4cf6165bae041e2b645bbbf84f16bed38ebac79be1b9b6d1dd38691a84"}},{"ruleId":"D1","level":"warning","message":{"text":"Map.DrawInOutIcon (cyclomatic 17): Map.DrawInOutIcon 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: Map.GetBezierAssister (cyclomatic 23) 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":"ADRIFT/Map.vb"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36694b1704d42e8b9e1d2b1ddf9d840c42fb20f1ead81b80fc3de4722b16aad"}},{"ruleId":"D1","level":"warning","message":{"text":"ObjectHashTable.List (cyclomatic 17): ObjectHashTable.List 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":"ADRIFT/StronglyTypedCollections.vb"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05e29fe45ad146b720d728a57803b2dd05341815119168fb2f212c79b829d53"}},{"ruleId":"D1","level":"warning","message":{"text":"PropertyHashTable.ResetOrRemoveProperty (cyclomatic 17): PropertyHashTable.ResetOrRemoveProperty 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":"ADRIFT/StronglyTypedCollections.vb"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"148fb609bb53bebf56a32a13acb76800cad6259e99109cb796cfad16ff0f1b47"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerSession.Display (cyclomatic 16): RunnerSession.Display 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. This is NOT this file\u0027s highest cyclomatic complexity: RunnerSession.GetReferenceKey (cyclomatic 19) 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40100a9ceca7518dfdab5d1b59e56f50ffbc025ac8b18ed5078c5bf16e2ca56"}},{"ruleId":"D1","level":"warning","message":{"text":"frmDebugger.BuildTree (cyclomatic 16): frmDebugger.BuildTree 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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8677309e0578b682599cfa7f59fb155f666cb91633aef9fccdf536bd5101734"}},{"ruleId":"D1","level":"warning","message":{"text":"frmDebugger.AddProperty (cyclomatic 16): frmDebugger.AddProperty 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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"94434c940b11174a4ff1767c603fc61b2039e94d46d64f07d6db9a476a801f62"}},{"ruleId":"D1","level":"warning","message":{"text":"frmDebugger.RefreshFromKey (cyclomatic 16): frmDebugger.RefreshFromKey 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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a778e7199ed08bf5924011712517a44ad56503e52834763ff047e86db15d4e49"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedModule.EvaluateUDF (cyclomatic 16): SharedModule.EvaluateUDF 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. This is NOT this file\u0027s highest cyclomatic complexity: SharedModule.EnumParseCharacter (cyclomatic 28) 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":"ADRIFT/Global.vb"},"region":{"startLine":3665}}}],"partialFingerprints":{"codehealthFindingId/v1":"2649d223ba71a00e856f2e7e16b0765ed0baffe04090206051e46a431f68972b"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.LoadOlder (cognitive 2250): FileIO.LoadOlder has cognitive complexity 2250 (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":"ADRIFT/FileIO.vb"},"region":{"startLine":7010}}}],"partialFingerprints":{"codehealthFindingId/v1":"4369a9141e4a1d58c15cc16178577f70af0d920d56439b31552d190b1615f33d"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.Load500 (cognitive 1564): FileIO.Load500 has cognitive complexity 1564 (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":"ADRIFT/FileIO.vb"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c052a6689d7a7a16dae18cd5a69afc224dc95b83233f54b5fcb4753c1b887d1"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.ExecuteSingleAction (cognitive 1132): RunnerSession.ExecuteSingleAction has cognitive complexity 1132 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5f858b6dd1f338fe48ba85fd65b5016747fd57755e08c82f5734e687fb4c80"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.PassSingleRestriction (cognitive 921): RunnerSession.PassSingleRestriction has cognitive complexity 921 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5541}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5f0a0ef738957df4f8f1705c5e503c91515f7007985b6646323ceb05d1bb0c"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedModule.ReplaceOOProperty (cognitive 812): SharedModule.ReplaceOOProperty has cognitive complexity 812 (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":"ADRIFT/Global.vb"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e8da2c679d85276763a3767db0abb6da3128fc96ffc63ce7658700f0f25d01"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedModule.ReplaceFunctions (cognitive 776): SharedModule.ReplaceFunctions has cognitive complexity 776 (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":"ADRIFT/Global.vb"},"region":{"startLine":3754}}}],"partialFingerprints":{"codehealthFindingId/v1":"821540a13e5dc843a5cd055b126280b7b4c10761fe2bcbd0d87d66e381ff7527"}},{"ruleId":"D2","level":"warning","message":{"text":"clsVariable.SetToExpression (cognitive 624): clsVariable.SetToExpression has cognitive complexity 624 (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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"924d0aed2a67abdda7f192d73022b10800d19498f6bb210eb64b0462db3cacb5"}},{"ruleId":"D2","level":"warning","message":{"text":"_Default.AppendHTML (cognitive 417): _Default.AppendHTML has cognitive complexity 417 (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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"05eef54d3daefc5126e5f7b11445f95fd47505434f7ee4a151650ec32084c066"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.GrabIt (cognitive 378): RunnerSession.GrabIt has cognitive complexity 378 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c887af1667f7cc3d960c67ab4b2ed8eb77f9035096d131efce39383da5e2dc"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.DoAutoComplete (cognitive 355): RunnerSession.DoAutoComplete has cognitive complexity 355 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4106}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e819b35ffeb4af3bed051a414beca0253752d204ba7f9417304fc4faaf300b"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.LoadActions (cognitive 291): FileIO.LoadActions has cognitive complexity 291 (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":"ADRIFT/FileIO.vb"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58b4cd110bf5cce38169952530edf872ed0227a961b572a969505155778dade"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.RefineMatchingPossibilitesUsingRestrictions (cognitive 280): RunnerSession.RefineMatchingPossibilitesUsingRestrictions has cognitive complexity 280 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7380}}}],"partialFingerprints":{"codehealthFindingId/v1":"846386ee8188bcab9079960eaf30247f2aeb0fe885c3f54b59bf17e3783246cf"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedModule.Source2HTML (cognitive 269): SharedModule.Source2HTML has cognitive complexity 269 (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":"ADRIFT/Global.vb"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"612cfa8e4431a256c9ec49ca1da390c547c99101908a95ff4ee6ff685f424348"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.AttemptToExecuteSubTask (cognitive 264): RunnerSession.AttemptToExecuteSubTask has cognitive complexity 264 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1daa3258cccd88865dadc5bb5ab9322cd6c6dc8608f1663c7f71cded6a329ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"mdlRunner.OutputClicked (cognitive 207): mdlRunner.OutputClicked has cognitive complexity 207 (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":"ADRIFT/Runner.vb"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb67d743223b98afc54ba4efbc6ded880d343df1fa86beeb43aa4a43a9b09ea"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.GetReference (cognitive 201): RunnerSession.GetReference has cognitive complexity 201 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5399}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c80626e9ae0c6c95263f0a14ad3a69c8f91c1e7e36be1b6c53d3f56d6c7883b"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.GetGeneralTask (cognitive 199): RunnerSession.GetGeneralTask has cognitive complexity 199 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7700}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8c5fba67bd050eba2f2171aa58b7130de33175219bb8d0f4411ca2fc2c3370"}},{"ruleId":"D2","level":"warning","message":{"text":"clsMap.UpdateMap (cognitive 198): clsMap.UpdateMap has cognitive complexity 198 (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":"ADRIFT/clsMap.vb"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"18075200204db48306191044107690c21871706a149dfc8d8e0eaaf6ced53c1f"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.NotUnderstood (cognitive 195): RunnerSession.NotUnderstood has cognitive complexity 195 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4722}}}],"partialFingerprints":{"codehealthFindingId/v1":"1440f63e94a760ffadf6c5d9d072ea0019d757e39ab37412c2245b63f3a0c182"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.AttemptToExecuteTask (cognitive 188): RunnerSession.AttemptToExecuteTask has cognitive complexity 188 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f263b792fa5d222cc5d209648d267af9af622bfa0185c3e4d53e836e9be665f6"}},{"ruleId":"D2","level":"warning","message":{"text":"StateStack.RestoreState (cognitive 163): StateStack.RestoreState has cognitive complexity 163 (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":"ADRIFT/clsState.vb"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7653ff0a0b798c45b45e0c13ba2ef4b48fa27b59954a9c73517f295a2253ef2"}},{"ruleId":"D2","level":"warning","message":{"text":"clsBlorb.OutputToFolder (cognitive 151): clsBlorb.OutputToFolder has cognitive complexity 151 (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":"ADRIFT/Blorb.vb"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"2900c3d1e2bd7e123eda2d3c8bf50fe6f4d08cf07ffa6e2c7292b8a62ac9d20c"}},{"ruleId":"D2","level":"warning","message":{"text":"clsAction.Summary.Get (cognitive 147): clsAction.Summary.Get has cognitive complexity 147 (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":"ADRIFT/Item Classes/clsTask.vb"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5167a6c96b4e0bf40e107ed9d874bd518197ab9744a650254ab7e0087afc60e0"}},{"ruleId":"D2","level":"warning","message":{"text":"clsRestriction.Summary.Get (cognitive 145): clsRestriction.Summary.Get has cognitive complexity 145 (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":"ADRIFT/Item Classes/clsTask.vb"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b52e46bb94b04a1ed36f72f313f2e02947586be59380a7009f6cab083c8b30"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.BuildAutos (cognitive 137): RunnerSession.BuildAutos has cognitive complexity 137 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4410}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cde7ed71d1695c11e64154a38ebde0dcdf328c521e7c1276cc38c85e68a783"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.FindConversationNode (cognitive 128): RunnerSession.FindConversationNode has cognitive complexity 128 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc784e9ac39ed5d4be3dcfa82f4df303dabc18cfeac4b94a19e6d7e7eb896c3"}},{"ruleId":"D2","level":"warning","message":{"text":"clsVariable.GetToken (cognitive 115): clsVariable.GetToken has cognitive complexity 115 (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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a021b5fcdc05608db9df830b3202a2e45a4905d5d4285682ea145baef19051f8"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.EvaluateInput (cognitive 99): RunnerSession.EvaluateInput has cognitive complexity 99 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66d72f383ca1998bac41f121be5f28d75a22959fdb8e106195d3e8e9ce697a1"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.LoadFile (cognitive 99): FileIO.LoadFile has cognitive complexity 99 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/FileIO.vb"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d3d4343ffed079fb48505a575e9515599a5d9daa00ab7bcc8fa02a209a9ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.OpenAdventure (cognitive 97): RunnerSession.OpenAdventure has cognitive complexity 97 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e23dc48da90b04acfd31262dfe8029ea44fbc3337bdf834c0e3b6831e1c249"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.Set400SpecificTasks (cognitive 97): FileIO.Set400SpecificTasks has cognitive complexity 97 (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":"ADRIFT/FileIO.vb"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ae952239a16e8cbcfcb73e00b3fce9188b75111c13ad69295b00b51d9e696b"}},{"ruleId":"D2","level":"warning","message":{"text":"_Default.Page_Load (cognitive 92): _Default.Page_Load has cognitive complexity 92 (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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b5e6a0769d4bc0115fe52fb0721958cd3fffc73b55e07e9e8a7b5989ac52ed"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.DisplayAmbiguityQuestion (cognitive 91): RunnerSession.DisplayAmbiguityQuestion has cognitive complexity 91 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6754acfb8d9089ac4fa9ed14cd46bdc381aa159a307673d7001190fa4b560b"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.DrawLinks (cognitive 85): Map.DrawLinks has cognitive complexity 85 (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":"ADRIFT/Map.vb"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"440ea221bab5a3d953650fb8630eb745eb60636092b09a2ffea8075ad7cc69fd"}},{"ruleId":"D2","level":"warning","message":{"text":"mdlSound.PlaySound (cognitive 84): mdlSound.PlaySound has cognitive complexity 84 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsSound.vb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1aed8cf709360c4fd6e8c74819633dc57fd15db0e5846ff21c87dfc4975f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.RecalculateLinks (cognitive 80): Map.RecalculateLinks has cognitive complexity 80 (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":"ADRIFT/Map.vb"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"3128d58479d9b57d6228391103f35cc91d393683b75a89a5dbaa59f8b891458b"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.LoadRestrictions (cognitive 76): FileIO.LoadRestrictions has cognitive complexity 76 (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":"ADRIFT/FileIO.vb"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c242bb80eac2e76145f4ffb2eac1a91a1fd853159f6889069f5aceb6899e936"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.PossibleKeys (cognitive 75): RunnerSession.PossibleKeys has cognitive complexity 75 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5321}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fba242d37b39713c2e659e26a396fae00e909383f6641cc508abf4c737f10f"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.InputMatchesObjects (cognitive 73): RunnerSession.InputMatchesObjects has cognitive complexity 73 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":6861}}}],"partialFingerprints":{"codehealthFindingId/v1":"43171bbd0941c551339621b667671a02b64efbaa633368f371eec2e51bf9fc8d"}},{"ruleId":"D2","level":"warning","message":{"text":"clsMap.AddNode (cognitive 72): clsMap.AddNode has cognitive complexity 72 (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":"ADRIFT/clsMap.vb"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a4085ca94359847bc461ba5e3f14a94ae97ede4258283b88e3f03f24f4a1bb"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.UncompleteTask (cognitive 71): RunnerSession.UncompleteTask has cognitive complexity 71 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"7409c28af02ba2aff47386f48f7db2986de131476b042640ba065a96229b4747"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.InputMatchesCommand (cognitive 70): RunnerSession.InputMatchesCommand has cognitive complexity 70 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c151dcbe66631f1e29b4eb6076038dcc43ff752806593fc93b2d6d317394921e"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.SystemTasks (cognitive 65): RunnerSession.SystemTasks 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4869}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf50728aaafa1e5310cfb05d840afe3d0bb9bcd1e48a68d34af7719e6252e66"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.AmbWord (cognitive 61): RunnerSession.AmbWord has cognitive complexity 61 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2af4d3b6a90b1ebe0ab8d80c817b19af3455fdc0300bf54a64a69ebda23e83"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedModule.EvaluateUDF (cognitive 56): SharedModule.EvaluateUDF 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":"ADRIFT/Global.vb"},"region":{"startLine":3665}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5534fe60ad05898d544152007f61c63d0fd460cf0c056858d75f81e5584a85"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.RecalculateNodes (cognitive 56): Map.RecalculateNodes 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":"ADRIFT/Map.vb"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43cdb84360d40160aefc83cd3a16c643e41563cb73d9f4488b62ddf6570260c"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.DrawNode (cognitive 52): Map.DrawNode 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":"ADRIFT/Map.vb"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5b9e5237fd6a9165ff48d7628e3f6a5f773a1daef9aca1a5e00a2c2cf6f992"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.ExecuteConversation (cognitive 51): RunnerSession.ExecuteConversation has cognitive complexity 51 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9f64eacef0dda683bb868c5017b0ef10eab7674843825d1160bb9c6fb9247f"}},{"ruleId":"D2","level":"warning","message":{"text":"clsAdventure.GetTypeFromKeyNice (cognitive 50): clsAdventure.GetTypeFromKeyNice 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":"ADRIFT/clsAdventure.vb"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a1a6f32eeab7af59a962a5bb2c93f1d68b1a5255eef0bd18604a48f930aa48"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.UnderlineNouns (cognitive 50): RunnerSession.UnderlineNouns 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"4861a6a9ea100d4b210701ea8f646e830d349fa97c5a195f7d10b57c53f59d86"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.RefsMatchSpecifics (cognitive 49): RunnerSession.RefsMatchSpecifics 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57c9e0918d3d5ee2d8fa56a9285b05ffc5238762530ef137d5e1b44f6fa6967"}},{"ruleId":"D2","level":"warning","message":{"text":"clsProperty.PossibleValues.Get (cognitive 49): clsProperty.PossibleValues.Get 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":"ADRIFT/Item Classes/clsProperty.vb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6157f46070dc5e1c345047580012a23822312bfc82ce6bb04b4d4cbacce4148b"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.FindSpareLink (cognitive 49): Map.FindSpareLink 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":"ADRIFT/Map.vb"},"region":{"startLine":3144}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d7e00fa4d705bfdc2c5b0440427f969b06410a57746be6088f6fd614974204"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.ExpandBlock (cognitive 48): RunnerSession.ExpandBlock has cognitive complexity 48 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4042}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4eef18e14a57c409f2088ff039e93159f9e7616449d2cf70e3725ea53cb937"}},{"ruleId":"D2","level":"warning","message":{"text":"ObjectHashTable.List (cognitive 48): ObjectHashTable.List has cognitive complexity 48 (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":"ADRIFT/StronglyTypedCollections.vb"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"910e149928d47f8c3e00c2a84b55543a63f8f3fb3a6d4e9511b3cb15c2ebf05a"}},{"ruleId":"D2","level":"warning","message":{"text":"clsAdventure.Tasks (cognitive 46): clsAdventure.Tasks has cognitive complexity 46 (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":"ADRIFT/clsAdventure.vb"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5af664095253c54b1b4c81dfc61419caa70f9b504ac4247dec158bdf2c50e1"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.PrintOutReferences (cognitive 46): RunnerSession.PrintOutReferences has cognitive complexity 46 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed9175962d5066af262b595519084db9d1789de8e0253beaae5f20298688b76"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.ProcessBlock (cognitive 46): RunnerSession.ProcessBlock has cognitive complexity 46 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":8458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2a0acb42f6cf735f348255193a2883cd76a783159ca82ce3a9be8f8663e2bb"}},{"ruleId":"D2","level":"warning","message":{"text":"StateStack.GetState (cognitive 45): StateStack.GetState has cognitive complexity 45 (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":"ADRIFT/clsState.vb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"565c5fe1118c6d5c87c48db3282cec87bb644942a40da930e85ea3ca777305c6"}},{"ruleId":"D2","level":"warning","message":{"text":"clsAdventure.GetNameFromKey (cognitive 44): clsAdventure.GetNameFromKey has cognitive complexity 44 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsAdventure.vb"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30b64deab6c424cf1ba0331757e3f35f4e14df145183345c454a8e91d6e3e27"}},{"ruleId":"D2","level":"warning","message":{"text":"frmDebugger.Print (cognitive 44): frmDebugger.Print has cognitive complexity 44 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/frmDebugger.vb"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3013edfc355c831ec9b14dc48a0ed3659996b4db51b92302960db29a9b90ae"}},{"ruleId":"D2","level":"warning","message":{"text":"frmRunner.txtInput_KeyDown (cognitive 44): frmRunner.txtInput_KeyDown has cognitive complexity 44 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/frmMonoRunner.vb"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be0438d0ce2afb8180c87583d5f64ea617823843ac8f6bb2df4e8256a6b0ea7"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.ResolveAmbiguity (cognitive 43): RunnerSession.ResolveAmbiguity has cognitive complexity 43 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5251}}}],"partialFingerprints":{"codehealthFindingId/v1":"217aff48f090fd04f4151b95ab310b17826302f79125df1e2b7c9f46ce97b188"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.SaveRestrictions (cognitive 43): FileIO.SaveRestrictions has cognitive complexity 43 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/FileIO.vb"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2511ffac4281d3ba66f81939173017cae09bf7aa086f2ded43a24a726080adb"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.EvaluateRestrictionBlock (cognitive 42): RunnerSession.EvaluateRestrictionBlock 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":6732}}}],"partialFingerprints":{"codehealthFindingId/v1":"19400c32fc7e4f8c5e19a383d6a031c13146802d02b7462bbed8e71b98782a93"}},{"ruleId":"D2","level":"warning","message":{"text":"frmDebugger.grdProperties_CellEndEdit (cognitive 41): frmDebugger.grdProperties_CellEndEdit has cognitive complexity 41 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/frmDebugger.vb"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f4045bbcf6870cb16e4dd37351b586570d2ecfc324fbfb1064ef2c7b2de965"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.RecalculateNode (cognitive 40): Map.RecalculateNode has cognitive complexity 40 (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":"ADRIFT/Map.vb"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8536d38bb69136c6717d7d684d0383bad125650187ad2fb606c73b2b33f218"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.PrepareForNextTurn (cognitive 38): RunnerSession.PrepareForNextTurn 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3224c3cf6973dd6d48182cf1ad677320c22ecad653acb4f7340e360180823fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"clsLocation.ObjectsInLocation.Get (cognitive 37): clsLocation.ObjectsInLocation.Get 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":"ADRIFT/Item Classes/clsLocation.vb"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec16e551e23e4086b7052399719198b78d9c7908dd1cd3bf944e29bd258b048"}},{"ruleId":"D2","level":"warning","message":{"text":"clsObject.Children.Get (cognitive 37): clsObject.Children.Get 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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca50eeb272849594066d9be66542e2a0640a9dbc3bad43a14e0d422ab1ee27a"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.imgMap_MouseDoubleClick (cognitive 37): Map.imgMap_MouseDoubleClick 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":"ADRIFT/Map.vb"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4433ad975167541863dfeea1c2bfb20eddb2a15413cfcdb1197bc6386fdb82"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.GetObKey (cognitive 35): FileIO.GetObKey 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":"ADRIFT/FileIO.vb"},"region":{"startLine":10395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7176fe85ec5edad4b945079cc900003f7728f31334197a81b6c055c97a006b7"}},{"ruleId":"D2","level":"warning","message":{"text":"clsObject.Location.Get (cognitive 35): clsObject.Location.Get 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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c6853d929ed2d9beea41adf6f6b629c522241d75d10ce848b7193caf102775"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.InputMatchesObject (cognitive 34): RunnerSession.InputMatchesObject 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":6942}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00e8111018defa81c07b459604d60ee43a51bef908a7cec0b8608f5d37740fb"}},{"ruleId":"D2","level":"warning","message":{"text":"clsProperty.Value.Set (cognitive 34): clsProperty.Value.Set 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":"ADRIFT/Item Classes/clsProperty.vb"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e849a9769de39e17e3da5638530c4dab910fe0ab7774008de73534f16703c1"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.RefsMatchSpecificsOld (cognitive 33): RunnerSession.RefsMatchSpecificsOld 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29a571d5d3a56c6ac0ceafbe7ebd0f1b434643e9393cdf9f544eb7ad8ffe0d1"}},{"ruleId":"D2","level":"warning","message":{"text":"clsCharacter.DeleteKey (cognitive 33): clsCharacter.DeleteKey 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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd5de101c431228895d6bd7872480e4e918c8123d47179b78232f42f4c81404"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.DrawInOutIcon (cognitive 33): Map.DrawInOutIcon 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":"ADRIFT/Map.vb"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e455acd6758c6c4f00cba056ce97e30ad848456cc84e45d89182840c86ca81d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.imgMap_MouseMove (cognitive 33): Map.imgMap_MouseMove 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":"ADRIFT/Map.vb"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"24950a436413540d7f0a01a32aad83dd11f73e443960d2e1fae1ea594e498a06"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.ProcessBlockOld (cognitive 32): RunnerSession.ProcessBlockOld has cognitive complexity 32 (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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":8405}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e717770dcbe25eb8a99366331b13085ee89634d80de65b30530821872ba336"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.ShouldWeLoadLibraryItem (cognitive 30): FileIO.ShouldWeLoadLibraryItem 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":"ADRIFT/FileIO.vb"},"region":{"startLine":2648}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b972e5fd551f02758c16c58394f864b135288382f237d0abb1b2ba91f6182f1"}},{"ruleId":"D2","level":"warning","message":{"text":"clsObject.ExistsAtLocation.Get (cognitive 30): clsObject.ExistsAtLocation.Get 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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"3102fbb08940c7f8d691ef3c72066b1d3fd8b8a3befdab13a4e9ea201c3334e6"}},{"ruleId":"D2","level":"warning","message":{"text":"clsObject.DisplayCharacterChildren (cognitive 29): clsObject.DisplayCharacterChildren 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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e01c5f2dd607f0810068879682cc3e5ce1fba32aa63e7345acb334d95d8e681"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyHashTable.ResetOrRemoveProperty (cognitive 29): PropertyHashTable.ResetOrRemoveProperty 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":"ADRIFT/StronglyTypedCollections.vb"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb31f1828b15585ae23c1a40f11bfe91e391bc6d6e3d8ba68abbd5ea095655a5"}},{"ruleId":"D2","level":"warning","message":{"text":"MMSoundInterface.Play (cognitive 27): MMSoundInterface.Play 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":"ADRIFT/clsSound.vb"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b5ed1a00964b1d2f690912dff42cbb4e8cb1d13049176cd448c9bae6d98c6a"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.InputMatchesLocation (cognitive 27): RunnerSession.InputMatchesLocation 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. This shape REPEATS in the file: one other method here (RunnerSession.InputMatchesCharacter) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7017}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ab1921cf261eb6997dadbe475f73c45c2e7a8176b73d29a0c109085a8cff6d"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.InputMatchesCharacter (cognitive 27): RunnerSession.InputMatchesCharacter 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. This shape REPEATS in the file: one other method here (RunnerSession.InputMatchesLocation) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7057}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d89a2e017b4d14b94b53280f0e4ae1ddc0b20e2cf732466aaf6b24d4415f75"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.SaveActions (cognitive 27): FileIO.SaveActions 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":"ADRIFT/FileIO.vb"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dec5206ee54708a1ec8362dbe208b685e49255a517d481332d49f54b8d5377"}},{"ruleId":"D2","level":"warning","message":{"text":"frmOptionsRunner.tabsOptions_SelectedTabChanged (cognitive 27): frmOptionsRunner.tabsOptions_SelectedTabChanged 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":"ADRIFT/frmOptionsRunner.vb"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"572fa517d4cf45175f403b33f7bfad8ec3a8ad1028162c79de81f74429be2a32"}},{"ruleId":"D2","level":"warning","message":{"text":"clsCharacter.DoWalk (cognitive 27): clsCharacter.DoWalk 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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb29e5643293e6a331eb86dba6f3ed6ba40d0e05772045f346804146ff5a512d"}},{"ruleId":"D2","level":"warning","message":{"text":"clsObject.LocationRoots.Get (cognitive 26): clsObject.LocationRoots.Get 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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"947812fc0c42e1ac261c8b27b1f93bbc0d02f109dc9831a261e67add439e2560"}},{"ruleId":"D2","level":"warning","message":{"text":"_Default.About (cognitive 26): _Default.About 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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8410a539f1c133106cd4e653878e7615fb9e428fa821cdea3d97d312e57b587"}},{"ruleId":"D2","level":"warning","message":{"text":"clsTask.TaskCommand (cognitive 25): clsTask.TaskCommand 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":"ADRIFT/Item Classes/clsTask.vb"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e28f509dc55630ec9699602f56daaafe1debba1ddb0b417f19962209d10a4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"frmDebugger.BuildTree (cognitive 24): frmDebugger.BuildTree 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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea205c047ddeb1b31a0fd4ef66ecc9742de5c1e5a2661e61ad206c6880377d54"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.Display (cognitive 23): RunnerSession.Display 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ae527438f1dcb79d526a4b782e4d9c96413ca99fe7613d03f1afe625c950f6"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.ExecuteSubTasks (cognitive 23): RunnerSession.ExecuteSubTasks 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35ac2d4686eb85b14d5ec30aa5fa9440db3adb9ea9ffc93d1f28209f3e027c0"}},{"ruleId":"D2","level":"warning","message":{"text":"clsObject.DisplayObjectChildren (cognitive 23): clsObject.DisplayObjectChildren 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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef40f527953f7ac384ba350912b40002c8a0b3ead515339b0f59ac7175fa7469"}},{"ruleId":"D2","level":"warning","message":{"text":"clsSoundInterface.Extension (cognitive 22): clsSoundInterface.Extension 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":"ADRIFT/clsSound.vb"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c39bc5bc2bddca92c53adb2202ae5c6f78430e03000ff747de6908904e245d"}},{"ruleId":"D2","level":"warning","message":{"text":"frmRunner.RunMacro (cognitive 22): frmRunner.RunMacro 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":"ADRIFT/frmMonoRunner.vb"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1ded09c84efa9df0725f6b03d33548a9e6711af4afd252dda699ba07de01b5"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedModule.WebClient_DownloadStringCompleted (cognitive 22): SharedModule.WebClient_DownloadStringCompleted 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":"ADRIFT/Global.vb"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce223a08034618fe5b24def79f40656ed1a44412cb97468daab673ebb9392a3"}},{"ruleId":"D2","level":"warning","message":{"text":"clsCharacter.Move (cognitive 22): clsCharacter.Move 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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e9f034e2e5f80514a2cb10b128ec6f8144b21a5cf4d329f91627a889af7ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"clsAdventure.Images.Get (cognitive 21): clsAdventure.Images.Get 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":"ADRIFT/clsAdventure.vb"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c147cae38398b11b147509411ffd54e9130b9229a110122cf193e476e067bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.UpdateStatusBar (cognitive 21): RunnerSession.UpdateStatusBar 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4948}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d00fddc9285d94912254169bc34c43de5918094a104e9daa9ddf232dd044e4"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedModule.ReplaceALRs (cognitive 21): SharedModule.ReplaceALRs 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":"ADRIFT/Global.vb"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b9330bfb7a580473a4bf02c4c464761a9f0dcd266545818ef3ee3b5181cdb4"}},{"ruleId":"D2","level":"warning","message":{"text":"clsCharacter.ChildrenObjects.Get (cognitive 21): clsCharacter.ChildrenObjects.Get 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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"875ba7fd3f9db8fd58fe7eb9c4ef130ba9f208cf198e3b0b5e21e4a9ce6c44e5"}},{"ruleId":"D2","level":"warning","message":{"text":"clsCharacter.ReferencesKey (cognitive 21): clsCharacter.ReferencesKey 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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3670bbe695dc4821f97da5c23964171c52ebe42a0660adace1e87c7db8876ce"}},{"ruleId":"D2","level":"warning","message":{"text":"clsItemWithProperties.htblInheritedProperties.Get (cognitive 21): clsItemWithProperties.htblInheritedProperties.Get 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":"ADRIFT/Item Classes/clsItem.vb"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d79295a53dca75f8d8cf6567559b65a0bf6023fca89afc7821dded146d356d"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.GetLinkPoint (cognitive 21): Map.GetLinkPoint 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":"ADRIFT/Map.vb"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09afb30842cc2ddb5f75e8084b7b28f8e49016417a97c19160aa294fc5d9334"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.miAddAnchor_Click (cognitive 21): Map.miAddAnchor_Click 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":"ADRIFT/Map.vb"},"region":{"startLine":2686}}}],"partialFingerprints":{"codehealthFindingId/v1":"5627a5e126a92c195012b4a1d8cc3aded662d76c64362c235dde60d17b841919"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.LoadMacros (cognitive 20): RunnerSession.LoadMacros has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7679132378a63646d674ff9ff4627ff53beeb436f865b5bb0116e183350d4bf"}},{"ruleId":"D2","level":"warning","message":{"text":"frmDebugger.RefreshFromKey (cognitive 20): frmDebugger.RefreshFromKey has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/frmDebugger.vb"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"810decbfb675fc73d1a71264bb149bfbecf2b52ca9829e6b04100dbb779a4c71"}},{"ruleId":"D2","level":"warning","message":{"text":"clsObject.GuessPluralFromNoun (cognitive 20): clsObject.GuessPluralFromNoun has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"28aefbbeaac663fb0131e30e52fd4619a6cd6c563a01118267c6cce7d3579c40"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.ConvText (cognitive 19): FileIO.ConvText 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":"ADRIFT/FileIO.vb"},"region":{"startLine":4427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d20fcbccb4040e2b0ea926a15e54c5052d813681b2de34d983026e8108f401b"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.GetRoomGroupFromList (cognitive 19): FileIO.GetRoomGroupFromList 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":"ADRIFT/FileIO.vb"},"region":{"startLine":10128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4e4b09463ffc9936ef52d9a9280177ad07118de0ded3549262a426243190bf"}},{"ruleId":"D2","level":"warning","message":{"text":"CSettings.SaveSetting (cognitive 19): CSettings.SaveSetting 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":"ADRIFT/GetSettings.vb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce50ca5a949624c1f7db1430ddecf5c0cce8189abae6afb2e9c8fd7a74efbf6f"}},{"ruleId":"D2","level":"warning","message":{"text":"clsCharacterLocation.ExistWhere.Set (cognitive 19): clsCharacterLocation.ExistWhere.Set 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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"5146e42b7944cfd20b61f31479811c29a67f29b4972565336dc642a96f19c985"}},{"ruleId":"D2","level":"warning","message":{"text":"clsItem.FindStringInDescription (cognitive 19): clsItem.FindStringInDescription 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":"ADRIFT/Item Classes/clsItem.vb"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c426dde9b0b7064da55aea0dc2437a6dbf439bbb234bc2f4962ea08b0587a92e"}},{"ruleId":"D2","level":"warning","message":{"text":"clsCharacterLocation.Key.Get (cognitive 18): clsCharacterLocation.Key.Get has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ed14554b8cb36a7a2e2e7468e27ad9d5c46493657738bbf2a6210639de8aae"}},{"ruleId":"D2","level":"warning","message":{"text":"clsObject.sRegularExpressionString.Get (cognitive 18): clsObject.sRegularExpressionString.Get has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b123ee97ed4ced383e010c24c3011e75f59a25581b38733f46f997e1d2f962d"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyHashTable.DeleteKey (cognitive 18): PropertyHashTable.DeleteKey has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/StronglyTypedCollections.vb"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f14027f19294e682964d744c01d102d3407f196fa3d6f7f9a6aa8fcb96dde1"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.InitialiseInputBox (cognitive 17): RunnerSession.InitialiseInputBox 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b815d2093fbe1c1a710c50afcd8ff7d2d82c8a15b2a4ce736c152301e88296"}},{"ruleId":"D2","level":"warning","message":{"text":"frmRunner.ReloadMacros (cognitive 17): frmRunner.ReloadMacros 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":"ADRIFT/frmMonoRunner.vb"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df840c59e2c4c5393a08e688b057f2527b40177317fa6c43e73b12cdf92de2c"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedModule.ReplaceOO (cognitive 17): SharedModule.ReplaceOO 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":"ADRIFT/Global.vb"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb75363d49408351b3dd07090893d8b8f944a2097ac3341e70eab18668b38a74"}},{"ruleId":"D2","level":"warning","message":{"text":"clsWalk.GetDefaultDescription (cognitive 17): clsWalk.GetDefaultDescription 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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"757a5f4477fc92ef29d04c4629cf53bd8cea409ed260a948e9cb920001441c5e"}},{"ruleId":"D2","level":"warning","message":{"text":"clsItem.GenerateKey.Get (cognitive 17): clsItem.GenerateKey.Get 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":"ADRIFT/Item Classes/clsItem.vb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f21ee0d4ad6ef631f4fb5795c5c33eb8ad2cb4233ab40373a4dab9481fc855a"}},{"ruleId":"D2","level":"warning","message":{"text":"Specific.List (cognitive 17): Specific.List 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":"ADRIFT/Item Classes/clsTask.vb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"868d6e6dbb3a6df6e81f70fe1f3abc99cd7168c61504121a1a138c6fb2e12e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.ActiveNode.Set (cognitive 17): Map.ActiveNode.Set 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":"ADRIFT/Map.vb"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d2132f79deec305f0c71c346c2da1e82cbff4249e545fc5df00c334bf04426"}},{"ruleId":"D2","level":"warning","message":{"text":"Map.MapRange (cognitive 17): Map.MapRange 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":"ADRIFT/Map.vb"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c8524a6dd3e69cf204862ef245bd1d135020f1c49c29e2e7c291118abb38d5"}},{"ruleId":"D2","level":"warning","message":{"text":"_Default.SetColours (cognitive 17): _Default.SetColours 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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d19afab80e282e9b4ab873b32a695040c68fecd6c768dd584df532d371d79f"}},{"ruleId":"D2","level":"warning","message":{"text":"clsBlorb.GetImage (cognitive 16): clsBlorb.GetImage has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (clsBlorb.GetSound) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Blorb.vb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a0f227f2fa629c7e930e2789767567651a8734fbffd213e96e827964728c79"}},{"ruleId":"D2","level":"warning","message":{"text":"clsBlorb.GetSound (cognitive 16): clsBlorb.GetSound has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (clsBlorb.GetImage) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Blorb.vb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3992bf104e52730029def30ea8678a883ae94fc4705998d2350b8455945d34f"}},{"ruleId":"D2","level":"warning","message":{"text":"FormChunk.WriteChunk (cognitive 16): FormChunk.WriteChunk 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":"ADRIFT/Blorb.vb"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa59c73e6c05d0cdcef40176c9b022a357219ee28f6a7c13c26f0a7605e1cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerSession.bHasOutput (cognitive 16): RunnerSession.bHasOutput 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"8802cf7d39ac906c62a1aaba47d3dda14f117f1b604125592f9ace5d759706a0"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIO.LoadLibraries (cognitive 16): FileIO.LoadLibraries 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":"ADRIFT/FileIO.vb"},"region":{"startLine":10179}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd484fc238c02b8d08866902e01bf9c5450e27be1bfd6a9a56b2af8b29bb136a"}},{"ruleId":"D2","level":"warning","message":{"text":"frmRunner.frmRunner_Shown (cognitive 16): frmRunner.frmRunner_Shown 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":"ADRIFT/frmMonoRunner.vb"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dd84799d75203c1c302629b8bfeaf8532c1afd8900be24cc17f383e68c4b63"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileIO.LoadOlder: MethodTooLong \u2014 LoadOlder runs 2356 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2256 over it, 23.56\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":"ADRIFT/FileIO.vb"},"region":{"startLine":7010}}}],"partialFingerprints":{"codehealthFindingId/v1":"509c7d0fc5ea200cf6c0d3bd602f085c98fff4325d610a6f78ec520f8953ceb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ADRIFT/clsUserSession.vb: FileTooLong \u2014 5920 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5420 over it, 11.84\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6703b2c29b2a270f8ea494b0d04378758412fbcaee4e5190df8a31ba11de5b9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileIO.Load500: MethodTooLong \u2014 Load500 runs 1083 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 983 over it, 10.83\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":"ADRIFT/FileIO.vb"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad26ad547502ef374e7b0bb0ddba8fa8ac823615d308a02883b923ca8a630c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.PassSingleRestriction: MethodTooLong \u2014 PassSingleRestriction runs 1051 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 951 over it, 10.51\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5541}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d138a22c2761436e8ddd83039c5f6be91f118cf3534472575df5dc9bf0ca4a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ADRIFT/FileIO.vb: FileTooLong \u2014 4861 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4361 over it, 9.72\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":"ADRIFT/FileIO.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a8573bac6dad4de5f570608cad7e0e3dee8e4b52014a27e5161e45efa9fe55"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.ExecuteSingleAction: MethodTooLong \u2014 ExecuteSingleAction runs 895 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 795 over it, 8.95\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"781a6d48bdd462cd309171ddbaae65c15da431ba7660f066e7c1d3f8315a68bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedModule.ReplaceOOProperty: MethodTooLong \u2014 ReplaceOOProperty runs 790 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 690 over it, 7.90\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":"ADRIFT/Global.vb"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1adeb617777ca5e215136791d13946e11f23fd933d5845064235a728046524"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ADRIFT/Global.vb: FileTooLong \u2014 3799 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3299 over it, 7.60\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":"ADRIFT/Global.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69be120f1a6b55b08e4d9e5b9ab9ac6140cbf9a34af87703fcf7baf25cabed6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: clsVariable.SetToExpression: MethodTooLong \u2014 SetToExpression runs 492 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 392 over it, 4.92\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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"875c11a2a2af8eb802fa87f8ea757358368a1bb2847c6bff901dd955bc185191"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SharedModule: TooManyMethods \u2014 3799 significant lines (blank, comment-only and punctuation-only lines excluded), 131 methods. The bar is 30 methods; this is 101 over it, 4.37\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":"ADRIFT/Global.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6d20ee10e207a6a3639ed507dd948d3c123102ba9b34d8a5773802a9aaf827"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedModule.ReplaceFunctions: MethodTooLong \u2014 ReplaceFunctions runs 429 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 329 over it, 4.29\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":"ADRIFT/Global.vb"},"region":{"startLine":3754}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4986241f62873e794e80fd6feff6ef0d45e3b46f6044007428048c3e1d511be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ADRIFT/Map.vb: FileTooLong \u2014 1649 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1149 over it, 3.30\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":"ADRIFT/Map.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c41a0b204c02e4b825464f2b96ae8508f9897d7f57ebd8227ab49a03bc42d37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _Default.AppendHTML: MethodTooLong \u2014 AppendHTML runs 322 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 222 over it, 3.22\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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d54d3dc8aa3f615c6a57cdaf8b7fd2163af5b5fcc130066f35eb470d6f03139"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RunnerSession: TooManyMethods \u2014 5918 significant lines (blank, comment-only and punctuation-only lines excluded), 93 methods. The bar is 30 methods; this is 63 over it, 3.10\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef473014353182c14342412448495020412739db4d17f1c6b4f8fd11825ab8cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedModule.Source2HTML: MethodTooLong \u2014 Source2HTML runs 295 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 195 over it, 2.95\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":"ADRIFT/Global.vb"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3db3e10089f3bf2f9074b564a7ba102655022d953cf8259c34b399becb6231b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Map: TooManyMethods \u2014 1647 significant lines (blank, comment-only and punctuation-only lines excluded), 86 methods. The bar is 30 methods; this is 56 over it, 2.87\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":"ADRIFT/Map.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb89e36739a4cb7308036fea6e9069603975eaaf4740ff42bd9dd5301352da2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: clsVariable.GetToken: MethodTooLong \u2014 GetToken runs 283 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 183 over it, 2.83\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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"917e16a4e0cf87620c70e5bcd4efd2fd25073be1bd031a20d2b060f6ce65495d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Item Classes/clsTask.vb: FileTooLong \u2014 1243 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 743 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Item Classes/clsTask.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d908b54819d95b5e58063f91beb5bc6c81cbcd757799dfd0843793e050e35c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.AttemptToExecuteSubTask: MethodTooLong \u2014 AttemptToExecuteSubTask runs 248 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cc670e6206cd2c95e0ee817c968da58dd1597c9e68f757e464b6559944398d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: clsVariable: ClassTooLong \u2014 986 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 586 over it, 2.47\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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78beee03a73896e92718abdc6d92ae11f567b978237fa26e06f367ef80b80c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileIO.LoadActions: MethodTooLong \u2014 LoadActions runs 246 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 146 over it, 2.46\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":"ADRIFT/FileIO.vb"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2021ab4c5371d2b78684e5dee954acffe674589cd52bbb02c29b4a0c30d4fb0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StronglyTypedCollections: ClassTooLong \u2014 903 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 503 over it, 2.26\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":"ADRIFT/StronglyTypedCollections.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91240ccb6221ef06bd7d5084d564081b33c2f6d6430c0ea32fcd0921266b28a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.GrabIt: MethodTooLong \u2014 GrabIt runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3536}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a05667d959be3f279afd5c30e08b72171f7b7c4b7dab5daee34eeca66ddeba"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: clsObject: ClassTooLong \u2014 806 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 406 over it, 2.02\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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e2519d0fe951173a0dfaa21a5b205dad0c1aadf75fa2f074b6a9c63e5996f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Item Classes/clsVariable.vb: FileTooLong \u2014 986 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 486 over it, 1.97\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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f44d3350b6d4b68ed8c34a4c9260ea6be6e71bb74cd783c2123294b53688783"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: clsBlorb: ClassTooLong \u2014 788 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 388 over it, 1.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":"ADRIFT/Blorb.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebeb6f968d6f19d7b6a4fbf5e487068332f6e8b38aad89ef277fbbf4aa168add"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.RefineMatchingPossibilitesUsingRestrictions: MethodTooLong \u2014 RefineMatchingPossibilitesUsingRestrictions runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7380}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cbfbb97fbc3fe3a6c29f0d5ac863d8e04473b3b613ccd435506692e50596df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ADRIFT/StronglyTypedCollections.vb: FileTooLong \u2014 904 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 404 over it, 1.81\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":"ADRIFT/StronglyTypedCollections.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea985fb1ca346beebd86cd4ef7846dd016323a01c113458b3214e13afe4aed73"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: clsAdventure: ClassTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 322 over it, 1.81\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":"ADRIFT/clsAdventure.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc63754d4bf76aa601fdb52959211ccb0899fef572f6efafacb9f03f0a23587"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileIO.LoadFile: MethodTooLong \u2014 LoadFile runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/FileIO.vb"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eece873dc2df27377826bc8331761aae2d4bf156b090c4a8788483a704aaab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.AttemptToExecuteTask: MethodTooLong \u2014 AttemptToExecuteTask runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de7431cdd03dcf518ab74ccff80a47e9a61a9330fdfaf9114a12d0e8cc639d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Item Classes/clsCharacter.vb: FileTooLong \u2014 853 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 353 over it, 1.71\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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27873b4b686d10e62ade3667682ef8590347e1de3a40040969aa67ac55d809c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Item Classes/clsObject.vb: FileTooLong \u2014 848 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 348 over it, 1.70\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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f24cb075def31eec549eec4f5e14784f97b009b372c644fce2af929b95a9359"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StateStack.RestoreState: MethodTooLong \u2014 RestoreState runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\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":"ADRIFT/clsState.vb"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ed9074f3baa11559262e20610202b76e7a1ae149125c00966611deab8ac798"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: frmRunner: TooManyMethods \u2014 494 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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":"ADRIFT/frmMonoRunner.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6819587831ddee65ceee6335ab35beb256e12745ca0f2dfa6a5dd8f991426e94"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ADRIFT/Blorb.vb: FileTooLong \u2014 791 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 291 over it, 1.58\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":"ADRIFT/Blorb.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2320a7ece5fe6e274724c4fa055b6327c0ca7994f5e2ce8638c4b95a3706a3ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.DoAutoComplete: MethodTooLong \u2014 DoAutoComplete runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4106}}}],"partialFingerprints":{"codehealthFindingId/v1":"2535c90e705ea00bfad5ae1b9ace53d0f668dacec318a76107cb11498e24e448"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _Default: ClassTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 188 over it, 1.47\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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5a4c53b5a17435c438d9ff6c6e9343415d904a4df22c659055c09e5ddce5a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ADRIFT/clsAdventure.vb: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 222 over it, 1.44\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":"ADRIFT/clsAdventure.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4fcef09f7f90a390a5c4bacfbc6f30014e2b5e0f1acc2bde508a7dccc1889d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FileIO: TooManyMethods \u2014 4857 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"ADRIFT/FileIO.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c48d8dff8f5021fcbe34ed1a6cf67a6b6ddd7f008ff766c4a94947ee4b9ce3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.EvaluateInput: MethodTooLong \u2014 EvaluateInput runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4530}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91d33ef06c5dfc898aa3c311f895155e41bf1c96579c9ff3a6b51532c6b55e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.OpenAdventure: MethodTooLong \u2014 OpenAdventure runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef40c3d95b5f6c29380d8c48e880db37e6ad925a3eb8e9da56b75c657c05662c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.NotUnderstood: MethodTooLong \u2014 NotUnderstood runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4722}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4db917628e5b3d7468e7daaa6513e6812d0930b0230ad67d58d66971536e178"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: mdlRunner.OutputClicked: MethodTooLong \u2014 OutputClicked runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Runner.vb"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa3e0791e098c1a3c6387ccc1e5c2f841d00a219f669d11e01a7f7c6f942db1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: clsCharacter: ClassTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 102 over it, 1.26\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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab78eeb699ccda9e2f8c9e426d8b6f1e3e2d7a043ab82dc9bb3195ebb45b0d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileIO.LoadRestrictions: MethodTooLong \u2014 LoadRestrictions runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"ADRIFT/FileIO.vb"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae370629e727d4edb6f609b183417d95f0dd936032228aa4c4fa1de95019d708"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ADRIFT/Default.aspx.vb: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 89 over it, 1.18\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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e09eaa37a152202b8fcc27368277964df5ed42fecb7d2fc82004a547c513c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ADRIFT/clsMap.vb: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 84 over it, 1.17\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":"ADRIFT/clsMap.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4a82ed43a8d745ae392e25a335fca2e4c6ba0e73e5926a049480c56221276c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: clsAction: ClassTooLong \u2014 456 significant lines (blank, comment-only and punctuation-only lines excluded), 3 methods. The bar is 400 significant lines; this is 56 over it, 1.14\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":"ADRIFT/Item Classes/clsTask.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c2a02717213f7df2c89a3354cdd94016b56aa0b3e3438c2ecb31d64ee7e8c2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: clsBabelTreatyInfo: ClassTooLong \u2014 454 significant lines (blank, comment-only and punctuation-only lines excluded), 3 methods. The bar is 400 significant lines; this is 54 over it, 1.14\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":"ADRIFT/Babel.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa46b0ab9f064d7a22887b517745ae925b15099245c9481d5b99b65daf7c17a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: clsRestriction: ClassTooLong \u2014 452 significant lines (blank, comment-only and punctuation-only lines excluded), 4 methods. The bar is 400 significant lines; this is 52 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":"ADRIFT/Item Classes/clsTask.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7db33d9c2b18ede8092f7d845d1977ed77c96aee3398e47491af0a6dfa3219"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.CreateRequiredProperties: MethodTooLong \u2014 CreateRequiredProperties runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa35cd6390e500cbc3b6ba31345a248abed26aa6b5a46c7f49d164135588b9e1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: frmDebugger: ClassTooLong \u2014 450 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 50 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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbf3656d17364d3d732ae8aaf337a980e5e15d9588a43ae584d4b051415a093"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileIO.CreateMandatoryProperties: MethodTooLong \u2014 CreateMandatoryProperties runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"ADRIFT/FileIO.vb"},"region":{"startLine":4501}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7fb6facfe6da14dfb44600539e82b89fb61039968d4a8c570e18b812de1e68"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.InputMatchesCommand: MethodTooLong \u2014 InputMatchesCommand runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5417494fb7d2193611d66fb5b46fc53a6a93b18dc8527d31797dd056ecee9aa3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: clsMap.UpdateMap: MethodTooLong \u2014 UpdateMap runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"ADRIFT/clsMap.vb"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b597c72e2f7ae89849a4286e3b7ce13fa04cf64326e8576c65e53d492b66da00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StateStack.GetState: MethodTooLong \u2014 GetState runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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":"ADRIFT/clsState.vb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b114d2585863a55553b25dcfa1a27e0dd2665112101affdee0e74f812f6a47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunnerSession.GetGeneralTask: MethodTooLong \u2014 GetGeneralTask runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7700}}}],"partialFingerprints":{"codehealthFindingId/v1":"610e1df290bfce53504d7328d492488248c5fa5f26762fb1fa31dd6a6ede4335"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _Default.Page_Load: MethodTooLong \u2014 Page_Load runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bed61047e0c3bf8aac50568ab5e93a8fee5499522516663ea4d54f78fdaaa1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ADRIFT/clsSound.vb: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 over it, 1.03\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":"ADRIFT/clsSound.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce73fd1ba13fa4725fdfac9391d33364d0b2cde783b5265fd98a21cb9bf1198f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: clsBlorb.OutputToFolder: MethodTooLong \u2014 OutputToFolder runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Blorb.vb"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"a045ce3cf6886c656d1b4f8701219278134b2cb00a9337c1c9a55cc927f5453b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201332 lines \u00D7 2): ADRIFT/clsUserSession.vb:8428-8452 | ADRIFT/clsUserSession.vb:8487-8518 \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":8428}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8addb3a82247ecf0da04360cb778cd1e301379bc8a22478563c068a54164ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): ADRIFT/clsUserSession.vb:1275-1296 | ADRIFT/clsUserSession.vb:1300-1321 \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69ead2d9bdec730a34c5402b000144727750257f0e18fd87a3a0ffdc54b1ef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): ADRIFT/clsUserSession.vb:7599-7616 | ADRIFT/clsUserSession.vb:7656-7673 \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7599}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f91532435c7e0a3aeaddd88f01309368d74a634d93178e7043acd900fcf4ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): ADRIFT/clsUserSession.vb:4902-4916 | ADRIFT/clsUserSession.vb:4924-4938 \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4902}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea8207edc9a95db524f72091cd2b9718a92a73db1bfa8226b626f9bd5c2400f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): ADRIFT/Item Classes/clsVariable.vb:977-990 | ADRIFT/Item Classes/clsVariable.vb:1039-1054 \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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ce363166f6a0a4a73b694f832515dfae87c1e0423cfe2c8a6a67b58eaf1429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): ADRIFT/Item Classes/clsTask.vb:1360-1374 | ADRIFT/Item Classes/clsTask.vb:1442-1455 | ADRIFT/Item Classes/clsTask.vb:1517-1530 \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. 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":"ADRIFT/Item Classes/clsTask.vb"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d5e935daddbe5c245610342670c1494a2ca08e6f541680cbaa0da551c4eea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): ADRIFT/clsUserSession.vb:1879-1890 | ADRIFT/clsUserSession.vb:1896-1907 \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a034d012755ef86106c1b87080198f033491c4ed81c93316f068f594eee997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): ADRIFT/clsUserSession.vb:7546-7556 | ADRIFT/clsUserSession.vb:7667-7677 \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7546}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52257da94452c7e5449b1a2795b5b8677f9f13a8e3d87cfc2f3d553e90b9b87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): ADRIFT/FileIO.vb:2082-2093 | ADRIFT/FileIO.vb:2124-2134 \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":"ADRIFT/FileIO.vb"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5bed15de0474612eedcb182b8b2fa426ce6ac95da06232d060f4451983a2c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): ADRIFT/clsUserSession.vb:7541-7553 | ADRIFT/clsUserSession.vb:7607-7617 | ADRIFT/clsUserSession.vb:7663-7674 \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. 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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7541}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00d6273cbc7818134113949ec3ac4ebf0eeaf19a6e776bad3ab1191b37e24c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ADRIFT/FileIO.vb:4436-4444 | ADRIFT/FileIO.vb:4449-4457 | ADRIFT/FileIO.vb:4462-4470 \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":"ADRIFT/FileIO.vb"},"region":{"startLine":4436}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4709b191620ee15c8380c0b413b4791fc217d27238809c4c14fd344cd04a7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): ADRIFT/FileIO.vb:522-529 | ADRIFT/FileIO.vb:560-567 | ADRIFT/FileIO.vb:587-594 \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":"ADRIFT/FileIO.vb"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"b200c71714105c234de11d4d559721efcad07213b5369ce770d0baf7ddc25e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): ADRIFT/clsUserSession.vb:7572-7581 | ADRIFT/clsUserSession.vb:7641-7651 \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a07024f977862ed1a378b9de222254c7c217b37b232a978754123230743d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): ADRIFT/Item Classes/clsVariable.vb:819-827 | ADRIFT/Item Classes/clsVariable.vb:980-990 | ADRIFT/Item Classes/clsVariable.vb:1042-1054 \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. 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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebb5413428752c43ba24a7fd900b051e0b17ee5a5275acc5c9c3ddf2243e365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): ADRIFT/Map.vb:1631-1639 | ADRIFT/Map.vb:1642-1650 \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":"ADRIFT/Map.vb"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"955cccfb3f818d4169ec687a54e268d7546fe2afe212864a8c722ec1c401468d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ADRIFT/clsUserSession.vb:8423-8429 | ADRIFT/clsUserSession.vb:8480-8486 \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":8423}}}],"partialFingerprints":{"codehealthFindingId/v1":"328fcca690bc629938c6c45dc7fcd63e76696afa165841bd54a9e02ff8e6e655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): ADRIFT/Item Classes/clsVariable.vb:788-795 | ADRIFT/Item Classes/clsVariable.vb:875-884 \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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6796b965016423b9478f525b0fb33e5d2f9f87ad41e8780ad6e49822e3cb2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ADRIFT/FileIO.vb:2519-2525 | ADRIFT/FileIO.vb:2528-2534 \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":"ADRIFT/FileIO.vb"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d77b66efbe72e7817c6c80bd21503d330a6ecc747c18dae7f93cdbed7106bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ADRIFT/FileIO.vb:10065-10071 | ADRIFT/FileIO.vb:10086-10092 \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":"ADRIFT/FileIO.vb"},"region":{"startLine":10065}}}],"partialFingerprints":{"codehealthFindingId/v1":"773dc53479f0c6dfd47d744e324ccf82f48bf8405f65608ecee91b7aa2a6317b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ADRIFT/Global.vb:6543-6549 | ADRIFT/Global.vb:6568-6574 \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":"ADRIFT/Global.vb"},"region":{"startLine":6543}}}],"partialFingerprints":{"codehealthFindingId/v1":"958d5253b93e9648820776a075638cdcef604407748a658cf3eb103466548cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): ADRIFT/Global.vb:6554-6560 | ADRIFT/Global.vb:6579-6585 \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":"ADRIFT/Global.vb"},"region":{"startLine":6554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9cfd0f6a48de689f59aeaaf9762755f629d499fecb8ea1a392de1813fcbe9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): ADRIFT/Item Classes/clsVariable.vb:1067-1072 | ADRIFT/Item Classes/clsVariable.vb:1080-1085 \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":"ADRIFT/Item Classes/clsVariable.vb"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"31aeb1db5f7bdcca3d0da81fa7982deee4f46b9676f37369f2768ee366defe2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): ADRIFT/FileIO.vb:717-721 | ADRIFT/FileIO.vb:733-737 | ADRIFT/FileIO.vb:743-747 \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":"ADRIFT/FileIO.vb"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7674755ac436e837324f2282dc079e275beebde8700543dc847a4ec08cafb09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): ADRIFT/Map.vb:1282-1286 | ADRIFT/Map.vb:1553-1557 \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":"ADRIFT/Map.vb"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d25db747144a709f23ef5c9cdbd83abac110c451b57ab9f421896b32a02719e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RunnerSession (LCOM4 11): RunnerSession\u0027s methods fall into 11 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8a3e217e73020d389306cae42255ba9061ccc13d8baa0c3cccc6c39f5aaa0f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: frmRunner (LCOM4 8): frmRunner\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/frmMonoRunner.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7672027fce0ac12d4b8dfa14843bd26ff034674af4866c4d6ceae8c8e410a37a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Map (LCOM4 5): Map\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Map.vb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df34d1a879877ec56752668b2088acb7982cf945e2606c9463deb06fe70f3fc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Description (LCOM4 4): Description\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Global.vb"},"region":{"startLine":6054}}}],"partialFingerprints":{"codehealthFindingId/v1":"d003be97a3c054b24806119f02d1a43f3b947746540cb42adceb3c7ab0b3e16c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: clsObject (LCOM4 4): clsObject\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cac668441217e891cd3627204c1af88ffdf1ab4b9ab8f326186199f4d5d757"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CharacterHashTable (LCOM4 4): CharacterHashTable\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/StronglyTypedCollections.vb"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"3773bea60f54908bf3556b99bef3d9b87278d5e936f70a0f178991191180ac9c"}},{"ruleId":"D8","level":"error","message":{"text":"No automated tests: No automated tests \u2014 no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (xUnit, NUnit or MSTest), and run it in CI so the gap cannot reopen."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3132564c6310e5d01a231f252a02d5d2f5a542c0a8fa29a14c89693f1e3df871"}},{"ruleId":"D9","level":"note","message":{"text":"No tests found: No test suite could be collected \u2014 no discoverable tests to count. If this repository does test, wiring the suite to a framework a runner can collect (xUnit, NUnit or MSTest) is what makes it countable here; a pipeline step that invokes a runner is not evidence on its own, because a runner over an empty suite passes. Tests written as plain executables or shell/PowerShell harnesses are not collectible this way and are not scored here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9bf64cbb5a4ae13d6bcd01fa3bc8d2879d860c73bc67f176ee3c2cecb8adce3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO: Customize the application\u0027s assembly information in the \u0022Application\u0022 pane of the project \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":"ADRIFT/AboutBox.vb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9726a6501d6b6ee30fffb60bfe0a05c6b72c1c76be15fc0d52d3167d304711"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - We actually need an UpdatePanel per channel... \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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50ff86a1efc35ae9c5e0be069de8a92ddc6bcbcd3dd043f5fb03c2ff3f5a54d"}},{"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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61036acb89daddf27094a52e7eb1a37cb20fad55a3afb8254a85b752791cd40"}},{"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":"ADRIFT/Default.aspx.vb"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"362af988f56cb61f5b49c7929e03103c57ac860fd676600aab4e51bf37ff6aa3"}},{"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":"ADRIFT/Global.vb"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ef2a7a2bc1af43c72955683f7764d92cb3f0900d809f63f24b0649889d2111"}},{"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":"ADRIFT/Global.vb"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"4261dad390210d0ff22ef9092f10f33c035357e8d44106e7a85b562e074d81b7"}},{"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":"ADRIFT/Global.vb"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d714e7aad6195060a6ab735f2bc4dd1a0ef25268817f0922f6de3eedb76ffbd"}},{"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":"ADRIFT/Global.vb"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"152149560f8275e5a2eb6139a8e2fe8ce41055d82b7b5ecb5bba46d596180eee"}},{"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":"ADRIFT/Map.vb"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88da81d8577e719baff97e607de76f5378fe1ae8b639c6f36af6f9cf00a2708"}},{"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":"ADRIFT/Map.vb"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf494878b426169b71b560901b7e477b4ee5126e51e82e7e1829dfc5831a945"}},{"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":"ADRIFT/clsMap.vb"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcf537ffebd8b5b8c2d34bb5910557a11b5ec75d5f71fa838c33b8819a143c4"}},{"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":"ADRIFT/clsSound.vb"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0828458c14eaedcaefa4f871dd35dcd16dc7e0c7f5d9d4a6c6bde3f9d84f9b4"}},{"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":"ADRIFT/frmMonoRunner.vb"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"236dee49256f1519e752ac6b8341d390cf9f991a72c388e50a9408ae0ccb6cce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027                    \u0027 TODO \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":"ADRIFT/FileIO.vb"},"region":{"startLine":4337}}}],"partialFingerprints":{"codehealthFindingId/v1":"908510833c822b46b171b002dc6c8da4db649586b9845ef7ddd9cea07ad6a300"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 StaticLoc.StaticKey = \u0022Location\u0022 \u0026 iRoom \u0027 TODO - Generate a roomgroup and assign that \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":"ADRIFT/FileIO.vb"},"region":{"startLine":7702}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd98a665f7331ff3956deb60614e229e85e7bf823aa23b9488a08f05c16dec0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO \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":"ADRIFT/FileIO.vb"},"region":{"startLine":9197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d761660d8682aeb458a058dd8578e691d0da22456551e0d0ec3757bc0df59580"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO \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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb451a67a8fcfb0528230f40a7c22775d07c86114bddbac0951304092667af7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dfe88fe56fb5c63bfb86686c17d5951343e847b3231efdf224fcd34c05f0ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO \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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed477bf19992e3a76a8a2c2e8195c74453d51d1ae72418ccf19471887d29225"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO \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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4e367da121c86456b1d047c4ee8abc7683c9f4098be083b157213958f11b7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO \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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"39091f2457af3dd251c5b742c88ecee614d907f6c952bd47168ad1d953db8a2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO \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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"010819b66db46015c52bdc305d1fe4c0f571c68feb6566ddd81590da3274f3a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO \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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76fbb82b6e6df8f20933b0391d7ecd96fc72e5f26b679d68d695637b8a1c608"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO \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":"ADRIFT/frmDebugger.vb"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c340269bba5642b665d86d413bf12ade296df499bd777ecde734c03487ef2c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - Improve this to read quotes and commas properly \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":"ADRIFT/Global.vb"},"region":{"startLine":4414}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41039dcde8e1339737f6c1d7c1a19e68b9c72d6f4926a60ee2ddf0ccba6dd5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - Improve this to read quotes and commas properly \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":"ADRIFT/Global.vb"},"region":{"startLine":4432}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb912a8739de2c07af3db02250a3c0b8c5215d177585aaa153fc666e80ccc969"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027                    TODO(\u0022LocationRoot for \u0022 \u0026 Location.ExistWhere.ToString) \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":"ADRIFT/Item Classes/clsCharacter.vb"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef50aab3194a542bd217c9be8ac5b42a2bcfa6bb56f6d78ef01e91d05ef9247"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - Enhance this, or make it user configuratble \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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59bf864283d5d4f3447c918d62e3fac4294cfc69b6395635086bfda6c6b1adb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027TODO(\u0022Set IsWearable()\u0022) \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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb099c29c330c091083f4378b4cda94189e7d60e121523ffdc3c54c4a18f5653"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - Need to do something clever here.  E.g. if we have properties Where=InLocation then Location = theroom, we need to set Where=Hidden and remove Location property \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":"ADRIFT/Item Classes/clsObject.vb"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f61f2709cd6a2379a41a782a80adb3ed0669c7441a2d1db9f2343f5dc39e9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - rejig all the other priorities to insert this one \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":"ADRIFT/Item Classes/clsTask.vb"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b09fc898044afddd9fda2c28e98040320dc85819856468feb481e09f961dc0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - warn if there are restrictions \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":"ADRIFT/Map.vb"},"region":{"startLine":2806}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c213ff4dce0093c625ba903bfa156725250e4109b7189671d10156bcb0f368f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - phase out the individual hashtables in favour of a single dictionary \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":"ADRIFT/StronglyTypedCollections.vb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"46faf9dae1ef0f6c39eb2c0cba88885605404032c59040bcdad113629ad9224f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO: Ensure unique for this adventure \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":"ADRIFT/clsMacro.vb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa2dd51ebb5ba0f1beddf980daac09422edd980154df66678fc03ef3a916628"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - Allow disabling of each interface in Settings \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":"ADRIFT/clsSound.vb"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1c2bf7efa89eb7e69cad5f593c1fcff9f753427764c4c0eb3a2c34803b1a87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO: Arrays \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":"ADRIFT/clsState.vb"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d529cba7243d135fbb164aef4891031a5baa061cc1c0ed963fdf61b1e978ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - If this is matching on a second command in the task where the refs are the other way around, it fails to match the specifics \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"2174ff88e2ec4e447ea55aceea1a9d9e3e0b02b2927af54e51d8ea26d01b7cd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - We could have responses from different tasks here.  We need to only match references from the same parent task \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec1ad08add6c6b59f3542708d7cb56cf8cc020cabb8ac3c82ae9600feb13a06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - These may be in the wrong order if we\u0027re matching on a secondary command! \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11ee5eea63de9747ee7c1722c831bfc68624218352e5ee27c325e7131ed834c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - Need to check PassRestrictions to see if we need to suppress parent Text or Actions \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5d32a551d3a37d06689e92c7131768d95db19feafa097ab35f01fd0006e0c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - Change this to configurable pronouns \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5237575669eef43630d963947faa1577ea443e5020bcf865405169770e8ea725"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - Run the implicit actions if we didn\u0027t find an explict match later. \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3057}}}],"partialFingerprints":{"codehealthFindingId/v1":"83545b895005870a944e653a9b4a60ead98614272ee4c6f0ba4dfed82e2b4a1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO: Need to make this configurable within Generator \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd92555df7f14f9ebfa2d958b510f7dd51e0220c3d865cc2964465126054021"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - Bring this into Developer as a task \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":4893}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edac16bd679e25531db9c2fdf466285b01bc9e670a6464bafbf1fd81c90e503"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO: This should only add if completeable in current room, i.e. pass all restrictions ignoring ones regarding references. \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5236}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b545f35e7485e0024d24edcdc142fd34f31f66e21ba72cf9281bebaa40a889"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027    TODO(\u0022Object is part of any character\u0022) \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16591df872bb351194a29d187272ebcf5be2ce75af469093e75bfad4d9400a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027    TODO(\u0022Object has been seen by any character\u0022) \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5841}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d76616fdd01f8e818d9d5afe92a21543afc9db14574d12c6696f9f3656bba7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027    TODO(\u0022Object visible to any character\u0022) \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5884}}}],"partialFingerprints":{"codehealthFindingId/v1":"299004b89c41656feb6b215dbddc942b3f110f6dad423bf5ba972c41b23303de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - This needs to check that it is the correct \u0027must exist\u0027 check, rather than just any \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":6975}}}],"partialFingerprints":{"codehealthFindingId/v1":"1405f36da9f037699f682781fec43801aa62d6663b3635ee9e592b724a3f6060"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - This needs to check that it is the correct \u0027must exist\u0027 check, rather than just any \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7043}}}],"partialFingerprints":{"codehealthFindingId/v1":"70540ccb441350df4ebcf72dc585961b14aa248476d24f338b7fcaf0dba5f253"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - This needs to check that it is the correct \u0027must exist\u0027 check, rather than just any \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7086}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ab14d504174d0224237c33cf901a02c66655b1a4dcf30f87fdff0766576143"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO, when more than 2 refs... \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7443}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1ca1cf65f31c3b53cb5514b9dc09c6b29ab40680c2953d4111ecd660bae9df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027                        \u0027TODO(\u0022Refine matching possibilites for \u0022 \u0026 CType(htblNotAdded(iRef)(sExplicitCommandNotAdded), ReferencesType).ToString \u0026 \u0022 references\u0022) \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7529}}}],"partialFingerprints":{"codehealthFindingId/v1":"615af4d329b37e3b2742d2b446b63d6bf2973365ba45628cdbf0712df8785721"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027Dim sPattern As String = ConvertToRE(sCom) \u0027 TODO: Cache the RegEx pattern rather than calculating it every turn! \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":7736}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb8c540bc8a9e11f165f95788a79b0ab6e9206d07f7d2fcf7012201030bbf0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO - replace above with custom names if changed \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":"ADRIFT/clsUserSession.vb"},"region":{"startLine":8555}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7aeee845d672e1490b266cbb6cbc0fcc6af396310b01aa7999a678952c88e72"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no installation or build instructions: There is no installation/build/usage section describing how to set up ADRIFT. Add a short install guide covering dependencies, cloning the repo, and running the first application."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa6bfcd5c6ae231d1b8ee99bced50b832d1f61cde9da6cbb533467b879a57db"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 4 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060MonoRunner\u0060 (48792 LoC, 163 public types across 2 namespaces). Review these for cohesion \u2014 split a project that spans unrelated responsibilities."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 36 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, it found no a build/run or getting-started section, no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise \u2014 or with no heading at all \u2014 is not seen and this row may understate what the document covers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5fc8f78bec0b6b3daab9d9139ba49b687f61b54f8310b64c159df9616f47e38e"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"M3","level":"note","message":{"text":"No src/ separation: Production code isn\u0027t grouped under a src/ folder \u2014 it all sits under ADRIFT/ alongside the root build files, so the conventional src/ boundary between the product and its tooling isn\u0027t drawn."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"M3","level":"note","message":{"text":"Inconsistent root namespaces: Only 2/4 projects share a common root namespace \u2014 the code\u0027s module identity is inconsistent."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c8031c9fb77ad97c2e4a8ddb29978f4bf30140d481913bd7fde8b5adbbb83ede"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets \u2014 CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"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"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!selector \u0026\u0026 jQuery.filter( selector, this ).length \u003E 0\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":4721}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a2137ad538eb363ef894c9abcbf3a84322c2d40ed6206aa6e9130c9b214b1c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!a.compareDocumentPosition || !b.compareDocumentPosition\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":4231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6180a1cd6677c66d051fdf05cbb8879cf030ba4d5076b48d45db5b529134196f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!div.getElementsByClassName || div.getElementsByClassName(\u0022e\u0022).length === 0\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":4417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a6ac8f267bfd6b6a6b9716f0c652b459fc01b5bec45240a1ebdef205e4c065"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!done \u0026\u0026 (!this.readyState || this.readyState === \u0022loaded\u0022 || this.readyState === \u0022complete\u0022)\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":6532}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1b93019af273171b1a0b8587ec15e71779d314bd18a19c2ea40fe6abc5415b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!elem || elem.nodeType === 3 || elem.nodeType === 8\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc713f84d6dbc96b50bb5a9ccd0c8686b029f90485884715fa5274a91e5574c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!event.relatedTarget \u0026\u0026 event.fromElement\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4b576bcc6b6e6ce8aee897b1de60e711a815417c93bd87b66a4a24889d7ecb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!event.which \u0026\u0026 event.button !== undefined\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98adc3bd4ca698ce0236458adc1f5fddd67e51f2c03df6ff46f1f33ef7c88a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!formElems.test( elem.nodeName ) || elem.readOnly\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a1f81e5cfbdda521874db4a42d14f491969be7b23a600375818a00cbc85957"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isClick \u0026\u0026 !(target \u0026\u0026 target.nodeName \u0026\u0026 jQuery.noData[target.nodeName.toLowerCase()])\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":2325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f790c92ecc3615c521a1798b30fd32248bace193dad0f3cd694e9e283bf73ba2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!jQuery.support.checkClone \u0026\u0026 arguments.length === 3 \u0026\u0026 typeof value === \u0022string\u0022 \u0026\u0026 rchecked.test( value )\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":5468}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef8add9fc7f0b575fa84d0a0def746986d4970c205e699a6856fc16e1b090f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!jQuery.support.hrefNormalized \u0026\u0026 notxml \u0026\u0026 special\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":1993}}}],"partialFingerprints":{"codehealthFindingId/v1":"593d18c2c156831f69bb1920da59dad38bda98e0e15f79308d8686c2c1355b83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!jQuery.support.leadingWhitespace \u0026\u0026 rleadingWhitespace.test( elem )\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":5811}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c46710d16def028a7016de940275518902ed6f1ada2584d52d4e0361dd85a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!jQuery.support.noCloneEvent \u0026\u0026 !jQuery.isXMLDoc(this)\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":5312}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f132e986134c527c8c217830273cef59634d1fe4ffdebcc47278c74c7ec7fec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!jQuery.support.opacity \u0026\u0026 name === \u0022opacity\u0022\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":5913}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03be864c036daf47fe32e1d55e9f9dbeb56d15c652653d934b418a638d8ee59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!jQuery.support.opacity \u0026\u0026 name === \u0022opacity\u0022 \u0026\u0026 elem.currentStyle\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":5994}}}],"partialFingerprints":{"codehealthFindingId/v1":"653a5afe29405c808458410d5266ba8b9033270aef01dc69262ae22eb1b83d02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!jQuery.support.style \u0026\u0026 notxml \u0026\u0026 name === \u0022style\u0022\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"c110808ad925f24955b97dbde227e6d2a3f14b74b67452b5faa6ad487aa349ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!node || !node.parentNode || node.parentNode.nodeType === 11\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":4843}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d095d7a4fc1306e6fb01c6067f746f03038551cfef4bb65415624aa9ffcdbe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!obj || toString.call(obj) !== \u0022[object Object]\u0022 || obj.nodeType || obj.setInterval\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1bf8e322cd2089f597111d9c42a8758b2f45ab128a0f8017cb6d5e91aa2c32"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pass \u0026\u0026 exec \u0026\u0026 jQuery.isFunction(value)\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccfcf9c20d8038c2c5ac60bb46f1c6cf2a89422d9675481f269da352878e659"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!requestDone \u0026\u0026 xhr \u0026\u0026 (xhr.readyState === 4 || isTimeout === \u0022timeout\u0022)\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":6634}}}],"partialFingerprints":{"codehealthFindingId/v1":"155c259d666582d5643d94cb1caedd8828ad5a2a3198c83508c23c87cc4d6c2b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!seed \u0026\u0026 context.nodeType === 9 \u0026\u0026 !isXML(context)\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":4393}}}],"partialFingerprints":{"codehealthFindingId/v1":"7581d8ea0780903224a92f15a9ba3f35dcaad247bdbbe8a386fe1e2bc1e39f28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!seed \u0026\u0026 parts.length \u003E 1 \u0026\u0026 context.nodeType === 9 \u0026\u0026 !contextXML \u0026\u0026 Expr.match.ID.test(parts[0]) \u0026\u0026 !Expr.match.ID.test(parts[parts.length\u2026\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":3549}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ebc2fa3641f39b4a4345fda4f542693cb84db4001e634950d4f28d1be3a1a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!selector || jQuery.filter( selector, [ this ] ).length\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":5707}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4f22bd906a0ba4f8bf9d043ddee79498eadceb7476565444c7ed0ba8bdb9d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!selector || typeof selector !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":3509}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3c1ee78de93f53b5a91810f320183ff866fae1944d1dc189c2bb1b59aa0878"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!special.setup || special.setup.call( elem, data, namespaces, handler) === false\u0060 appears character-identically in 2 files \u2014 ADRIFT/Scripts/jquery-1.4.1-vsdoc.js, ADRIFT/Scripts/jquery-1.4.1.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/Scripts/jquery-1.4.1-vsdoc.js"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ef806e39c9bec74c33446659b24f4c4b590fce7bddad476249fb3cf288ef58"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: This condition tests \u0060NewReferences\u0060 for emptiness and then indexes it on a branch that test does not reach. \u0060NewReferences(0)\u0060 is evaluated whenever the guarded half is false \u2014 which includes the case the guard exists to anticipate, \u0060NewReferences\u0060 being empty \u2014 so an empty \u0060NewReferences\u0060 indexes position 0 of nothing and throws. This same condition already shows the intended bracketing: \u0060NewReferences(1)\u0060 sits INSIDE the guard. Either the guard is load-bearing, in which case this access escapes it and crashes, or \u0060NewReferences\u0060 cannot be empty here, in which case the guard beside it is dead code \u2014 the condition is wrong under both readings. Move the parenthesis so the emptiness test brackets every access to \u0060NewReferences\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ADRIFT/clsUserSession.vb"},"region":{"startLine":5956}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b9a5221f7718580acfce346d68f9fa976a648a5c03874ab585023641689007"}}],"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":0,"secretScannerRunsExcluded":0}}}]}