{"$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":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D18","name":"Solution Shape","shortDescription":{"text":"Solution Shape"},"helpUri":"https://codehealth.canine.dev/dimensions/D18"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"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":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"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":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"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":"clsOptDE.DoIteration (cyclomatic 38): clsOptDE.DoIteration 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: LibOptimization/Optimization/clsOptDE.vb holds 2 of the 15 methods over the threshold \u2014 including the worst \u2014 and 26 of the 78 points over it (33%), 2\u00D7 the next-largest file (TestLibOptimization/UnitTestLinearAlgebra.vb at 13). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptDE.vb"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1da6b6b8f99dfa9eea22022e208f560ff1bbeacdcfd6fb39e472f1a252b4c7"}},{"ruleId":"D1","level":"warning","message":{"text":"UnitTestLinearAlgebra.Vec_Product_VectorMatrix (cyclomatic 24): UnitTestLinearAlgebra.Vec_Product_VectorMatrix 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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"7089ef5b5da6df8d4e38febf50f624f4563b5878cd05d20ef843907f8765bc80"}},{"ruleId":"D1","level":"warning","message":{"text":"clsOptDEJADE.DoIteration (cyclomatic 23): clsOptDEJADE.DoIteration 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":"LibOptimization/Optimization/clsOptDEJADE.vb"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b421029328c61b8587558ec17013649a3e565057fb7f88c597f8786e819e984"}},{"ruleId":"D1","level":"warning","message":{"text":"clsOptES.Init (cyclomatic 20): clsOptES.Init 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":"LibOptimization/Optimization/clsOptES.vb"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f67ab1f2fbc91afb6ecb10c53cfe8963513424ed053e170edd219ba29234b87"}},{"ruleId":"D1","level":"warning","message":{"text":"clsOptPSO.DoIteration (cyclomatic 20): clsOptPSO.DoIteration 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":"LibOptimization/Optimization/clsOptPSO.vb"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b625b4eedecbeffeeb52a591277b37ee02fb49d35c9c4daba530984769f48a8"}},{"ruleId":"D1","level":"warning","message":{"text":"UnitTestLinearAlgebra.Mat_Product_MatrixVector (cyclomatic 19): UnitTestLinearAlgebra.Mat_Product_MatrixVector 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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c87e531bcd28b286635a67507f9b0df62fe36603d804a2b4c3ce64b79b767da"}},{"ruleId":"D1","level":"warning","message":{"text":"DenseMatrix.LUP (cyclomatic 19): DenseMatrix.LUP 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":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fada1c2052e2c3f66489d3bd86f3ffb1e598a986140e04b0c41288f3c6d31d"}},{"ruleId":"D1","level":"warning","message":{"text":"TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 (cyclomatic 19): TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 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":"TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fd9325acc18ef4ac4c8af63bb9c095feceb12f0a942fe53713f088a6183f7a"}},{"ruleId":"D1","level":"warning","message":{"text":"DenseMatrix.tred2 (cyclomatic 18): DenseMatrix.tred2 has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"778021a395974ba35539f91f85d96da9a62991a1fadb93407b07bdc6f0cace4b"}},{"ruleId":"D1","level":"warning","message":{"text":"clsOptCS.DoIteration (cyclomatic 18): clsOptCS.DoIteration has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptCS.vb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aed433e91e70893b0c35ef04589b27a4e10efa4870861d2cfbbfa2ffc659ae"}},{"ruleId":"D1","level":"warning","message":{"text":"clsOptDE.Init (cyclomatic 18): clsOptDE.Init 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: LibOptimization/Optimization/clsOptDE.vb holds 2 of the 15 methods over the threshold \u2014 including the worst \u2014 and 26 of the 78 points over it (33%), 2\u00D7 the next-largest file (TestLibOptimization/UnitTestLinearAlgebra.vb at 13). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptDE.vb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eef4a4f17b113608f7b80ee2739a5dd69d39bb137adcbdb5639cce683a30e2"}},{"ruleId":"D1","level":"warning","message":{"text":"clsOptDEJADE.Init (cyclomatic 18): clsOptDEJADE.Init has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptDEJADE.vb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f20beec84f28401868a6d1f6fa039730c8d2bd4fc778bf4a93827a0d73bfce"}},{"ruleId":"D1","level":"warning","message":{"text":"DenseMatrix.Inverse (cyclomatic 17): DenseMatrix.Inverse 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":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff7208e719ed995497fb4f22053b553fc30594c98000514a8806d578c5040b3"}},{"ruleId":"D1","level":"warning","message":{"text":"clsOptNelderMeadANMS.DoIteration (cyclomatic 16): clsOptNelderMeadANMS.DoIteration 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":"LibOptimization/Optimization/clsOptNelderMeadANMS.vb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c07fc1409a31b2412fa11108397ef0cf6c4dfb91f71082c40c7c3689b15a92"}},{"ruleId":"D1","level":"warning","message":{"text":"clsOptPSOCPSO.DoIteration (cyclomatic 16): clsOptPSOCPSO.DoIteration 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":"LibOptimization/Optimization/clsOptPSOCPSO.vb"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cff61d6e7160df65777194bbc65c8fe6110abb58d439a6191497af04f9fc3c6"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptDE.DoIteration (cognitive 99): clsOptDE.DoIteration 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":"LibOptimization/Optimization/clsOptDE.vb"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cb6260bfb2f1edf182aedf76c8389baba1ddd028a81a3a2b3e910671ddbbc7"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptDEJADE.DoIteration (cognitive 60): clsOptDEJADE.DoIteration has cognitive complexity 60 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptDEJADE.vb"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1639701de970fc07bccfbb9c5dc2a94a69b5ebd9f677380dd4dc91fba98ddaee"}},{"ruleId":"D2","level":"warning","message":{"text":"DenseMatrix.tred2 (cognitive 59): DenseMatrix.tred2 has cognitive complexity 59 (threshold 15). To reduce it, flatten the nesting: invert conditions into 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":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"867d119cfdf9bfdf125e94529164a8b5b51bb6afa162442e3d80bcd0f4333e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptPSO.DoIteration (cognitive 52): clsOptPSO.DoIteration 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":"LibOptimization/Optimization/clsOptPSO.vb"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e264020c9d57cf1447d40aaac5385751238be8a85a9e84d21271f85a4cb0639d"}},{"ruleId":"D2","level":"warning","message":{"text":"clsBenchRosenblock.Hessian (cognitive 43): clsBenchRosenblock.Hessian 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":"LibOptimization/BenchmarkFunctions/clsBenchRosenblock.vb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5817450dcc63639fb02ed3df181fbfbc70326da339f494e18729c9c0f5f2c04f"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptCS.DoIteration (cognitive 40): clsOptCS.DoIteration 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":"LibOptimization/Optimization/clsOptCS.vb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf51b3936e6246eb54c83d71b2b9d66be0609b0357f878daeb78b53db1ecd47b"}},{"ruleId":"D2","level":"warning","message":{"text":"DenseMatrix.LUP (cognitive 37): DenseMatrix.LUP 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":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae1a3ef0bf438c58819aaf89052619560f9669fbef9b125e935037d4aaf8db6"}},{"ruleId":"D2","level":"warning","message":{"text":"DenseMatrix.tqli (cognitive 37): DenseMatrix.tqli 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":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7531a95c9cf93f854073d3a6d0a577895747e8a62dd0902840879511868d2ae"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptPSOCPSO.DoIteration (cognitive 37): clsOptPSOCPSO.DoIteration 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":"LibOptimization/Optimization/clsOptPSOCPSO.vb"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de5fa57461de4ec56d523658bad6e2d99a563d3154d4bab287fd669c002f1f4"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptNelderMeadANMS.DoIteration (cognitive 33): clsOptNelderMeadANMS.DoIteration 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":"LibOptimization/Optimization/clsOptNelderMeadANMS.vb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"97062d9cdc9c1d8c30baf26a1941873601fca38586e3c4bdba2a0bfbde56991a"}},{"ruleId":"D2","level":"warning","message":{"text":"DenseMatrix.Inverse (cognitive 32): DenseMatrix.Inverse 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":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a35e973218f8100504117518d480ce42f0511da8a243144d6c96422dd4c3b6"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptNelderMead.DoIteration (cognitive 32): clsOptNelderMead.DoIteration 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":"LibOptimization/Optimization/clsOptNelderMead.vb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"511cfa1472975d95fa298ea57b87eb7c0ab9f5a82db39d539757658106e177cb"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptES.Init (cognitive 31): clsOptES.Init has cognitive complexity 31 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptES.vb"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"db488200b273a2c8411b5af16d463858d3d07fc76e14781a5162c8ab34ff1add"}},{"ruleId":"D2","level":"warning","message":{"text":"clsBenchmark.DisplayStatic (cognitive 30): clsBenchmark.DisplayStatic 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":"TestCode/Module1.vb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5594cf53bd9f9572cee762e9188d05d071a45bc53f6a926f14d5b0ece49420c"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptDE.Init (cognitive 29): clsOptDE.Init 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":"LibOptimization/Optimization/clsOptDE.vb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d5a32d15f1473c91cd46f3a55a3878507d2fccdf01a31e11e548349aad1a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptDEJADE.Init (cognitive 29): clsOptDEJADE.Init 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":"LibOptimization/Optimization/clsOptDEJADE.vb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0de0e8ceffef908566f8e79424c3a592f09ba64f705fc87890b577807aab08"}},{"ruleId":"D2","level":"warning","message":{"text":"UnitTestLinearAlgebra.Vec_Product_VectorMatrix (cognitive 27): UnitTestLinearAlgebra.Vec_Product_VectorMatrix 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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7f62b74caaf9061f6b14f2961b9927863ac7ba1f442fcd886914e7429cf268"}},{"ruleId":"D2","level":"warning","message":{"text":"Module1.BenchmarkLU (cognitive 27): Module1.BenchmarkLU 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":"TestCode/Module1.vb"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4341280dcbf912d1ff5cea8b0971c5cf52f9991248becda8221f24a94035c2cc"}},{"ruleId":"D2","level":"warning","message":{"text":"MathUtil.CreateRandomSymmetricMatrix (cognitive 25): MathUtil.CreateRandomSymmetricMatrix 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":"LibOptimization/MathTool/MathUtil.vb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e4b961369a93895226afa0cd8055be9611a6acc1ba70ce072c90356c5ae30d"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptFA.DoIteration (cognitive 25): clsOptFA.DoIteration 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":"LibOptimization/Optimization/clsOptFA.vb"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4fef3b357533e8518ab79e9ce2a6a109bd2a34238c8b0e0d71050745de1916"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptPSOChaoticIW.DoIteration (cognitive 25): clsOptPSOChaoticIW.DoIteration 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":"LibOptimization/Optimization/clsOptPSOChaoticIW.vb"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee26bdad5a2c2040b461ed7dbbd8a86ef9ce12e4f5f1ec7585487b04af996369"}},{"ruleId":"D2","level":"warning","message":{"text":"UnitTestLinearAlgebra.Mat_Inverse (cognitive 24): UnitTestLinearAlgebra.Mat_Inverse 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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b61d3b09cea5712dee8abfbc9e9b1fa065d06654a69a718037ac778f5c5a5f8"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptNelderMeadWiki.DoIteration (cognitive 24): clsOptNelderMeadWiki.DoIteration 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":"LibOptimization/Optimization/clsOptNelderMeadWiki.vb"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4de567eb133e510c4505463a78ee2fe63e80b367a7707f34c4089cf3037be3c"}},{"ruleId":"D2","level":"warning","message":{"text":"MathUtil.CreateRandomASymmetricMatrix (cognitive 22): MathUtil.CreateRandomASymmetricMatrix 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":"LibOptimization/MathTool/MathUtil.vb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d4bae851e9c9b6f70b5e202cf5830ea978752231528d733a2f4b3da10cd01d"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptPSOAIW.DoIteration (cognitive 22): clsOptPSOAIW.DoIteration 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":"LibOptimization/Optimization/clsOptPSOAIW.vb"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b2a448a04fd3cb58b58e361280085a8b222d6ad2a5812a43626b905ab178b2"}},{"ruleId":"D2","level":"warning","message":{"text":"UnitTestLinearAlgebra.Mat_Product_MatrixVector (cognitive 21): UnitTestLinearAlgebra.Mat_Product_MatrixVector 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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42f860291f1cd7227c222efb4ca2554b923e31b548f5904ada6ac32f9262ae6"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptPSOLDIW.DoIteration (cognitive 21): clsOptPSOLDIW.DoIteration 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":"LibOptimization/Optimization/clsOptPSOLDIW.vb"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef5a13d63109c5ae65ecc330169c76bc9d86f54106e9ca7d8eba49f61d9640d"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptRealGABLX.DoIteration (cognitive 21): clsOptRealGABLX.DoIteration 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":"LibOptimization/Optimization/clsOptRealGABLX.vb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59ee27b2ae11b07a69144e3d39f30e09f3e7a99622989cef870228e831f5126"}},{"ruleId":"D2","level":"warning","message":{"text":"clsUtil.RandomPermutaion (cognitive 21): clsUtil.RandomPermutaion 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":"LibOptimization/Util/clsUtil.vb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b779b43419042c71b60cbbba0571f871e585cc7647b9a2fc54596cb1684fe62c"}},{"ruleId":"D2","level":"warning","message":{"text":"TestLibOptimizationDotNet30.Opt_OptimizeSphere_2D_NET35 (cognitive 21): TestLibOptimizationDotNet30.Opt_OptimizeSphere_2D_NET35 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":"TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"161f079c41136fff74f76f4948210aa15c25e4014f0dc420e569ee9b46e6447a"}},{"ruleId":"D2","level":"warning","message":{"text":"TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 (cognitive 21): TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30 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":"TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f3fffdc3bf324d71bbbf8e39265aee459d2480f7bf221986837ee78dc11dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptPSO.Init (cognitive 20): clsOptPSO.Init 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":"LibOptimization/Optimization/clsOptPSO.vb"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f11b10cfd6b65516d1166ed9720199e1e3eb25465d93a489454e31a77ee018"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptPSOCPSO.Init (cognitive 20): clsOptPSOCPSO.Init 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":"LibOptimization/Optimization/clsOptPSOCPSO.vb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18225d0a6149d3c8268624c0af730374f2899b45e558be0d91a34b66f884c83"}},{"ruleId":"D2","level":"warning","message":{"text":"DenseMatrix.EigenJacobi (cognitive 19): DenseMatrix.EigenJacobi 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":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b090ca85b24a3770c6bbd662cf13dad50f4fdf9f20bbde7cc663b71544cb2f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptSimulatedAnnealing.DoIteration (cognitive 19): clsOptSimulatedAnnealing.DoIteration 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":"LibOptimization/Optimization/clsOptSimulatedAnnealing.vb"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca92233fa8cd4d31ca172e4f8e900a819dcd7ff4f6cdd7348f9ab1bb07e3dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"Program.Main (cognitive 18): Program.Main has cognitive complexity 18 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"SampleCSharp/Program.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e586be545a53e0aa97beb7106cac54ef49cb8bd56eb1bef10d630476e91e381"}},{"ruleId":"D2","level":"warning","message":{"text":"UnitTestLinearAlgebra.Mat_CreateMatrix (cognitive 18): UnitTestLinearAlgebra.Mat_CreateMatrix 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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"257868007ba2e09257229b97809a7c54d76df3d078c671a01f69b8d95230878b"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptRealGAPCX.CrossoverPCX (cognitive 18): clsOptRealGAPCX.CrossoverPCX 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":"LibOptimization/Optimization/clsOptRealGAPCX.vb"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"0969b87f5b389ca363f031d4ea0b4f03c7f5ec71eda13d73e1c21b04b4973765"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptRealGAUNDX.SelectRoulette (cognitive 18): clsOptRealGAUNDX.SelectRoulette 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":"LibOptimization/Optimization/clsOptRealGAUNDX.vb"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc867b8a8946e8d556c421b888a0573e5eaa42e54414a423b5f600fc8a0d4e4b"}},{"ruleId":"D2","level":"warning","message":{"text":"UnitTestLinearAlgebra.Mat_Product_MatrixMatrix (cognitive 16): UnitTestLinearAlgebra.Mat_Product_MatrixMatrix 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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9686d16deb4288cdc95b931c119df81efb053cfe87aa7cc4ae59dc176454a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"UnitTestLibOptimization.Opt_IterationCount (cognitive 16): UnitTestLibOptimization.Opt_IterationCount 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":"TestLibOptimization/UnitTestLibOptimization.vb"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a39bcd65bcc0099ac9a09bf025f6644028051db4572aea1440102c80dc4c83"}},{"ruleId":"D2","level":"warning","message":{"text":"DenseMatrix.Cholesky (cognitive 16): DenseMatrix.Cholesky 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":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a506bc1e29fadaa2ffcf293bfd32208f282157407e80d1406d87dbc7fab3e7"}},{"ruleId":"D2","level":"warning","message":{"text":"DenseVector.PrintValue (cognitive 16): DenseVector.PrintValue 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":"LibOptimization/MathTool/DenseVector.vb"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84f45942236ea516929be69a74e4cf988cc6305c54b0c9fc3361bc71aaec006"}},{"ruleId":"D2","level":"warning","message":{"text":"clsOptES.DoIteration (cognitive 16): clsOptES.DoIteration 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":"LibOptimization/Optimization/clsOptES.vb"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d0900c24245f20e0a1bb135df2fce1e1c0bb9cc19a70dd8a132e2343474aed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: TestLibOptimization/UnitTestLinearAlgebra.vb: FileTooLong \u2014 1079 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 579 over it, 2.16\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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1119240853f9791197f5d4f58d330009ee48a1a2f15e1d52f5187cc4ac2f57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: MathTool/DenseMatrix.vb: FileTooLong \u2014 992 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 492 over it, 1.98\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":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d9a1b91b303b45dbdc815f2975e5149a5f59dcca7bafdb1baa7301fb2c36c8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DenseMatrix: TooManyMethods \u2014 990 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1cb654ff5749923d6b39c41cc1f745c5e0b19fcf4faed2bb8e95c2ac326b51"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: clsUtil.GetOptimizersForUnitTest: MethodTooLong \u2014 GetOptimizersForUnitTest runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.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":"LibOptimization/Util/clsUtil.vb"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"d246d5ee0c9364075c78676d96a2e80983de78af37c37707dc9d8e42c02132eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnitTestLinearAlgebra.Vec_Product_VectorMatrix: MethodTooLong \u2014 Vec_Product_VectorMatrix runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a056f717d89c8a6e6b5249390d64dfff30dcef41298a599d20f267e976ccd81"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Module1.Main: MethodTooLong \u2014 Main runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"SampleVB/Module1.vb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae2d85fd55af64a121ff0506e5e2a316472691658015886f0400e70bcad24df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnitTestLinearAlgebra.Mat_Product_MatrixVector: MethodTooLong \u2014 Mat_Product_MatrixVector runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f362e4df71e30429f7f0e9a37d84f3f2475a79d25329739317e7c55449dc01db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TestLibOptimizationDotNet30.Mat_Product_MatrixVectorNET30: MethodTooLong \u2014 Mat_Product_MatrixVectorNET30 runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1eb61de839409be5cbdf720c716e120615ee3ae33f3c4a3507e8051b2612c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: clsOptDE.DoIteration: MethodTooLong \u2014 DoIteration runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"LibOptimization/Optimization/clsOptDE.vb"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f47e684b93896d84954c15a0d2e19d2e40a2adda4870c219eddb97e7cab3612"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UnitTestLinearAlgebra: TooManyMethods \u2014 1076 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c197ab59308191028a2f6b8c28b0975ef22fb19f0d545094b7979d579429fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DenseVector: TooManyMethods \u2014 308 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/DenseVector.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce781e2e6aa2ead7b966304c3057837204da62cb6bee97a14b6c251b64f787ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Util/clsUtil.vb: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 29 over it, 1.06\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":"LibOptimization/Util/clsUtil.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be1f2488d5eca267320653a7971018c77a3fe6bb8b0f3c5e623a89db96aa944"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: clsOptDEJADE.DoIteration: MethodTooLong \u2014 DoIteration 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":"LibOptimization/Optimization/clsOptDEJADE.vb"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"092b1a54b494a734914adf0591a881af3e3a71219a94352570d907a02128ad30"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: clsUtil: TooManyMethods \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Util/clsUtil.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb8e0617c2680e218310f297231a93a0dca71659c901366fa00a3302b4100ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnitTestLinearAlgebra.Mat_Inverse: MethodTooLong \u2014 Mat_Inverse runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f71706e6ca67d030169f8cf4997cc43b09fa9cebbb43dbfc524b5ab5cf7e5bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (18 members, 50\u002B identical tokens): LibOptimization/Optimization/Template/clsOptTemplate.vb:107-135 | LibOptimization/Optimization/clsOptDE.vb:208-342 | LibOptimization/Optimization/clsOptDEJADE.vb:173-320 | LibOptimization/Optimization/clsOptFA.vb:149-193 | LibOptimization/Optimization/clsOptHillClimbing.vb:103-129 | LibOptimization/Optimization/clsOptNelderMead.vb:128-188 | LibOptimization/Optimization/clsOptNelderMeadANMS.vb:132-239 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:127-179 | LibOptimization/Optimization/clsOptPSOAIW.vb:142-202 | LibOptimization/Optimization/clsOptPSOCPSO.vb:170-269 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:153-222 | LibOptimization/Optimization/clsOptPSOLDIW.vb:151-205 | LibOptimization/Optimization/clsOptPatternSearch.vb:97-136 | LibOptimization/Optimization/clsOptRealGABLX.vb:128-187 | LibOptimization/Optimization/clsOptRealGAPCX.vb:132-187 | LibOptimization/Optimization/clsOptRealGAREX.vb:140-179 | LibOptimization/Optimization/clsOptRealGASPX.vb:136-176 | LibOptimization/Optimization/clsOptSimulatedAnnealing.vb:151-202 \u2014 These 18 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 18 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 18 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/Template/clsOptTemplate.vb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d1050d82e186243480b59b6ba3724aa1786eb435e1752caa3550a36c2d8312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 3): LibOptimization/Optimization/clsOptRealGABLX.vb:130-155 | LibOptimization/Optimization/clsOptRealGAPCX.vb:134-161 | LibOptimization/Optimization/clsOptRealGASPX.vb:138-163 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptRealGABLX.vb\u0060 and \u0060LibOptimization/Optimization/clsOptRealGAPCX.vb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note 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":"LibOptimization/Optimization/clsOptRealGABLX.vb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac1266725ea5ea7ae0dc46b261b127a370d91c2a5d5938ee25902f41643a7c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): SampleCSharp/Program.cs:154-180 | SampleCSharp/Program.cs:187-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060SampleCSharp/Program.cs:154\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"SampleCSharp/Program.cs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad382ea397ea2a4d87c2c00ad63076abafd40fb23f84e468c9ec913b7253ec6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): SampleVB/Module1.vb:42-59 | SampleVB/Module1.vb:63-80 \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":"SampleVB/Module1.vb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee8846d7758be547fb27129140b1de0a85068d18cf24cd9e1bd1a494aa7b185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): LibOptimization/Optimization/clsOptDE.vb:219-235 | LibOptimization/Optimization/clsOptDEJADE.vb:183-202 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060LibOptimization/Optimization/clsOptDE.vb:218\u0060 calls \u0060clsPoint\u0060 and \u0060LibOptimization/Optimization/clsOptDEJADE.vb:182\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptDE.vb"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc5497267020b666ce0311f059a6ed877c26c35ee557a4a415fa8f2d5a35278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): LibOptimization/Optimization/clsOptRealGABLX.vb:128-143 | LibOptimization/Optimization/clsOptRealGAPCX.vb:132-147 | LibOptimization/Optimization/clsOptRealGAREX.vb:140-155 | LibOptimization/Optimization/clsOptRealGASPX.vb:136-151 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptRealGABLX.vb\u0060 and \u0060LibOptimization/Optimization/clsOptRealGAPCX.vb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptRealGABLX.vb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bf22723e19a07a8bad66f1f487af66c0b19e879bf040b34b836cca7effad53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): LibOptimization/Optimization/clsOptPSOAIW.vb:150-168 | LibOptimization/Optimization/clsOptPSOLDIW.vb:159-177 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptPSOAIW.vb\u0060 and \u0060LibOptimization/Optimization/clsOptPSOLDIW.vb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSOAIW.vb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c294b9d6ffcdb320c6e05d0de09ec969a1f9dd80e97cf88f8fe0362549c1b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): LibOptimization/Optimization/clsOptPSOAIW.vb:142-159 | LibOptimization/Optimization/clsOptPSOCPSO.vb:170-187 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:153-170 | LibOptimization/Optimization/clsOptPSOLDIW.vb:151-168 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptPSOAIW.vb\u0060 and \u0060LibOptimization/Optimization/clsOptPSOCPSO.vb\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060LibOptimization/Optimization/clsOptPSOCPSO.vb:188\u0060 calls \u0060IsCriterion\u0060, \u0060m_swarm\u0060 and \u0060LibOptimization/Optimization/clsOptPSOAIW.vb:161\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSOAIW.vb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3835e0eb7799fee5353875307e1578a9bfdfcc9f92bc332e9d9dd12316f45320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): LibOptimization/Optimization/clsOptNelderMead.vb:128-145 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:127-144 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptNelderMead.vb\u0060 and \u0060LibOptimization/Optimization/clsOptNelderMeadWiki.vb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptNelderMead.vb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"60387f10e7e89b96e7ed0f0ca884940531cd0820211e191b5e41ebe2708ac727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 8): LibOptimization/Optimization/Template/clsOptTemplate.vb:107-119 | LibOptimization/Optimization/clsOptFA.vb:149-161 | LibOptimization/Optimization/clsOptNelderMead.vb:128-140 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:127-139 | LibOptimization/Optimization/clsOptRealGABLX.vb:128-140 | LibOptimization/Optimization/clsOptRealGAPCX.vb:132-144 | LibOptimization/Optimization/clsOptRealGAREX.vb:140-152 | LibOptimization/Optimization/clsOptRealGASPX.vb:136-148 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptNelderMead.vb\u0060 and \u0060LibOptimization/Optimization/clsOptNelderMeadWiki.vb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/Template/clsOptTemplate.vb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"47788f4b8a0f530beda7c8445aff73d45b393aee3355ca2b1f7c8a3639178e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): LibOptimization/Optimization/clsOptDEJADE.vb:173-189 | LibOptimization/Optimization/clsOptHillClimbing.vb:103-118 | LibOptimization/Optimization/clsOptPatternSearch.vb:97-112 | LibOptimization/Optimization/clsOptSimulatedAnnealing.vb:151-166 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. 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":"LibOptimization/Optimization/clsOptDEJADE.vb"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e611a654024caa4bc44191fec432e4a9779781e6fbedc900df646f4d73b0d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): LibOptimization/Optimization/clsOptPSOAIW.vb:163-176 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:187-200 | LibOptimization/Optimization/clsOptPSOLDIW.vb:171-185 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptPSOAIW.vb\u0060 and \u0060LibOptimization/Optimization/clsOptPSOChaoticIW.vb\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSOAIW.vb"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a29a755494e27f734f20b84aff3a04bf89dbd525b270be552d69f2f34546eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): LibOptimization/Optimization/clsOptNelderMead.vb:138-154 | LibOptimization/Optimization/clsOptNelderMeadANMS.vb:144-157 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:137-153 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptNelderMead.vb\u0060 and \u0060LibOptimization/Optimization/clsOptNelderMeadWiki.vb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note 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":"LibOptimization/Optimization/clsOptNelderMead.vb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef87ec5967c0f0dbfd5a379436ff6ff41a3b1485376dac841ccf86c4f8413469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 16): LibOptimization/Optimization/Template/clsOptTemplate.vb:107-119 | LibOptimization/Optimization/clsOptDEJADE.vb:173-185 | LibOptimization/Optimization/clsOptFA.vb:149-161 | LibOptimization/Optimization/clsOptHillClimbing.vb:103-115 | LibOptimization/Optimization/clsOptNelderMead.vb:128-140 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:127-139 | LibOptimization/Optimization/clsOptPSOAIW.vb:142-154 | LibOptimization/Optimization/clsOptPSOCPSO.vb:170-182 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:153-165 | LibOptimization/Optimization/clsOptPSOLDIW.vb:151-163 | LibOptimization/Optimization/clsOptPatternSearch.vb:97-109 | LibOptimization/Optimization/clsOptRealGABLX.vb:128-140 | LibOptimization/Optimization/clsOptRealGAPCX.vb:132-144 | LibOptimization/Optimization/clsOptRealGAREX.vb:140-152 | LibOptimization/Optimization/clsOptRealGASPX.vb:136-148 | LibOptimization/Optimization/clsOptSimulatedAnnealing.vb:151-163 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptNelderMead.vb\u0060 and \u0060LibOptimization/Optimization/clsOptNelderMeadWiki.vb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/Template/clsOptTemplate.vb"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cd27d5d432e6686f8389fde119d96c6b702b03ace13bc15c37163a011d83ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): LibOptimization/Optimization/clsOptNelderMead.vb:225-237 | LibOptimization/Optimization/clsOptNelderMeadWiki.vb:216-228 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptNelderMead.vb\u0060 and \u0060LibOptimization/Optimization/clsOptNelderMeadWiki.vb\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptNelderMead.vb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a9bd9ab79410db1f6054a0843481f821db3f888923df67d43c3301d77ed955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): LibOptimization/Optimization/clsOptNewtonMethod.vb:76-85 | LibOptimization/Optimization/clsOptSteepestDescent.vb:76-87 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptNewtonMethod.vb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a0a32788183e5a37aaea91ff3f5ef10bea1e63613b62590dbe4bef76f0f66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): LibOptimization/Optimization/clsOptNewtonMethod.vb:104-114 | LibOptimization/Optimization/clsOptSteepestDescent.vb:105-115 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptNewtonMethod.vb"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0ffc512e555744bb67d33eb3237d47189ec567cfa36c51d66dc54b799efe36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): LibOptimization/Optimization/clsOptRealGAREX.vb:190-200 | LibOptimization/Optimization/clsOptRealGASPX.vb:187-197 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptRealGAREX.vb\u0060 and \u0060LibOptimization/Optimization/clsOptRealGASPX.vb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptRealGAREX.vb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2ede09edfb1fdde4200caaedc9f58232e2149f4c74975766e2344f430e48ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): LibOptimization/MathTool/MathUtil.vb:63-71 | LibOptimization/MathTool/MathUtil.vb:114-122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060LibOptimization/MathTool/MathUtil.vb:72\u0060 calls \u0060matTemp\u0060 and \u0060LibOptimization/MathTool/MathUtil.vb:123\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/MathUtil.vb"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa61bd9071f9672ff7e30e6bbcfe817d6f7f416ebe0e5d1cca2223967db0ee1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): LibOptimization/Optimization/clsOptNelderMead.vb:252-261 | LibOptimization/Optimization/clsOptNelderMead.vb:300-309 \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":"LibOptimization/Optimization/clsOptNelderMead.vb"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c17608c4cebce86903dd7868b9732f486e34bf4657d81a9dcf031de60cade4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): LibOptimization/Optimization/clsOptDE.vb:256-263 | LibOptimization/Optimization/clsOptDE.vb:296-303 | LibOptimization/Optimization/clsOptDE.vb:306-313 \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":"LibOptimization/Optimization/clsOptDE.vb"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e8a54fa641c76af631323073475b6493782e018acd6b233f26b06030cf2bf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): LibOptimization/MathTool/RNG/RandomUtil.vb:21-26 | LibOptimization/MathTool/RNG/RandomUtil.vb:42-47 \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":"LibOptimization/MathTool/RNG/RandomUtil.vb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b462dec3cc3b746fb26178b85cb4eb25a5d7d8b6e780c1dd4a475c8a4cbca62a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): LibOptimization/Optimization/clsOptDE.vb:266-273 | LibOptimization/Optimization/clsOptDE.vb:316-323 \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":"LibOptimization/Optimization/clsOptDE.vb"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb1bf32e5e28b87260d02f37381e643de8ec25694972e667581db93515b351f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): LibOptimization/Optimization/clsOptPSOAIW.vb:164-170 | LibOptimization/Optimization/clsOptPSOCPSO.vb:198-204 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:188-194 | LibOptimization/Optimization/clsOptPSOLDIW.vb:173-179 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptPSOAIW.vb\u0060 and \u0060LibOptimization/Optimization/clsOptPSOCPSO.vb\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSOAIW.vb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7c16700d3562cab90da21484afb262e8370fbed624443d277dd3df03cae424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): LibOptimization/Optimization/clsOptDE.vb:279-283 | LibOptimization/Optimization/clsOptDE.vb:289-293 \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":"LibOptimization/Optimization/clsOptDE.vb"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea97361708d7d4e5a0f63217df1d887e170f4073a8b54130bb49c34810642667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): LibOptimization/BenchmarkFunctions/clsBenchSphere.vb:26-71 | LibOptimization/BenchmarkFunctions/clsBenchSphereNumericDiff.vb:26-48 \u2014 before extracting anything, compare \u0060LibOptimization/BenchmarkFunctions/clsBenchSphere.vb\u0060 and \u0060LibOptimization/BenchmarkFunctions/clsBenchSphereNumericDiff.vb\u0060 as WHOLE FILES: 97% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/BenchmarkFunctions/clsBenchSphere.vb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7a1df7677f8f845a9cd6e5313e1257f32e4c5188314bf10aa7c5a9a7797bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): LibOptimization/Optimization/clsOptPSO.vb:171-274 | LibOptimization/Optimization/clsOptRealGAUNDX.vb:141-195 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSO.vb"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4ed4551dcb90ac7e54a132af4496cb50c611f0b65b7114a999e05ccfac1e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): LibOptimization/Optimization/clsOptPSO.vb:307-312 | LibOptimization/Optimization/clsOptPSOAIW.vb:235-240 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:255-260 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptPSO.vb\u0060 and \u0060LibOptimization/Optimization/clsOptPSOAIW.vb\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSO.vb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b7f652ae2f112be1d7c0bf4d740f4e67986167bd57a44184e32a65a22bbe82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): LibOptimization/Optimization/clsOptPSO.vb:307-312 | LibOptimization/Optimization/clsOptPSOAIW.vb:235-240 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:255-260 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptPSO.vb\u0060 and \u0060LibOptimization/Optimization/clsOptPSOAIW.vb\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSO.vb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33711479dfd47e549d89c31e92513645621896bf7164e57cc2304be0138e60d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): LibOptimization/Optimization/clsOptPSO.vb:307-312 | LibOptimization/Optimization/clsOptPSOAIW.vb:235-240 | LibOptimization/Optimization/clsOptPSOChaoticIW.vb:255-260 \u2014 before extracting anything, compare \u0060LibOptimization/Optimization/clsOptPSO.vb\u0060 and \u0060LibOptimization/Optimization/clsOptPSOAIW.vb\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSO.vb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0c9af7783bdf58faea26ef15e82cd6b650d06df338c256617f6293ab99f80f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (137 corresponding lines): TestLibOptimization/UnitTestLinearAlgebra.vb:500-664 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:118-254 \u2014 These two members are one piece of code written twice and then edited apart: 137 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e6de22147c0fa1c0d2caa516e08f5492f3eff74a7ef8188568b896874e6908"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): TestLibOptimization/UnitTestLibOptimization.vb:22-72 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:14-71 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLibOptimization.vb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc2609f1e1e787070e089ebc3ed18b2b17d6bcd75af74472ff86ca6e19b8164"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): TestLibOptimization/UnitTestLinearAlgebra.vb:759-785 | TestLibOptimization/UnitTestLinearAlgebra.vb:792-818 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"84972b9dc7778b812cd1d5b6a9d5684a7578c5d9de3001d01be16179fe1f0214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): TestLibOptimization/UnitTestLinearAlgebra.vb:124-148 | TestLibOptimization/UnitTestLinearAlgebra.vb:244-268 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad17a451be4c057118510f308e34230f1969b934e322ec19cd9f54b2716a0ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): TestLibOptimization/UnitTestLinearAlgebra.vb:155-166 | TestLibOptimization/UnitTestLinearAlgebra.vb:173-184 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c9164b836d7fcc08537dea07aaf196e6fd5608b69f90fcdd7d6a581f82b5c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201355 lines \u00D7 2): TestLibOptimization/UnitTestLinearAlgebra.vb:278-332 | TestLibOptimization/UnitTestLinearAlgebra.vb:500-533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060TestLibOptimization/UnitTestLinearAlgebra.vb:500\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060TestLibOptimization/UnitTestLinearAlgebra.vb:533\u0060 calls \u0060DenseMatrix\u0060, \u0060Double\u0060 and \u0060TestLibOptimization/UnitTestLinearAlgebra.vb:332\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41f54c89be291248abc90bb253b343765f9fd9c509e7050ee9b8ae5a41ad6df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48\u201351 lines \u00D7 2): TestLibOptimization/UnitTestLibOptimization.vb:24-71 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:19-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLibOptimization.vb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2852656ff6a7b77b7e2a3ce28d3883c0eeee4da00b32d74a67ee3068c8da6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): TestLibOptimization/UnitTestLinearAlgebra.vb:338-362 | TestLibOptimization/UnitTestLinearAlgebra.vb:366-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060TestLibOptimization/UnitTestLinearAlgebra.vb:334\u0060 calls \u0060PrintValue\u0060 and \u0060TestLibOptimization/UnitTestLinearAlgebra.vb:362\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc24d2a86005b85cf397c90a31bbb6141589f1302bd56684f9b9f9ecb38b870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:178-202 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:206-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:174\u0060 calls \u0060PrintValue\u0060 and \u0060TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:202\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"207c8aba251d28938a403318dfb66ad4e03f9360218b5d68ca955d73e9662f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201325 lines \u00D7 2): TestLibOptimization/UnitTestLinearAlgebra.vb:1138-1157 | TestLibOptimization/UnitTestLinearAlgebra.vb:1162-1186 \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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afbfa18b3a9ac756865a8517438370047de7249037689ac8f11c2c5f99fa570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): TestCode/Module1.vb:196-219 | TestCode/Module1.vb:225-248 \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":"TestCode/Module1.vb"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19a98d1bffcf14c21d693e54fe8ea9ae78875028f92ae2a9d20016a04bd985b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): TestLibOptimization/UnitTestLinearAlgebra.vb:556-578 | TestLibOptimization/UnitTestLinearAlgebra.vb:587-609 | TestLibOptimization/UnitTestLinearAlgebra.vb:617-639 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060TestLibOptimization/UnitTestLinearAlgebra.vb:556\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"d522b28b7a0e2b209d700f8ffa873e76b01d2fae9ef7e167970d9e4fd24c4b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201321 lines \u00D7 2): TestLibOptimization/UnitTestLibOptimization.vb:180-200 | TestLibOptimization/UnitTestLibOptimization.vb:202-216 \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":"TestLibOptimization/UnitTestLibOptimization.vb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f7b73fc14f5e2af9d3aa4f1d842e78a5e837521332bc65b238a0d2f5079708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): TestLibOptimization/UnitTestLibOptimization.vb:260-279 | TestLibOptimization/UnitTestLibOptimization.vb:284-303 \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":"TestLibOptimization/UnitTestLibOptimization.vb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccfc4fe927eb7340db619384d196795e4d353d062a322b199d97df2901ad59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): TestLibOptimization/UnitTestLinearAlgebra.vb:553-572 | TestLibOptimization/UnitTestLinearAlgebra.vb:584-603 | TestLibOptimization/UnitTestLinearAlgebra.vb:614-633 | TestLibOptimization/UnitTestLinearAlgebra.vb:643-662 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"167376545ad9bbe8d06ed0a20fde4075abd370b7c58b16fd9a5f08d06ae6152e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): TestLibOptimization/UnitTestLinearAlgebra.vb:335-354 | TestLibOptimization/UnitTestLinearAlgebra.vb:363-382 | TestLibOptimization/UnitTestLinearAlgebra.vb:393-412 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060TestLibOptimization/UnitTestLinearAlgebra.vb:334\u0060 calls \u0060PrintValue\u0060 and \u0060TestLibOptimization/UnitTestLinearAlgebra.vb:362\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6493469ce406416dbf64938f48f17ee94138992931f0506a8b643dd66334c57e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:175-194 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:203-222 | TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:233-252 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:174\u0060 calls \u0060PrintValue\u0060 and \u0060TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb:202\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4f6bff00fe9f885bed7d7466562111f57549a303ede1b5b5a16b262e0fd689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): TestLibOptimization/UnitTestLinearAlgebra.vb:35-52 | TestLibOptimization/UnitTestLinearAlgebra.vb:57-74 \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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfbafaf4acdbee98971ed0af99440eb686bab944726c7a092ddb814061a7b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): TestLibOptimization/UnitTestLinearAlgebra.vb:671-688 | TestLibOptimization/UnitTestLinearAlgebra.vb:735-752 \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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"17975b3b908691ca0200006d0722bdba801670d26987d6e9254e34dba0f07c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): TestLibOptimization/UnitTestLinearAlgebra.vb:194-211 | TestLibOptimization/UnitTestLinearAlgebra.vb:212-228 \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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a236e5e147a8d2b41bd1a7c5bc4779fbef5397f84d8f09fa82775cbd1d41932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201317 lines \u00D7 3): TestLibOptimization/UnitTestLinearAlgebra.vb:428-444 | TestLibOptimization/UnitTestLinearAlgebra.vb:451-467 | TestLibOptimization/UnitTestLinearAlgebra.vb:469-478 \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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b465c1b4a185c334ade79c10c57261cc9c0de7d3955afb6dc10db05a9641bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): TestLibOptimization/UnitTestLinearAlgebra.vb:974-988 | TestLibOptimization/UnitTestLinearAlgebra.vb:1000-1016 \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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dbfeef42880cea9ab1ae1024220826341b88c296db8c83fb44d7a8b659aa60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): TestLibOptimization/UnitTestLinearAlgebra.vb:1099-1112 | TestLibOptimization/UnitTestLinearAlgebra.vb:1114-1128 \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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"93999c20f20fa73c3d5a826717b638c7eb90c18db73b9a8d033e22955cf0a949"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): TestLibOptimization/UnitTestLinearAlgebra.vb:761-770 | TestLibOptimization/UnitTestLinearAlgebra.vb:794-803 \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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21f01a57403be96016c26e1baa0e3f484859c3cd67560ca21b7f4f0c8c2d5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): TestLibOptimization/UnitTestLinearAlgebra.vb:773-785 | TestLibOptimization/UnitTestLinearAlgebra.vb:806-818 \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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a6003ba7140ed81b3b66469a67dafa1590162e53223b324a48e469b30cb3dc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DenseVector (LCOM4 14): DenseVector\u0027s methods fall into 14 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 14 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":"LibOptimization/MathTool/DenseVector.vb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a478fbca39d6397b2c5c3c6992d44978200cf8cabdc670c7f1db743351b026"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DenseMatrix (LCOM4 6): DenseMatrix\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c64c348988a37fbdbd4627363b0d1be2c2ccf551689bcdcf7b4d97c72dd341"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: LibOptimization/Optimization/clsOptES.vb: LibOptimization/Optimization/clsOptES.vb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in clsOptES.Init at line 82. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2024-11-14..2025-02-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272024-11-14 16:50:46 \u002B09:00\u0027 --until=\u00272025-02-12 16:50:46 \u002B09:00\u0027 --full-history --no-merges -- LibOptimization/Optimization/clsOptES.vb\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptES.vb"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b90901dd4bef22b8ce65d023dcf9fe5626242b7b97fac752bd68cf962dbf7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: LibOptimization/Optimization/clsOptCS.vb: LibOptimization/Optimization/clsOptCS.vb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in clsOptCS.DoIteration at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2024-11-14..2025-02-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272024-11-14 16:50:46 \u002B09:00\u0027 --until=\u00272025-02-12 16:50:46 \u002B09:00\u0027 --full-history --no-merges -- LibOptimization/Optimization/clsOptCS.vb\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptCS.vb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec626327d285f90f22546e8c2b1c9a6e012efc86b304f1d02e9549f7d2f911a7"}},{"ruleId":"D17","level":"warning","message":{"text":"ObsoleteWithCallers: \u003CObsolete\u003E EigenJacobi"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ee2ad06c84ec858a7216567d985f611a1042f0d0cf69ca26f2bc247c9f8c61"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 3 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"SampleCSharp/SimulatedAnnealingSample.cs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8f4ffc64ffe2d50b85f8d3061c442a5997274ac5cfcf4a85c6f239b8895cb8"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb11a0be8f7eab5f98f72c168f4f79e79c0c933f9c243b1282b80e3d6fecb11"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3491cba3e1a69a06470ebd5004c902dcbe67a7ca771502851ec92e5f3a33912a"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e77f6b0293241a2131d4321670bac5f05a30114a7793dc6b24f0c3ff1ae3f7"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"032feeaf2b3c78ca84df9e07ad93e209007ce73b2eaa37679c73ed344c927cdd"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e05ddf7ccb0b85aa1327be749332080936704d453da03d222eab31a5fb2c69"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7069a88d1ad0bf97b9cf2980de70a1307a3ba9cd132784aebb3a8804679914"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13e721b090acf6646ba066f2331ca661e0e78f7530db15f14d60bec905386c3"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbce523206b25b9b1f7d10dae0ab4f8d0af9bf216fb3a49373defee9afa5e40"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d87b9534c1b242931b0884c4762340f089b621b2f4181380376954b5589c708"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26fb606d1b41a97250dea28816ffae7844e497adc408da5ee7380162b3d375a"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aac1127bf0345b7b5b919cfba0b76a20ac6ad16d3c671f561aec1a8663b62b"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f30aea64beae6b176659ec98d8e1462d7310e56db4fd34f5e2a1baf079a384f"}},{"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":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d47900a26b85f442e991ec7993defa06b97b957c5ba8c9f3582dbfdfe26803c"}},{"ruleId":"D18","level":"warning","message":{"text":"Build failed: The target solution did not build cleanly (errors: 66), which caps Solution Shape at 3/10 \u2014 the most basic shape signal is that it compiles. First errors: BC30002: Type \u0027TestClass\u0027 is not defined.; BC30002: Type \u0027TestMethod\u0027 is not defined.; BC30002: Type \u0027Ignore\u0027 is not defined.; BC30002: Type \u0027TestInitialize\u0027 is not defined.."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"24ff41d1fc14d3a19b969001a7e9697d13d34fc0453d84646f56c980eff97f2b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find current best\u0022 repeats the code it sits on: 3 of its 3 words (find, current, best) are already in \u0060Dim candidateBest = newNests(clsUtil.FindCurrentBestIndex(newNests))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptCS.vb"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae13be48cfd44b851d45d2f6edb8c44b7b7e4842252942682c0c3747b0e6649"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find current best\u0022 repeats the code it sits on: 3 of its 3 words (find, current, best) are already in \u0060candidateBest = newNests(clsUtil.FindCurrentBestIndex(newNests))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptCS.vb"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec63f66ccaf1c6e29740c1c12824bb13ca336672e040c1aa32c2516729f6fcba"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Limit solution space\u0022 repeats the code it sits on: 3 of its 3 words (limit, solution, space) are already in \u0060clsUtil.LimitSolutionSpace(child, Me.LowerBounds, Me.UpperBounds)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptDE.vb"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d81bd5d9aba1c468560f5d42265cfbf9bb70c354051572f5095bf825f6e3bf"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Limit solution space\u0022 repeats the code it sits on: 3 of its 3 words (limit, solution, space) are already in \u0060clsUtil.LimitSolutionSpace(child, Me.LowerBounds, Me.UpperBounds)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptDEJADE.vb"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6131d69465e6f4e0d84e2a1cbdfa737e72f9bf5a4286255f6d8992912b4bd637"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022limit solution space\u0022 repeats the code it sits on: 3 of its 3 words (limit, solution, space) are already in \u0060clsUtil.LimitSolutionSpace(nextPoint, LowerBounds, UpperBounds)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptHillClimbing.vb"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a97aeab1bc77e5ca57847b3c802c53753327149dac3ea9fe5848e8a61befd8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022MakeExploratoryMoves\u0022 repeats the code it sits on: 3 of its 3 words (make, exploratory, moves) are already in \u0060Dim exp As clsPoint = Me.MakeExploratoryMoves(Me.m_base, Me.m_stepLength)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPatternSearch.vb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7849669c92eb4394cf789d264a7bafecb3cca9887fd4b1dd84bc28c88c2414d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022MakePatternMove and MakeExploratoryMoves\u0022 repeats the code it sits on: 4 of its 5 words (make, pattern, move, moves) are already in \u0060Dim temp As clsPoint = Me.MakePatternMove(previousBasePoint, Me.m_base)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPatternSearch.vb"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a10099c1626ad4f68835ccaea2852669202480998a98c8c829b8c7c26b22c5b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022rand * (xi-xg)\u0022 repeats the code it sits on: 3 of its 3 words (rand, xi, xg) are already in \u0060childV \u002B= randVal * (xi.Value - xg)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptRealGAREX.vb"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7a36d9efab6706f1883d4940a125ee68acd7d82809f4e5dbb46855976dbc09"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022limit solution space\u0022 repeats the code it sits on: 3 of its 3 words (limit, solution, space) are already in \u0060clsUtil.LimitSolutionSpace(tempChild, Me.LowerBounds, Me.UpperBounds)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptRealGASPX.vb"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e8f6acdaf99a56d98217be2584ce3d6269c64bafcb273b0b2b70800d692ebc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022objective function for LeastSquaresMethod\u0022 repeats the code it sits on: 4 of its 4 words (objective, function, squares, method) are already in \u0060Dim objectiveFunction = New LeastSquaresMethod()\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"SampleVB/Module1.vb"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e01316f96807d5f617abb033d7df3d4a44ec58fee593c86f98c71b575142697"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022check iteration count\u0022 repeats the code it sits on: 3 of its 3 words (check, iteration, count) are already in \u0060If opt.IterationCount \u003C\u003E 0 Then\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLibOptimization.vb"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"63674141b30a7c5d2b1990f450eee9d536c9d9c67b0136c6a9e14d5a5724e37a"}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64868d4f0f37683a537be0ccd1463e79f351f891a9340113ec44900857b480f0"},"properties":{"dependency":{"package":"Microsoft.NETCore.App","version":"2.1.0","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"LibOptimization/LibOptimization.vbproj"}}}},{"ruleId":"D34","level":"note","message":{"text":"Dormant codebase: 49 of 49 significant files have no living knowledge \u2014 the codebase as a whole is dormant, not 49 separate risks. Counted over 49 of the 84 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4c69f1e54b7dd6fe9029dd02df6ba8f8145b789f2f18dbdaa086c40ded49dba6"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/DenseMatrix.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d576f40bd14bc15453064fd36320fca2a8a7fe46dee8b51da7fd7d7ea53d8d"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLinearAlgebra.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"127782f5c79de6818ba4b8ff38b7123aa42108e3867670db751d36472eab2f0b"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Util/clsUtil.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec7c0a7791becda164619d995797bfd2af7f851ba84b230e039dbab1deb5f5e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/DenseVector.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a9d8fde39542c35cdc9c2c22a45f31106006d51ab6cc5166f7d78aeb0e0c4f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestLibOptimization.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2817049d9e3fa0fc0dd2fc59b48146aa2e877fd2ecd81d631d3186fb4b93a91"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/MathUtil.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0670a6571d5e71a34ac2d5965a2b12f3f0ccbe13fae328ff3f0f0938da06555c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptDE.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97dd7a9b204352c63a2a27d93f2365a28fa4092098d732a8284d36a62f4a65ed"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptDEJADE.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da874cece2f5f6c8f721aba8dc1c666057f4ba15dfc85d9d17c7d1bc49e6334a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSO.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea10ecd11861b0137306102db4e6ccc947233a858f451f964b5030ff9668fba"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptRealGAUNDX.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d7d881142c00be71c566ad7e39b5bfcb99b3fd867556197dfdab4b0593a5cd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSOCPSO.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f6f18761e8ba63d9ab8dcb00f7b0b463689566af4437695f7093552f3fdebf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptNelderMead.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c54dc07f607a44adae8647a48fa9a064a31703ba90ab700007f39ce7c386e8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptRealGAPCX.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"676d1a65c6c5205939a970e21c856c1abcc81cd954b420c05967f4d3c9449d3a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptNelderMeadANMS.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0f75d1fa2790ad5b0505b69332f88a55d1beb6478e43a6daa0bda0a7d85555"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSOChaoticIW.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5090e3570897f926f9fdd794e5a64d94268c58e35e3fe98ec38e367949173b90"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptRealGAREX.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae62210500189a6d4acba02c16015e8fdcf0c8a6d0b740988c19ca79620238d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptNelderMeadWiki.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"893408c3e6ad19a22e7df72f2d9ebcd666ce858ee6e7c91609455439c84c8507"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptRealGASPX.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bcf2821a5fb6790b142f23e73c9fc03bac9eb0e1169dd46f92e0eaa6090e43"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptCS.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62dbbda14cb4132c0058d37c880cc6127484659bbb3f62be19907dfc429352e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSOLDIW.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a3a3e7cb52b787a6cb7f1203e5bf8a65244e9baf8963701929e79829bf0ce8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPSOAIW.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c749c8f2afcd3fc33df2ed2d876c7016a6be27419f99ae222b2907743683e9ae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptES.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1db68e979fccc200c7dae7b4945a1a766917acedf87cc1a036934d1a98368de"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestCode/Module1.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90f83ae5c8d98fac138b5f55c3a91cfe28963f15a07ad3ba04d5b650b9d820d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptFA.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8559413000836b5172aed0309d9885374cc43f75be9cbd0734cc75daedee78b2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimizationDotNet3.0/TestLibOptimizationDotNet3.0.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7e3aab19267e26bda7a7ef79b04964bbc9a78c4728e856da7a509b186a1cf6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptRealGABLX.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee81873b4ad53f654a54533d7ddc713cf3da9e0dcda883cfb37231c94241b613"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptPatternSearch.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fabddb2c667e52408002c5b94318aabfad4525013eeb4df38206bf60fafd9d2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptSimulatedAnnealing.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2210bbd1191a044088a7dd40eef4c77de8244507b8e049cc71b6662747a6f14"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"SampleCSharp/Program.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbccde358c6d83db7b23be7e7ac8d19ceb68d885762f5873b2106a3930aff97"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"SampleVB/Module1.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fb3792ab990a1b91b311736055a3453991e7463ca479c568975c3806817e1c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/RNG/RandomXorshift.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca42c95146ccf87d2ebd78b4ceac9096aa401790a4a6b3c40b3f05612c1264d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimization/UnitTestMathUtil.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f187926c06cddba052a7b96540ae262c11c3b00e386ee5962937d4e600ed7232"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptHillClimbing.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de90455de70c7578e632319964690dae196126752c1ee58c34466f8234bd4614"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/Template/clsOptTemplate.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bacf79c354c8ee988866df2a14fc6ee4ef1cf9bd0bb05775c78760a7c950eaa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptSteepestDescent.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c9e839adbe11797b6e3fe6f679e8e43d1b71372451a2f6a91a217c0d1f7bfe"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/Dto/clsFireFly.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"490316c893a21a2e4bc657f0d26902de98e050e1125629bdfa65938195319538"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/Dto/clsPoint.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47304aa995422b89c32a89d6b75e5e57e279e8124f61fee8f46c5cb515941617"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/clsOptNewtonMethod.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ee7993ce8b9eb622d23333e72fe52f1e5e8079b0adf44a43e098f57d01fb86"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/abstract/absOptimization.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9382e8ed9ffa3136f806944aaf35880e93d43b25a50ea53e9c9871f71fac3dac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"SampleCSharp/SimulatedAnnealingSample.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5c9a7eea85c46935d7cdcaa6782970b8fe0d08afd78a71a1b877878069fe77"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/BenchmarkFunctions/clsBenchRosenblock.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94d2be34a10e6837d253fefba336bd69534bc0d2296624acf8e1322410c5c2d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Optimization/Dto/clsParticle.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be83b4bc43ff45538458b53ddd67e85e6c2124d0ae434e3dac4066f7d42651f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/Eigen.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4a3f1e4476941cd137d381f70f1cc9abf66f5f1125b8e03d3fbe2077c1c9df"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Util/clsError.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"755266545a82351cd30f35121d548df790922e5dee77ef36de86dd9109e0d136"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/LU.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1ce8a1f96162044c815544b4644ec173c1965a7e8b04e69edf1263045ef7d0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/MathTool/RNG/RandomUtil.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ae64bc7143e82a2f8e99eef90da6e1397a3170abfeb23981b8907a7952dd76"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/BenchmarkFunctions/clsBenchDeJongFunction5.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0044937130a74dfc996db0beaeec324afd7bf5bc96e287d5d5da911ee6557ee1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/Util/clsEval.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd556d53acb90c2918f3f3390406612005455d7c0ee84fcbb9fab3d41d4fb422"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"LibOptimization/BenchmarkFunctions/clsBenchDeJongFunction1.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"478dced2c9653f4355ee5d9800c9148b7afd6974413d76128abe99b4a82017e2"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: .NET net5.0: TestLibOptimizationDotNetCore/TestLibOptimizationDotNetCore.vbproj declares .NET net5.0 as this project\u0027s target framework, and .NET 5, support ended 2022-05-10. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-05-10 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimizationDotNetCore/TestLibOptimizationDotNetCore.vbproj"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d77f7bf37e9005a5117f87a26e30af81791a6fbb753870e88ec73a6eccecd9e"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets \u2014 CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060TestLibOptimizationDotNetCore/TestLibOptimizationDotNetCore.vbproj\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"TestLibOptimizationDotNetCore/TestLibOptimizationDotNetCore.vbproj"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb371d941ffa9badaf1ce78ada42eb6b4b4b2ba027f74c36ab722dedd3877977"}},{"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"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":1,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}