{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D18","name":"Solution Shape","shortDescription":{"text":"Solution Shape"},"helpUri":"https://codehealth.canine.dev/dimensions/D18"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"}]}},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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."},"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/Form_Main.vb: FileTooLong \u2014 8667 significant lines (blank, comment-only and punctuation-only lines excluded). 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/Form_Main.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"588592a0ae412361d425408374ba1a7449f5ffaf37848622f105507420a0dc81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: codes/View_Tree.vb: FileTooLong \u2014 3503 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"TooManyMethods: Form_Main: TooManyMethods \u2014 8662 significant lines (blank, comment-only and punctuation-only lines excluded), 171 methods. 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/Form_Main.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d33b64197f043d042df89e7934ede6ef543c88fd6ac967c8b20812fbc20f05"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config_Lagrange: ClassTooLong \u2014 1376 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. 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":"FileTooLong: codes/Config_BGB.vb: FileTooLong \u2014 1588 significant lines (blank, comment-only and punctuation-only lines excluded). 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). 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. 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":"FileTooLong: codes/Tool_Cluster.vb: FileTooLong \u2014 1210 significant lines (blank, comment-only and punctuation-only lines excluded). 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_Cluster.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c214b535eac2700f412c0a4caa55dd3a6540b3e45536125c6dc2f4915a83ed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tool_Cluster: TooManyMethods \u2014 1208 significant lines (blank, comment-only and punctuation-only lines excluded), 62 methods. 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_Cluster.vb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0907d08a3aed2514949130bb34ffe833e7f7f719fc34fa4132662d78ccbb2362"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tool_Omitted: ClassTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. 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":"FileTooLong: codes/Tool_Omitted.vb: FileTooLong \u2014 687 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"ClassTooLong: Tool_Combine: ClassTooLong \u2014 480 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. 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. 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. 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":"ClassTooLong: Tool_TvS: ClassTooLong \u2014 452 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. 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":"ClassTooLong: Config_Chrom: ClassTooLong \u2014 443 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. 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":"ClassTooLong: Config_Traits: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. 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. 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. 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":"Duplicated block (27 lines \u00D7 2): codes/Config_BGB.vb:1060-1086 | codes/Config_Lagrange.vb:1177-1203 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b4f58b58c6dd604000a1d1c1adb5bae99afadc2af1f08ccf2e87a2ef8999ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 8): codes/Config_BayArea.vb:156-176 | codes/Config_BGB.vb:166-186 | codes/Config_BGB.vb:499-519 | codes/Config_Chrom.vb:40-60 | codes/Config_Lagrange.vb:167-187 | codes/Config_Lagrange.vb:640-660 | codes/Tool_Combine.vb:42-62 | codes/View_Tree.vb:269-289 \u2014 there are 8 copies across 6 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 8 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BayArea.vb"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfe78bed4095fa1b3db84c1304dd7ebc5d835b60fb2e52d20d2219f0a7778e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): codes/Form_Main.vb:9199-9218 | codes/Form_Main.vb:9357-9376 \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":9199}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe5b65e6462e8e4d88ebaac052add7206f390532169529b8ba89b34e6d3fdfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): codes/Form_Main.vb:656-674 | codes/Form_Main.vb:861-879 \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":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce917ddd990638652017081dd2d6f464158f86781a5572cf49cc4a09e2ce432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): codes/Form_Main.vb:5510-5528 | codes/Form_Main.vb:5675-5693 \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":5510}}}],"partialFingerprints":{"codehealthFindingId/v1":"35102fda4f73d9f1924977b89e3f9f23185399bcc70e7896ea500566f15c898d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): codes/Form_Main.vb:8451-8468 | codes/Form_Main.vb:8784-8801 \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":"86577391501eba6dc1270ee264d102d9fd1eab4e47442df258cfbefd7bf2ae35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): codes/Form_Main.vb:8673-8690 | codes/Form_Main.vb:9122-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":8673}}}],"partialFingerprints":{"codehealthFindingId/v1":"680205d5845cb97a5c0673f3b4d2a40c9269975d7b36c3ae09ac39eb876a5286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): codes/Form_Main.vb:732-748 | codes/Form_Main.vb:937-954 \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":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfbb5ff0e139eb9713943187b6829df875a4caec1da93d7e3ca30bdc7a30f41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codes/Config_BGB.vb:762-777 | codes/Config_Lagrange.vb:900-915 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f0a9752553b022546921e77e0ee7d1d47304624348c0a3c86519f456830b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codes/Form_Main.vb:4051-4066 | codes/Form_Main.vb:6099-6114 \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":4051}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a50fef3d858fb638a8161e2a2eb63aa40832e8c5395f51dc677fa952aef13b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codes/Form_Main.vb:4407-4424 | codes/Form_Main.vb:4524-4539 \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":4407}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a4cf4b5f6c9a48e085b97e86b8b77d6c8a844b2959b484d6dad4ffd0a77793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codes/Form_Main.vb:5252-5267 | codes/Form_Main.vb:5402-5417 \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":5252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1450483e70a35220073ef8faf7fb88c637afa35b106685815e74ce858be7b650"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codes/Form_Main.vb:5586-5601 | codes/Form_Main.vb:5751-5766 \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":5586}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cad920dfd045cfbf05bf0db41db3b6fe8f96fd26f0d47860b11677f2355187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codes/Tool_Cluster.vb:860-875 | codes/Tool_Cluster.vb:886-901 \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":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b44e9959e68667cc66057b7de1f38a4bb01e52f5f3bff65ed141b9c327234bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): codes/Tool_TvS.vb:356-371 | codes/Tool_TvS.vb:483-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:356\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":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"6692b3bc99a66249324b0a83ddf9171bc68f9726c59c660974ef5d1772ca6ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 8): codes/Form_Main.vb:5917-5932 | codes/Form_Main.vb:8244-8258 | codes/Form_Main.vb:8347-8361 | codes/Form_Main.vb:8449-8463 | codes/Form_Main.vb:8619-8633 | codes/Form_Main.vb:8782-8796 | codes/Form_Main.vb:9168-9182 | codes/Form_Main.vb:9326-9340 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":5917}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a0156a37d29becf6561cf76c60ab4d86d68ff91d6bee36e0e93e83042f73de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): codes/Form_Main.vb:8088-8102 | codes/Form_Main.vb:8281-8295 | codes/Form_Main.vb:8383-8397 | codes/Form_Main.vb:8485-8499 \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":8088}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c43a13f621a9d2ccfef056c348246eb6945718e2f39ed85844c05f9c00652b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): codes/Config_BGB.vb:534-548 | codes/Config_Lagrange.vb:675-689 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3092764d63c757acbae2b86f80563f1a8db10af8c16e1e91f1551b3258b5f7be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): codes/Form_Main.vb:8706-8720 | codes/Form_Main.vb:8731-8745 \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":"ba1b94c0910186a1f37760805477d5b9ea2da48002f294b088bbbe2920a35fbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): codes/View_Tree.vb:1792-1806 | codes/View_Tree.vb:2082-2098 \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":"7713c50b1b98652805cd903d55ebb3765877db9f83c11e0ff34a2267f57f9a6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): codes/Config_BGB.vb:93-106 | codes/Config_Lagrange.vb:91-104 | codes/Config_SDIVA.vb:90-103 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9905f70b974ac7b0e2f4dc82a81a96a1a061371007239f8e49547576193209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codes/Config_BGB.vb:843-856 | codes/Config_Lagrange.vb:969-982 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd894342e61b97f047d4972b149eab83279310e7d4674f806fae0dd5e474b8f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codes/Config_BGB.vb:1120-1133 | codes/Config_Lagrange.vb:1237-1250 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e621318807bc89369ca72b964877640de8a870aae61fd1ef8cff17e1eae0ccc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codes/Form_Main.vb:3973-3986 | codes/Form_Main.vb:5983-5996 \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":3973}}}],"partialFingerprints":{"codehealthFindingId/v1":"0268f73895d304d395d7b2bf8f4eb9d9a01f14dab572566b28278b2ba14304eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codes/Form_Main.vb:4086-4099 | codes/Form_Main.vb:6136-6149 \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":4086}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb740ed31d28774936ca4d088a2d8ea2bce83711429f996d4e4ceedad6e3ea41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codes/Form_Main.vb:5295-5308 | codes/Form_Main.vb:5786-5800 \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":"3aff54d75a1a1ab5920cb1ed2a803ef66ae6fa1e47b2cda79f1764350030fdb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): codes/Form_Main.vb:6970-6983 | codes/Module_Var.vb:370-383 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":6970}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fd897ed89e385657438688e6bdc6c776bd1ec8912dc34dec24d2159f2168a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7): codes/Config_BayArea.vb:238-250 | codes/Config_BGB.vb:240-252 | codes/Config_BGB.vb:583-595 | codes/Config_Lagrange.vb:241-253 | codes/Config_Lagrange.vb:724-736 | codes/Tool_Combine.vb:116-128 | codes/View_Tree.vb:355-367 \u2014 there are 7 copies across 5 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. 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_BayArea.vb"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6484c51e0debd54c592532ca2ccfa2b662574e8c30b3456c02e95857690c26c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): codes/Config_BBM.vb:187-199 | codes/Config_BBM.vb:208-220 \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_BBM.vb"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e28d89e17ee0d1eaed5e66df113ef487fe284625baba723cf5330e0918dcef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): codes/Config_BGB.vb:695-707 | codes/Config_Lagrange.vb:835-847 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc02db946461021c06f0d5ba0c1a3974c31a8a7a73e1aeb24cfbf1c85e09c71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): codes/Form_Main.vb:481-495 | codes/Form_Main.vb:2302-2314 \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":"57a7907223018bc613682f90a26be81a2d234ea4be3ccb5c84a0fa76658ac55b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): codes/Form_Main.vb:6296-6308 | codes/Form_Main.vb:6497-6509 \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":6296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffffba83b320d88b5736cadcfa592d8171f37237e4d1d46f9f9feb26c20aa03c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): codes/Form_Main.vb:7189-7201 | codes/Form_Main.vb:7249-7261 \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":7189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b679fad94803f0ac75265316e92d2d8a1c840da50e85e42375fa66db6acae22e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): codes/View_Tree.vb:1772-1784 | codes/View_Tree.vb:2065-2078 \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":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efdde8ea5c0224158b626ec3a0045b363ef1890eab8fa9501b65238be81a691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): codes/Config_BGB.vb:1586-1597 | codes/Config_Lagrange.vb:1366-1377 | codes/Config_SDIVA.vb:354-365 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1b23aa19364c888bf74d25e1deed073ec750924539fef3aefa13749f3100c4"}},{"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":"e0a29fd05bbf05d9ca086fdce1f572b1ad982b0032d903694a2434418c2f116c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Form_Main.vb:1406-1417 | codes/Tool_Omitted.vb:280-291 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72c87de9cb1d3e23eedb805d43955b9e8a38996a26d8810c5fc8743da4b5848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Form_Main.vb:2414-2425 | codes/Form_Main.vb:2661-2672 \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":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"da26e3c9ec5af4b9638ad2fa34724fb439829d1c1bc19aea357fac78e67398f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Form_Main.vb:8363-8374 | codes/Form_Main.vb:8461-8476 \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":8363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55ca3f3a1be9f7583e7637c5e63efcc51f3e8cc664577fa4de5fde752865888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Form_Main.vb:9111-9122 | codes/Form_Main.vb:9536-9547 \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":"9bb8f76f8d82168f6a4d442c050d7f65941900a59da8eb86d61e85c5ee5edfb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Tool_Cluster.vb:66-77 | codes/Tool_Cluster.vb:104-115 \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":"dac836db7087ab5e64026ac86e5c3af362c245e884ec78b56308541089eabe1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Tool_Omitted.vb:564-575 | codes/Tool_Omitted.vb:651-663 \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":"09eda022236cdb068cdd0a0b18ad75c58db847afd57570955fe58fbe111a7507"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): codes/Tool_TvS.vb:282-293 | codes/Tool_TvS.vb:416-427 \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":"e5e0a993545d51f5d7915665ae85144e254fc7bac25da0e2232a6e25f50b2f10"}},{"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":"f0cb19561f6e2cd513f5031c15e30e6678a28149af3d22cf09197360c7d84697"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): codes/Form_Main.vb:8546-8556 | codes/Form_Main.vb:9111-9121 | codes/Form_Main.vb:9536-9546 \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":8546}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55a393fc249187ce752801303f70342e6d6226b62e0f8e82f5a1b85afa428db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): codes/Tool_Cluster.vb:204-214 | codes/Tool_Cluster.vb:241-251 | codes/Tool_Cluster.vb:1059-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:204\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_Cluster.vb"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5d35ef0ecccbab3dc9bbcfcb9df67263be495e5cb0f1c0ff63d95083e60235"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Batch Tools.vb:241-251 | codes/Batch Tools.vb:266-276 \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":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6decf6f2b9d0f459d08570e2f69a6f8caac28fb87c492da216935b545d90aae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Form_Main.vb:1353-1363 | codes/Form_Main.vb:1375-1385 \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":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a2e0af6492668dac717fa09c4c81cf50a5341f191e0b49454e101b323d4ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Form_Main.vb:2165-2175 | codes/Form_Main.vb:2264-2274 \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":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98dde486ca67bd55b004724b891ea875b20f61a3c1d0c101bf6d3ae74fb2259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Form_Main.vb:4138-4148 | codes/Form_Main.vb:6186-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":4138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e5e15533fdff405665802e76a5d0c5c0374cefd1c14b65ce9ae1cd258ca7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Form_Main.vb:7218-7228 | codes/Form_Main.vb:7280-7290 \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":"ce472fcfe810ec3af35f7730a78511784ce5e5f6ea8a82582412ae223e1b15c5"}},{"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":"939671e435f6b97ef7f4afba293c9169907f490d9f8e08323eeada2988d3583b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/Tool_Omitted.vb:692-702 | codes/Tool_Omitted.vb:715-725 \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":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddd34b86989eca254abce4889e88b3236dc1e3822934ab25de0c47e0c8a008b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/View_BBM.vb:105-115 | codes/View_BBM.vb:154-164 \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_BBM.vb"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5800e872e70cf7fea26eb2a0d1faf87a75b9e0080b533085c8896a746148d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/View_Pie.vb:76-86 | codes/View_Pie.vb:290-300 \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":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e3b76f25bed12c8bea795fd7872fc712bb8cd256b8af92b9fe4c175812dd03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/View_Tree.vb:1712-1722 | codes/View_Tree.vb:1995-2005 \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":"ce09efa53049435edea6d165f5e5d6134a2315ec88693d083c027ac4f7617648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): codes/View_Tree.vb:1747-1757 | codes/View_Tree.vb:2036-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e0ef7515fe14dfcddfb18f0dfd0615c928b79f27420053ee5c1696933d553b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): codes/Config_BayArea.vb:291-300 | codes/Config_BGB.vb:663-672 | codes/Config_Lagrange.vb:805-814 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BayArea.vb"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eba75f6431644e01db7d2afc85a235ee7e983ac99606439eae06cbc898260a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): codes/Config_BGB.vb:1608-1617 | codes/Config_Lagrange.vb:1387-1396 | codes/Config_SDIVA.vb:398-407 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ede5708b50cb40b159113c62403e7d68178e0218fea0bd43db827221cc82d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): codes/View_Dis.vb:298-308 | codes/View_Tree.vb:2458-2467 | codes/View_Tree.vb:3164-3174 \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":"2f05f1ca709b539557b24bd4aab635891695415c0c2e8fc1a721845dab58df25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): codes/View_Tree.vb:2578-2587 | codes/View_Tree.vb:2596-2605 | codes/View_Tree.vb:3624-3633 \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":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c799f983e3fea0d6d2ffd1f8e967e2b16908f6cdd5ce257ea4f1539bcc2487c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Batch Tools.vb:66-75 | codes/Batch Tools.vb:82-91 \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":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c040f21354204064c5a3fe0b434ea459ddf18d325b54d4c49346ab8dbba358e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Config_BBM.vb:12-21 | codes/Config_Traits.vb:10-19 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BBM.vb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad46ad4540b6b8d6e54c6ee0ebfd828002de67c9cb4a6d5bf7d00c015f596c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Config_BGB.vb:622-631 | codes/Config_Lagrange.vb:763-772 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d11535966974ea5ba9409081f565bfbfa354be015dc8c113e85875e8bb976a0"}},{"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":"88f9b257b1d67a36af397e54631edf289cf91b780df7978191b46087cfa2bd3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Form_Main.vb:3044-3053 | codes/Form_Main.vb:3059-3068 \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":3044}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad045c81a4145d8a587220a8dbe6154b25fc61dabf35ecba4193df99003cdc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Form_Main.vb:4115-4124 | codes/Form_Main.vb:6164-6173 \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":"b9851e2e363d0637e567ce2f2cc92d6db8e67c91bb693a9539e4c1117d547cd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Form_Main.vb:4164-4173 | codes/Form_Main.vb:6200-6209 \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":4164}}}],"partialFingerprints":{"codehealthFindingId/v1":"527a863552dddd2ff8645ba5f72c03e0b2217f7abb221044f8581a5706dc2854"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Form_Main.vb:5364-5373 | codes/Form_Main.vb:5379-5388 \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":5364}}}],"partialFingerprints":{"codehealthFindingId/v1":"5750b09b40d71220f93b4656d94815f6102b47c06e854d7fdaefdffd87736302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Form_Main.vb:6830-6839 | codes/View_Tree.vb:515-524 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":6830}}}],"partialFingerprints":{"codehealthFindingId/v1":"b079db6a4571fee20a835a6071d1c010eb049bb234391d52e7f4fdcda32c3a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Tool_Combine.vb:77-86 | codes/View_Tree.vb:305-314 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_Combine.vb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"213e2b273465500057ee3488e8ced57f799cddf1e9918d543544527497777245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Tool_DPP.vb:243-252 | codes/View_Tree.vb:3393-3402 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_DPP.vb"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5770c94db881df558777592214bd4d5532e9665d549550d9da753305c23aeff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Tool_Omitted.vb:166-175 | codes/Tool_Omitted.vb:178-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":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7495d974462945cbd3a5f1a8da87c0c9ed91deb9c23a235aed776743943dbdd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Tool_Omitted.vb:217-226 | codes/Tool_Omitted.vb:230-239 \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":"568ed885700385ff614d51b1d6945eecf17727de9ccb25c4ed2c2601627a8d07"}},{"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: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_SvT.vb"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"329e8ddebb86f7a612e7b5d88b06622ed3614ac85481defaa96b7395697b867c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/Tool_TvS.vb:123-133 | codes/Tool_TvS.vb:175-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":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e407d37fa406c7fb09f74454073404bac0fb63d7e2e3f2bb5105444e4db1ae2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): codes/View_Dis.vb:175-184 | codes/View_Dis.vb:189-198 \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":"3cd6978854b0e8061a4cc577153f5b81ce8ed8f48a14cdeb28c2671c4af9b385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): codes/Module_Stat.vb:133-141 | codes/Module_Stat.vb:148-156 | codes/Module_Stat.vb:163-171 | codes/Module_Stat.vb:178-186 | codes/Module_Stat.vb:193-201 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Module_Stat.vb"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6559dd59f0c54ee5154206f58dba8accf9e6bd9feebbddc8707edcc9f694e084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): codes/Config_BGB.vb:39-47 | codes/Config_Lagrange.vb:37-45 | codes/Config_SDIVA.vb:32-40 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"971a0f2ba3f136f2688d040af8b9e126b2340d2020edba80a730a14f881000a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): codes/Tool_Cluster.vb:744-752 | codes/Tool_Cluster.vb:769-777 | codes/Tool_Cluster.vb:1341-1350 \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":"d9693fa3e7babb01f82c38df9943a3d39900686098665bbb359ff093f26b9315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): codes/View_Tree.vb:3415-3423 | codes/View_Tree.vb:3673-3681 | codes/View_Tree.vb:3708-3716 \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":"214dc4c83b8adffaf9b0fdf9bee053cbf9dfe546224b29d16c4f8d39e79ffe06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Config_BGB.vb:477-485 | codes/Form_Main.vb:6681-6689 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e4b07b894b47de8e6d5c274e0d3ee914cb3c7177f53ec72dfaf8fedb7f9895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Config_BGB.vb:637-645 | codes/Config_Lagrange.vb:778-786 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4e5a5a403911d95d53381bdf9cd7fc2c3b4873d38c279b10d8a954ce69969c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Config_BGB.vb:1329-1337 | codes/Config_BGB.vb:1404-1414 \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":"938b209424460b4d2eab4d9e07ac636ae9d5f9c0e8191118ad55d2aed161fb4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Config_Lagrange.vb:309-317 | codes/Config_Lagrange.vb:1005-1013 \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_Lagrange.vb"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cf8ca0ac6f1edaef38c6883c8fe476543caeb981599c8a60a9bca658c234fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Form_Main.vb:755-763 | codes/Form_Main.vb:961-969 \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":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"da828ac51c6e765e270f925077a36673fc9ddaac031f77b2946c7feabc88c34c"}},{"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":"b3b13e36f61cb8175fd0826ac94d399209451906d74b6ab9daa8b3418b926738"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Form_Main.vb:4011-4019 | codes/Form_Main.vb:4027-4035 \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":4011}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e89d5ba9aff8e2130c830250fc7d3490fcdeec283432b343cc3890f5f54962d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Form_Main.vb:4031-4039 | codes/Form_Main.vb:6067-6075 \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":4031}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0824c52d2ef90cab8b9eb38a091e599fdaac60a4be86196988e1b4673d8928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Form_Main.vb:5231-5239 | codes/Form_Main.vb:5333-5341 \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":5231}}}],"partialFingerprints":{"codehealthFindingId/v1":"35da55d01ba021debfe0fddbb8091e62784e307ea9f739ebf1e047f0cf691df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Form_Main.vb:7382-7390 | codes/Form_Main.vb:7439-7447 \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":7382}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ae43a73f50e4413e7b0530445af04c5d39187e55bd048387123177928e4271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Form_Main.vb:7396-7404 | codes/Form_Main.vb:7449-7457 \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":"daf43c591615ef7f989249c0cc0d8dd49f4c5b3e2b483199de70f34056f5d1c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Codes/Module_BBM.vb:92-100 | Codes/Module_BBM.vb:103-111 \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_BBM.vb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af87b79eb7e699464fcc61f9dc4655388b10f6ee4ff7337ac1684147df4ef18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/Tool_Cluster.vb:186-194 | codes/Tool_Cluster.vb:1041-1049 \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":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d5a846c0a40e769bcf77d96d8ce8c721ef71f4920e41940ed24faff302dfa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): codes/View_Tree.vb:680-688 | codes/View_Tree.vb:1180-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":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac163a5c47c2f724fb415e3793b8b891efe2a96aab8382d9e430f503c95cd3c0"}},{"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":"32020f132f08914231fac1fac4752ec6a61a6252bf794ce96ce97034ddce75fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Config_BGB.vb:142-149 | codes/Config_Lagrange.vb:143-150 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee159c09bfc0c45bab8da63800989c7444df4a53fba708d5b8cb2ada1d65781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Config_BGB.vb:1295-1302 | codes/Config_Lagrange.vb:393-400 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ef591bb8656877f85eaddc4992ac7ef5020aa9ac6c5ad6b480b06241e88c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Form_Main.vb:2346-2353 | codes/Form_Main.vb:2564-2571 \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":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b565195306556d684c25a802ee33f2b528b40ef10c6392990f06da2c4ee08e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/Form_Main.vb:3494-3501 | codes/Form_Main.vb:3645-3652 \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":3494}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a1c96b951b9fc1c7328ee675cd0fcc24fe5b3c337ccc0b45141ffb4bcdf6ad"}},{"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":"7e2eb5b7acfbc9c18563c4c70be8a3f98178b53d9af73a5d456a79635649d2e2"}},{"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":"2e6737a6e14f8fce2d990961cfa50fb3849c20546e2d23397ecce7e6053146a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/View_Pie.vb:65-72 | codes/View_Pie.vb:278-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":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"099209c977a8fda391cdc9c6e58deab77651c6955a48368515cd4e0c4587ab85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/View_Tree.vb:182-189 | codes/View_Tree.vb:195-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":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77e8fad3abe4673f606b259ed9dfcd45fb3cf1b41c10e3175fab1c580f4de2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/View_Tree.vb:1586-1593 | codes/View_Tree.vb:1612-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":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"c165322ee5932906b23c5b1e0ddf18f8e07ee25650bd9cb89317c602b9d417cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/View_Tree.vb:1653-1660 | codes/View_Tree.vb:3839-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":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b2d74741254ff8f5e4e1456837339a737560f45510620d6052b24efb8922d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): codes/View_Tree.vb:3516-3523 | codes/View_Tree.vb:3528-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":3516}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b77ae7ae47764875f95e4034a50dfad25816b0bce7f3c4e6e1f647dd426bda4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): codes/View_Tree.vb:1201-1208 | codes/View_Tree.vb:2548-2555 | codes/View_Tree.vb:2578-2584 | codes/View_Tree.vb:2596-2602 | codes/View_Tree.vb:3233-3240 | codes/View_Tree.vb:3624-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":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e8b6702d9a261232d238238870de2f0e9188eec9cfb4a9d16305360f53e297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): codes/Config_BayArea.vb:255-261 | codes/Config_BGB.vb:616-622 | codes/Config_Lagrange.vb:757-763 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BayArea.vb"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e77c6434bcc560f3b6b10ecab15464b448fe352bc9ee85a8bb4f542e177733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): codes/Form_Main.vb:2322-2328 | codes/Form_Main.vb:2336-2342 | codes/Form_Main.vb:2554-2560 \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":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"65426c9126ad9c57afe4024d7cc3922650a4a09adb504c6ecac4915777f40cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): codes/Form_Main.vb:6015-6021 | codes/Form_Main.vb:6045-6051 | codes/Form_Main.vb:6079-6085 \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":6015}}}],"partialFingerprints":{"codehealthFindingId/v1":"713c7cfc21ba04d614650d85bcf3e063890e969e1c2b69c016f02ff6123782f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): codes/View_BBM.vb:83-89 | codes/View_BBM.vb:138-144 | codes/View_BBM.vb:187-193 \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":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fc59b34c8293c98ed574d0798b50abc6b52502e44e18d0c0d993589d3cd4cd"}},{"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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b51ae06e6ebd982b4f66e3eb9bb8e437e9514f90419ced75e2366c2f0a6b7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/Config_Chrom.vb:113-119 | codes/Config_Chrom.vb:352-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":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d96fb76ea265c28d11e582ff788601814bfd57d36aa7e79c1887e46b0f4511b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/Config_Traits.vb:123-129 | codes/Form_Main.vb:7117-7123 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Traits.vb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d94eb42d384487912b1740c766c692ba5923edbdccd1fb613dbdec13d81a937"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/Form_Main.vb:767-773 | codes/Form_Main.vb:973-979 \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":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"84da8fa7fa883a3b36383ae0d833abea7068e46a399b843cf15c9b2855bb997c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/Form_Main.vb:6026-6032 | codes/Form_Main.vb:6056-6062 \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":6026}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b2a0c6fe5e3be3222cf77ccde36d39d6793527bc4b2cf6ae067c7b7b31d2c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/Form_Main.vb:6034-6042 | codes/Form_Main.vb:6064-6070 \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":"1e2944b0dea007e6c46eb01df3b0e6ebc9bf46f077b174d43ea64c25b5f66654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/Form_Main.vb:6769-6775 | codes/View_Tree.vb:348-354 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":6769}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10752b0b3de87875e2dbea714adc89a6417080bb81800ed2f8c53d0362e55b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/Form_Main.vb:9303-9309 | codes/Tool_TvS.vb:271-277 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":9303}}}],"partialFingerprints":{"codehealthFindingId/v1":"218280bf3b07a8b108bf05f94c72739d457d7ad79c659165f0144f675d477012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/Tool_TvS.vb:135-141 | codes/Tool_TvS.vb:187-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Tool_TvS.vb"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"db34f632c39b62f7c3b89765527aa907cd187911969d7d2a059aa13a989a6a8e"}},{"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":"fce5956386fd79be0028e553e8fae95516d42078b7cb682ddb6d275bf564e7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/View_Tree.vb:2912-2918 | codes/View_Tree.vb:2930-2936 \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":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"761c29c7670cfdac9e7928a35428f5a0847232205f97502fec88a71cf922aa01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): codes/View_Tree.vb:3006-3012 | codes/View_Tree.vb:3029-3035 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":3006}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad024a36f2ba50ab1e9cdb710659c8d7affde690d2aaef47854753ef2fa30aa"}},{"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":"be74bc318d6cdea85ced1144610ee6c33ddc5ae40716b08066e3eea5e8862148"}},{"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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f3f2f280a9779295c9245ac1846791aa745dd7548d812dcd6b015d87285745"}},{"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":"3efd81914fc9a57a2a74b7a7ed91e84ff8b193366b567d7511759cc83cbace89"}},{"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":"2f2fd885a935fe745eb9a8f41c38a4c37147a42b6d19b24229266d5b8212ac2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Config_Chrom.vb:281-286 | codes/Config_Traits.vb:303-308 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Chrom.vb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd6a6a973c533f90d5204c90f0aa05e52b4ecdb9d399de00ab22eb1e2f4317b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Form_Main.vb:1843-1848 | codes/Form_Main.vb:1995-2000 \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":"94639d5c0b9c54e19b28d4f066fc5bdf694b39053de4210eeffc37561685748c"}},{"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: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":6807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4ed4d9fd34b15e2214208b38b9e54072ac64b1d1eac86bfca4e556bc456f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Form_Main.vb:8657-8662 | codes/Form_Main.vb:9106-9111 \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":8657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0032f0b60f3740b07f330460bd8ea37b2e98529d4a37c3d0c30a8cd59fb11bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/Form_Main.vb:9030-9035 | codes/Form_Main.vb:9158-9164 \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":9030}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af9ae5f6ed8d979520ef6aa61783886f76d778de1a424c558549eb1d288f857"}},{"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":"46ce6dbe6edcf698bde6d62ca46a4311cf64a8af4f4a236d3559cd1866297110"}},{"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":"41ac4c7f2fb9bee18bf10a027f23c55a73caa66ae2353739a3fa3cdcb76c61cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): codes/View_BBM.vb:131-136 | codes/View_BBM.vb:180-185 \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_BBM.vb"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"798786d2ce8894c710fd812fd0d4a1f03ac2588ccc34b05628fdd27d9b8bcfc1"}},{"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/View_Tree.vb"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5d3f66796c06958afafc7245fde4e8ed5c7ffd5c6cbc402315638fbcdec9eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 23): codes/View_Tree.vb:639-643 | codes/View_Tree.vb:1199-1204 | codes/View_Tree.vb:1210-1214 | 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 23 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":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a47b05a67c778857b3340826f7852453ebf059fad7040343c36ed79d88249e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10): codes/Config_Traits.vb:423-427 | codes/Form_Main.vb:5909-5913 | codes/Form_Main.vb:8543-8547 | codes/Form_Main.vb:8611-8615 | codes/Form_Main.vb:8659-8663 | codes/Form_Main.vb:9031-9035 | codes/Form_Main.vb:9108-9112 | codes/Form_Main.vb:9160-9164 | codes/Form_Main.vb:9318-9322 | codes/Form_Main.vb:9533-9537 \u2014 there are 10 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 10 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_Traits.vb"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ff4e163a4da177ed97476a40836f40afdff99440c3bdfd7a3f5a36a9a74aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): codes/Form_Main.vb:776-780 | codes/Form_Main.vb:982-986 | codes/Form_Main.vb:2629-2633 \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":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b2394a8c84c66e615755ce52471ae063753e910ca1868f14696c7558ea0bbe"}},{"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":"c95ac2fc03c03cf0cac1c4438d7e2aa8c38a5f5a522d778008087a40def4787c"}},{"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":"d71ea706ca32d3d5b1c7036cc3a2788fe0f6ad9dfe5ae0a4b82a70886f5c6eab"}},{"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 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Config_BGB.vb"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e1bd1b4f16ff9ecf76cf16e02e614ae5a5e9d81372a2ffc13638f7ad5867f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/Form_Main.vb:783-787 | codes/Form_Main.vb:989-993 \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":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71c07796242ae77b898b103ab672bf3ba840decc8451a4712a9274647ac08cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/Form_Main.vb:7111-7115 | codes/Tool_DPP.vb:173-177 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codes/Form_Main.vb"},"region":{"startLine":7111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4588d63a46729d49f3171278a6b0dc57e499b5a682e5ac3ac7ee15dd7adc1477"}},{"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":"2c3e7c7831de29218f970d62c8c37099c69b04e8d86840732d1ba363f67f219b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/View_Dis.vb:244-248 | codes/View_Dis.vb:251-255 \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":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"70727dfca97193ff9539ec5393b8db3a2e08f4620a4745d0fab15127d4673bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/View_Tree.vb:1350-1354 | codes/View_Tree.vb:1388-1392 \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":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f468eef87dc6122773c1b933dbf07dc72cd33dd0e9d693d767d6e47db5d0f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/View_Tree.vb:2842-2846 | codes/View_Tree.vb:2866-2870 \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":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc12101e583dc1700dfcabf8e2ed9b217569180a783626d00df73be9f075a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): codes/View_Tree.vb:2848-2852 | codes/View_Tree.vb:2872-2876 \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":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d6ac2d67d993095c16df6c2c4cde5ab9e9d02a4530089c95a66ed6ec2ddf30"}},{"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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3132564c6310e5d01a231f252a02d5d2f5a542c0a8fa29a14c89693f1e3df871"}},{"ruleId":"D9","level":"note","message":{"text":"No tests found: No test suite could be collected \u2014 nothing here references a test framework (xUnit, NUnit or MSTest), so there were no discoverable tests to count. 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":"D16","level":"warning","message":{"text":"single-maintainer \u2014 knowledge-concentration (bus factor) risk: single-maintainer \u2014 knowledge-concentration (bus factor) risk (1 author(s) across 45 commit(s) sampled)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b4b49d961df742f0e507f4cc5c8094fb077ba0391a27fd015d18320865187719"}},{"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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. Narrow the catch to the exception you actually expect, record it through whatever this codebase already uses to report problems, or \u2014 where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all and leaves this row in place. Any of the three makes the decision reviewable; all three clear this row."},"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":"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":"2eddf9f4d45af80b0ccffe04dd4a5d925b3a01ac5e81ef36d467245634da80f1"}},{"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":"c9b0aa72d1da110612126a92a8d1694d05a6a09bf14ea2649b96187caeb40416"}},{"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":"1d25c91047a7b94f4e78869961f0f3de00cdcc1580bbfed4dcf5ff0d2f000e23"}},{"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":"ff1ff42640adea94692b3f4caafa0ba181acc1bb26fbcbd66183189bc3396d57"}},{"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":"3c24265b8dbb6af9946dce91e706ac1ebb317d4077fb62cabe3d23d49e00a3f4"}},{"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":"e910a5f8323b4e8b2e279bc65dd648e1eeca355c3ddda22a194209a830a5e3d0"}},{"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":"073c83c7d0225dadd4efa177e1a52f8c8cbd8eef32fc34e06b812dd47c05c4f6"}},{"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":"c70914dd5ea6700a63ed6a2f534792daf2adde735f18949333c4de2e51ba9fcb"}},{"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":"521731e09d1d2e2dfc570bbc7e24498d48833a2366a02533dbaa11af56298741"}},{"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":"602aa22d2d4efa7033045e37186431b58105207d7023b31ca03062e33fdb6d6f"}},{"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":"df9820c825595ec5fd707b71839a57c11486f701b1732aefd3d1032ba8c18be8"}},{"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":"88b1af47692a736d036046d777ac6b7cdddfb6ccd3bd7dce46ca85b57e0ef411"}},{"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":"b4e092e6c95e298014e63ad3c33cafa400d90bd9f73b4d962edfb632fde6cbc9"}},{"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":"02e49f5d3f1d34d5d13b5d4095387cc3c932572bde16f562cd9221c52152f924"}},{"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":"ca2879677fe54e533c6f60bf88c9599993d512fcc3f591db8b70688354695a3d"}},{"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":"a8b21fdf132167fbaa2d8fc8834e9001569b8c7706e0565bae799ca45ac0dd6e"}},{"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":"eaa175d2c15c7fff00118720e2eb0c8019d0feaf9e89b072bc64fbc19c045dba"}},{"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":"03274e13e9968865ae0c8520efa47a2e6593421ffdb54674f91886b7d052be95"}},{"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":"156a5820888484ab72a0f1b401e0febc78d77fe4870180ef7d94e4f045633cd6"}},{"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":"62d20c03a32813c4c6ae7ba0e9ee0c260145b956752b77bb7bebf10f6d9be611"}},{"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":"305520ae1444d25525390c6082cc7136604b98a4d415da3ef77f6cd835ab927e"}},{"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":"1d9c0e027fe810bd69166cb79ce7dd5b9101e30e05914b2416d232a4479d2017"}},{"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":"07dfacf1087c8e263414f14f53f1feb526ea192348a9bdcf0cbbfed0c9c461bf"}},{"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":"b48498dd745a12fa7429de7e4adee4a50de645f9bbc8626dae45032586655da8"}},{"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":"c1bd4355f726a03b23ef5bfbf24eb99aef265c0e56e6105af2635c4ab78586e9"}},{"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":"c03d423850025469ceadb613106e04fa2b8c089ec99ef27f338808b8c8402c06"}},{"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":"a6dfc9e402aa181e8d7639038b653e314d546f2fb6d58f2e7fffbfb599e73162"}},{"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":"7be3e95b9d55590fd73cde7a91c405e39ce756131d25adfe37a726858be7971b"}},{"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":"3aae7e4c1781684bdfdef7b1621d75c949d5e1211ebc0c8302fd8620bf7dbfaa"}},{"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"}}],"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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":30,"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."]}]}