{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"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":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.load_trees (cyclomatic 138): Form_Main.load_trees has cyclomatic complexity 138 (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: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"37341d075561e32d82e32e9ef4d0de6ef6a96daef4399ebef5e96ea3db8c1645"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.load_bayes_trees (cyclomatic 116): Form_Main.load_bayes_trees has cyclomatic complexity 116 (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: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":5323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9db82b4a0c4d71c39481be03e2d8975847837db1704e8a51181ef5324b5fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"Module_Brushes.str_to_color (cyclomatic 113): Module_Brushes.str_to_color has cyclomatic complexity 113 (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":"codes/Module_Brushes.vb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cb10450754df131f86591974495300b1131cfd61108556e8640411372f0486"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.do_analysis (cyclomatic 101): Form_Main.do_analysis has cyclomatic complexity 101 (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: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edf98c3d0431264d51048e8b213d7da558a826739c89254dbbfb8c08f7ab8f7"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.draw_tree (cyclomatic 94): View_Tree.draw_tree has cyclomatic complexity 94 (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":"codes/View_Tree.vb"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0f4b31ddbc3ac190de616fb6beda2227fd2fd3f86b3bfc3db3cef3bd22448b"}},{"ruleId":"D1","level":"warning","message":{"text":"Batch_Tools.load_final_trees (cyclomatic 64): Batch_Tools.load_final_trees has cyclomatic complexity 64 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Batch Tools.vb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ddf91df23007db04086a0ab9d6e37e8fd46482a71fed10642cc782e4e01bf5"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.read_results (cyclomatic 62): View_Tree.read_results has cyclomatic complexity 62 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6d3fd76e0a717e722d0ea3f7faae6cb09d0ddadc320cdb8de5cb70980965ac"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.FDTimer_Tick (cyclomatic 61): Form_Main.FDTimer_Tick has cyclomatic complexity 61 (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: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":4270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ff32acfe6d4cdcece2ece5fa92682fb886c7c128d9d006590c1e6aacea2c9b"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.Global_Info (cyclomatic 57): View_Tree.Global_Info has cyclomatic complexity 57 (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":"codes/View_Tree.vb"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c4cf40b0ad74c11c5908e0915aa22b8a4a571f1cb255f503da64d67459c3fe"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_BGB.Button13_Click (cyclomatic 55): Config_BGB.Button13_Click has cyclomatic complexity 55 (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":"codes/Config_BGB.vb"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0426b775b2b65c1a5bc2663f846f7cb8e2976e218213c6d0f3a8f1ac67794896"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool_Combine.combine_result (cyclomatic 54): Tool_Combine.combine_result has cyclomatic complexity 54 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Combine.vb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"825383b00339cb363e32df589f37d386e203c50c16fd6123deba0999f2251135"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.Button1_Click (cyclomatic 48): Form_Main.Button1_Click has cyclomatic complexity 48 (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: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":7502}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b02213afb23c910ba5ad9042659b19380dd3d0a453d2532ec34f4aa8d4c64d"}},{"ruleId":"D1","level":"warning","message":{"text":"Ploy_Tree.New.ctor (cyclomatic 48): Ploy_Tree.New.ctor has cyclomatic complexity 48 (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":"codes/Module_Tree.vb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"00006cfd839a2dc932f7af034a7704f2b81810ef10da13db2d407e1a29f7abc6"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.make_final_trees (cyclomatic 45): Form_Main.make_final_trees has cyclomatic complexity 45 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdae2233a9c3688d6283e3e2b042b8eea34992c7d786dbb003c3b5454e7dddfc"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.load_final_trees (cyclomatic 44): Form_Main.load_final_trees has cyclomatic complexity 44 (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: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"1935e06ee7a240909ad6951adf8ed39c78bc8572381ca052eae2a50bea2ae272"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.Read_Poly_Tree (cyclomatic 43): View_Tree.Read_Poly_Tree has cyclomatic complexity 43 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0472634bd85c259df65f8295e27ad410ebe092d6f8cc43d25722d36366e64ce"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.remove_taxon (cyclomatic 41): Form_Main.remove_taxon has cyclomatic complexity 41 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":7147}}}],"partialFingerprints":{"codehealthFindingId/v1":"48204bfa1f20dc7ef8b622dc9efa59a87341f81249def439f860d7f4b8c8c328"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool_TvS.claculate_score (cyclomatic 40): Tool_TvS.claculate_score has cyclomatic complexity 40 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_TvS.vb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e900e9a9e31d074c25f7aecebb5b94f036eb6bd8c44c7692d7cfa4b8dc2637"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.check_mrbayes (cyclomatic 36): Form_Main.check_mrbayes has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f101d62fbf1ac6ca9c9c8ecf406e3fe6fdea8faab419c688828bd2cc2d11f15"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.Swap_tree (cyclomatic 36): View_Tree.Swap_tree has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a996657301e35b46b4538ec1420af48366110495de68357696e411a202e36c5"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.Get_Info (cyclomatic 36): View_Tree.Get_Info has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c35e483e5bdddbedf2899ac380c23acc2ac493a472b5c7a2eecd13947228680"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_BGB.Read_Poly_Tree (cyclomatic 34): Config_BGB.Read_Poly_Tree has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0943720af432c842ee4b30462f0f3d9a59d599aecca75b764975660690f026"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_Lagrange.Read_Poly_Tree (cyclomatic 34): Config_Lagrange.Read_Poly_Tree has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Lagrange.vb"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"bace29d26f0a184cc81e13dce17de152674a595dc67584903e4bb982a8225424"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.read_new_bayes_log (cyclomatic 34): Form_Main.read_new_bayes_log has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":5965}}}],"partialFingerprints":{"codehealthFindingId/v1":"0164fcc35c4eecfba4b1b8647ae15de2103a279183c85ba6f6cb7252d0a4f3f6"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.comb_result_all (cyclomatic 33): Form_Main.comb_result_all has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":4989}}}],"partialFingerprints":{"codehealthFindingId/v1":"12505ce665bc37a80f768b623c7be387b6f91d763d1f72a681a931da8c5c213e"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_BayArea.Read_Poly_Tree (cyclomatic 32): Config_BayArea.Read_Poly_Tree has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BayArea.vb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b144bcb13b41f625813dd2fb4eb07a2e2bb00b7d97ac3d38924e1fbcdedeaf"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.Swap_Whole (cyclomatic 30): View_Tree.Swap_Whole has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":3429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7766d49171054a072a44c8e1eb95f3cc90d594aec9e8dd6c4e03d87d7a0734c"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Dis.cal_column (cyclomatic 29): View_Dis.cal_column has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Dis.vb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65470aa19e07565062aae3106de03c51f0a2a0ab8e42b21f92af3a5a3850a08"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.get_tree_length (cyclomatic 28): Form_Main.get_tree_length has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":6668}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c48b31ca7900d476e749f67003701dba2ebcbb3d842891b43542e1e9070ed2"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_BGB.Read_LG_Tree (cyclomatic 27): Config_BGB.Read_LG_Tree has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f795407c455a437eeb3392c7dbab1ed853799d43ea6a474c5dc0be792c1c63"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_Lagrange.Read_LG_Tree (cyclomatic 27): Config_Lagrange.Read_LG_Tree has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Lagrange.vb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"027d16f0d07f34e41ba4be31d7b9a164c767332af0f5b193af69ccfdc95fddf0"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.load_names (cyclomatic 27): Form_Main.load_names has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e993224f9d738c732bf2785c28e9b419942f2f50b03f21f95a12188c0e1d9be"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.Build_Final_Tree (cyclomatic 27): Form_Main.Build_Final_Tree has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":3493}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ae6b5ac98ba73320f8b312dd467debe189e73b56ac3c7bd0c2a17e7c3a541a"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.read_range_log (cyclomatic 27): Form_Main.read_range_log has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":3955}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fa79a53cde947587d8b9b0045b7478ced9c6c3e200af78c9af0de9e6a5f433"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.write_remove_og (cyclomatic 27): Form_Main.write_remove_og has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":7351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1bdeefc21cd6429d8b707e5c6c95e2601bc94627987a74a5abbbd2726671f3"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool_Cluster.Timer_R_Tick (cyclomatic 27): Tool_Cluster.Timer_R_Tick has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Cluster.vb"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"167365ea72c9645b744c9522185baccde7200af986c768079fb4909cd34a7d8a"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool_Combine.get_tree_length (cyclomatic 27): Tool_Combine.get_tree_length has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Combine.vb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58b7d4e849e696514fdfd9c7ed7cd8183022bdc8bbc4a49297c9050622f42f8"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.draw_diagram (cyclomatic 27): View_Tree.draw_diagram has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f31d64c7f6332dcbe68f3bbd37d995912b11ba49f26799311c7f4dc4f8ef97a"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_Lagrange.Button3_Click (cyclomatic 26): Config_Lagrange.Button3_Click has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Lagrange.vb"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c3faaf341a2bc16ea8d11a9de7e79d46eeffd8390620ae0e5bd55fdfab91da"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.LoadDistrutionToolStripMenuItem_Click (cyclomatic 26): Form_Main.LoadDistrutionToolStripMenuItem_Click has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2387ec16dfe8cb8f62d0ff757e55ef3d936828cd9448d9317c36a915a51a6e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.make_file_BGB (cyclomatic 26): Form_Main.make_file_BGB has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":6293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b598d583c229f8d2d1a27f8314383d9a133a05f20e930a61ba27de37c1c75882"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.EventLine (cyclomatic 26): View_Tree.EventLine has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":2823}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f9187dba988e2db9c6838e160c4d4083553ed061de43e87ae00bba2cf0f508"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_BBM.Button1_Click (cyclomatic 25): Config_BBM.Button1_Click has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BBM.vb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ff9ae590bda6b84386c08a43f851d235420297de40a3626f863594c275291c"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_SDIVA.LoadSettingToolStripMenuItem_Click (cyclomatic 24): Config_SDIVA.LoadSettingToolStripMenuItem_Click 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":"codes/Config_SDIVA.vb"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbae3ae4d3f576ec2488319a19c9a00e7346a04eb6603c1c828e424be8c83a4"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.runDIVA (cyclomatic 24): Form_Main.runDIVA 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ef257ba245780bc784f90661648c428455428909463a0cd5011e5a90ed90a6"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.make_file_dec (cyclomatic 24): Form_Main.make_file_dec 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":6494}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd26cb65018f7720436af4d9a3a92eeba6d2b5ae91b4675cd1265a5bcd21e8c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Module_Var.Read_Poly_Node (cyclomatic 24): Module_Var.Read_Poly_Node 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":"codes/Module_Var.vb"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d22223c85d2934a278cde64c0717392cde19b339715d97fffeaf5124d570ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool_Omitted.f_node (cyclomatic 24): Tool_Omitted.f_node 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":"codes/Tool_Omitted.vb"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43d6dc727ce2bc4cd92ba1970ec9136079cf89f6c1287eda79106d0f15d5f3e"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.read_node (cyclomatic 23): Form_Main.read_node 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f21c985a1b5346d69b1a364c833dc9618d1c213601c7db86119f56968a81a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_Traits.read_traits_file (cyclomatic 22): Config_Traits.read_traits_file has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Traits.vb"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f767128427b4225e6ec3bd281709f3bb7e202ad967977c06171626df73f63f28"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool_SvT.find_best_tree (cyclomatic 22): Tool_SvT.find_best_tree has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_SvT.vb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48e6aeaf72933dcdd654435124712eb780223f9a6359414dfa8509a35d59a40"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_BGB.LoadSettingToolStripMenuItem_Click (cyclomatic 20): Config_BGB.LoadSettingToolStripMenuItem_Click 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":"codes/Config_BGB.vb"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcc693b931e8a2bbb501d23eef82267d153085ec6326539629ab3842ceac497"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_Lagrange.LoadSettingToolStripMenuItem_Click_1 (cyclomatic 20): Config_Lagrange.LoadSettingToolStripMenuItem_Click_1 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":"codes/Config_Lagrange.vb"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"269a8684219076f7d1756c82eeeb8964efcd97680223b53af1d8d87addd7188a"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.Form1_Load (cyclomatic 20): View_Tree.Form1_Load 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":"codes/View_Tree.vb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed593d328e761f6b8562ebc0f11c22eb68dfa3de2dbec6c4952c8899b55df2a"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.make_final_tree (cyclomatic 19): Form_Main.make_final_tree 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"37df03b624c06b5055a8af140d8e8b651e1adc5cae07926eed7e24c13e9d4901"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.read_bayarea (cyclomatic 19): Form_Main.read_bayarea 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":3835}}}],"partialFingerprints":{"codehealthFindingId/v1":"10845876397d8dff09e3c060cd0781398a3233027862a0291d341137dd16008f"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.BioGeoBEARSToolStripMenuItem2_Click (cyclomatic 19): Form_Main.BioGeoBEARSToolStripMenuItem2_Click 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. This shape REPEATS in the file: one other method here (Form_Main.DIVALIKEInBiogenBEARSToolStripMenuItem_Click) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":8223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5dcbe6a6a0cf4f546d7398db449a5a4148d3b8181be961c59b802d11ca5789"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.DIVALIKEInBiogenBEARSToolStripMenuItem_Click (cyclomatic 19): Form_Main.DIVALIKEInBiogenBEARSToolStripMenuItem_Click 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. This shape REPEATS in the file: one other method here (Form_Main.BioGeoBEARSToolStripMenuItem2_Click) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":8326}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac93fe30a3a0592a258a69bb1f933e81a2b52000c2dda7bd44f116fbf6bea68"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool_Omitted.e_node (cyclomatic 19): Tool_Omitted.e_node 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":"codes/Tool_Omitted.vb"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3d16560b87f2b6a5b92eeb725b072e6cbe20360cfafc40d47c258760d97c24"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.load_beast_trees (cyclomatic 18): Form_Main.load_beast_trees 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: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":5222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcd1a2365dbc72f67cbe53b653f889529f7511309c674da8929ad084896e0f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.StatisticalDIVALIKEToolStripMenuItem_Click (cyclomatic 18): Form_Main.StatisticalDIVALIKEToolStripMenuItem_Click 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: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":8427}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d026de1bfc69280d712c908f7092997825e8e37acfe73b779dd0c7669e57e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.StatisticalERSYMARDInAPEToolStripMenuItem_Click (cyclomatic 18): Form_Main.StatisticalERSYMARDInAPEToolStripMenuItem_Click 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: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":9313}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb75be63680a014afdc01898d59545cff3e131c43e7cb58193bd55061c44d848"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.draw_col (cyclomatic 18): View_Tree.draw_col 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":"codes/View_Tree.vb"},"region":{"startLine":2228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cdab93380187a35ed40b9b00bb326cfc259c7e2e90273bc0a0029bdadf21b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_BBM.Write_Bayes_nex (cyclomatic 17): Config_BBM.Write_Bayes_nex 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":"codes/Config_BBM.vb"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9851fe31bcb0f2811fc4b2371d1eb5f74dd0b3d9484d513c5364c89443b35e73"}},{"ruleId":"D1","level":"warning","message":{"text":"Config_Traits.Button1_Click (cyclomatic 17): Config_Traits.Button1_Click 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":"codes/Config_Traits.vb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ef8f17dec6b787908f7e45a50a25a8bb879c7fc7e3353cc62a50f7fc25e349"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.read_DEC (cyclomatic 17): Form_Main.read_DEC has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":4902}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bb8467189d2c4ea58f5efe6fb6fe0758d868ec23a4c93597b013f65342d10f"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.StatisticalDispersalVicarianceAnalysisSDIVAToolStripMenuItem_Click (cyclomatic 17): Form_Main.StatisticalDispersalVicarianceAnalysisSDIVAToolStripMenuItem_Click has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":8529}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6fc1e951a76c6faa9cb1247de303c51e754d3c9f99946c37de7c3dfb4ba19c"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.ERSYMARDModelInAPEToolStripMenuItem_Click (cyclomatic 17): Form_Main.ERSYMARDModelInAPEToolStripMenuItem_Click has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":9156}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b0a8dec0d0d4dc991aca770c4f5288b17f42c75b5d79a12ebb20fd5f22da3e"}},{"ruleId":"D1","level":"warning","message":{"text":"View_Tree.AreaLine (cyclomatic 17): View_Tree.AreaLine 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":"codes/View_Tree.vb"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"8724c26ec434dd6d30d5785c4721a67143000cac5c4510efd399212f01907505"}},{"ruleId":"D1","level":"warning","message":{"text":"Form_Main.add_tree_length (cyclomatic 16): Form_Main.add_tree_length has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: codes/Form_Main.vb holds 32 of the 71 methods over the threshold \u2014 including the worst \u2014 and 673 of the 1441 points over it (47%), 2.4\u00D7 the next-largest file (codes/View_Tree.vb at 286). 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":"codes/Form_Main.vb"},"region":{"startLine":8913}}}],"partialFingerprints":{"codehealthFindingId/v1":"1595885aa35df82d87d28e15d1565df26a8911b28a36ef67df88e7ffbdb0e32a"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool_Cluster.make_final_tree (cyclomatic 16): Tool_Cluster.make_final_tree 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":"codes/Tool_Cluster.vb"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"3887b80334cd489c6e8ac9276ae320f307fe7f2990f7712c0f26dc7acc5fdbfb"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.load_trees (cognitive 615): Form_Main.load_trees has cognitive complexity 615 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe66a3b104dedc25ec5f70456333c05d9833721f096c0d4aaca8f0c77ea682a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.load_bayes_trees (cognitive 531): Form_Main.load_bayes_trees has cognitive complexity 531 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":5323}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dc9f5b43aeed35b1b169537b868783ebd8ebbea31863771f2b0634fc9064aa"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.draw_tree (cognitive 496): View_Tree.draw_tree has cognitive complexity 496 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd51ff61f0e5464717bea7f78165976ba420f302e53803b859096aa419737be"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.do_analysis (cognitive 413): Form_Main.do_analysis has cognitive complexity 413 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a48cf7defc8aeef9c84153abf38f1d23eaaaeae6cfb36f922c4464321a802d"}},{"ruleId":"D2","level":"warning","message":{"text":"Batch_Tools.load_final_trees (cognitive 286): Batch_Tools.load_final_trees has cognitive complexity 286 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Batch Tools.vb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4110bae2a9ccf72475a0358487029231433d2794e7ec9114d164e33de28f74"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.read_results (cognitive 283): View_Tree.read_results has cognitive complexity 283 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"9854394661b804fb270f1dfd1f2002fef53435621084ea0af454de20bb6e6c15"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.make_final_trees (cognitive 208): Form_Main.make_final_trees has cognitive complexity 208 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11bb16d87a6490bab2f7786b11430c8a68857840bc6bf59b2d86bcd468079f4"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.Global_Info (cognitive 173): View_Tree.Global_Info has cognitive complexity 173 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36664436d6d9ad39c33ccb865c6b7b719e57afdd820c99c13328e4643432dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.Get_Info (cognitive 167): View_Tree.Get_Info has cognitive complexity 167 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"833635317880b8418b23fa4228f46449b4342fcb4c0956e66bdbbee4ee388ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.load_final_trees (cognitive 137): Form_Main.load_final_trees has cognitive complexity 137 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac2d307d118adfedbd66ccb38ca52d705ae2f3518e12028f2f6f413e9cc4122"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Combine.combine_result (cognitive 129): Tool_Combine.combine_result has cognitive complexity 129 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Combine.vb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"431513ee72a0c98bc8ab1d34bdd4b0903938bd0bb59137615dbd3a2703521479"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.FDTimer_Tick (cognitive 121): Form_Main.FDTimer_Tick has cognitive complexity 121 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":4270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25ae3fcb5f7a9e281f36d42274b2d9d2d2d470e4fcc284f7f500947472b6520"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.Button1_Click (cognitive 121): Form_Main.Button1_Click has cognitive complexity 121 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":7502}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7392ea6d6a3e7b6764c17033f03bef503f859d6a27d80f9120874297a64e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.check_mrbayes (cognitive 120): Form_Main.check_mrbayes has cognitive complexity 120 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"5250021357cd4abed38fb6775d3df28b48b81c2e3f8dbdfc30fb37ea653771c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Ploy_Tree.New.ctor (cognitive 115): Ploy_Tree.New.ctor has cognitive complexity 115 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Module_Tree.vb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6308d8fc043d8c1990fbb32b1e149eb68560d2b634cff4b1d9e07a9666ab9b06"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.draw_diagram (cognitive 114): View_Tree.draw_diagram has cognitive complexity 114 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc877f1aea3f42419086f1bab52961fbea84bb0f8ca7542a41e5fd58a7ee07fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Module_Brushes.str_to_color (cognitive 112): Module_Brushes.str_to_color has cognitive complexity 112 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Module_Brushes.vb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f3397baae99ceee892e9d9df690fa82ba0c72ce6a7c3654b499fff01f02411"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_TvS.claculate_score (cognitive 112): Tool_TvS.claculate_score has cognitive complexity 112 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_TvS.vb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d941165d59b1dde87f1ed0109899455b544d5ee964ff429283719e67d5ad9be4"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Dis.cal_column (cognitive 110): View_Dis.cal_column has cognitive complexity 110 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Dis.vb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b171555e0a023eb88d012da166cc30d640d9a77a90fa6d3c900d0d974c34c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.Read_Poly_Tree (cognitive 109): View_Tree.Read_Poly_Tree has cognitive complexity 109 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"74652ee8c174ada0e7093854a61ee8eed3c74f77e00139b6b895555afb8aabb3"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.load_names (cognitive 107): Form_Main.load_names has cognitive complexity 107 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3d4e3e5b71c61f548a7d6db349adabe699a68eef614f21140e8bf8ab8109ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.comb_result_all (cognitive 101): Form_Main.comb_result_all has cognitive complexity 101 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":4989}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7e6d2f092b03af10ba65ccc19e7e8034d98f6b8a7180d7252f8d435594a1d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_SDIVA.LoadSettingToolStripMenuItem_Click (cognitive 94): Config_SDIVA.LoadSettingToolStripMenuItem_Click has cognitive complexity 94 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_SDIVA.vb"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf3d1aac8701cbe5619aa832fbc7c7b84bbd8209e0c1235d16297d6944498ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.LoadDistrutionToolStripMenuItem_Click (cognitive 86): Form_Main.LoadDistrutionToolStripMenuItem_Click has cognitive complexity 86 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ee2fca82b3fb4d7eb94817bf1071118954961e40b7d313eeba61e6b0d0c551"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.EventLine (cognitive 80): View_Tree.EventLine has cognitive complexity 80 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":2823}}}],"partialFingerprints":{"codehealthFindingId/v1":"860096137abe896aa490bb400bdd156a23a312fa744dd9a0d0dc299ee17275a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BGB.Read_Poly_Tree (cognitive 78): Config_BGB.Read_Poly_Tree has cognitive complexity 78 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2374645189c0298b30123fa74a2efe816df659fb7ca57e1e2ee64bc52c0277"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Lagrange.Read_Poly_Tree (cognitive 78): Config_Lagrange.Read_Poly_Tree has cognitive complexity 78 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Lagrange.vb"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"4172d08007f781b0b3a096059f352c73d1e20c42f0dbb77bc29acc76e0339a48"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BGB.Button13_Click (cognitive 77): Config_BGB.Button13_Click has cognitive complexity 77 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbde6ce678c8204a2ed4156097fbd141ef9836a7b323497b31a8c936f47277c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BGB.LoadSettingToolStripMenuItem_Click (cognitive 74): Config_BGB.LoadSettingToolStripMenuItem_Click has cognitive complexity 74 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46e9719a2e280f40378a2afccaf045b99b0269d86ac7ccd89009fe484f928c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Lagrange.LoadSettingToolStripMenuItem_Click_1 (cognitive 74): Config_Lagrange.LoadSettingToolStripMenuItem_Click_1 has cognitive complexity 74 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Lagrange.vb"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82cc332e48001b83941c4e22c5101dc0a394f8a1a227ac0c1d04df74f8aca75"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.Swap_Whole (cognitive 73): View_Tree.Swap_Whole has cognitive complexity 73 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":3429}}}],"partialFingerprints":{"codehealthFindingId/v1":"723de183bee5fd14ccc0f58e21ecc24597600f0fa4d30beadb6e771863c2795a"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Traits.TimerTraits_Tick (cognitive 71): Config_Traits.TimerTraits_Tick has cognitive complexity 71 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Traits.vb"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e4f537f1373ad9c63b82c61366976efe4583218456f0f2959b59a373885b69"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BayArea.Read_Poly_Tree (cognitive 68): Config_BayArea.Read_Poly_Tree has cognitive complexity 68 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BayArea.vb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1323ce995ddea656c9615710e02ca2237a5d1508b61ae50e764d2c5d09c325"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_SvT.find_best_tree (cognitive 67): Tool_SvT.find_best_tree has cognitive complexity 67 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_SvT.vb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"19314f28c3852463b1fd47e13ece5e4caccb1663aa4d3ac748ce6d1ea137804a"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.get_tree_length (cognitive 66): Form_Main.get_tree_length has cognitive complexity 66 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":6668}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e1047199f0869c3e47dbb0265e054e70e6e2de20b7a70aa61b69ba912bfbcf"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.write_remove_og (cognitive 66): Form_Main.write_remove_og has cognitive complexity 66 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":7351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea631d345337b4216ac87b0d987d281f858fe0779df8773f5e9b17d2e5e618e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BGB.Read_LG_Tree (cognitive 65): Config_BGB.Read_LG_Tree has cognitive complexity 65 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbde7750817ce2a7df4a4bf9950fcf6f03e98f8b617d72c2b7fd4fc455e44396"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Lagrange.Read_LG_Tree (cognitive 65): Config_Lagrange.Read_LG_Tree has cognitive complexity 65 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Lagrange.vb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b3cd58d41ec516b2bccc0e344f23caa6c3d94e01d6409b350fc0c409a30b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Combine.get_tree_length (cognitive 65): Tool_Combine.get_tree_length has cognitive complexity 65 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Combine.vb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a6e8bf3076dee5b60fcf435514940eff2604afe45b10aba238ff361c4282b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.remove_taxon (cognitive 64): Form_Main.remove_taxon has cognitive complexity 64 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":7147}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb49c71d5a08cb0d76b7bcb45c3759f8cea8947e1c7829c6eae130d95d017a7b"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.Swap_tree (cognitive 64): View_Tree.Swap_tree has cognitive complexity 64 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf285c8a57bbbd65735724cd268705b98c61ca78772e9a74064db58fa312b27b"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.Form1_Load (cognitive 62): View_Tree.Form1_Load has cognitive complexity 62 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"4313f5d3e3aacfc55ace58da6befbc178685e55b09fb003309b6c4c3f6abf02f"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Lagrange.Button10_Click (cognitive 61): Config_Lagrange.Button10_Click has cognitive complexity 61 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Lagrange.vb"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52bca3002267b65e58c855a64fc0b887d9e69a33248e08b07d4167b0a5bcff6"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Omitted.f_node (cognitive 61): Tool_Omitted.f_node has cognitive complexity 61 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Omitted.vb"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecf0afa90f4a6480cf429c149a2a5bc3a027a05688cf31e09debfdac2187e8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.read_new_bayes_log (cognitive 57): Form_Main.read_new_bayes_log has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":5965}}}],"partialFingerprints":{"codehealthFindingId/v1":"5150309df721993d3c94c4a85ec08f659995c51b5e950d0c4b226398d3cd3f87"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_DPP.Button4_Click (cognitive 57): Tool_DPP.Button4_Click has cognitive complexity 57 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_DPP.vb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff649cff0f431f34bdbe1532c009a19b270c508fbce5128649f6dcb7087aaed"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.StatisticalDispersalVicarianceAnalysisSDIVAToolStripMenuItem_Click (cognitive 56): Form_Main.StatisticalDispersalVicarianceAnalysisSDIVAToolStripMenuItem_Click has cognitive complexity 56 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":8529}}}],"partialFingerprints":{"codehealthFindingId/v1":"775255121251a2e1dda4c233d7ffebd4ac233f8cd013211317592d2e8b5526ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Module_Var.Read_Poly_Node (cognitive 56): Module_Var.Read_Poly_Node has cognitive complexity 56 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Module_Var.vb"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59a64d64ea7323a702618f5a241f2bb50e55059143831598234987bce3a660c"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.draw_col (cognitive 56): View_Tree.draw_col has cognitive complexity 56 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":2228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76126a3b233e62540a72242b5023ca66929436b87e2a32b81ae3100db1c9989"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.make_final_tree (cognitive 55): Form_Main.make_final_tree has cognitive complexity 55 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c3e707eda3f6bffc3b442537be7e1dd2f3bc7609cf81ecec215b5dea1f746a"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.load_beast_trees (cognitive 54): Form_Main.load_beast_trees has cognitive complexity 54 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":5222}}}],"partialFingerprints":{"codehealthFindingId/v1":"449f80801ac19390eb58b10e04c7fb901da7563dd439761ccd905300c29b0167"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.read_DEC (cognitive 52): Form_Main.read_DEC 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":4902}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a206a5757b4a854f789f920b644a9504534ae7c474f0356b090dc6fd6881f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Cluster.make_fdw_matrix (cognitive 52): Tool_Cluster.make_fdw_matrix 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":"codes/Tool_Cluster.vb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a36ce42e20b4c781319c14993b27e26d1f3b44c68b92a8be4bb3ab843d4206a"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.SaveDistributionToolStripMenuItem_Click (cognitive 51): Form_Main.SaveDistributionToolStripMenuItem_Click has cognitive complexity 51 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":5881}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9c17526ffdcd36c9144e1e083fd2f60d73a019c7a5bfb80fa390d4e401a1ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.make_file_BGB (cognitive 51): Form_Main.make_file_BGB has cognitive complexity 51 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":6293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7488f57b8fcc928e442c2c3fc286beafc3b3093eac380554da48022a0cce54b"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.make_file_dec (cognitive 51): Form_Main.make_file_dec has cognitive complexity 51 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":6494}}}],"partialFingerprints":{"codehealthFindingId/v1":"19deeb7a0aa3b344b0e247151937703a1172867c7cec459e9e531314933021cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.BioGeoBEARSToolStripMenuItem2_Click (cognitive 50): Form_Main.BioGeoBEARSToolStripMenuItem2_Click has cognitive complexity 50 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (Form_Main.DIVALIKEInBiogenBEARSToolStripMenuItem_Click) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":8223}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cfa4bff02ff38880eb2fcfd9a1591ca4f8214b9401a1f08f61618480ba5793"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.DIVALIKEInBiogenBEARSToolStripMenuItem_Click (cognitive 50): Form_Main.DIVALIKEInBiogenBEARSToolStripMenuItem_Click has cognitive complexity 50 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (Form_Main.BioGeoBEARSToolStripMenuItem2_Click) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":8326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d420586f02a5e05c286c9acfd5ff3dda53e582a2b4990d269f23109356ec5e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.StatisticalDIVALIKEToolStripMenuItem_Click (cognitive 48): Form_Main.StatisticalDIVALIKEToolStripMenuItem_Click has cognitive complexity 48 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":8427}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fa857af6ed40363eb2d5bd82fe19493f3c26b540bc3016f1df2fc3398b158c"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Traits.read_traits_file (cognitive 47): Config_Traits.read_traits_file has cognitive complexity 47 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Traits.vb"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"637ea471163bdc668940defba737e121f5b73516b779b5d92bc456521eb72c89"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Omitted.e_node (cognitive 47): Tool_Omitted.e_node has cognitive complexity 47 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Omitted.vb"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcdf9653be374a0c801b3ecbe3ddb5121c088c25598158397b190d90150d720"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.add_tree_length (cognitive 46): Form_Main.add_tree_length has cognitive complexity 46 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":8913}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f08e6e22018b456fc736568e2d8ae11e88fd3bd28a2b68f22a180e778e2898"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.Build_Final_Tree (cognitive 45): Form_Main.Build_Final_Tree has cognitive complexity 45 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":3493}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75f3877698601e5848867858894c3fabcb013f5714f74d93c75b2e64ece8f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.AreaLine (cognitive 45): View_Tree.AreaLine has cognitive complexity 45 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4db5c642b9d8fdea51c0f08bf21c42a5a55c49a422a684fdb6371eb1186cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.StatisticalERSYMARDInAPEToolStripMenuItem_Click (cognitive 44): Form_Main.StatisticalERSYMARDInAPEToolStripMenuItem_Click has cognitive complexity 44 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":9313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4be994eb915b0ed98136297e66de3eea88c5f239fb97b3b8d531ee2f0ff28ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BGB.Config_BGB_VisibleChanged (cognitive 43): Config_BGB.Config_BGB_VisibleChanged 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":"codes/Config_BGB.vb"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c81f72479c4ae6cf416b98e1a777038e0feddf969d7216b7f2cd896135e21d"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.make_tree_xy (cognitive 43): View_Tree.make_tree_xy 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":"codes/View_Tree.vb"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a7900c8e5147040227f304c9406699c20e1560e6db5e9462e9b2ed0299663a"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.Readnex (cognitive 42): Form_Main.Readnex has cognitive complexity 42 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":6856}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a66c7f968ac3d5fe1cd6bf043437323db52094257e9ccbb1aceb9746e88d12"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Cluster.Timer_R_Tick (cognitive 42): Tool_Cluster.Timer_R_Tick has cognitive complexity 42 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Cluster.vb"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"670e832177f6aa341660666162b9e3197ae868cbda93992ff133cd20c2e46347"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.runDIVA (cognitive 41): Form_Main.runDIVA has cognitive complexity 41 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49d0737fa4daec2848b2ebe3728477e9132eae7b86c50b1767ae5e2717543c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Cluster.make_SC_matrix (cognitive 41): Tool_Cluster.make_SC_matrix has cognitive complexity 41 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Cluster.vb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d31cf4a889f06776a40c9137ea89cdbc5737d316740881ead773716eb7ee55"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Lagrange.Button3_Click (cognitive 40): Config_Lagrange.Button3_Click 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":"codes/Config_Lagrange.vb"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75ce2245645843687b2720aee69ced6beacaf7967da0324b82e8f53533f2447"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.read_range_log (cognitive 40): Form_Main.read_range_log 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":3955}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e82c2918b7f887f8de5c1febb66421e1ebbf41a9bf3b344b0e66db453dde01"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_TvS.Timer_R_Tick (cognitive 40): Tool_TvS.Timer_R_Tick 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":"codes/Tool_TvS.vb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e013b48101e8b2b5c3440f4faed2c99debb4ba1349e303aed28df602811f0a"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.read_node (cognitive 39): Form_Main.read_node has cognitive complexity 39 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"60946a56b2dc90eb3c941e521494f67fcc18af20a88e007fbcf2eabe7c9c65ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.read_bayarea (cognitive 39): Form_Main.read_bayarea has cognitive complexity 39 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":3835}}}],"partialFingerprints":{"codehealthFindingId/v1":"8563bfe60a17274c14712286b15be6ddfb18c4d9009e534afbd47f492256088f"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.PicBox2_High (cognitive 39): View_Tree.PicBox2_High has cognitive complexity 39 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e506fc4777b2c6ac975401c172437251e7dc38ade5cacd6784eaa318723c44b"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Chrom.TimerChromEvol_Tick (cognitive 38): Config_Chrom.TimerChromEvol_Tick has cognitive complexity 38 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Chrom.vb"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea428ba451e351a7d503cf056925bb94577b894d9664de26410652090b0ab23"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.StatesVsTreesToolStripMenuItem_Click (cognitive 38): Form_Main.StatesVsTreesToolStripMenuItem_Click has cognitive complexity 38 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":9019}}}],"partialFingerprints":{"codehealthFindingId/v1":"283631e784413776f74398c6072188757ef5a295abeefc29fd57a79235ac84f0"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.TreeWithTimeToolStripMenuItem_Click (cognitive 38): View_Tree.TreeWithTimeToolStripMenuItem_Click has cognitive complexity 38 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":3308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7c9afe7533de20d8df4c9d6002cd0c5d418fcac92f7f497e36c732ec1b4cb2"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Dis.drawfig1 (cognitive 37): View_Dis.drawfig1 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":"codes/View_Dis.vb"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4095470c79af989a23e9c26975f27c0e3c5a5d1b80b9dfdcd6e59e3eb32fef7"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Lagrange.Lag_Config_VisibleChanged (cognitive 36): Config_Lagrange.Lag_Config_VisibleChanged has cognitive complexity 36 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Lagrange.vb"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1d358b3c8d5827250e78a2ab333670f1761fdc3266ac11bd71066cd2f414bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BBM.Write_Bayes_nex (cognitive 35): Config_BBM.Write_Bayes_nex has cognitive complexity 35 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BBM.vb"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"93afac4c2a054b43d699ed98de95c2b2184ee2dd7926e172fe5ffe009615dd7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BGB.read_time_period (cognitive 34): Config_BGB.read_time_period has cognitive complexity 34 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"b938dcbf4de04753efd675ed4f49869caedc844b0905f83af5347dfc6bb1d4f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.BayesianBinaryMCMCBBMToolStripMenuItem1_Click (cognitive 33): Form_Main.BayesianBinaryMCMCBBMToolStripMenuItem1_Click has cognitive complexity 33 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":9104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c23f062d0d19d4275088eed9d5d1a22cc12328f6b50db251faab5e55daf3499"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BBM.Button1_Click (cognitive 32): Config_BBM.Button1_Click 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":"codes/Config_BBM.vb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"93caa61d9a7c306ff7604f161897759e2596a1cfc4982f6928ff6d8f6df3a8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_SDIVA.SaveSettingsToolStripMenuItem_Click (cognitive 32): Config_SDIVA.SaveSettingsToolStripMenuItem_Click 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":"codes/Config_SDIVA.vb"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0c61c332a5dfd852aa01afeaf540e02a334a1927c1bfd9913a01dc58b3c7b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.StatisticalDECSDECToolStripMenuItem_Click (cognitive 32): Form_Main.StatisticalDECSDECToolStripMenuItem_Click 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":8759}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf4ff4be3d4099da553da3893fe1c0ea90791b886a4b5b63a7fbe8508e16b88"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.make_range_P (cognitive 31): Form_Main.make_range_P 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":4114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1b10ac34bdb15438282a27cdb874f49f39a9242c272a9a8d61442598228fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.MultiStateReconstructionInBayesTraitsToolStripMenuItem_Click (cognitive 31): Form_Main.MultiStateReconstructionInBayesTraitsToolStripMenuItem_Click 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":9521}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e22cd0d5bf100faffd7c3dd2dee7c47f84ccd555aeea59fdbdf02e685e3dab"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Omitted.Fill_clade (cognitive 31): Tool_Omitted.Fill_clade 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":"codes/Tool_Omitted.vb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"701ff3177fcd608e41e988c1307b89c0a8034506dece35a83a3c2e26ca0f6c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.PictureBox1_MouseDoubleClick (cognitive 31): View_Tree.PictureBox1_MouseDoubleClick 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":"codes/View_Tree.vb"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccebd2a3b634d21486074c930672faaa96caf23ef4f04c6bafd0c28ad0f364f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BGB.Button7_Click (cognitive 30): Config_BGB.Button7_Click 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":"codes/Config_BGB.vb"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50e559131e9c1f2022efdb84fb89e7f0a9025b1e7fc3de15e8cb255fd93837b"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Lagrange.Button7_Click (cognitive 30): Config_Lagrange.Button7_Click 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":"codes/Config_Lagrange.vb"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e1d082aabc4d720429f361cdeeb26320d0f96e8fba4212a9fd308b22208af9"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.BayesianInferenceForDiscreteAreasBayAreaToolStripMenuItem_Click (cognitive 30): Form_Main.BayesianInferenceForDiscreteAreasBayAreaToolStripMenuItem_Click 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":8655}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c7a1ef00e2b51975c90677942994ca0af19e5446666068121b79674858e7a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Cluster.make_final_tree (cognitive 30): Tool_Cluster.make_final_tree 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":"codes/Tool_Cluster.vb"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c47aaf5f10ab74d57338b6e0caccdd8449d50cd8b3872d086aed9b870e51a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Cluster.ListView1_SelectedIndexChanged (cognitive 29): Tool_Cluster.ListView1_SelectedIndexChanged 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":"codes/Tool_Cluster.vb"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7850474ac8f66709031bca63dea20df727397d0ebb220be9b7f5f6f237512ca"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Pie.pie_Load (cognitive 29): View_Pie.pie_Load 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":"codes/View_Pie.vb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb66618d0e7ab90567d9c16034171f7383792abd3d58655d685149c88143345b"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.read_BGB (cognitive 28): Form_Main.read_BGB has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":7941}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeb2121d2e5b9758075421b35cefaf83baedcfad938b3e251a287947fb1cd56"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Chrom.read_ChromEvol (cognitive 27): Config_Chrom.read_ChromEvol 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":"codes/Config_Chrom.vb"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fab220e984de3a48ef8b4beaa606cdfe82187c25e390557375d0c17f6cfb1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.ERSYMARDModelInAPEToolStripMenuItem_Click (cognitive 27): Form_Main.ERSYMARDModelInAPEToolStripMenuItem_Click has cognitive complexity 27 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":9156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e752322f4883f655f6b11a6c33bec8a098688cebd7055d8577976de95d554373"}},{"ruleId":"D2","level":"warning","message":{"text":"Module_BBM.read_result (cognitive 27): Module_BBM.read_result 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":"Codes/Module_BBM.vb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"26de5d0bc72e8504a3eb16259a43bf2f799d5523b07e75a3596b0505b5c9023d"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Omitted.exchange_clade (cognitive 27): Tool_Omitted.exchange_clade 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":"codes/Tool_Omitted.vb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"092f95ac86b5da68dbf4215edee96247b4b87ad42f2556b4bd61c67fe976ccc5"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.Load_result (cognitive 27): View_Tree.Load_result 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":"codes/View_Tree.vb"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb491a30135235ade318dbd1d344f5ae6cd96504f3d560e1af1537ee14c852e"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BGB.ComboBox2_SelectedIndexChanged (cognitive 25): Config_BGB.ComboBox2_SelectedIndexChanged 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":"codes/Config_BGB.vb"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cc466dd9ce79f29b0b8d981ae816482d94314e27fa8927bd58b4bfcdb27b69"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Chrom.Read_Poly_Tree (cognitive 25): Config_Chrom.Read_Poly_Tree 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":"codes/Config_Chrom.vb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f765162130ea8d3894811658d15c2fc0e44dfb6759454965fda7ab10d25ec5a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_SDIVA.RangeForm_VisibleChanged (cognitive 25): Config_SDIVA.RangeForm_VisibleChanged 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":"codes/Config_SDIVA.vb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10786ad49c65b86da019161b89c29e7f1e8cf6ba4a88185bed6aaff3c4afdee"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.check_r_package (cognitive 25): Form_Main.check_r_package 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":8164}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b3c2f47e4d34f530442df82f7d6f5f40545d01b7c7b1b19d2b9c22d4852ffb"}},{"ruleId":"D2","level":"warning","message":{"text":"View_BBM.drawfig1 (cognitive 25): View_BBM.drawfig1 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":"codes/View_BBM.vb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"197d37600b12188e61912dceaf0b91d4be98f0f13640459a9e8fab9d5296e624"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Traits.Button1_Click (cognitive 24): Config_Traits.Button1_Click 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":"codes/Config_Traits.vb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a94fcb616c4b7a83ebe86a8844d04cdb6861ec271e7fb87c8a104c38dac46a"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.read_tree (cognitive 24): Form_Main.read_tree 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":4842}}}],"partialFingerprints":{"codehealthFindingId/v1":"74858e5561d36e1fe99c8d9ace17203656bcfc8ab19b455fd8b3ae7f00776b27"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Welcome.Timer1_Tick (cognitive 24): Form_Welcome.Timer1_Tick 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":"codes/Form_Welcome.vb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d60d5d6518c95305ab36dc2351445939a6082a3d65dee2bbb7046a8c8ac0ce"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.SortNum (cognitive 24): View_Tree.SortNum 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":"codes/View_Tree.vb"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"7daf9e61f38f8cac96cca21534d6cc6a789dd9468d585c064ab1a823e00c26e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.BayesTimer_Tick (cognitive 23): Form_Main.BayesTimer_Tick has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":4207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1607ea6681a0c87158fa140aab6bb9b403fdd7b328fee59f8e094d76ee51c971"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.read_geiger (cognitive 23): Form_Main.read_geiger has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":7872}}}],"partialFingerprints":{"codehealthFindingId/v1":"7646e7bd3e3ef2c12421a31388ecc81b86f3a146ce9325cec0f43a9f1f280fdf"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.TreeTimeMultiplierToolStripMenuItem_Click (cognitive 23): Form_Main.TreeTimeMultiplierToolStripMenuItem_Click has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":8851}}}],"partialFingerprints":{"codehealthFindingId/v1":"f871868051fd4e2ff9d0bc77973d8fbd9db382ebf8e512eb1cac8700a56f9361"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BGB.pailie (cognitive 22): Config_BGB.pailie 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":"codes/Config_BGB.vb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b835438d7b522eb7f862c53ed65812eacab8964b058eca0cea53e520bad03f"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Lagrange.pailie (cognitive 22): Config_Lagrange.pailie 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":"codes/Config_Lagrange.vb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8edc2a527d939c2a7e7ea9e89070bd5f2d0afaa202d051387e0f36affc53be"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_SDIVA.pailie (cognitive 22): Config_SDIVA.pailie 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":"codes/Config_SDIVA.vb"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b946fa8bbf5c864adb75dfff9cfc82ff91223bdf326f83dc74c6c9d5291f8c0c"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.pailie (cognitive 22): Form_Main.pailie 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":8045}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20c9589fecc5caac3282b8733a477942dd89f99c4a70fa8e7a70ec2bf726e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.read_max_reconstruction (cognitive 22): View_Tree.read_max_reconstruction 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":"codes/View_Tree.vb"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e743a9a21b10201b9e19ce58d15cefdd238e73b78222e7accf682a6b6be97f"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.cale_relation (cognitive 22): View_Tree.cale_relation 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":"codes/View_Tree.vb"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"41eb9d15ab70fcfa15c588291917a35e1cba4e3680bc3b00983d902a1b1e4e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.make_new_range (cognitive 21): Form_Main.make_new_range has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":6163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62fc39f98f30e600c5243aec5d965f1c456e49c03671e6549891eecc06d4ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.make_file_ape (cognitive 21): Form_Main.make_file_ape has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":9391}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b9ebf18b11ee631eb954e31516da4c147e6aae23bbd6a5f3cf13e57ea96837"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Cluster.write_matrix_limit (cognitive 21): Tool_Cluster.write_matrix_limit 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":"codes/Tool_Cluster.vb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d473c8fcf7b9d464f4589d1f52c3536a2c2150cb8fcbbcc84a2cf8b5f7c9e3"}},{"ruleId":"D2","level":"warning","message":{"text":"View_BBM.drawfig2 (cognitive 21): View_BBM.drawfig2 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":"codes/View_BBM.vb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad30ff1a02ae8a5907f3b7c17a4220e424fef23d3871ad26acb61a126fc33f89"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Pie.Mypaint (cognitive 21): View_Pie.Mypaint 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":"codes/View_Pie.vb"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0672e4667398b4fd8c9c2a0dbfce41e32a38eae9ebebbbbe3df9e19ba305d58"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BayArea.make_chain (cognitive 20): Config_BayArea.make_chain 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":"codes/Config_BayArea.vb"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8e04d5b42b4e3765963dfb41b708d7f3e61c5f0a7e7dc42eef9640db23c2a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BGB.make_chain (cognitive 20): Config_BGB.make_chain 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":"codes/Config_BGB.vb"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c555bcf07fb64691df973efbd1bbfc1d5d69b5b29fb4dc95e3df9d6f613e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_BGB.SaveSettingsToolStripMenuItem_Click (cognitive 20): Config_BGB.SaveSettingsToolStripMenuItem_Click 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":"codes/Config_BGB.vb"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"a657bb38425279e669dee5e3f2f18fb302336da343f6f3c8af79c3b7291b1b21"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Lagrange.make_chain (cognitive 20): Config_Lagrange.make_chain 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":"codes/Config_Lagrange.vb"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7af457ed1df9a6e7e9e477f80852beeb76cde3b32ec1d13f258aff80a5d2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Lagrange.SaveSettingsToolStripMenuItem_Click_1 (cognitive 20): Config_Lagrange.SaveSettingsToolStripMenuItem_Click_1 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":"codes/Config_Lagrange.vb"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d61a5e5f0dcf93834fde4008f8d023382b498a0f0e4dd86fa5e1bc6a876c75"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.FormatedTreeToolStripMenuItem_Click (cognitive 20): Form_Main.FormatedTreeToolStripMenuItem_Click 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":3237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b677a7d9b61e19e87701ce2d7402f62192b4dc1a147147069958090a156242c"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_TvS.tree_vs_states (cognitive 20): Tool_TvS.tree_vs_states 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":"codes/Tool_TvS.vb"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c5d96e6afd9e97ebfed2f96844ad93b3de00c934cf6457d10d3dbef371d456"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_TvS.state_vs_trees (cognitive 20): Tool_TvS.state_vs_trees 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":"codes/Tool_TvS.vb"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"086eb68f6e5f6f30ba6644abd4fd3a022e0cf3c58cda0729a94a50f439aa3134"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.Button2_Click (cognitive 20): View_Tree.Button2_Click 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":"codes/View_Tree.vb"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9af7dd96c1b103d38356bc07c811f1128c6802b832db96cc45166f7bf0394d"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Chrom.Button3_Click (cognitive 19): Config_Chrom.Button3_Click 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":"codes/Config_Chrom.vb"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7589a6064eced0012ad51dd015870425e36771b89a582839ea44fe8e3387cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.Make_Optimize (cognitive 19): Form_Main.Make_Optimize has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ebebfe913338fbac1f62cb40e129628e7c5da4398448b9b50507f2caacb3ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Convert.Button1_Click (cognitive 19): Tool_Convert.Button1_Click 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":"codes/Tool_Convert.vb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e53fee48788d2ad1c43ecc9e963cd1fef2ff9e78340a6fd8fc6c655ee536c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_SvT.Tool_State_VisibleChanged (cognitive 19): Tool_SvT.Tool_State_VisibleChanged 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":"codes/Tool_SvT.vb"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a3dd13f5cd9279628d4434b5cf08d75bbe4964a1235eed224d9948aa7d6cac"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_SDIVA.NumericUpDown2_ValueChanged (cognitive 18): Config_SDIVA.NumericUpDown2_ValueChanged 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":"codes/Config_SDIVA.vb"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fb696920d123a7408956fdac64fd38ed937c62c43843ec6fa2f5473ee59008"}},{"ruleId":"D2","level":"warning","message":{"text":"Config_Traits.LoadLogToolStripMenuItem_Click (cognitive 18): Config_Traits.LoadLogToolStripMenuItem_Click 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":"codes/Config_Traits.vb"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07a5f5a66519fc06a80e728dd47b765fd130e8f63b386f0b9b6533624998932"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.DispersalExtinctionCladogenesisDECToolStripMenuItem_Click (cognitive 18): Form_Main.DispersalExtinctionCladogenesisDECToolStripMenuItem_Click 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":8604}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c123fdd2da5da0132a5683acd30f4f86fccb157e5aaaa250aa499c33bf2d7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"View_BBM.drawfig3 (cognitive 18): View_BBM.drawfig3 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":"codes/View_BBM.vb"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4823fd5fb3b48a75650b2d9ac36846793d6f8153fab82176843b4ce13f240e87"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tracer.View_Tracer_VisibleChanged (cognitive 18): View_Tracer.View_Tracer_VisibleChanged 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":"codes/View_Tracer.vb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eac44bee9c80c8e9ae55908d88cd519c74196f6c32e8a0bda85b2c2de68785"}},{"ruleId":"D2","level":"warning","message":{"text":"Form_Main.LoadTreesDataToolStripMenuItem_Click (cognitive 16): Form_Main.LoadTreesDataToolStripMenuItem_Click has cognitive complexity 16 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: codes/Form_Main.vb holds 53 of the 149 methods over the threshold \u2014 including the worst \u2014 and 3377 of the 7350 points over it (46%), 2\u00D7 the next-largest file (codes/View_Tree.vb at 1675). 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":"codes/Form_Main.vb"},"region":{"startLine":3730}}}],"partialFingerprints":{"codehealthFindingId/v1":"2446415fbb22de1fe6cc70e9faeddb92aa4032d342eb9cf6c7c1a576c1ade8cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool_Omitted.export_omitted (cognitive 16): Tool_Omitted.export_omitted 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":"codes/Tool_Omitted.vb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b2a4a17e56a343ae97e28f4f831b126cecc6a39d90d01802c68647204f3343"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.load_color (cognitive 16): View_Tree.load_color 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":"codes/View_Tree.vb"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"748877a68f5bf20673fe9ef9ee7130b55ab12dcd01cd87b421f17a93776dea8a"}},{"ruleId":"D2","level":"warning","message":{"text":"View_Tree.IncreaseTreeToolStripMenuItem_Click (cognitive 16): View_Tree.IncreaseTreeToolStripMenuItem_Click 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":"codes/View_Tree.vb"},"region":{"startLine":3688}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7e7cfe817deaa0ce452e1a4ff25ebf4591bda5699c855388c2375d43f9260e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: codes/View_Tree.vb: FileTooLong \u2014 3503 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3003 over it, 7.01\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":"codes/View_Tree.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d8953b1c36ef034aee85ae7b2bfb9ddabb5b5f1e03a7bc896a0f3dbe0495e1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config_Lagrange: ClassTooLong \u2014 1376 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 976 over it, 3.44\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":"codes/Config_Lagrange.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b125f1fc91d07417aed0f3b931abb61b34c78a3d6c99afe46cc1de4ea1a4ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Module_Brushes.str_to_color: MethodTooLong \u2014 str_to_color runs 339 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 239 over it, 3.39\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":"codes/Module_Brushes.vb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a50dadfab361d1353a43df5080854e4812f391668f884b23554deb9da8700a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: View_Tree.draw_tree: MethodTooLong \u2014 draw_tree runs 320 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 220 over it, 3.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c0d777c9c6a08c5a74d3bbc886206d0174200da08d4e7a5bc39f15f4ef64b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: codes/Config_BGB.vb: FileTooLong \u2014 1588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1088 over it, 3.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9351b73138f962451e46b948af31de9ffac44c8413180b203a9f1463a6b1732"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: codes/Config_Lagrange.vb: FileTooLong \u2014 1378 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 878 over it, 2.76\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":"codes/Config_Lagrange.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"590f92b33ae3920563fb6b09cc59927f062235a517b5c63632b839d08e3d3f64"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: View_Tree: TooManyMethods \u2014 3497 significant lines (blank, comment-only and punctuation-only lines excluded), 82 methods. The bar is 30 methods; this is 52 over it, 2.73\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":"codes/View_Tree.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d142840e38b0c4a196ae01a9121d3cf32aaa8acfe59201b5afb24a638d4d3fe5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: View_Tree.Global_Info: MethodTooLong \u2014 Global_Info runs 273 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 173 over it, 2.73\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":"codes/View_Tree.vb"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1bf0c25a0b8bb94074f2fea2c881bf08003a7255ca7cbaf024eda37561fc9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Batch_Tools.load_final_trees: MethodTooLong \u2014 load_final_trees runs 255 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 155 over it, 2.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Batch Tools.vb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa98933bebed3068394a39d5ce649d90bf80af5d96ee186764efb652c4a5bb5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: View_Tree.read_results: MethodTooLong \u2014 read_results runs 249 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 149 over it, 2.49\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":"codes/View_Tree.vb"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cff90081d2d5e308e3fecce23e51faa1aa6d7dc86a5d460d3fa5acab7c778df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_BGB.Button13_Click: MethodTooLong \u2014 Button13_Click runs 242 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\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":"codes/Config_BGB.vb"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ac212305d50f20e1ff60d3024e42c026f79f6061c19a6f7ee5bda5d36a0cce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tool_Combine.combine_result: MethodTooLong \u2014 combine_result runs 242 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\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":"codes/Tool_Combine.vb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd6f24b2db449d5e15526789573848e3df1ad8e992e15cc4dbbff2db473b687"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Module_Tree.Ploy_Tree.New(\u2026): MethodTooLong \u2014 New(\u2026) runs 236 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Module_Tree.vb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e668cabf5388fdec462c6f602db4fc8cda777538125b89ac03f75b4f3e5e8ad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: View_Tree.Read_Poly_Tree: MethodTooLong \u2014 Read_Poly_Tree runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42037fcc1592d611cbd3adb3e87cfd90430c0d9e7eb759f92c40df4e2945fd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_BGB.Read_Poly_Tree: MethodTooLong \u2014 Read_Poly_Tree runs 178 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\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":"codes/Config_BGB.vb"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dea3cc4a16c9d2939c7d949c665208c3035fc2c11c3fa266144ed3990f5adc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_Lagrange.Read_Poly_Tree: MethodTooLong \u2014 Read_Poly_Tree runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Lagrange.vb"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bb8f20210bb1de5147c50bf4a2d62062619b0d64849c423c1af4b32c70ccbc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tool_Omitted: ClassTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 284 over it, 1.71\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":"codes/Tool_Omitted.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e87c50bb41c9cc5512e99cb8d0ba13dc78860b16d1e1232dd8a9825a71a4cb7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tool_TvS.claculate_score: MethodTooLong \u2014 claculate_score runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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":"codes/Tool_TvS.vb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9516c496addc9a2a98e2a4972f4ef00e45545437c719b33249330505f8d8b56a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: View_Tree.Get_Info: MethodTooLong \u2014 Get_Info runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\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":"codes/View_Tree.vb"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7473011b8359685131a4717b8df796849cdf1b71efc3a30bde8be6423c555c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_BGB.Config_BGB_VisibleChanged: MethodTooLong \u2014 Config_BGB_VisibleChanged runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3331ee79a38b8cabe43ed1e5b0732c8f5fac1c42d6b703d08f59025abb381b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: View_Tree.Swap_tree: MethodTooLong \u2014 Swap_tree runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\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":"codes/View_Tree.vb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cf364586e9364044de6e71c9fcd29810a88277738c2b362a553b5758ad1d73"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_Lagrange.Lag_Config_VisibleChanged: MethodTooLong \u2014 Lag_Config_VisibleChanged runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Lagrange.vb"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11931e136fbcf24c16fbc542f8f30ee406221afa385185e6c90d3e1fb17afcd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_BGB.Button11_Click: MethodTooLong \u2014 Button11_Click runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\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":"codes/Config_BGB.vb"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1931a1f4c126fdb3777fc1ab306abe9ce13756f6bb9e8a57018f3f9ba50629"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_BayArea.Read_Poly_Tree: MethodTooLong \u2014 Read_Poly_Tree runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\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":"codes/Config_BayArea.vb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e34bfbe6652a302d3ddd5c5ec310ab31e7ed407cf009c3073df5a124c65a4b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_Lagrange.Button11_Click: MethodTooLong \u2014 Button11_Click runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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":"codes/Config_Lagrange.vb"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5456d2d00ae30638c4a28ec3940d5aab720c5a75782a631d8c5ee2167be9263"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tool_Combine.get_tree_length: MethodTooLong \u2014 get_tree_length runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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":"codes/Tool_Combine.vb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"21de99f47dc03aa032b796c639e12cea2716df998d44d7729d7b749ebaa7bdf9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: View_Tree.EventLine: MethodTooLong \u2014 EventLine runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"codes/View_Tree.vb"},"region":{"startLine":2823}}}],"partialFingerprints":{"codehealthFindingId/v1":"db71125eb471c53a89f401e4d594934abe612ab1b0fd11d450bbf11b524a5eaf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_BGB.Read_LG_Tree: MethodTooLong \u2014 Read_LG_Tree runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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":"codes/Config_BGB.vb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a053a15b2ce4a80d2d464746473d046ca9e8acc2996b8ec1130ab4c12ea6cf6b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_Lagrange.Read_LG_Tree: MethodTooLong \u2014 Read_LG_Tree runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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":"codes/Config_Lagrange.vb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"084328da6dcefdbd38eb44d04ae82c0f334f628745434546e1f43564bdcf82fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: codes/Tool_Omitted.vb: FileTooLong \u2014 687 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 187 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Omitted.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe87197269e7b52c17ac419526f9c16e2718ec020b905fa65dc688768a337ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: View_Tree.Swap_Whole: MethodTooLong \u2014 Swap_Whole runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"codes/View_Tree.vb"},"region":{"startLine":3429}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bf4ce33466e389fab44aae4699b3e6e45643b3686c18fd75d36d19ecad0ab1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_BBM.Button1_Click: MethodTooLong \u2014 Button1_Click runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"codes/Config_BBM.vb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c24c708b3aff45cfc7575d62b7c96b41a283ce3daa9d36018acd42ce78f429d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_Lagrange.Button3_Click: MethodTooLong \u2014 Button3_Click 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":"codes/Config_Lagrange.vb"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b9b18de260672cc791a2cc3447f01a9d7ee18dde87cd7630afe02d1c80983a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_Lagrange.Button10_Click: MethodTooLong \u2014 Button10_Click runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Lagrange.vb"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"df87a6067e813bd20112b03a484f644c20226ba891f809a11ecb473d7eef7afd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: View_Dis.cal_column: MethodTooLong \u2014 cal_column runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Dis.vb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb80ea7b84c7605d9c3614d763339d179d23e2b1cd0a71dd55d66ab95b0623d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tool_Combine: ClassTooLong \u2014 480 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 80 over it, 1.20\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":"codes/Tool_Combine.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e47c1455fd6d5efbaaba747afe96a7ceaeea7a0bb31fdbf5f19a4353a7d378"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config_SDIVA: ClassTooLong \u2014 475 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 75 over it, 1.19\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":"codes/Config_SDIVA.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5313eaf5e48ca98690b6fc5d0b0a5b7bed9b94e95d45e0827a05110820223351"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config_BGB: TooManyMethods \u2014 1586 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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":"codes/Config_BGB.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ee4b535d294dd6d617916bd97a9b22853a886d1070032a4287ebbce152219f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config_BGB.read_time_period: MethodTooLong \u2014 read_time_period runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"codes/Config_BGB.vb"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"c676f64159455cd3f55e6749a801399205116f68e0e21a95fe0022a37e26a1c6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tool_TvS: ClassTooLong \u2014 452 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 52 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_TvS.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0b7c35fe18e6c97e038b2d17a4bc2621443cc3d66a6d23d2911fed4c4f6f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tool_SvT.find_best_tree: MethodTooLong \u2014 find_best_tree runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_SvT.vb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6603e0bde461334a64bf95aa803df462822d98dd81e4d48eabb82752832845d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: View_Tree.Form1_Load: MethodTooLong \u2014 Form1_Load runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba8ff3ab5a01c74dca13fb1159ad05541c98bb22138adeba9685124a781a512"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config_Chrom: ClassTooLong \u2014 443 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 43 over it, 1.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Chrom.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd0c46b62f0f56eff98ed9b125edb2a390730a8f959a815b2b2c37b2d19373d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Module_Var.Read_Poly_Node: MethodTooLong \u2014 Read_Poly_Node runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"codes/Module_Var.vb"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"528394c77c50236433866f406c1b434cc0f6fc3627cc8fcd110935bbfeb2926b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config_Traits: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 30 over it, 1.08\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":"codes/Config_Traits.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23435287c6bbba39c9a379cb5cf9cd22ce3c988f3e6b32b7340d3a0d99a4847"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config_BayArea: ClassTooLong \u2014 422 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 22 over it, 1.06\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":"codes/Config_BayArea.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7310a5d7bcd727997879e2753fb904b5a17df8c2b620154ad5d9038db45a850"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: View_Dis: ClassTooLong \u2014 412 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 12 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":"codes/View_Dis.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b8563c94a816aedea3c5d7bb4ff7a6a2acf5166537c4e98a030d690b7a9a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (7 members, 57 shared lines): codes/Config_BGB.vb:142-284 | codes/Config_BGB.vb:470-653 | codes/Config_BayArea.vb:128-281 | codes/Config_Lagrange.vb:143-285 | codes/Config_Lagrange.vb:612-794 | codes/Tool_Combine.vb:11-160 | codes/View_Tree.vb:234-447 \u2014 These 7 members are variants of one another: a block of 57 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fdaf3f80a40f3d3240ddecbcb57734e61494719b2b743a87b5b6c9ce0d4bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (7 members, 43 shared lines): codes/Config_BGB.vb:142-284 | codes/Config_BGB.vb:470-653 | codes/Config_BayArea.vb:128-281 | codes/Config_Lagrange.vb:143-285 | codes/Config_Lagrange.vb:612-794 | codes/Module_Var.vb:240-350 | codes/View_Tree.vb:234-447 \u2014 These 7 members are variants of one another: a block of 43 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7591d555411d4f87513113a8a4039aaef3f169c9c289199a5573d788e49dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 40 shared lines): codes/Config_BGB.vb:142-284 | codes/Config_BayArea.vb:128-281 | codes/Config_Chrom.vb:12-84 | codes/Config_Lagrange.vb:143-285 | codes/Config_Lagrange.vb:612-794 \u2014 These 5 members are variants of one another: a block of 40 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"37724a68ee3ecbe1421739bb3b54ab65866c3608934b21b6729e3e2c2bd3cf13"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (102 shared lines): codes/View_Tree.vb:1688-1984 | codes/View_Tree.vb:1987-2174 \u2014 These two members are variants of one another: 102 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bf619e4cd53dd2ea7696c0bee3316bf1fd9443c938c3ed5594e8e58e98171c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (22 members, 50\u002B identical tokens): codes/View_Tree.vb:536-653 | codes/View_Tree.vb:1193-1216 | codes/View_Tree.vb:1581-1625 | codes/View_Tree.vb:1636-1662 | codes/View_Tree.vb:2501-2534 | codes/View_Tree.vb:2539-2555 | codes/View_Tree.vb:2562-2568 | codes/View_Tree.vb:2573-2587 | codes/View_Tree.vb:2591-2605 | codes/View_Tree.vb:2611-2652 | codes/View_Tree.vb:3101-3111 | codes/View_Tree.vb:3115-3124 | codes/View_Tree.vb:3130-3137 | codes/View_Tree.vb:3144-3151 | codes/View_Tree.vb:3228-3254 | codes/View_Tree.vb:3277-3291 | codes/View_Tree.vb:3413-3427 | codes/View_Tree.vb:3612-3634 | codes/View_Tree.vb:3651-3658 | codes/View_Tree.vb:3662-3685 | codes/View_Tree.vb:3689-3720 | codes/View_Tree.vb:3834-3846 \u2014 These 22 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 22 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 22 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"caab53d1ef110a3c2307302ca78eaf6a94576497af59d70681082993fc22f2fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (17 members, 50\u002B identical tokens): codes/Config_Traits.vb:423-460 | codes/Form_Main.vb:5882-5940 | codes/Form_Main.vb:7503-7800 | codes/Form_Main.vb:8224-8323 | codes/Form_Main.vb:8327-8424 | codes/Form_Main.vb:8428-8526 | codes/Form_Main.vb:8530-8601 | codes/Form_Main.vb:8605-8652 | codes/Form_Main.vb:8657-8701 | codes/Form_Main.vb:8706-8727 | codes/Form_Main.vb:8731-8756 | codes/Form_Main.vb:8761-8817 | codes/Form_Main.vb:9020-9061 | codes/Form_Main.vb:9106-9154 | codes/Form_Main.vb:9157-9227 | codes/Form_Main.vb:9314-9389 | codes/Form_Main.vb:9522-9566 \u2014 These 17 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 17 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 17 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Traits.vb"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"7660ff0b95df939a0ace98db2ec9f0c493b632d5b5ff09fcb79124fba06d1a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): codes/Config_Chrom.vb:223-305 | codes/Config_Traits.vb:242-336 | codes/Form_Main.vb:1742-2283 | codes/Form_Main.vb:3836-3953 | codes/Form_Main.vb:3956-4111 | codes/Form_Main.vb:4990-5162 | codes/Form_Main.vb:5966-6161 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Chrom.vb"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc5f1b4a71bda5727f18496566be94a80934907ba5986be1fc849fe7b9af45d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): codes/Config_BGB.vb:656-678 | codes/Config_BayArea.vb:284-306 | codes/Config_Lagrange.vb:798-820 | codes/Form_Main.vb:6826-6842 | codes/View_Tree.vb:511-527 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"55951c33988cecd0486e79adf894657c7e6c0a105b900a21ab2150903a03cc68"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): codes/Config_BGB.vb:692-747 | codes/Config_BGB.vb:750-797 | codes/Config_BGB.vb:1480-1503 | codes/Config_Lagrange.vb:834-886 | codes/Config_Lagrange.vb:890-932 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff30b2551186924c67566a373322f8f2679881fe1c9f4b3089007d3df928865"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): codes/Form_Main.vb:445-1059 | codes/Form_Main.vb:2287-2500 | codes/Form_Main.vb:2503-2730 | codes/Form_Main.vb:5223-5321 | codes/Form_Main.vb:5324-5816 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"5927aa3a9a5dcc11fd9144541d4f0f86a24ae0933c5e0abd4fbc958b4afede21"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): codes/Module_Stat.vb:133-143 | codes/Module_Stat.vb:148-158 | codes/Module_Stat.vb:163-173 | codes/Module_Stat.vb:178-188 | codes/Module_Stat.vb:193-203 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Module_Stat.vb"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6545c6f35df40a83e91899b8dfd7bdfa75e2866af40fdc62fdc96855fd25024d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): codes/Form_Main.vb:8081-8125 | codes/Form_Main.vb:8224-8323 | codes/Form_Main.vb:8327-8424 | codes/Form_Main.vb:8428-8526 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":8081}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea11842e00edc4af4fa6e6405ba2fdb35a02c27343f704433d0c3f82fb396b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): codes/View_Dis.vb:297-338 | codes/View_Pie.vb:221-256 | codes/View_Tree.vb:2457-2497 | codes/View_Tree.vb:3163-3204 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Dis.vb"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dd4f93331d9dacec0f46048c269ff821004320864ca75029b8dce96c44c03e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (106 lines \u00D7 2): codes/Form_Main.vb:587-692 | codes/Form_Main.vb:792-897 \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":"codes/Form_Main.vb"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58af845533701b2f22a3454d5ebff4d60666471f6c7c83f7714fd8db67915d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (106 lines \u00D7 2): codes/Form_Main.vb:5441-5546 | codes/Form_Main.vb:5606-5711 \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":"codes/Form_Main.vb"},"region":{"startLine":5441}}}],"partialFingerprints":{"codehealthFindingId/v1":"494c7ae050d868a7ff868a1e280fd99f89c3f947ea81a3bc282a5e608e58262c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (76 lines \u00D7 2): codes/Config_BGB.vb:1120-1195 | codes/Config_Lagrange.vb:1237-1312 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f93fe640527ca9d8c457ba3d627db1cfec3c46f7d98d7043faa442c8139d7aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): codes/Config_BGB.vb:1060-1118 | codes/Config_Lagrange.vb:1177-1235 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a0dad5156a2004e37319ea99854d31a2cc7936c41b71fa2ce5ed01efbfaaaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58\u201359 lines \u00D7 2): codes/Form_Main.vb:694-751 | codes/Form_Main.vb:899-957 \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":"codes/Form_Main.vb"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f932690e47d928e7af5acfaeaa866862ddfbba4286efd6011c8d8c577d41066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55\u201356 lines \u00D7 2): codes/Form_Main.vb:5548-5602 | codes/Form_Main.vb:5713-5768 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":5548}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d54b374dac3538722622001b73191a308920ec7af43d7cabae92ac9d1e52cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52\u201353 lines \u00D7 2): codes/Config_BGB.vb:695-747 | codes/Config_Lagrange.vb:835-886 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"1919214e6ee4df41a6721965217e0f3f0d0c0af3955be82dc21feb38b3bfd520"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): codes/Form_Main.vb:3957-4007 | codes/Form_Main.vb:5967-6017 \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":"codes/Form_Main.vb"},"region":{"startLine":3957}}}],"partialFingerprints":{"codehealthFindingId/v1":"981903bea87280220447ecbf8ae91d2c1d4d4c003ce3e182d69d116c6635ddf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201347 lines \u00D7 2): codes/View_Tree.vb:1792-1835 | codes/View_Tree.vb:2082-2128 \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":"codes/View_Tree.vb"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2581c38a163e74410d968b6fe53e67c422790279c5f0a0525d8612640377d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201339 lines \u00D7 2): codes/Config_BGB.vb:753-791 | codes/Config_Lagrange.vb:891-928 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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, \u0060codes/Config_BGB.vb:793\u0060 calls \u0060Columns\u0060 and \u0060codes/Config_Lagrange.vb:929\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":"codes/Config_BGB.vb"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0aab797de03766617cb19e5eece9c20bf9ddb122f7eff18245c4069f0012c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): codes/Form_Main.vb:9183-9221 | codes/Form_Main.vb:9341-9379 \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":"codes/Form_Main.vb"},"region":{"startLine":9183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b39e29322ac489065ee905769bc973a303857a3c9944ed238435b225d4aeb46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): codes/Form_Main.vb:5245-5280 | codes/Form_Main.vb:5395-5430 \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":"codes/Form_Main.vb"},"region":{"startLine":5245}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ec8e660e38b77e4950d297ac7653ef85481b0318946340783f0905a3f5bf91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): codes/Config_BGB.vb:822-856 | codes/Config_Lagrange.vb:948-982 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"5521c7022877556e519591e10c065463c697c98d6c2e5481526e867f32712a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): codes/Form_Main.vb:4079-4111 | codes/Form_Main.vb:6129-6161 \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":"codes/Form_Main.vb"},"region":{"startLine":4079}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a41928d41fa8973fac18e88d12ac4beb43651a8cd349c9c34e6294f9982c13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 3): codes/Config_BGB.vb:174-204 | codes/Config_Lagrange.vb:175-205 | codes/Tool_Combine.vb:50-80 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2502a1964d2b9b888ba8d877f73577931cc785fc7a3b3d4c67938abc444118a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): codes/Form_Main.vb:4047-4076 | codes/Form_Main.vb:6095-6124 \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":"codes/Form_Main.vb"},"region":{"startLine":4047}}}],"partialFingerprints":{"codehealthFindingId/v1":"804ac567b81ed67b45e1321bcd67114b3f4093cad26c2c97e5b119601b8a1b97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): codes/Form_Main.vb:4162-4192 | codes/Form_Main.vb:6198-6228 \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":"codes/Form_Main.vb"},"region":{"startLine":4162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2875cc97139fc0d6188ca9d3de69adf9590f36fa383dde627c9a604eff104a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 9): codes/Config_BGB.vb:156-185 | codes/Config_BGB.vb:489-518 | codes/Config_BayArea.vb:146-175 | codes/Config_Chrom.vb:30-59 | codes/Config_Lagrange.vb:157-186 | codes/Config_Lagrange.vb:630-659 | codes/Module_Var.vb:252-281 | codes/Tool_Combine.vb:32-61 | codes/View_Tree.vb:259-288 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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":"codes/Config_BGB.vb"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fb26f627e35b52429c6a27ba23083326ec5da6453db00246f61fcb9ef3692c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): codes/Form_Main.vb:8284-8314 | codes/Form_Main.vb:8386-8415 \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":"codes/Form_Main.vb"},"region":{"startLine":8284}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a6430fedfa03e67327fb7a3480c06e6ae45d296f9c65aff8648b2f32d797bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): codes/Form_Main.vb:2149-2173 | codes/Form_Main.vb:2248-2272 \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":"codes/Form_Main.vb"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cc1f4dee92dba904b1b801b60e18f79056d3b4875f9123c5d09045de0b1add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 2): codes/View_Tree.vb:1760-1786 | codes/View_Tree.vb:2052-2080 \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":"codes/View_Tree.vb"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f7300dc667a88d82702055c17ea2efc285d7620eda10dc287f4ee4edcb80cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): codes/Config_BGB.vb:1329-1354 | codes/Config_BGB.vb:1404-1431 \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 \u0060codes/Config_BGB.vb:1329\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":"codes/Config_BGB.vb"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fd70ce7c1471a65d1120f5d050cbf5a484c632a349ad4f93e9c1d4017dbbda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): codes/Form_Main.vb:4402-4428 | codes/Form_Main.vb:4519-4543 \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":"codes/Form_Main.vb"},"region":{"startLine":4402}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f02a34521fc3edc64450c470432da6d30ebbda517c60f5f89888fdf53c11dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): codes/Form_Main.vb:8667-8690 | codes/Form_Main.vb:9116-9141 \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":"codes/Form_Main.vb"},"region":{"startLine":8667}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4b597716d11f65de080125068ff968902b3ee697c19a2a5f1d35ce9be4492e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): codes/Form_Main.vb:8268-8291 | codes/Form_Main.vb:8370-8393 | codes/Form_Main.vb:8472-8495 \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":"codes/Form_Main.vb"},"region":{"startLine":8268}}}],"partialFingerprints":{"codehealthFindingId/v1":"6988120d54ace373f91df2a243aab1103996f39dc76b5f7b6a61eaf7e1368faa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): codes/Form_Main.vb:7396-7418 | codes/Form_Main.vb:7449-7471 \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":"codes/Form_Main.vb"},"region":{"startLine":7396}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc5858730f801256d693d0f4db63ffaa287c1befd52d0ddd63bb233a55900f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): codes/Tool_TvS.vb:348-371 | codes/Tool_TvS.vb:475-498 \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 \u0060codes/Tool_TvS.vb:348\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":"codes/Tool_TvS.vb"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"160c18db207400972d34692457697fb8b6bfea82a06171edda4e1b3f0f450261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): codes/Config_BGB.vb:656-678 | codes/Config_BayArea.vb:284-306 | codes/Config_Lagrange.vb:798-820 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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":"codes/Config_BGB.vb"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a41314eb041ec9cddd45df22cd0b0e2be96a3fe33b412ffbdc2b29d8d108d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): codes/Config_BGB.vb:84-106 | codes/Config_Lagrange.vb:82-104 | codes/Config_SDIVA.vb:81-103 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e90845f38fc319e0bb0d19ceada97ae59ebba747f721dfa933a4ab449e6d1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): codes/Form_Main.vb:495-516 | codes/Form_Main.vb:2529-2550 \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":"codes/Form_Main.vb"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f06a34192e9d6315754399e7d3a8caacd2637918ac07f0d9a2cb8ab069de653"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): codes/Form_Main.vb:2637-2658 | codes/Form_Main.vb:3148-3169 \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":"codes/Form_Main.vb"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"885e793b49cc0ce39db0377db8624d679c1317d63938c8a01ea75fc2a0b5725f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): codes/Config_BGB.vb:1576-1597 | codes/Config_Lagrange.vb:1356-1377 | codes/Config_SDIVA.vb:344-365 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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, \u0060codes/Config_Lagrange.vb:1378\u0060 calls \u0060Write\u0060 and \u0060codes/Config_BGB.vb:1598\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":"codes/Config_BGB.vb"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b274de67e87574d49b1ce740a3229ff5522af0ba1c00210073619f11f5ec7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): codes/Form_Main.vb:4128-4148 | codes/Form_Main.vb:6175-6196 \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":"codes/Form_Main.vb"},"region":{"startLine":4128}}}],"partialFingerprints":{"codehealthFindingId/v1":"883df1c9739cd302d46d450c535e9ff3a85a12e52530bd127e930a4c60927f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): codes/Form_Main.vb:8451-8471 | codes/Form_Main.vb:8784-8804 \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":"codes/Form_Main.vb"},"region":{"startLine":8451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87d13448bfa821286e7f4ec73a693be8cd00ae06f98e7a0802880907474b458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): codes/View_Tree.vb:3001-3021 | codes/View_Tree.vb:3024-3045 \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":"codes/View_Tree.vb"},"region":{"startLine":3001}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0768f9a8f6554b727946f4192a86389bd21f20f64fed9568ee897398f82900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 5): codes/Form_Main.vb:8246-8266 | codes/Form_Main.vb:8349-8369 | codes/Form_Main.vb:8621-8641 | codes/Form_Main.vb:9170-9190 | codes/Form_Main.vb:9328-9348 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":8246}}}],"partialFingerprints":{"codehealthFindingId/v1":"155faa0eaf42d207c39eb7de18685557815562b825f34edc05514c2795c69095"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): codes/View_BBM.vb:105-125 | codes/View_BBM.vb:154-174 \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, \u0060codes/View_BBM.vb:152\u0060 calls \u0060drawfig3\u0060 and \u0060codes/View_BBM.vb:104\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":"codes/View_BBM.vb"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c081a536fdbcf9341ae6a1fc166513145edf7bc100d5f336061451f07c24a282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 5): codes/Config_BGB.vb:255-272 | codes/Config_BGB.vb:598-615 | codes/Config_Lagrange.vb:256-273 | codes/Config_Lagrange.vb:739-756 | codes/View_Tree.vb:370-387 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedba1825f06499384556faa9f73c9a728b0f01538b86e44cc9b261b39e02b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): codes/View_BBM.vb:77-95 | codes/View_BBM.vb:131-150 | codes/View_BBM.vb:180-199 \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":"codes/View_BBM.vb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d78d8ea5976a25a6fd138508442c77a0e946379b5e03cf5b70fc988564ff51b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): codes/Form_Main.vb:5295-5313 | codes/Form_Main.vb:5786-5805 \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":"codes/Form_Main.vb"},"region":{"startLine":5295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b882272cdfc6119f5343b0bfa2b0131e246cdbe1a004e0f8a1e88939b458b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 9): codes/Form_Main.vb:5912-5930 | codes/Form_Main.vb:8239-8256 | codes/Form_Main.vb:8342-8359 | codes/Form_Main.vb:8444-8461 | codes/Form_Main.vb:8614-8631 | codes/Form_Main.vb:8777-8794 | codes/Form_Main.vb:9034-9051 | codes/Form_Main.vb:9163-9180 | codes/Form_Main.vb:9321-9338 \u2014 all 9 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":"codes/Form_Main.vb"},"region":{"startLine":5912}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f4dda683cb72ede570d1cd9ea5fb4bc1c6596ade9f39b5e51ea01daf502fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): codes/Form_Main.vb:6965-6982 | codes/Module_Var.vb:365-382 \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":"codes/Form_Main.vb"},"region":{"startLine":6965}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d538b4fd84f2dc0de1dac2bec2f1f2397136657b8429289aa89574eb914fde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): codes/Form_Main.vb:8876-8893 | codes/Form_Main.vb:8972-8989 \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, \u0060codes/Form_Main.vb:8894\u0060 calls \u0060MsgBox\u0060, \u0060ToString\u0060 and \u0060codes/Form_Main.vb:8990\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":"codes/Form_Main.vb"},"region":{"startLine":8876}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f8e77a1a9938e9d94693a9d98d32df6c55913b6171423bb2b90d792acbed36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): codes/Form_Main.vb:8088-8104 | codes/Form_Main.vb:8281-8297 | codes/Form_Main.vb:8383-8399 | codes/Form_Main.vb:8485-8501 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codes/Form_Main.vb:8502\u0060 calls \u0060StreamWriter\u0060, \u0060WriteLine\u0060, \u0060Close\u0060 and \u0060codes/Form_Main.vb:8299\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":"codes/Form_Main.vb"},"region":{"startLine":8088}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0ab53493e3553de346841d3863b51e7ef177ce9b75f0058b842b963f6ae783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): codes/Config_BGB.vb:531-547 | codes/Config_Lagrange.vb:672-688 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23261739c675807d305db704a9653b4a9f353429ef87af849e5ad184278bbbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): codes/Form_Main.vb:1352-1368 | codes/Form_Main.vb:1374-1391 \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":"codes/Form_Main.vb"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"246132eedfd509364a672c3d4367029ec530946550bc59569176115ce28f7021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): codes/Form_Main.vb:7190-7206 | codes/Form_Main.vb:7250-7266 \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, \u0060codes/Form_Main.vb:7267\u0060 calls \u0060old_tree_char\u0060 and \u0060codes/Form_Main.vb:7207\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":"codes/Form_Main.vb"},"region":{"startLine":7190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8609394cc519935f1d8ee2c9ecfd8f181d3218a1229b4889fee06bbfe326c8a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): codes/Tool_Cluster.vb:858-874 | codes/Tool_Cluster.vb:884-900 \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":"codes/Tool_Cluster.vb"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f8a95f1aa42128b3edc4d8aa2945318d8702539eca0c453e30f1ae3fd0afb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): codes/Config_BGB.vb:1605-1621 | codes/Config_Lagrange.vb:1384-1400 | codes/Config_SDIVA.vb:395-411 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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 before the matched lines, \u0060codes/Config_BGB.vb:1603\u0060 calls \u0060Write\u0060 and \u0060codes/Config_Lagrange.vb:1383\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":"codes/Config_BGB.vb"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0aaca5be1eb4d9cf89e1b4a01e79661fbd02ac139c78d68f112ecc57c64f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): codes/Tool_Cluster.vb:200-214 | codes/Tool_Cluster.vb:237-251 | codes/Tool_Cluster.vb:1055-1069 \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 \u0060codes/Tool_Cluster.vb:200\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codes/Tool_Cluster.vb:196\u0060 calls \u0060Replace\u0060 and \u0060codes/Tool_Cluster.vb:234\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":"codes/Tool_Cluster.vb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc1828d88cfe19ad3f23533fde1964cc2d6380d5755fba3aa53b2215f101ae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): codes/Form_Main.vb:481-497 | codes/Form_Main.vb:2302-2316 \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":"codes/Form_Main.vb"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8332197e9245bae6b99e9e2736a58d2686064cf409a76a861f83eb47dff03243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): codes/Form_Main.vb:6826-6842 | codes/View_Tree.vb:511-527 \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":"codes/Form_Main.vb"},"region":{"startLine":6826}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4fcade20f8f4556caeda69d7fa8e62db3b4a6a02179d37a5560eed174df18f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): codes/Tool_Cluster.vb:66-82 | codes/Tool_Cluster.vb:104-120 \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":"codes/Tool_Cluster.vb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8d0081b01117615a4f84b88145b0d5ba04ca3755afada9928acf676f58c756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): codes/Config_BGB.vb:230-245 | codes/Config_BGB.vb:573-588 | codes/Config_BayArea.vb:228-243 | codes/Config_Lagrange.vb:231-246 | codes/Config_Lagrange.vb:714-729 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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":"codes/Config_BGB.vb"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77a3dcb64315350eb73f2b71e585e96827963d9c63ab4c1fdd71b0bdf144a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codes/Config_BGB.vb:633-648 | codes/Config_Lagrange.vb:774-789 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"344d7b67accb9f377badbbfc63a9e03964e32b97ac4721ee5ecd2a078cdc86fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codes/Form_Main.vb:8706-8721 | codes/Form_Main.vb:8731-8746 \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":"codes/Form_Main.vb"},"region":{"startLine":8706}}}],"partialFingerprints":{"codehealthFindingId/v1":"561df792c3ba3331b11354deb958a812dd51ac3649da110b6068524b525cdaaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codes/Form_Main.vb:9111-9126 | codes/Form_Main.vb:9536-9551 \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":"codes/Form_Main.vb"},"region":{"startLine":9111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5d51c4eaae7e01473f2a4fd3e6f218e15c8ebb9001e9e5793e517692cf065b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): codes/Config_BGB.vb:210-224 | codes/Config_BGB.vb:553-567 | codes/Config_Lagrange.vb:211-225 | codes/Config_Lagrange.vb:694-708 | codes/View_Tree.vb:314-328 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd7871b0a097be5b5417fa546e64f29c4b15638e7fbcbf7794984f35d6d2a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): codes/Form_Main.vb:6294-6308 | codes/Form_Main.vb:6495-6509 | codes/Form_Main.vb:9392-9406 \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":"codes/Form_Main.vb"},"region":{"startLine":6294}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab59277575cce73c300dc3c503f21102a1b7ff9f93204460a9ecd9118d947eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): codes/Form_Main.vb:8710-8723 | codes/Form_Main.vb:8735-8748 | codes/Form_Main.vb:9134-9147 \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 after the matched lines, \u0060codes/Form_Main.vb:8749\u0060 calls \u0060get_tree_length\u0060, \u0060Substring\u0060 and \u0060codes/Form_Main.vb:9148\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":"codes/Form_Main.vb"},"region":{"startLine":8710}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc82f640d4e3b70a149c22fc55c213c88cf9067349289f523d6cd4f9545622ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): codes/Form_Main.vb:1843-1857 | codes/Form_Main.vb:1995-2009 \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":"codes/Form_Main.vb"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59d8cb9caebc580c9334e8881f5b5135761f46b5a2931c75cb309d03a5aadf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codes/Form_Main.vb:4032-4045 | codes/Form_Main.vb:6068-6081 \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":"codes/Form_Main.vb"},"region":{"startLine":4032}}}],"partialFingerprints":{"codehealthFindingId/v1":"461ae5c0af1900c206b58eeb03d649372e664fec5d88c3a98d9965f31114d53c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): codes/View_Pie.vb:74-87 | codes/View_Pie.vb:287-301 \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":"codes/View_Pie.vb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"331f67543e3818019cbcc1a0224f6554d66926ac26207253df20c0ff24147ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 7): codes/Config_BGB.vb:207-220 | codes/Config_BGB.vb:550-563 | codes/Config_BayArea.vb:202-215 | codes/Config_Lagrange.vb:208-221 | codes/Config_Lagrange.vb:691-704 | codes/Tool_Combine.vb:83-96 | codes/View_Tree.vb:311-324 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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, \u0060codes/Config_BayArea.vb:216\u0060 calls \u0060IsNumeric\u0060, \u0060tree_char\u0060 and \u0060codes/Config_BGB.vb:221\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":"codes/Config_BGB.vb"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53f45f4efd57f6722e21554998988b84245377b52110ddb5ddea903adcf541f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): codes/Config_BGB.vb:241-253 | codes/Config_BGB.vb:584-596 | codes/Config_Lagrange.vb:242-254 | codes/Config_Lagrange.vb:725-737 | codes/Tool_Combine.vb:117-129 | codes/View_Tree.vb:356-368 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2469db5c31047376232375d5340e5a051eab5ce1d1d530cc53ac33c29f0d5b98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): codes/View_Dis.vb:298-311 | codes/View_Tree.vb:2458-2470 | codes/View_Tree.vb:3164-3177 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Dis.vb"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e56a4f2b3175529775211696ac864a95bf521cd28b6575d4ed77582e3bfb127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codes/Config_BGB.vb:544-557 | codes/Form_Main.vb:6737-6750 \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":"codes/Config_BGB.vb"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0ecec3ba7f3c6e9aea5faafc62dac6b6ad35aa6185a888d99188fd57934816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): codes/Config_BGB.vb:883-895 | codes/Config_Lagrange.vb:1005-1017 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e51cfa1b7ef45bfc26ef58c2e044212c3f9f2aa8af8d1dd98c4cee8b7c6bd8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codes/Form_Main.vb:1405-1418 | codes/Tool_Omitted.vb:279-292 \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":"codes/Form_Main.vb"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"096bed3316c744bc00de7ca75b587c782c02eec113f42175e897308bf05c385f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codes/Form_Main.vb:3412-3425 | codes/Tool_Cluster.vb:957-970 \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":"codes/Form_Main.vb"},"region":{"startLine":3412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56b13fa6cf4706081d18095e710736c68e833537d5829a5c3ffa084b691d62a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codes/Form_Main.vb:5228-5241 | codes/Form_Main.vb:5330-5343 \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, \u0060codes/Form_Main.vb:5345\u0060 calls \u0060f_t_name\u0060 and \u0060codes/Form_Main.vb:5242\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":"codes/Form_Main.vb"},"region":{"startLine":5228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93920de5befe546051d35c3336ed3616f84ab8d71c3b6f72c50c44e42e0ad4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): codes/Tool_Omitted.vb:564-576 | codes/Tool_Omitted.vb:651-664 \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":"codes/Tool_Omitted.vb"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee9ac46bf5547d75488294f7a6f33e00f44f3fd42f4c4873a0441068eca5ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Tool_Omitted.vb:693-704 | codes/Tool_Omitted.vb:716-727 \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":"codes/Tool_Omitted.vb"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e879a5bea3661635f371ed0a340c01879366bd5600cc9426c09105b6376f9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): codes/View_Tree.vb:1745-1757 | codes/View_Tree.vb:2034-2046 \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, \u0060codes/View_Tree.vb:2047\u0060 calls \u0060CInt\u0060, \u0060Result_list\u0060 and \u0060codes/View_Tree.vb:1758\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":"codes/View_Tree.vb"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"f027c6860fe5929ad1a292752bd6de0ccd36583b28847edd278d3836b18a1fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 8): codes/Config_BGB.vb:240-252 | codes/Config_BGB.vb:583-595 | codes/Config_BayArea.vb:238-250 | codes/Config_Lagrange.vb:241-253 | codes/Config_Lagrange.vb:724-736 | codes/Form_Main.vb:6776-6787 | codes/Tool_Combine.vb:116-128 | codes/View_Tree.vb:355-367 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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":"codes/Config_BGB.vb"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb94f62c2f79a8d773b3cddd1cda4c686c615c59ee6e6e0bd83a5d7fc8b2ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7): codes/Config_BGB.vb:226-238 | codes/Config_BGB.vb:569-581 | codes/Config_BayArea.vb:224-236 | codes/Config_Lagrange.vb:227-239 | codes/Config_Lagrange.vb:710-722 | codes/Module_Var.vb:304-316 | codes/View_Tree.vb:341-353 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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":"codes/Config_BGB.vb"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d49fc690fa06628aa2d2201b63d6aef367db0728ede821de8f86c7699add0b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): codes/View_Dis.vb:298-310 | codes/View_Pie.vb:224-235 | codes/View_Tree.vb:2458-2469 | codes/View_Tree.vb:3164-3176 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codes/View_Pie.vb:224\u0060 calls \u0060FromImage\u0060 and \u0060codes/View_Dis.vb:298\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":"codes/View_Dis.vb"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a072568266db7819adae72370a113e3ec954f747deaac0536cb5a6fd812c612e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): codes/Config_BayArea.vb:128-140 | codes/Config_Chrom.vb:12-24 | codes/Config_Lagrange.vb:612-624 \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 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BayArea.vb"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9d1685bdae76fa5c7da2db082748ce6870af1c8fdf7e5c2e9ed0d12fa42d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): codes/Tool_Cluster.vb:744-755 | codes/Tool_Cluster.vb:769-780 | codes/Tool_Cluster.vb:1341-1353 \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":"codes/Tool_Cluster.vb"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5700a8f0db39e1e60be03de6db0842bb3fbe220e40fd23f705fbf56e6dfbd82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Batch Tools.vb:67-78 | codes/Batch Tools.vb:83-94 \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":"codes/Batch Tools.vb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"457f5b90e32f7a91bca5cbed9a3bd82b3b96858684862070998cf2f4ad56d071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Config_BBM.vb:188-198 | codes/Config_BBM.vb:209-219 \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, \u0060codes/Config_BBM.vb:207\u0060 calls \u0060WriteLine\u0060, \u0060Distributiton_to_Binary\u0060 and \u0060codes/Config_BBM.vb:186\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":"codes/Config_BBM.vb"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6936e991c052cb522423d5267389afad8b0a8560f99e404050ca0c8f8c5941ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Form_Main.vb:2415-2426 | codes/Form_Main.vb:2662-2673 \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":"codes/Form_Main.vb"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"716dade7e40a3cc361d2c8cd8f6b3e1eae71f18fa4c5a6e785cb2aa9041b4044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Form_Main.vb:5365-5376 | codes/Form_Main.vb:5380-5391 \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":"codes/Form_Main.vb"},"region":{"startLine":5365}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ca35f90b780bda82d63b5c1675fa8bcef638af4055159e0b3bff5c22cfdfc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): codes/Tool_Cluster.vb:185-196 | codes/Tool_Cluster.vb:1040-1052 \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":"codes/Tool_Cluster.vb"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79883f11672046af448089f6ad75a58f220cc9b5b8fe719104a344099951139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): codes/Tool_TvS.vb:121-133 | codes/Tool_TvS.vb:173-184 \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":"codes/Tool_TvS.vb"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9593bfd1bc745839e7bd26cd4e50675fd06159d3fc0f7c60abc2f7d7966572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): codes/View_Dis.vb:175-187 | codes/View_Dis.vb:189-201 \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":"codes/View_Dis.vb"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"95935acb09a2ade1f7b342d3e7e0985f3245dfbaa6ec61a5160d20145e3cfc56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): codes/View_Tree.vb:1649-1660 | codes/View_Tree.vb:3834-3846 \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":"codes/View_Tree.vb"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"65166b07b90de814546cb114d1c94ce40063fa92c4b9123058240bd33055a01a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): codes/View_Tree.vb:1712-1723 | codes/View_Tree.vb:1995-2007 \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":"codes/View_Tree.vb"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd13fe0e1f5fb57a65b5484701062b2cffaf4b4b67747c288102ed9c6a8f173"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): codes/Config_BGB.vb:36-47 | codes/Config_Lagrange.vb:34-45 | codes/Config_SDIVA.vb:29-40 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba34f4763695d918052cb7f3ecc16aa746d26e742dc792816c86db9bb42d73c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): codes/Form_Main.vb:1827-1839 | codes/Form_Main.vb:1976-1987 | codes/Form_Main.vb:2187-2198 \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":"codes/Form_Main.vb"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8c21bcee16c1378d13949d9ab526da3fd510735607efcc8e63e127ef9dc534"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Batch Tools.vb:242-252 | codes/Batch Tools.vb:267-277 \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":"codes/Batch Tools.vb"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"181cd8503eb77198aec27cfb3431a0fdec2bdc09ea6c9da359efad75b1a4cfc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): codes/Config_Traits.vb:123-133 | codes/Form_Main.vb:7117-7128 \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":"codes/Config_Traits.vb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2395dc85117e7add3712114d6305d8a76d30dd423d58ab96e7397a3234b2e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Form_Main.vb:574-584 | codes/Form_Main.vb:5428-5438 \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":"codes/Form_Main.vb"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d0d84783178e318c95cee67aacd9cb244db49c86a8fe2e4df64ebb8600bb63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Form_Main.vb:3045-3055 | codes/Form_Main.vb:3060-3070 \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":"codes/Form_Main.vb"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"17400b4ad8bb63b667dd7ae72a3442d8fb57beef8cff37978f8d7ff59edfd962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Form_Main.vb:5892-5903 | codes/Form_Main.vb:7367-7378 \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":"codes/Form_Main.vb"},"region":{"startLine":5892}}}],"partialFingerprints":{"codehealthFindingId/v1":"309a5c8afc9190470f47319500331fbced6fb1a262ae498d63ed933d46b0c4a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Form_Main.vb:7218-7229 | codes/Form_Main.vb:7280-7291 \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":"codes/Form_Main.vb"},"region":{"startLine":7218}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d1613b789e723e7721b6500223459b19213756898ea401f29b92bfd1e492ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Form_Main.vb:7379-7389 | codes/Form_Main.vb:7436-7446 \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":"codes/Form_Main.vb"},"region":{"startLine":7379}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5f95ba5dd9d34dd730d74c54f8f6925023b34a0d2d41145fb2b9e7f8360658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/Tool_TvS.vb:282-288 | codes/Tool_TvS.vb:416-422 \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":"codes/Tool_TvS.vb"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"da84e368b9c06932912618626ae478ddce098385dd1edccc80ca0f67f83bc0c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/View_Tree.vb:3668-3681 | codes/View_Tree.vb:3705-3716 \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":"codes/View_Tree.vb"},"region":{"startLine":3668}}}],"partialFingerprints":{"codehealthFindingId/v1":"276ebec17982618d2dc50d59ad866515148c48cbb5761efbf7d7bd8f5bd272e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): codes/Config_BGB.vb:215-225 | codes/Config_BGB.vb:558-568 | codes/Config_Lagrange.vb:216-226 | codes/Config_Lagrange.vb:699-709 | codes/Form_Main.vb:6751-6761 | codes/View_Tree.vb:319-329 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c11aa1bd47dc0191a133d36df39421b6340b462dcc89f1f57f5ad33e56c897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): codes/Form_Main.vb:500-510 | codes/Form_Main.vb:515-525 | codes/Form_Main.vb:2317-2327 | codes/Form_Main.vb:2331-2341 | codes/Form_Main.vb:2534-2544 | codes/Form_Main.vb:2549-2559 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codes/Form_Main.vb:2342\u0060 calls \u0060Replace\u0060 and \u0060codes/Form_Main.vb:526\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":"codes/Form_Main.vb"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58e5d16934f46a401383436e4f3177a54efaf42bbfe5b2b7277c27e6e7c6a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): codes/Config_BGB.vb:881-891 | codes/Config_Lagrange.vb:307-317 | codes/Config_Lagrange.vb:1003-1013 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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 before the matched lines, \u0060codes/Config_BGB.vb:880\u0060 calls \u0060write_time_period\u0060 and \u0060codes/Config_Lagrange.vb:306\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":"codes/Config_BGB.vb"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"309d69718ae7d6890492f05bbdafd54aab5e26f10c40e003a4a4526b042f1fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): codes/Form_Main.vb:460-470 | codes/Form_Main.vb:5228-5238 | codes/Form_Main.vb:5330-5340 \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 after the matched lines, \u0060codes/Form_Main.vb:471\u0060 calls \u0060StreamWriter\u0060 and \u0060codes/Form_Main.vb:5239\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":"codes/Form_Main.vb"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"56380f0cc80948681f3b089067a4ce19a1833f551d04a07d5701f2ebf9471c9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): codes/Form_Main.vb:8546-8555 | codes/Form_Main.vb:9111-9120 | codes/Form_Main.vb:9536-9545 \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":"codes/Form_Main.vb"},"region":{"startLine":8546}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea957fcc9349bfb7fd45a01c067f09fc611a757a19064be215a1195ce4325ad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Config_BGB.vb:623-630 | codes/Config_Lagrange.vb:764-771 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"8229d396479c4dbf8db28bc3285e9837e2b584ae3cb055bf81e8cde1dfc809f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 4): codes/Form_Main.vb:754-764 | codes/Form_Main.vb:960-970 | codes/Form_Main.vb:2440-2443 | codes/Form_Main.vb:2616-2619 \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":"codes/Form_Main.vb"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"c086540f9eab5fba0ed7caab8fa45fa1cc167385f27f9db246b97232ba6a4b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Form_Main.vb:2511-2521 | codes/Form_Main.vb:3022-3032 \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":"codes/Form_Main.vb"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"0165dad9a5893ef07d913a61b3f7a95a7ed13d3e544d2da7cbd94358474bb27d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Form_Main.vb:4115-4125 | codes/Form_Main.vb:6164-6174 \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":"codes/Form_Main.vb"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4334a4b8e8b52653cacbe87fc42b304d2e794813f10f64a15c645015ffc75fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): codes/Form_Main.vb:6034-6044 | codes/Form_Main.vb:6064-6072 \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":"codes/Form_Main.vb"},"region":{"startLine":6034}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adb1b5f5845edddc1322b491fdd9e1fa6a907a03adc2fedd2abc0f135e2fb13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Form_Main.vb:8224-8234 | codes/Form_Main.vb:8327-8337 \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":"codes/Form_Main.vb"},"region":{"startLine":8224}}}],"partialFingerprints":{"codehealthFindingId/v1":"46af987c9268fdf9ea0b1f7f83b8d102390d6c6dbd7c9fba087a64faddd5f5ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): Codes/Module_BBM.vb:92-102 | Codes/Module_BBM.vb:103-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Codes/Module_BBM.vb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d366e66426e51bc4b9f83e2ac0fcb30441d880a32cdbadcb5d62550f921839cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Module_Stat.vb:133-142 | codes/Module_Stat.vb:148-157 \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":"codes/Module_Stat.vb"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce98f48fe28402328653e8d08f84c314a523ce60c69b44cdf16f1e1580677519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Tool_Omitted.vb:217-227 | codes/Tool_Omitted.vb:230-240 \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":"codes/Tool_Omitted.vb"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb09a1be2b6ba65b2c96952da9bf73a78fb939dc7e9deec5f31c2e5adb64fb0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/View_Tree.vb:181-189 | codes/View_Tree.vb:194-202 \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":"codes/View_Tree.vb"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"074c23e93b7d8b8c68b0c502d1886675d1060fe8b9755255383fa0887567cf34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/View_Tree.vb:678-688 | codes/View_Tree.vb:1178-1188 \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":"codes/View_Tree.vb"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8c9a74ee92dd96b4befaf196aec499d652d79974daccce22f9de302b1e5264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/View_Tree.vb:3515-3523 | codes/View_Tree.vb:3527-3535 \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":"codes/View_Tree.vb"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"89629a6b9af6a0683bf65d4070f284b8c7362161af5e59f429770c0fee09f071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): codes/Config_BGB.vb:207-215 | codes/Config_BGB.vb:550-558 | codes/Config_BayArea.vb:202-210 | codes/Config_Lagrange.vb:208-216 | codes/Config_Lagrange.vb:691-699 | codes/Form_Main.vb:6743-6751 | codes/Tool_Combine.vb:83-91 | codes/View_Tree.vb:311-319 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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":"codes/Config_BGB.vb"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9d3fe961d4375f85f389f0a09abe45e2d79a577bc6377faac3269a7c61d6d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 6): codes/View_Tree.vb:1199-1208 | codes/View_Tree.vb:2546-2555 | codes/View_Tree.vb:2576-2584 | codes/View_Tree.vb:2594-2602 | codes/View_Tree.vb:3231-3240 | codes/View_Tree.vb:3622-3631 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79aa3630218e900efc95809011dc3e07c0cdda71a22e2454de031138213792a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): codes/Config_BGB.vb:144-153 | codes/Config_BayArea.vb:134-143 | codes/Config_Chrom.vb:18-27 | codes/Config_Lagrange.vb:145-154 | codes/Config_Lagrange.vb:618-627 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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":"codes/Config_BGB.vb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c5323f4b732453e1bef96b838ac8cccaa0b14fdb0122f7d42c736debb5bb8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): codes/View_Tree.vb:3415-3424 | codes/View_Tree.vb:3673-3682 | codes/View_Tree.vb:3708-3717 \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":"codes/View_Tree.vb"},"region":{"startLine":3415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a7f51b709b59c74e615dcf6eff65e71a3916e3dba951180297a56e2e4754ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Config_BBM.vb:12-20 | codes/Config_Traits.vb:10-18 \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":"codes/Config_BBM.vb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ad14a64185e67c5fecb7dd0ce16ac9579750933ad3824aecf507cae65128fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Config_BGB.vb:479-486 | codes/Form_Main.vb:6683-6690 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codes/Config_BGB.vb:487\u0060 calls \u0060tree_char\u0060 and \u0060codes/Form_Main.vb:6691\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":"codes/Config_BGB.vb"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b01f50fc4ef095100cdc5b668c1be6048b0992a3ca46377239f3adc2027e25b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Config_BGB.vb:693-703 | codes/Config_BGB.vb:751-760 \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":"codes/Config_BGB.vb"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f90a99ea7df86b0e9b126e81337238ee6c5e8eba7b3ed7fb8d591cdb29e7bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Form_Main.vb:1163-1173 | codes/Form_Main.vb:1953-1962 \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":"codes/Form_Main.vb"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a383f3d5ba704c69ac18405c8439a9c07c5960f9bf2df9a10b0a658f377af87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Form_Main.vb:3495-3503 | codes/Form_Main.vb:3646-3654 \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":"codes/Form_Main.vb"},"region":{"startLine":3495}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0d4057036513d2fe06f60cdbd092ee7e67042f69a280862853fe23eaebbee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Form_Main.vb:4012-4020 | codes/Form_Main.vb:4028-4036 \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":"codes/Form_Main.vb"},"region":{"startLine":4012}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1cc8db0ee9c74b8ac2af38f803bb2e61e93454165f7287357ba28526b89e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Module_Stat.vb:164-172 | codes/Module_Stat.vb:179-187 \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":"codes/Module_Stat.vb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"33703d16fd50628a8183b11221d1233c694fa8626f0188e321ee162d959b8ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Tool_DPP.vb:243-251 | codes/View_Tree.vb:3393-3401 \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":"codes/Tool_DPP.vb"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d2b7e025bb42359c36782903419b4c21d77d511cef18978a08eba1646e14ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Tool_Omitted.vb:167-175 | codes/Tool_Omitted.vb:179-187 \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":"codes/Tool_Omitted.vb"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8024fc015cfc7bc2efd9c2f7c0c6263f6279a37b573521f726a417fe5471310f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Tool_SvT.vb:265-274 | codes/Tool_TvS.vb:376-385 \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":"codes/Tool_SvT.vb"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"12477bc611a15e52651bddfdf5856a1e4d2e44661ede30a369b9afab2a6a93ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): codes/Config_BGB.vb:663-671 | codes/Config_BayArea.vb:291-299 | codes/Config_Lagrange.vb:805-813 | codes/Form_Main.vb:6830-6838 | codes/View_Tree.vb:515-523 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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":"codes/Config_BGB.vb"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e339776a76ffb124c6df2e5517b1bee81e948c4bccbf6f90ed69f040104116c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): codes/Module_Stat.vb:133-140 | codes/Module_Stat.vb:148-155 | codes/Module_Stat.vb:163-170 | codes/Module_Stat.vb:178-185 | codes/Module_Stat.vb:193-200 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Module_Stat.vb"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d310b62b827bee9f54a399c512fd9c695e5cd825a439f682fe4edc89944334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20139 lines \u00D7 6): codes/Form_Main.vb:6015-6023 | codes/Form_Main.vb:6025-6025 | codes/Form_Main.vb:6045-6053 | codes/Form_Main.vb:6055-6055 | codes/Form_Main.vb:6079-6087 | codes/Form_Main.vb:6089-6089 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codes/Form_Main.vb:6025\u0060 calls \u0060new_list\u0060, \u0060Val\u0060, \u0060p_list\u0060 and \u0060codes/Form_Main.vb:6027\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":"codes/Form_Main.vb"},"region":{"startLine":6015}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c828759bc28be3cb80e962017479fb6876436040d32d9a3f5710673d2987c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): codes/Form_Main.vb:6036-6044 | codes/Form_Main.vb:6066-6072 | codes/Form_Main.vb:6093-6099 \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":"codes/Form_Main.vb"},"region":{"startLine":6036}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f905c5803d90bf9e5e85ba1c4d6e3b990c72405f73da2e61f933b4ceeaaf0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): codes/Form_Main.vb:8228-8235 | codes/Form_Main.vb:8331-8338 | codes/Form_Main.vb:8766-8773 \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":"codes/Form_Main.vb"},"region":{"startLine":8228}}}],"partialFingerprints":{"codehealthFindingId/v1":"24969c1fb386916dde661b974a137cb4a2eac20609f45738080bcc3ac7ef7616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): codes/Tool_Cluster.vb:188-196 | codes/Tool_Cluster.vb:227-235 | codes/Tool_Cluster.vb:1043-1052 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codes/Tool_Cluster.vb:196\u0060 calls \u0060Replace\u0060 and \u0060codes/Tool_Cluster.vb:235\u0060 does not \u2014 after which the two agree again for 5 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":"codes/Tool_Cluster.vb"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59b6749bacde8fadcee984dc1f835047f88cffd425b94ff5782ec8b342c9693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Form_Main.vb:2917-2925 | codes/Form_Main.vb:7081-7090 \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":"codes/Form_Main.vb"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea457c5878de150d4bea76e0e1a5e2255b2750285eb6f08db692265ec6d15721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Form_Main.vb:4016-4023 | codes/Form_Main.vb:6040-6047 \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":"codes/Form_Main.vb"},"region":{"startLine":4016}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea30497d0a41f683519bfc5b3a977065e16643402a4665cf13526a2880a03996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Form_Main.vb:8860-8867 | codes/Form_Main.vb:8919-8926 \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":"codes/Form_Main.vb"},"region":{"startLine":8860}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bb8f271d2e1fa95b8fa04f021cb7a18ae4d39b0801e6e889032e8f8b9be828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Form_Main.vb:9302-9310 | codes/Tool_TvS.vb:270-278 \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":"codes/Form_Main.vb"},"region":{"startLine":9302}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f28b257ceb14f6a224930e8d6ca9d57c651707344dabb72d1c0b3d01c925b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/View_Tree.vb:1585-1593 | codes/View_Tree.vb:1611-1619 \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":"codes/View_Tree.vb"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48d9192e3eabfa9a7d4b7140acee9d367e6088984aa8d7b62963219a1e36344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): codes/Config_BGB.vb:270-277 | codes/Config_BGB.vb:613-620 | codes/Config_BayArea.vb:252-259 | codes/Config_Lagrange.vb:271-278 | codes/Config_Lagrange.vb:754-761 | codes/Tool_Combine.vb:146-153 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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":"codes/Config_BGB.vb"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec7a421938f1fd08f69f86de0d981a28614571ae6e37e7e9522190bced9f9b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20138 lines \u00D7 5): codes/Config_BGB.vb:524-531 | codes/Config_BayArea.vb:181-188 | codes/Config_Chrom.vb:65-69 | codes/Config_Lagrange.vb:665-672 | codes/View_Tree.vb:293-298 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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":"codes/Config_BGB.vb"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0906e7bd6b8638519711e25afb297b629d4e813d19543e88a912f16399b8c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): codes/Config_BGB.vb:192-199 | codes/Config_Lagrange.vb:193-200 | codes/Tool_Combine.vb:68-75 | codes/View_Tree.vb:295-302 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"012b5672ab21c7c755a4b46fe6ca251519a3a6e780fef3b74173a26e6ed0a01e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): codes/Config_BGB.vb:713-720 | codes/Config_BGB.vb:1493-1500 | codes/Config_Lagrange.vb:853-860 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3c29d115624045f4a77f3753d5dbeac14b6a080cf46fcc8261bbb9a4412482"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Config_BGB.vb:109-116 | codes/Config_BGB.vb:288-295 \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":"codes/Config_BGB.vb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f14fa2fac388de83a45e9ab520f8d68badea4391dbd5393031e05d3905d2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/Config_BGB.vb:1296-1302 | codes/Config_Lagrange.vb:394-400 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fd40d526f17cdc86b54ad7b7c918bf5745f8fa017d2c75211ca9483a734d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Form_Main.vb:2347-2352 | codes/Form_Main.vb:2565-2570 \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":"codes/Form_Main.vb"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf4587614b91655eb8fd6adac3eaedf76d2f2233fbe8986637865816b1ac573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Form_Main.vb:2347-2352 | codes/Form_Main.vb:5395-5400 \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":"codes/Form_Main.vb"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aee76ec58a8f52809d6c8e6ec5c1c1a0926954ae82e891f1822f02b1ac92d01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Form_Main.vb:7903-7910 | codes/Form_Main.vb:7972-7979 \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":"codes/Form_Main.vb"},"region":{"startLine":7903}}}],"partialFingerprints":{"codehealthFindingId/v1":"649a8e2cc84a0b20cf4538ec69766ba3a4d555e942945ac3871b9f14c0c8c125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Tool_Cluster.vb:16-24 | codes/Tool_Cluster.vb:85-92 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Cluster.vb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfd2c7b8024ea787219bb3ae88569d256fcfcb4aa87178c09e06608c40b88b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Tool_Cluster.vb:405-413 | codes/Tool_Cluster.vb:554-561 \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":"codes/Tool_Cluster.vb"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6c2c97b0bfa5da0fb4efad1dd2e739cd2fb1b59abc31f0e1e0d1d36ce6dddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Tool_TvS.vb:134-141 | codes/Tool_TvS.vb:186-193 \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, \u0060codes/Tool_TvS.vb:194\u0060 calls \u0060Item\u0060 and \u0060codes/Tool_TvS.vb:142\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":"codes/Tool_TvS.vb"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb2d8328a11da08fe6f56c9ef0d1d2ab94aa842914a1a51ed23be28a8d82320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/View_Pie.vb:66-72 | codes/View_Pie.vb:279-285 \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":"codes/View_Pie.vb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae10e48e7a698711f8b43d199df189576883e7415ef75d3e47f4a1e2775b09b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20138 lines \u00D7 4): codes/View_Tree.vb:2912-2919 | codes/View_Tree.vb:2920-2921 | codes/View_Tree.vb:2930-2937 | codes/View_Tree.vb:2938-2939 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codes/View_Tree.vb:2919\u0060 calls \u0060draw_pie\u0060, \u0060CInt\u0060, \u0060Val\u0060 and \u0060codes/View_Tree.vb:2921\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":"codes/View_Tree.vb"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c16e0e1ad6a38621cd093a265d69891f6774536473e72cd342c7bf9d93266f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 13): codes/Form_Main.vb:5911-5916 | codes/Form_Main.vb:8238-8243 | codes/Form_Main.vb:8341-8346 | codes/Form_Main.vb:8443-8448 | codes/Form_Main.vb:8545-8550 | codes/Form_Main.vb:8613-8618 | codes/Form_Main.vb:8661-8666 | codes/Form_Main.vb:8776-8781 | codes/Form_Main.vb:9033-9038 | codes/Form_Main.vb:9110-9115 | codes/Form_Main.vb:9162-9167 | codes/Form_Main.vb:9320-9325 | codes/Form_Main.vb:9535-9540 \u2014 all 13 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, \u0060codes/Form_Main.vb:9317\u0060 calls \u0060CInt\u0060 and \u0060codes/Form_Main.vb:9158\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":"codes/Form_Main.vb"},"region":{"startLine":5911}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c891774a03de50e836eab9a0c9e4d0d3355abc508df3e5a4b6a85d064f2adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): codes/Config_BGB.vb:219-223 | codes/Config_BGB.vb:562-566 | codes/Config_Lagrange.vb:220-224 | codes/Config_Lagrange.vb:703-707 | codes/Form_Main.vb:6755-6759 | codes/Module_Var.vb:298-302 | codes/View_Tree.vb:323-327 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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 before the matched lines, \u0060codes/Module_Var.vb:296\u0060 calls \u0060Temp_node\u0060 and \u0060codes/View_Tree.vb:321\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":"codes/Config_BGB.vb"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b943e69aa710cbfac23ef857186d8cebf59488c09f2a80750d6a373080a597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): codes/Config_BGB.vb:234-238 | codes/Config_BGB.vb:577-581 | codes/Config_BayArea.vb:232-236 | codes/Config_Lagrange.vb:235-239 | codes/Config_Lagrange.vb:718-722 | codes/Tool_Combine.vb:110-114 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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":"codes/Config_BGB.vb"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b359457467d5e389c6bd9afd2464a0f8039090637878e86ba268c198bc62ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): codes/Config_BGB.vb:109-115 | codes/Config_BGB.vb:288-294 | codes/Config_Lagrange.vb:107-113 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c99e948ecd1d89d3fb01fb28c1319365c6553540eca4db6dc24b01085823040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/Config_BGB.vb:1305-1312 | codes/Config_Lagrange.vb:424-430 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f1d75dda350e4fb7354784cbe95d94b37247b0c588394d81bdca60d3032d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Config_Chrom.vb:93-98 | codes/Config_Chrom.vb:176-181 \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 \u0060codes/Config_Chrom.vb:93\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":"codes/Config_Chrom.vb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2b9a8d468b19362be39484295f8c6be972efc2c4da856f4e3ee0ef07f39516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Config_Chrom.vb:114-119 | codes/Config_Chrom.vb:353-358 \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":"codes/Config_Chrom.vb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca667f97fef436e1356c839b93433df7ef548ec009f69c3736254ee2ce01df0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 4): codes/Form_Main.vb:767-773 | codes/Form_Main.vb:973-979 | codes/Form_Main.vb:2443-2445 | codes/Form_Main.vb:2619-2621 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codes/Form_Main.vb:764\u0060 calls \u0060Replace\u0060, \u0060f_t_name\u0060 and \u0060codes/Form_Main.vb:2441\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":"codes/Form_Main.vb"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe3b7dddc0018ff9ae1a1759c916fe5265ade8676e2fc50aa99a0afc936e05d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 4): codes/Form_Main.vb:783-788 | codes/Form_Main.vb:989-995 | codes/Form_Main.vb:2465-2468 | codes/Form_Main.vb:2635-2636 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codes/Form_Main.vb:780\u0060 calls \u0060Replace\u0060, \u0060Item\u0060 and \u0060codes/Form_Main.vb:2632\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":"codes/Form_Main.vb"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"701418a9fca0ae208bf63fc657add7931608235d597202f8bb19a15dd4b82c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): codes/Form_Main.vb:6026-6032 | codes/Form_Main.vb:6056-6062 | codes/Form_Main.vb:6089-6091 \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":"codes/Form_Main.vb"},"region":{"startLine":6026}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de848506c46940d948ac78a54d7806e80750a99c14f503d77b7734eea97de4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/View_Tree.vb:216-220 | codes/View_Tree.vb:3552-3556 \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":"codes/View_Tree.vb"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b6f8f29dea61b9d67caf2240d5181ab30897972ce3de83b63469808e07c633"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/View_Tree.vb:1210-1216 | codes/View_Tree.vb:3104-3111 \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":"codes/View_Tree.vb"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadb6b264e2e6331370a571cf54fce7b0989719539405f7a1a44b6975e313c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): codes/View_Tree.vb:1329-1332 | codes/View_Tree.vb:1350-1356 | codes/View_Tree.vb:1388-1394 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codes/View_Tree.vb:1332\u0060 calls \u0060DrawEllipse\u0060, \u0060Pen\u0060 and \u0060codes/View_Tree.vb:1356\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":"codes/View_Tree.vb"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1eef90c3cf85c4e4f0b47a9d21519c3c00962314b6c1773610835320fa12180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 14): codes/Form_Main.vb:5911-5916 | codes/Form_Main.vb:7647-7652 | codes/Form_Main.vb:8238-8243 | codes/Form_Main.vb:8341-8346 | codes/Form_Main.vb:8443-8448 | codes/Form_Main.vb:8545-8550 | codes/Form_Main.vb:8613-8618 | codes/Form_Main.vb:8661-8666 | codes/Form_Main.vb:8776-8781 | codes/Form_Main.vb:9033-9038 | codes/Form_Main.vb:9110-9115 | codes/Form_Main.vb:9162-9167 | codes/Form_Main.vb:9320-9325 | codes/Form_Main.vb:9535-9540 \u2014 all 14 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, \u0060codes/Form_Main.vb:9317\u0060 calls \u0060CInt\u0060 and \u0060codes/Form_Main.vb:9158\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":"codes/Form_Main.vb"},"region":{"startLine":5911}}}],"partialFingerprints":{"codehealthFindingId/v1":"f979966f8d8071474aec4823f9d5e0a5e84f5135d6924decd441cde370d691c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): codes/View_Tree.vb:1210-1215 | codes/View_Tree.vb:1620-1625 | codes/View_Tree.vb:1651-1656 | codes/View_Tree.vb:2563-2568 | codes/View_Tree.vb:3104-3109 | codes/View_Tree.vb:3116-3121 | codes/View_Tree.vb:3653-3658 | codes/View_Tree.vb:3837-3842 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codes/View_Tree.vb:1648\u0060 calls \u0060Load_result\u0060, \u0060Get_Info\u0060 and \u0060codes/View_Tree.vb:1619\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":"codes/View_Tree.vb"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"17edc5b3476f40ab9271a34fc94f2a3b2e1db4e05de898802fc7a710c8ad1141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): codes/View_Tree.vb:3285-3290 | codes/View_Tree.vb:3422-3427 | codes/View_Tree.vb:3680-3685 | codes/View_Tree.vb:3715-3720 \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":"codes/View_Tree.vb"},"region":{"startLine":3285}}}],"partialFingerprints":{"codehealthFindingId/v1":"21827137fa0b0566c70d578b10012dd8edae9631c394c36c7d8230adaf4c13d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): codes/Config_BGB.vb:126-132 | codes/Config_Lagrange.vb:126-132 | codes/Config_SDIVA.vb:132-137 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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, \u0060codes/Config_BGB.vb:133\u0060 calls \u0060IndexOf\u0060, \u0060Items\u0060 and \u0060codes/Config_SDIVA.vb:138\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":"codes/Config_BGB.vb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fa2d144649f4acc7dc579b6a864dad20e02963d416a2266f74d6c3ecfad02c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 5): codes/Form_Main.vb:776-781 | codes/Form_Main.vb:982-987 | codes/Form_Main.vb:2454-2455 | codes/Form_Main.vb:2469-2471 | codes/Form_Main.vb:2629-2634 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060codes/Form_Main.vb:2636\u0060 calls \u0060Replace\u0060, \u0060Item\u0060 and \u0060codes/Form_Main.vb:2473\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":"codes/Form_Main.vb"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e33db91b328bd3a035724168cc599340ce38c0d45202845a8077c5f5b9d00e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): codes/Form_Main.vb:2129-2134 | codes/Form_Main.vb:3990-3995 | codes/Form_Main.vb:6000-6005 \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":"codes/Form_Main.vb"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3972b0d01653c97f9e16ca11bb58d652e2136f4040c098b8cc9d4d6493d09cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/Config_Chrom.vb:281-285 | codes/Config_Traits.vb:303-307 \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":"codes/Config_Chrom.vb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2facd83c058059c5907a1002455debbf268834756f0b55dfe42eab8feafec6ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/Form_Main.vb:3927-3931 | codes/Form_Main.vb:5151-5155 \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":"codes/Form_Main.vb"},"region":{"startLine":3927}}}],"partialFingerprints":{"codehealthFindingId/v1":"89678d9a30c3eb048989a2581580722f79e70e3c53ca90d0081c1d5395bbe0eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Form_Main.vb:6807-6812 | codes/View_Tree.vb:387-392 \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":"codes/Form_Main.vb"},"region":{"startLine":6807}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d12e8b40d79bce8e74e3cfe73d24ef772929407fc3bf340c15f8abaf56e51c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Form_Main.vb:7111-7116 | codes/Tool_DPP.vb:173-178 \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":"codes/Form_Main.vb"},"region":{"startLine":7111}}}],"partialFingerprints":{"codehealthFindingId/v1":"780227af2efeef7162f90eeb0280ebbb2e682cef870fbc294798a82bcece910a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/Form_Main.vb:7876-7880 | codes/Form_Main.vb:7945-7949 \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":"codes/Form_Main.vb"},"region":{"startLine":7876}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb04b8812b70b13fdceef17dbf64663d7cfcfa578201aae9faad40408b69b961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Tool_Combine.vb:200-205 | codes/Tool_Combine.vb:287-292 \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":"codes/Tool_Combine.vb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bf4101345bbe794bb858ffbbc8b3f1d7fb5657af8284110a1178ae240b4720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Tool_TvS.vb:309-314 | codes/Tool_TvS.vb:431-436 \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":"codes/Tool_TvS.vb"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"588a67528a82838408b34aa08a633c1af34a670538da41b7c1aff605d856d45c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/View_Dis.vb:245-249 | codes/View_Dis.vb:252-256 \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":"codes/View_Dis.vb"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c4195ec33bacc4b6a63802eb9d35a6336b4c78bd994554a32e1306b3385014"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/View_Tree.vb:1729-1734 | codes/View_Tree.vb:2014-2019 \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, \u0060codes/View_Tree.vb:2020\u0060 calls \u0060TaxonName\u0060, \u0060CInt\u0060 and \u0060codes/View_Tree.vb:1735\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":"codes/View_Tree.vb"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"325b4a54544d93e99523172faa1ee2babba5c2e30ccee649a83f24931b30fbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 24): codes/View_Tree.vb:639-643 | codes/View_Tree.vb:1199-1204 | codes/View_Tree.vb:1210-1214 | codes/View_Tree.vb:1620-1624 | codes/View_Tree.vb:1651-1655 | codes/View_Tree.vb:2518-2522 | codes/View_Tree.vb:2546-2550 | codes/View_Tree.vb:2563-2567 | codes/View_Tree.vb:2576-2580 | codes/View_Tree.vb:2594-2598 | codes/View_Tree.vb:2648-2652 | codes/View_Tree.vb:3104-3108 | codes/View_Tree.vb:3116-3120 | codes/View_Tree.vb:3133-3137 | codes/View_Tree.vb:3147-3151 | codes/View_Tree.vb:3231-3235 | codes/View_Tree.vb:3243-3247 | codes/View_Tree.vb:3285-3289 | codes/View_Tree.vb:3422-3426 | codes/View_Tree.vb:3622-3626 | codes/View_Tree.vb:3653-3657 | codes/View_Tree.vb:3680-3684 | codes/View_Tree.vb:3715-3719 | codes/View_Tree.vb:3837-3841 \u2014 all 24 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, \u0060codes/View_Tree.vb:1197\u0060 calls \u0060Load_result\u0060 and \u0060codes/View_Tree.vb:638\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":"codes/View_Tree.vb"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"8498a446942984b085583bc3df9eec3ce8d233afaad7f6386de93dd564d30d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 15): codes/Config_Traits.vb:425-429 | codes/Form_Main.vb:5911-5915 | codes/Form_Main.vb:7647-7651 | codes/Form_Main.vb:8238-8242 | codes/Form_Main.vb:8341-8345 | codes/Form_Main.vb:8443-8447 | codes/Form_Main.vb:8545-8549 | codes/Form_Main.vb:8613-8617 | codes/Form_Main.vb:8661-8665 | codes/Form_Main.vb:8776-8780 | codes/Form_Main.vb:9033-9037 | codes/Form_Main.vb:9110-9114 | codes/Form_Main.vb:9162-9166 | codes/Form_Main.vb:9320-9324 | codes/Form_Main.vb:9535-9539 \u2014 there are 15 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 15 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060codes/Config_Traits.vb:422\u0060 calls \u0060LoadLogToolStripMenuItem_Click\u0060 and \u0060codes/Form_Main.vb:8237\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":"codes/Config_Traits.vb"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"19755eaf6df83823656a881d9458a4fe97dd605c127ccf833d4f6995fc906445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): codes/Config_BGB.vb:221-225 | codes/Config_BGB.vb:564-568 | codes/Config_BayArea.vb:219-223 | codes/Config_Lagrange.vb:222-226 | codes/Config_Lagrange.vb:705-709 | codes/Form_Main.vb:6757-6761 | codes/View_Tree.vb:325-329 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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 before the matched lines, \u0060codes/Config_BayArea.vb:216\u0060 calls \u0060IsNumeric\u0060, \u0060tree_char\u0060 and \u0060codes/Config_BGB.vb:220\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":"codes/Config_BGB.vb"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6f52a70bb119669885218e94e4770d0a2a7670ab3ceee68c8431ba7a237f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): codes/Config_BGB.vb:223-227 | codes/Config_BGB.vb:566-570 | codes/Config_BayArea.vb:221-225 | codes/Config_Lagrange.vb:224-228 | codes/Config_Lagrange.vb:707-711 | codes/Form_Main.vb:6759-6763 | codes/Module_Var.vb:301-305 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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 before the matched lines, \u0060codes/Config_BGB.vb:222\u0060 calls \u0060Poly_Node\u0060, \u0060Temp_node\u0060 and \u0060codes/Module_Var.vb:300\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":"codes/Config_BGB.vb"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8aa51602c6c18ee4d490c61452906b7598cdd880807ea8b00adfc5417c57e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): codes/Config_BGB.vb:225-229 | codes/Config_BGB.vb:568-572 | codes/Config_BayArea.vb:223-227 | codes/Config_Lagrange.vb:226-230 | codes/Config_Lagrange.vb:709-713 | codes/Module_Var.vb:303-307 | codes/Tool_Combine.vb:101-105 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_BayArea.vb\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 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 before the matched lines, \u0060codes/Config_BGB.vb:222\u0060 calls \u0060Poly_Node\u0060, \u0060Temp_node\u0060 and \u0060codes/Module_Var.vb:300\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":"codes/Config_BGB.vb"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe252ff8179ce806bb007708b68a41a43618fa6748e2d006d2c657b40edbdd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): codes/Config_Chrom.vb:281-285 | codes/Config_Traits.vb:303-307 | codes/Form_Main.vb:2129-2133 | codes/Form_Main.vb:3927-3931 | codes/Form_Main.vb:3990-3994 | codes/Form_Main.vb:5151-5155 | codes/Form_Main.vb:6000-6004 \u2014 there are 7 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Chrom.vb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ce73d094103ec543c709beea59b3ad9349e2e7b59fe6f6bf90f09f49e76792"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): codes/Config_BGB.vb:262-266 | codes/Config_BGB.vb:605-609 | codes/Config_Lagrange.vb:263-267 | codes/Config_Lagrange.vb:746-750 | codes/Module_Var.vb:330-334 | codes/View_Tree.vb:377-381 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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, \u0060codes/Module_Var.vb:336\u0060 calls \u0060Temp_node\u0060, \u0060tree_char\u0060 and \u0060codes/Config_BGB.vb:267\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":"codes/Config_BGB.vb"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6974c3619eec683d5b2104eb261f3726aaf56ea54ee1995fccd79c4fa634d41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 4): codes/Form_Main.vb:770-774 | codes/Form_Main.vb:976-980 | codes/Form_Main.vb:2456-2460 | codes/Form_Main.vb:2627-2628 \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":"codes/Form_Main.vb"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af9bb403cd38589be653b1b22facb9ea9a7802224651bf7c4a1376b9f5663ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): codes/View_Dis.vb:370-374 | codes/View_Dis.vb:403-407 | codes/View_Dis.vb:420-424 \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":"codes/View_Dis.vb"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d266a8b544560506329c198cacbc0cae7cb90cd8c1dc841bb5b68a446e0b2f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/Config_BayArea.vb:79-83 | codes/Config_BayArea.vb:85-89 \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":"codes/Config_BayArea.vb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2462abd7e912deb80a26814a5d5063f08bb896770ae077268a3470765a6b409e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/Config_BGB.vb:649-653 | codes/Config_Lagrange.vb:790-794 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"feab7f11a321221c0b059fc5d48d8827a3102e23a908212d628b491f26725038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/Tool_Cluster.vb:580-584 | codes/Tool_Cluster.vb:595-599 \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":"codes/Tool_Cluster.vb"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09f80ecb6602de8a53c5f12314b71dcb201941fd0fb14594761e4217f184c6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): codes/View_Tree.vb:2842-2846 | codes/View_Tree.vb:2853-2855 | codes/View_Tree.vb:2866-2870 \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 after the matched lines, \u0060codes/View_Tree.vb:2847\u0060 calls \u0060temp_time_area\u0060, \u0060RASP_Event\u0060, \u0060Exp\u0060 and \u0060codes/View_Tree.vb:2856\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":"codes/View_Tree.vb"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"6816e87ef8f74971f97dabbe3064e4cae8616cdbb25d508172e47d87fd42a29b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): codes/View_Tree.vb:2848-2852 | codes/View_Tree.vb:2854-2856 | codes/View_Tree.vb:2872-2876 \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":"codes/View_Tree.vb"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"10eec9e9ff20769850cfc68121ca96e2b0b60a4435a70c96cb9244036c6aa145"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): codes/Config_BGB.vb:50-56 | codes/Config_BGB.vb:1544-1550 | codes/Config_Lagrange.vb:48-54 | codes/Config_Lagrange.vb:1324-1330 | codes/Config_SDIVA.vb:48-54 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c3c5528676ccb7a95ac19fca71719117cedf41b510e829977b08db95d043ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Config_BGB.vb:681-686 | codes/Config_Lagrange.vb:823-828 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60cdf91406d1d231a8c8c7ff60e8437ce30f57381ceb66decbb7159e6270cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): codes/Config_BGB.vb:860-865 | codes/Config_Lagrange.vb:986-991 | codes/Tool_DPP.vb:77-82 \u2014 before extracting anything, compare \u0060codes/Config_BGB.vb\u0060 and \u0060codes/Config_Lagrange.vb\u0060 as WHOLE FILES: this scan already matched 46 separate duplicated blocks between them, totalling at least 741 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":"codes/Config_BGB.vb"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"96268b1086ca436cc56960fc32b09cbe0552629154f48d9883bbf8cd27cf634f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Tool_SvT.vb:313-321 | codes/Tool_TvS.vb:399-407 \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":"codes/Tool_SvT.vb"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd292e7d574c49a135989f74151e2f5d3f9fcb66d5dc45080508b3cedd45bee"}},{"ruleId":"D8","level":"error","message":{"text":"No automated tests: No automated tests \u2014 no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (xUnit, NUnit or MSTest), and run it in CI so the gap cannot reopen."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3132564c6310e5d01a231f252a02d5d2f5a542c0a8fa29a14c89693f1e3df871"}},{"ruleId":"D9","level":"note","message":{"text":"No tests found: No test suite could be collected \u2014 no discoverable tests to count. If this repository does test, wiring the suite to a framework a runner can collect (xUnit, NUnit or MSTest) is what makes it countable here; a pipeline step that invokes a runner is not evidence on its own, because a runner over an empty suite passes. Tests written as plain executables or shell/PowerShell harnesses are not collectible this way and are not scored here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9bf64cbb5a4ae13d6bcd01fa3bc8d2879d860c73bc67f176ee3c2cecb8adce3"}},{"ruleId":"D17","level":"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":"codes/Config_BBM.vb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9042e56a831e928e8b7d82450c50b62a0a36a99e9eb5014e99d56f5469d5814a"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1daab68354c9975fc90ca1bb0298c1da5373ab5d1a89a0df77814567660f03d"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"99091042c18fce11674b59da3d4dce36fe31b04dc78706601a7548ef00d428b9"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e930fcbafc56928bf29ca528df297bc7a5828d3343354a9eae23a928ead3d2b"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":3157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fabc22d29ee99205291d4b28fe8ab8a3060882739a6300cfc02f4adffd3ee34"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":4240}}}],"partialFingerprints":{"codehealthFindingId/v1":"26670a11077bc0638e3773dabb98c1da5acca1fac8f921310da88dc4eef80e56"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":4286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e5938590ed2606e98192b4bfee650753e938b60a516955f31dc677b434e093"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":4298}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0c391397d68a2fe3758978685ecae1789a6538a5ab76d5a35c56fbe39c860c"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":4503}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef3b077f256e1c800397e2ed98716bff6737e317faa74b4525525ee011b5f30"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"0191728d668ea27c716724f38b69a92775ffd2a87c1fd215c50b28782d929ed8"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":4630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1d84474fffde9800439c3b2ac2211f4513c6e7c55bb327e7cb9fd9e68ae165"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":5776}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c522601bf5b4d5c586277e90b50aa5aebc8313f1d563e5c0c79436cba3d15c"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":6935}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61ea4dba87e1de6b7288bf080aff563266528b1a898b70f58b066bab8f07327"}},{"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":"codes/Form_Main.vb"},"region":{"startLine":8898}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4cd7cd1cb286f87b44e9751db35ddcfc1d44c8d61d323a746fb16a1d643cbe"}},{"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":"codes/Form_Welcome.vb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc4f0f81c6707321aa39b9785437c2222cb9de62842ba45e893d17baa566c73"}},{"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":"codes/Module_Var.vb"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f40af70e7d4334b136062aa4ce4250ec1e61939a7b9e8d342f94bcd3e88558"}},{"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":"codes/Module_Var.vb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fcd3863d45531e1a8463555feda8e043c6e0305a7a61377714a68f5f1f9ad6"}},{"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":"codes/Module_Var.vb"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0687ccf9962b7955214e617bd510f83467c6fdd91979eb1eee0e67c480a100a"}},{"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":"codes/Tool_Cluster.vb"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"791ec9c286dbad1611cbf7041db1b10ac111d6b6c742b24ee48cab34a0e70165"}},{"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":"codes/Tool_Cluster.vb"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"88321a35e6b23aa71a3f180a7f202e75243722be4e431214ff98c0f337a2aef9"}},{"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":"codes/Tool_Cluster.vb"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f26c72652e2ee0c43013ecef4f0d9af992cd3989805d4564a6d6202b699898f"}},{"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":"codes/Tool_SvT.vb"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1030cd286432b74aa5b69a51e5047fcb2f172e278cdd884545d785351939f0c4"}},{"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":"codes/Tool_TvS.vb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65b723e7678fd1caa260522ff7d2c3429f78abfa4c6247ed179ce24e348776b"}},{"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":"codes/Tool_TvS.vb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e6a6f6327c6194565d6463b60caa2dbb54553535bbacfa260335f7614168b5"}},{"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":"codes/Tool_TvS.vb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c0fd0e92286c23287f2ef54d940b0ef1ac5f4e3f32152f7bff16a97ff54166"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: \u0027 TODO: \u5728\u9879\u76EE\u7684\u201C\u5E94\u7528\u7A0B\u5E8F\u201D\u7A97\u683C\u4E2D\u81EA\u5B9A\u4E49\u6B64\u5E94\u7528\u7A0B\u5E8F\u7684\u7A0B\u5E8F\u96C6\u4FE1\u606F \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060\u0027 REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_AboutBox.vb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdacfae3a0fd63fe72acdff6bccd84cdb81157d5165e9388e2c279977cc8f7e"}},{"ruleId":"D18","level":"warning","message":{"text":"Build failed: The target solution did not build cleanly (errors: 1), which caps Solution Shape at 3/10 \u2014 the most basic shape signal is that it compiles. First errors: BC31509: Unable to open resource file \u0027Codes/ICO.ico\u0027: Could not find file \u0027Codes/ICO.ico\u0027.."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"24ff41d1fc14d3a19b969001a7e9697d13d34fc0453d84646f56c980eff97f2b"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D28","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":"154e9fecac71f56d1ad747f2ecb020871adda09a656c9a343cd115db61882d24"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"5cc15bb8da66a61438d6a10457a41770e297c1bde4388eda1febf08048011138"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"10a35acf7fdfaeeb6b4dc03ddd3dcd632f79f3c2244ddd6fa7d3e6240c7f9491"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"e9831bbdc00fc9ba00b2a6b9c088101570eebc663b285377cae01812a9b5a9be"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"c2ba90c4c33a6537444ff838ec4233630c429bec553533921c6734dc0a3eda91"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"5e1fc2c97d2cd2b2b1bd3651e10a52ebe6b7519e9924d0803e43db571e873385"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"7ce8027fad3120f5cf8a7d161fc30392a6ffa6f186885e371981c9d46ac9df6a"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"4fde97b8385840a7207fd1e4c8bb6c5b01fa660c9cc9be03f1e989018f7284a2"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"53353559cabbf5cbf39b0ca48808109067d448ce72d33e1b5025e87e2790c705"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"ba0d8b007d61061fbf5936128f7604bad3a0e93acee31d2534917eba34df63e8"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"2324a16c853abcc29ef8d65d0cf35e77398788a2b8cf6460a184d4d615d9dfd0"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"9ce6b3260bfc77ea17ccb9d4a606bb599ecfd29f1475c118981331c13a31f0ae"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"e3a6ff59207777a5fa182384069f5b6db811a2f67840320d74e6e4b5e8d06386"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"f0df6e7d7c450aa518f08df07b6699962bdad49976ce4be65a8366efcf4dadf7"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"1f6ca1f3acfa79435d47c5fd705b0528984cc8eb73a0d6728c28c532f19f6cf6"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"2fbeaea4cd89eb65bbc330034b6fd2865045aa0e9989a28913738647543883ae"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"c50480eea049be55d4f5398d1e4e205a6cf0743f373f3dfb49c6d55768a7eeb8"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"de86612b6edede0c6fbff302e88f4b8232195673387299c7737be64c15ad6d7e"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"414607df8018a22b67ffbc9c63b12bf14e4cd50ceec80e3e058d2a702aa26682"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"4e169d5cc7d963539aeb0bd8513bd714fe2a903347ba7dd5102d4736e7578c58"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"7bc2c89c77487cd77633da52196373a4a7707542e83ff7443f7810ca3b67981e"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"2c3e82535bc6d27f9882dd1fef5e257762a8c4d04ad617af8504d2594a54964e"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"338109f55642b322a2ed9824437f9743dfd1c9cfbdff92ec0fc9694a8eb90f3b"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"2752c43087443cf823f8d961b58341356c1e8a6bfebb267de38ba2a0760b8c00"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"abc617b2ec7b81cad120ef73d66dff547205b5deae936bce230fbe1e0ee37f4e"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"3eaa1e75222644ff9c65dd90f5cc1f36fe965893f7770baa049917d273bf75fc"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"8eb9de795e80fefa448378380bd17431a88d24479b78d61a397ee867acf639c5"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"f00e8e49ac71e91e40b54c50701ce8ae2e3d6bffe8f2d1cfc3a99b3c069defe6"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"2bd7cb8fc4a70cfc1b1db1dd059090c2df4e7b562d2b505f452aa03e1b7d7e5d"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"348479bebee01d3939934935c5dc331766c1d3d1b25a49e6c54ef5ed32c4701e"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"d00a509c8e4e100978f05627be82e11c6bc47706f10d3e278c1382f35998d80e"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"f0783dd00c73abdf483ee6b10ceeae3e82cfddc5337835848a5b875d2d0b593b"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"71a5f968a3a9d40b3c36c48d1122cfa6d4830f47ee87d7e2945672d86a41432b"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"118e5011db1261d1ef9616bfd9200f702562d8b39b31bc715612b92ea9a5edf3"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"83ce47ae28feda8389bc9b7591ebb27dd6e01ab7ddd1daf616fdcd871f3401ae"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","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":"2f78a44748faaef9511c3aafa8e3757a79a66c07ee43509455fa028bc7a64be7"},"properties":{"commitSha":"dc417bc58dc9d159126e4ce980b75a329cf4fce6"}},{"ruleId":"D28","level":"note","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: .NET net6.0: RASP.vbproj declares .NET net6.0 as this project\u0027s target framework, and .NET 6 LTS, support ended 2024-11-12. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2024-11-12 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":"RASP.vbproj"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"833052aef8fed8fff4f2fedf55a392e3e58dc048b7b988c82a469d1d41453aa6"}},{"ruleId":"AX5","level":"warning","message":{"text":"Appears unstructured (no recognised architecture): ~25k production LoC (51 types) across 1 project(s) / 4 namespace(s) with no recognised architectural style or layering \u2014 at this size, deliberate module boundaries would help. No DDD/clean/vertical-slice/CQRS/transaction-script organisation was detected \u2014 code is likely organised ad hoc, which makes change and onboarding harder as it grows."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cf38333cec692da9187608fc8d12d547460b1d3964d6b4da78c9c51e859dd969"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"M3","level":"note","message":{"text":"No src/ separation: Production code isn\u0027t grouped under a src/ folder \u2014 it\u0027s spread across several top-level directories, so there\u0027s no one place that says \u0027this is the product\u0027."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"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":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"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: \u0060RASP.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":"RASP.vbproj"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"128660ae0d4dfb09d10314082efea66cfc64622fb118730e95d91a19a28854d6"}},{"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-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-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":"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":37,"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."]}]}