Public report — RASP, published 3 Aug 2026.
Concrete security findings (CVE IDs, secret matches, dependency versions) are hidden in this version;
ask the repo owner for the full report.
445findings with an exact file:lineof 454 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
29/94dimensions across the health lenses24952 LoC · 1 projects — wide & deep
Executive summary
Read through the Production lens — the standard calibration. *Green* means good enough to run in production. The score is absolute and comparable across repos.
sculab/RASP carries serious gaps (39%). Several issues below can materially affect correctness, security, or the cost of changing it — and propagate to everything that depends on it.
The area that most needs attention is Readiness (23%) — releases are harder to depend on — versioning, release notes and dependency hygiene are thin, so consumers can't easily tell what changed or trust an upgrade. Security (50%) is the next concern — exposure to security and compliance incidents is elevated.
Leadership focus, highest impact first: CI workflow that builds and runs the test suite on every push/PR (CI/CD gates); 1 No automated tests finding(s) in Code Coverage (Code Coverage); 1 No tests found finding(s) in Test Distribution (Test Distribution).
For scale: Medium (~24,952 production lines); rebuilding it from scratch would take roughly ~0.2 person-years (~1 engineer). Approximate, ±~30%.
How the score is built — each lens's share of the headlineWidth is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.
A full-fidelity diff against the previous run's complete recorded findings — line-move tolerant: a finding that only shifted line counts as unchanged, only genuinely new titles/files surface here.
0.7× (at 39% quality) — the last 20% of quality is most of the work
Size & shape
Medium · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)
This codebase represents roughly ~0.2 person-years of build effort (about ~€22,000 to rebuild). Its weakest lens is Readiness at 23% — the part of that asset most exposed by the findings below.
How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.1) — desktop/game × a 0.7× quality factor, at €60–95/h; indicative, ±~30% · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).
Top priorities
The highest-leverage moves; the full ranked list is in the Roadmap below.
1
Resolve the 1 No automated tests finding(s) in Code Coverage.
Value concentrated against a weak lens · High · Value at risk
This is a Medium asset (~0.2 person-years to rebuild), and its weakest lens is Readiness at 23%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.
→ Direct remediation budget at Readiness first — highest risk-reduction per euro on an asset this size.
Highest-leverage move · Medium · Leverage
Of everything flagged, the best return on effort is: Add a CI workflow that builds and runs the test suite on every push/PR. The rest can wait behind it.
Evidence: priority ranking: top of 5 ranked by impact/effort
→ Add a CI workflow that builds and runs the test suite on every push/PR.
A velocity tax on every change · Medium · Economics
The code-quality signals (complexity, duplication, cohesion) average 4.8/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 8–18% more than in clean code, and the tax compounds as the codebase grows. (A modelled estimate, not a measured fact.)
Evidence: D1/D2/D4/D6 code quality: averaging 4.8/10 across the code-quality signals actually measured
→ Pay it down where churn is highest — the hotspots — not everywhere; that's where the tax is actually paid.
At a glance — Code Health · 66% · Adequate · gated by D1, D2
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A02:2021 — Cryptographic Failures
30
High / Critical
Roadmap
First, establish a continuous integration workflow to build and test every change, ensuring immediate feedback on code quality. Next, address the lack of automated tests by resolving the identified coverage gaps and ensuring tests are properly distributed. Simultaneously, secure the codebase by removing exposed secrets from the repository history. Finally, improve release hygiene by maintaining a clear changelog to track shipped features and fixes.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 No automated tests finding(s) in Code Coverage.
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).
Introduce deliberate module boundaries — by feature (vertical slices) if your team prefers, or by layer (domain/application/infrastructure). Even splitting into a few cohesive projects with a clear dependency direction would help.
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 27 of 29 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 2 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.5 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 29 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 445 of 454 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
A clean run — every tool resolved and ran, and every applicable dimension was measured at full confidence. No scanner was unavailable, no analysis timed out or crashed, and nothing fell back to a degraded estimate.
When something does degrade — a missing scanner, a shallow clone, an LLM hiccup — it is named here explicitly and its exact cause recorded in diagnostics.md, never absorbed silently into the score.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity (jscpd) — it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D8 Code Coverage: Coverage is measured by building and running the test suite inside Watchdog's isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D18 Solution Shape: Build integrity reflects whether the solution compiled in this environment — a build that needs a private feed, a specific SDK, or a generated file absent from the repo can read as broken when it is merely unreproducible here.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
The LLM boundary
LLM-set scores this run (3): D19, D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score (documentation, ADR quality, naming, comment value, onboarding) — D25 sets the ADR-conformance fraction over sampled code, D22 judges API accuracy over a sample. These are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
+ 66 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 Form_Main.load_trees (cyclomatic 138) finding(s) in Cyclomatic Complexity — start with Form_Main.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Form_Main.load_bayes_trees (cyclomatic 116) finding(s) in Cyclomatic Complexity — start with Form_Main.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Module_Brushes.str_to_color (cyclomatic 113) finding(s) in Cyclomatic Complexity — start with Module_Brushes.vb. — One of this dimension's main actionable groups (1 warning-level).
Stand up a CI pipeline, then gate Cyclomatic Complexity in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 144 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 Form_Main.load_trees (cognitive 615) finding(s) in Cognitive Complexity — start with Form_Main.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Form_Main.load_bayes_trees (cognitive 531) finding(s) in Cognitive Complexity — start with Form_Main.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 View_Tree.draw_tree (cognitive 496) finding(s) in Cognitive Complexity — start with View_Tree.vb. — One of this dimension's main actionable groups (1 warning-level).
Stand up a CI pipeline, then gate Cognitive Complexity in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes7.6 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 9 ClassTooLong finding(s) in God Classes — start with Config_Lagrange.vb, Tool_Omitted.vb, Tool_Combine.vb. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 6 FileTooLong finding(s) in God Classes — start with Form_Main.vb, View_Tree.vb, Config_BGB.vb. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 4 TooManyMethods finding(s) in God Classes — start with Form_Main.vb, View_Tree.vb, Tool_Cluster.vb. — One of this dimension's main actionable groups (4 warning-level).
Stand up a CI pipeline, then gate God Classes in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
+ 29 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 16 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with Form_Main.vb (6), Tool_Omitted.vb (2), Batch Tools.vb. — One of this dimension's main actionable groups (16 warning-level).
Resolve the 14 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with Form_Main.vb (7), Config_BGB.vb (3), Config_Lagrange.vb. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 12 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with View_Tree.vb (4), Config_BGB.vb (3), Form_Main.vb (2). — One of this dimension's main actionable groups (12 warning-level).
Stand up a CI pipeline, then gate Code Duplication in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
What it measures: How much of the code is actually exercised by tests.
Method: Coverage from coverlet runs or committed reports (Cobertura/OpenCover/lcov), computed per-file with structured exclusions for generated, trivial, and glue code. When the suite can't be built/run in-image AND no report is committed, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.
No automated tests — no test code was found in this repository.
No automated tests
What to do
Resolve the 1 No automated tests finding(s) in Code Coverage. — One of this dimension's main actionable groups (1 issue-level).
Stand up a CI pipeline, then gate Code Coverage in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d8_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution0.0 / 10Critical✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
26 deducted debt markers + 0 dead symbols across 24952 LoC (0.9/KLoC) → score 8.1.
EmptyCatchBlock · ×25codes/Config_BBM.vb:37
TodoCommentcodes/Form_AboutBox.vb:15
What to do
Resolve the 25 EmptyCatchBlock finding(s) in Explicit Debt — start with Form_Main.vb (13), Module_Var.vb (3), Tool_Cluster.vb (3). — One of this dimension's main actionable groups (25 issue-level).
Resolve the 1 TodoComment finding(s) in Explicit Debt — start with Form_AboutBox.vb. — One of this dimension's main actionable groups (1 warning-level).
Stand up a CI pipeline, then gate Explicit Debt in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the solution is laid out in a sensible, conventional structure.
Method: Solution structure: project count, decomposition, shell-project detection, build success (confirmed failures cap the score); traced to actual .sln files and binaries. Deterministic.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
RASP's README is a solid single-document introduction that states the software and its purpose clearly. It gives install links to two sources (SourceForge and an internal HTTP server), lists six tutorials with full URLs pointing to Chinese blog posts, and cites the paper for both the main program and S-DIVA methods. The body clips mid-sentence after 'S-DIVA method:' under the citations section, so further sections like usage examples or a roadmap are not visible; this is not penalized by the clip discipline. It reads as well-organized but thin documentation for an RASP tool whose primary value lies in its tutorials and citations.
XML-doc coverage: RASPRASP.vbproj
What to do
Improve Documentation Quality — currently 6.0/10. — RASP's README is a solid single-document introduction that states the software and its purpose clearly. It gives install links to two sources (SourceForge and an internal HTTP server), lists six tutorials with full URLs pointing to Chinese blog posts, and cites the paper for both the main program and S-DIVA methods. The body clips mid-sentence after 'S-DIVA method:' under the citations section, so further sections like usage examples or a roadmap are not visible; this is not penalized by the clip discipline. It reads as well-organized but thin documentation for an RASP tool whose primary value lies in its tutorials and citations.
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
92 % of calls cross a namespace and 1 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: medium — clean/modular boundaries expected.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Git-history secret scan via gitleaks detect over full history in an isolated checkout; each match flagged High. Exhaustive; degrades cleanly when tool absent.
63 finding(s): 0 critical, 63 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
Secret: aws-access-token · ×29Tutorials/examples/Psychotria/Alignments/ETS.fasta:6detected by gitleaks finding
Rotate the exposed credentials — git history can't be un-committed
What to do
Resolve the 29 Secret finding(s) in Secrets (history) — start with nd3.fasta (27), ETS.fasta (2). — One of this dimension's main actionable groups (29 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling; coupling through a build step, config, or non-source file isn't seen.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
~25k production LoC (51 types) across 1 project(s) / 4 namespace(s) with no recognised architectural style or layering — at this size, deliberate module boundaries would help. No DDD/clean/vertical-slice/CQRS/transaction-script organisation was detected — code is likely organised ad hoc, which makes change and onboarding harder as it grows.
What to do
Introduce deliberate module boundaries — by feature (vertical slices) if your team prefers, or by layer (domain/application/infrastructure). Even splitting into a few cohesive projects with a clear dependency direction would help.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.
Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a 'Testing' section to the root README — how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no `NNNN-title.md` documents and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No C4/PlantUML/Mermaid diagram or architecture.md — the high-level shape isn't documented.
What to do
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree with `NNNN-title.md` names is the most discoverable form).
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Production code isn't grouped under a src/ folder — application code, tests and tooling are mixed at the repository root.
No test surface was found — there are no tests here to separate from production code, so the folder question hasn't been reached yet.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
Start a test surface where your build system looks for one (tests/, test/, spec/, or your ecosystem's test source set) — the separation follows from putting the first tests in the right place.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
Do you agree with this assessment?
P1 · CI/CD gates0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.
What to do
Add a CI workflow that builds and runs the test suite on every push/PR.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add CodeQL's csharp pack (it analyses VB.NET too), or a security analyzer package (or `semgrep --config=auto`, which runs on any language) — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build.
What to do
Run what this repository's stack ships: CodeQL's csharp pack (it analyses VB.NET too), or a security analyzer package — or `semgrep --config=auto`, which runs on any language — — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Not included — 65 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — no DI registrations detected
AX10 Code composition — not assessed — code composition is computed by ROLE over a document set that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX2 Stateful singletons — no singleton implementations detected
AX3 Project dependency cycles — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX4 Dependency direction — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — no public interfaces
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — not assessed — test isolation is computed from a project graph (which projects are test projects, and what they reference) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — No tests were found in the analyzed repository to assess for quality.
D11 Test Reliability — Test reliability not included
D14 License Compliance — license scan produced no result — the tool ran but its JSON output could not be parsed; the offline NuGet fallback resolved nothing
D16 Bus Factor — single-maintainer — knowledge-concentration (bus factor) risk
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D22 Internal API Consistency — No exposed public API
D23 Boundary Type-Coupling — At only 24952 LoC across a single project there are no cross-project boundaries to assess.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D30 Dependency Vulnerabilities — the solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan for NuGet CVEs — excluded rather than scored; re-run on an SDK that can restore this solution
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Terraform, Kubernetes/Helm, CloudFormation); nothing to scan.
D32 Data Compliance (PII/GDPR) — Data compliance (PII/GDPR) was not assessed in this scan — no ruleset is currently available for it. This says nothing about how this repository handles personal data, in either direction.
D33 JS/npm Dependency Vulnerabilities — No JS/npm manifest or lockfile found outside build output (package.json, package-lock.json, yarn.lock, pnpm-lock.yaml, bun.lockb); no JS dependencies to scan.
D34 Knowledge Freshness — early-stage repository — too little history to judge knowledge freshness
D36 Supply-chain Provenance & Signing — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .gitlab-ci.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, Jenkinsfile, .circleci); there is no build to attest provenance for.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D38 OSV Dependency Vulnerabilities — No supported non-.NET dependency lockfile found outside build output (npm package-lock/yarn/pnpm/bun, Go go.mod, Rust Cargo.lock, Maven pom.xml, Gradle lockfiles, Python requirements.txt/poetry.lock/Pipfile.lock/pdm.lock, PHP composer.lock, Ruby Gemfile.lock, Elixir mix.lock, Dart pubspec.lock, Swift Package.resolved); nothing for OSV to scan. A NuGet-only repo stays NotApplicable — .NET CVEs are D30's domain.
D39 IL Efficiency — The target did not build, so no IL was available to measure.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no MSBuild project graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this check looks for
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this check looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this check looks for
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — no CI workflow found
P2 Observability — Observability was not assessed: this check reads a source model that does not carry this repository's product — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of a logging idiom this check recognises is NOT evidence that this repo lacks structured logging (it may log through its own ecosystem's logger). This is a gap in the analyzer, not a finding about this repository.
P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
P8 Schema migrations — no EF Core usage detected
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (Cobertura — `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference) into the repo working tree before the scan — a CI step is the usual place, since the artefact is commonly gitignored, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF2 Allocation hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF3 Async & latency hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
EmptyCatchBlock codes/Config_BBM.vb:37— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:114— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:1004— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:2646— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:3157— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:4240— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:4286— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:4298— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:4503— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:4560— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:4630— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:5776— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:6935— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Main.vb:8898— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Form_Welcome.vb:101— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Module_Var.vb:173— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Module_Var.vb:189— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Module_Var.vb:229— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Tool_Cluster.vb:396— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Tool_Cluster.vb:612— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Tool_Cluster.vb:737— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Tool_SvT.vb:243— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Tool_TvS.vb:35— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Tool_TvS.vb:69— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
EmptyCatchBlock codes/Tool_TvS.vb:77— empty catch block — 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 — where swallowing really is correct, as it often is on a teardown/dispose path where throwing would mask the original failure — write down WHY in a comment on the catch. The comment has to give the reason: a note that only restates the swallow ("ignored", "do nothing") 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.
Duplicated block (10 lines × 2) codes/Batch Tools.vb:66— codes/Batch Tools.vb:66-75 | codes/Batch Tools.vb:82-91 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) codes/Config_BBM.vb:12— codes/Config_BBM.vb:12-21 | codes/Config_Traits.vb:10-19 — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10 lines × 2) codes/Config_BGB.vb:622— codes/Config_BGB.vb:622-631 | codes/Config_Lagrange.vb:763-772 — 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.
Duplicated block (10 lines × 2) codes/Form_Main.vb:1163— codes/Form_Main.vb:1163-1173 | codes/Form_Main.vb:1953-1962 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) codes/Form_Main.vb:3044— codes/Form_Main.vb:3044-3053 | codes/Form_Main.vb:3059-3068 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) codes/Form_Main.vb:4115— codes/Form_Main.vb:4115-4124 | codes/Form_Main.vb:6164-6173 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) codes/Form_Main.vb:4164— codes/Form_Main.vb:4164-4173 | codes/Form_Main.vb:6200-6209 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) codes/Form_Main.vb:5364— codes/Form_Main.vb:5364-5373 | codes/Form_Main.vb:5379-5388 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) codes/Form_Main.vb:6830— codes/Form_Main.vb:6830-6839 | codes/View_Tree.vb:515-524 — 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.
Duplicated block (10 lines × 2) codes/Tool_Combine.vb:77— codes/Tool_Combine.vb:77-86 | codes/View_Tree.vb:305-314 — 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.
Duplicated block (10 lines × 2) codes/Tool_DPP.vb:243— codes/Tool_DPP.vb:243-252 | codes/View_Tree.vb:3393-3402 — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10 lines × 2) codes/Tool_Omitted.vb:166— codes/Tool_Omitted.vb:166-175 | codes/Tool_Omitted.vb:178-187 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) codes/Tool_Omitted.vb:217— codes/Tool_Omitted.vb:217-226 | codes/Tool_Omitted.vb:230-239 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) codes/Tool_SvT.vb:265— codes/Tool_SvT.vb:265-274 | codes/Tool_TvS.vb:376-385 — 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.
Duplicated block (10 lines × 2) codes/Tool_TvS.vb:123— codes/Tool_TvS.vb:123-133 | codes/Tool_TvS.vb:175-184 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) codes/View_Dis.vb:175— codes/View_Dis.vb:175-184 | codes/View_Dis.vb:189-198 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) codes/Config_BGB.vb:477— codes/Config_BGB.vb:477-485 | codes/Form_Main.vb:6681-6689 — 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.
Duplicated block (9 lines × 2) codes/Config_BGB.vb:637— codes/Config_BGB.vb:637-645 | codes/Config_Lagrange.vb:778-786 — 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.
Duplicated block (9 lines × 2) codes/Config_BGB.vb:1329— codes/Config_BGB.vb:1329-1337 | codes/Config_BGB.vb:1404-1414 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `codes/Config_BGB.vb:1329` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) codes/Config_Lagrange.vb:309— codes/Config_Lagrange.vb:309-317 | codes/Config_Lagrange.vb:1005-1013 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) codes/Form_Main.vb:755— codes/Form_Main.vb:755-763 | codes/Form_Main.vb:961-969 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) codes/Form_Main.vb:2917— codes/Form_Main.vb:2917-2925 | codes/Form_Main.vb:7081-7090 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) codes/Form_Main.vb:4011— codes/Form_Main.vb:4011-4019 | codes/Form_Main.vb:4027-4035 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) codes/Form_Main.vb:4031— codes/Form_Main.vb:4031-4039 | codes/Form_Main.vb:6067-6075 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) codes/Form_Main.vb:5231— codes/Form_Main.vb:5231-5239 | codes/Form_Main.vb:5333-5341 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) codes/Form_Main.vb:7382— codes/Form_Main.vb:7382-7390 | codes/Form_Main.vb:7439-7447 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) codes/Form_Main.vb:7396— codes/Form_Main.vb:7396-7404 | codes/Form_Main.vb:7449-7457 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) Codes/Module_BBM.vb:92— Codes/Module_BBM.vb:92-100 | Codes/Module_BBM.vb:103-111 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) codes/Tool_Cluster.vb:186— codes/Tool_Cluster.vb:186-194 | codes/Tool_Cluster.vb:1041-1049 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) codes/View_Tree.vb:680— codes/View_Tree.vb:680-688 | codes/View_Tree.vb:1180-1188 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) codes/Config_BGB.vb:109— codes/Config_BGB.vb:109-116 | codes/Config_BGB.vb:288-295 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) codes/Config_BGB.vb:142— codes/Config_BGB.vb:142-149 | codes/Config_Lagrange.vb:143-150 — 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.
Duplicated block (8 lines × 2) codes/Config_BGB.vb:1295— codes/Config_BGB.vb:1295-1302 | codes/Config_Lagrange.vb:393-400 — 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.
Duplicated block (8 lines × 2) codes/Form_Main.vb:2346— codes/Form_Main.vb:2346-2353 | codes/Form_Main.vb:2564-2571 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 2) codes/Form_Main.vb:3494— codes/Form_Main.vb:3494-3501 | codes/Form_Main.vb:3645-3652 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) codes/Tool_Cluster.vb:16— codes/Tool_Cluster.vb:16-24 | codes/Tool_Cluster.vb:85-92 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 2) codes/Tool_Cluster.vb:405— codes/Tool_Cluster.vb:405-413 | codes/Tool_Cluster.vb:554-561 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) codes/View_Pie.vb:65— codes/View_Pie.vb:65-72 | codes/View_Pie.vb:278-285 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) codes/View_Tree.vb:182— codes/View_Tree.vb:182-189 | codes/View_Tree.vb:195-202 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) codes/View_Tree.vb:1586— codes/View_Tree.vb:1586-1593 | codes/View_Tree.vb:1612-1619 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) codes/View_Tree.vb:1653— codes/View_Tree.vb:1653-1660 | codes/View_Tree.vb:3839-3846 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) codes/View_Tree.vb:3516— codes/View_Tree.vb:3516-3523 | codes/View_Tree.vb:3528-3535 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) codes/Config_BGB.vb:1305— codes/Config_BGB.vb:1305-1312 | codes/Config_Lagrange.vb:424-430 — 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.
Duplicated block (7 lines × 2) codes/Config_Chrom.vb:113— codes/Config_Chrom.vb:113-119 | codes/Config_Chrom.vb:352-358 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) codes/Config_Traits.vb:123— codes/Config_Traits.vb:123-129 | codes/Form_Main.vb:7117-7123 — 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.
Duplicated block (7 lines × 2) codes/Form_Main.vb:767— codes/Form_Main.vb:767-773 | codes/Form_Main.vb:973-979 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) codes/Form_Main.vb:6026— codes/Form_Main.vb:6026-6032 | codes/Form_Main.vb:6056-6062 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) codes/Form_Main.vb:6034— codes/Form_Main.vb:6034-6042 | codes/Form_Main.vb:6064-6070 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) codes/Form_Main.vb:6769— codes/Form_Main.vb:6769-6775 | codes/View_Tree.vb:348-354 — 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.
Duplicated block (7 lines × 2) codes/Form_Main.vb:9303— codes/Form_Main.vb:9303-9309 | codes/Tool_TvS.vb:271-277 — 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.
Duplicated block (7 lines × 2) codes/Tool_TvS.vb:135— codes/Tool_TvS.vb:135-141 | codes/Tool_TvS.vb:187-193 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) codes/View_Tree.vb:1210— codes/View_Tree.vb:1210-1216 | codes/View_Tree.vb:3104-3111 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) codes/View_Tree.vb:2912— codes/View_Tree.vb:2912-2918 | codes/View_Tree.vb:2930-2936 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) codes/View_Tree.vb:3006— codes/View_Tree.vb:3006-3012 | codes/View_Tree.vb:3029-3035 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) codes/Batch Tools.vb:241— codes/Batch Tools.vb:241-251 | codes/Batch Tools.vb:266-276 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) codes/Form_Main.vb:1353— codes/Form_Main.vb:1353-1363 | codes/Form_Main.vb:1375-1385 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) codes/Form_Main.vb:2165— codes/Form_Main.vb:2165-2175 | codes/Form_Main.vb:2264-2274 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 2) codes/Form_Main.vb:4138— codes/Form_Main.vb:4138-4148 | codes/Form_Main.vb:6186-6196 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) codes/Form_Main.vb:7218— codes/Form_Main.vb:7218-7228 | codes/Form_Main.vb:7280-7290 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) codes/Form_Main.vb:8224— codes/Form_Main.vb:8224-8234 | codes/Form_Main.vb:8327-8337 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) codes/Tool_Omitted.vb:692— codes/Tool_Omitted.vb:692-702 | codes/Tool_Omitted.vb:715-725 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) codes/View_BBM.vb:105— codes/View_BBM.vb:105-115 | codes/View_BBM.vb:154-164 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) codes/View_Pie.vb:76— codes/View_Pie.vb:76-86 | codes/View_Pie.vb:290-300 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) codes/View_Tree.vb:1712— codes/View_Tree.vb:1712-1722 | codes/View_Tree.vb:1995-2005 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) codes/View_Tree.vb:1747— codes/View_Tree.vb:1747-1757 | codes/View_Tree.vb:2036-2046 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) codes/Config_Chrom.vb:93— codes/Config_Chrom.vb:93-98 | codes/Config_Chrom.vb:176-181 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `codes/Config_Chrom.vb:93` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) codes/Config_Chrom.vb:281— codes/Config_Chrom.vb:281-286 | codes/Config_Traits.vb:303-308 — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 2) codes/Form_Main.vb:1843— codes/Form_Main.vb:1843-1848 | codes/Form_Main.vb:1995-2000 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) codes/Form_Main.vb:6807— codes/Form_Main.vb:6807-6812 | codes/View_Tree.vb:387-392 — 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.
Duplicated block (6 lines × 2) codes/Form_Main.vb:8657— codes/Form_Main.vb:8657-8662 | codes/Form_Main.vb:9106-9111 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) codes/Form_Main.vb:9030— codes/Form_Main.vb:9030-9035 | codes/Form_Main.vb:9158-9164 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) codes/Tool_Combine.vb:200— codes/Tool_Combine.vb:200-205 | codes/Tool_Combine.vb:287-292 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) codes/Tool_TvS.vb:309— codes/Tool_TvS.vb:309-314 | codes/Tool_TvS.vb:431-436 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) codes/View_BBM.vb:131— codes/View_BBM.vb:131-136 | codes/View_BBM.vb:180-185 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) codes/View_Tree.vb:1729— codes/View_Tree.vb:1729-1734 | codes/View_Tree.vb:2014-2019 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
ClassTooLong: Config_Lagrange codes/Config_Lagrange.vb:0— ClassTooLong — 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.
ClassTooLong: Tool_Omitted codes/Tool_Omitted.vb:0— ClassTooLong — 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.
ClassTooLong: Tool_Combine codes/Tool_Combine.vb:0— ClassTooLong — 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.
ClassTooLong: Config_SDIVA codes/Config_SDIVA.vb:0— ClassTooLong — 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.
ClassTooLong: Tool_TvS codes/Tool_TvS.vb:0— ClassTooLong — 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.
ClassTooLong: Config_Chrom codes/Config_Chrom.vb:0— ClassTooLong — 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.
ClassTooLong: Config_Traits codes/Config_Traits.vb:0— ClassTooLong — 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.
ClassTooLong: Config_BayArea codes/Config_BayArea.vb:0— ClassTooLong — 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.
ClassTooLong: View_Dis codes/View_Dis.vb:0— ClassTooLong — 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.
Duplicated block (5 lines × 2) codes/Config_BayArea.vb:79— codes/Config_BayArea.vb:79-83 | codes/Config_BayArea.vb:85-89 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) codes/Config_BGB.vb:649— codes/Config_BGB.vb:649-653 | codes/Config_Lagrange.vb:790-794 — 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.
Duplicated block (5 lines × 2) codes/Form_Main.vb:783— codes/Form_Main.vb:783-787 | codes/Form_Main.vb:989-993 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) codes/Form_Main.vb:7111— codes/Form_Main.vb:7111-7115 | codes/Tool_DPP.vb:173-177 — 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.
Duplicated block (5 lines × 2) codes/Tool_Cluster.vb:580— codes/Tool_Cluster.vb:580-584 | codes/Tool_Cluster.vb:595-599 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) codes/View_Dis.vb:244— codes/View_Dis.vb:244-248 | codes/View_Dis.vb:251-255 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) codes/View_Tree.vb:1350— codes/View_Tree.vb:1350-1354 | codes/View_Tree.vb:1388-1392 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) codes/View_Tree.vb:2842— codes/View_Tree.vb:2842-2846 | codes/View_Tree.vb:2866-2870 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) codes/View_Tree.vb:2848— codes/View_Tree.vb:2848-2852 | codes/View_Tree.vb:2872-2876 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) codes/Form_Main.vb:1406— codes/Form_Main.vb:1406-1417 | codes/Tool_Omitted.vb:280-291 — 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.
Duplicated block (12 lines × 2) codes/Form_Main.vb:2414— codes/Form_Main.vb:2414-2425 | codes/Form_Main.vb:2661-2672 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) codes/Form_Main.vb:8363— codes/Form_Main.vb:8363-8374 | codes/Form_Main.vb:8461-8476 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) codes/Form_Main.vb:9111— codes/Form_Main.vb:9111-9122 | codes/Form_Main.vb:9536-9547 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) codes/Tool_Cluster.vb:66— codes/Tool_Cluster.vb:66-77 | codes/Tool_Cluster.vb:104-115 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) codes/Tool_Omitted.vb:564— codes/Tool_Omitted.vb:564-575 | codes/Tool_Omitted.vb:651-663 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) codes/Tool_TvS.vb:282— codes/Tool_TvS.vb:282-293 | codes/Tool_TvS.vb:416-427 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) codes/View_Tree.vb:3668— codes/View_Tree.vb:3668-3681 | codes/View_Tree.vb:3705-3716 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) codes/Config_BGB.vb:762— codes/Config_BGB.vb:762-777 | codes/Config_Lagrange.vb:900-915 — 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.
Duplicated block (16 lines × 2) codes/Form_Main.vb:4051— codes/Form_Main.vb:4051-4066 | codes/Form_Main.vb:6099-6114 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) codes/Form_Main.vb:4407— codes/Form_Main.vb:4407-4424 | codes/Form_Main.vb:4524-4539 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) codes/Form_Main.vb:5252— codes/Form_Main.vb:5252-5267 | codes/Form_Main.vb:5402-5417 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) codes/Form_Main.vb:5586— codes/Form_Main.vb:5586-5601 | codes/Form_Main.vb:5751-5766 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) codes/Tool_Cluster.vb:860— codes/Tool_Cluster.vb:860-875 | codes/Tool_Cluster.vb:886-901 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) codes/Tool_TvS.vb:356— codes/Tool_TvS.vb:356-371 | codes/Tool_TvS.vb:483-498 — both copies are in the same file, so extract the block into one function there and call it from each site — 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 `codes/Tool_TvS.vb:356` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
FileTooLong: codes/Form_Main.vb codes/Form_Main.vb:0— FileTooLong — 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.
FileTooLong: codes/View_Tree.vb codes/View_Tree.vb:0— FileTooLong — 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.
FileTooLong: codes/Config_BGB.vb codes/Config_BGB.vb:0— FileTooLong — 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.
FileTooLong: codes/Config_Lagrange.vb codes/Config_Lagrange.vb:0— FileTooLong — 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.
FileTooLong: codes/Tool_Cluster.vb codes/Tool_Cluster.vb:0— FileTooLong — 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.
FileTooLong: codes/Tool_Omitted.vb codes/Tool_Omitted.vb:0— FileTooLong — 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.
Duplicated block (14 lines × 2) codes/Config_BGB.vb:843— codes/Config_BGB.vb:843-856 | codes/Config_Lagrange.vb:969-982 — 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.
Duplicated block (14 lines × 2) codes/Config_BGB.vb:1120— codes/Config_BGB.vb:1120-1133 | codes/Config_Lagrange.vb:1237-1250 — 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.
Duplicated block (14 lines × 2) codes/Form_Main.vb:3973— codes/Form_Main.vb:3973-3986 | codes/Form_Main.vb:5983-5996 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) codes/Form_Main.vb:4086— codes/Form_Main.vb:4086-4099 | codes/Form_Main.vb:6136-6149 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) codes/Form_Main.vb:5295— codes/Form_Main.vb:5295-5308 | codes/Form_Main.vb:5786-5800 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) codes/Form_Main.vb:6970— codes/Form_Main.vb:6970-6983 | codes/Module_Var.vb:370-383 — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13 lines × 2) codes/Config_BBM.vb:187— codes/Config_BBM.vb:187-199 | codes/Config_BBM.vb:208-220 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) codes/Config_BGB.vb:695— codes/Config_BGB.vb:695-707 | codes/Config_Lagrange.vb:835-847 — 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.
Duplicated block (13 lines × 2) codes/Form_Main.vb:481— codes/Form_Main.vb:481-495 | codes/Form_Main.vb:2302-2314 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) codes/Form_Main.vb:6296— codes/Form_Main.vb:6296-6308 | codes/Form_Main.vb:6497-6509 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) codes/Form_Main.vb:7189— codes/Form_Main.vb:7189-7201 | codes/Form_Main.vb:7249-7261 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) codes/View_Tree.vb:1772— codes/View_Tree.vb:1772-1784 | codes/View_Tree.vb:2065-2078 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
TooManyMethods: Form_Main codes/Form_Main.vb:0— TooManyMethods — 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.
TooManyMethods: View_Tree codes/View_Tree.vb:0— TooManyMethods — 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.
TooManyMethods: Tool_Cluster codes/Tool_Cluster.vb:0— TooManyMethods — 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.
TooManyMethods: Config_BGB codes/Config_BGB.vb:0— TooManyMethods — 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.
Duplicated block (10 lines × 3) codes/Config_BayArea.vb:291— codes/Config_BayArea.vb:291-300 | codes/Config_BGB.vb:663-672 | codes/Config_Lagrange.vb:805-814 — 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.
Duplicated block (10 lines × 3) codes/Config_BGB.vb:1608— codes/Config_BGB.vb:1608-1617 | codes/Config_Lagrange.vb:1387-1396 | codes/Config_SDIVA.vb:398-407 — 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.
Duplicated block (10 lines × 3) codes/View_Dis.vb:298— codes/View_Dis.vb:298-308 | codes/View_Tree.vb:2458-2467 | codes/View_Tree.vb:3164-3174 — there are 3 copies across 2 file(s) — 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.
Duplicated block (10 lines × 3) codes/View_Tree.vb:2578— codes/View_Tree.vb:2578-2587 | codes/View_Tree.vb:2596-2605 | codes/View_Tree.vb:3624-3633 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) codes/Config_BayArea.vb:255— codes/Config_BayArea.vb:255-261 | codes/Config_BGB.vb:616-622 | codes/Config_Lagrange.vb:757-763 — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 3) codes/Form_Main.vb:2322— codes/Form_Main.vb:2322-2328 | codes/Form_Main.vb:2336-2342 | codes/Form_Main.vb:2554-2560 — 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 — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 3) codes/Form_Main.vb:6015— codes/Form_Main.vb:6015-6021 | codes/Form_Main.vb:6045-6051 | codes/Form_Main.vb:6079-6085 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) codes/View_BBM.vb:83— codes/View_BBM.vb:83-89 | codes/View_BBM.vb:138-144 | codes/View_BBM.vb:187-193 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15 lines × 2) codes/Config_BGB.vb:534— codes/Config_BGB.vb:534-548 | codes/Config_Lagrange.vb:675-689 — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (15 lines × 2) codes/Form_Main.vb:8706— codes/Form_Main.vb:8706-8720 | codes/Form_Main.vb:8731-8745 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) codes/View_Tree.vb:1792— codes/View_Tree.vb:1792-1806 | codes/View_Tree.vb:2082-2098 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 3) codes/Config_BGB.vb:39— codes/Config_BGB.vb:39-47 | codes/Config_Lagrange.vb:37-45 | codes/Config_SDIVA.vb:32-40 — 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.
Duplicated block (9 lines × 3) codes/Tool_Cluster.vb:744— codes/Tool_Cluster.vb:744-752 | codes/Tool_Cluster.vb:769-777 | codes/Tool_Cluster.vb:1341-1350 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9 lines × 3) codes/View_Tree.vb:3415— codes/View_Tree.vb:3415-3423 | codes/View_Tree.vb:3673-3681 | codes/View_Tree.vb:3708-3716 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (19 lines × 2) codes/Form_Main.vb:656— codes/Form_Main.vb:656-674 | codes/Form_Main.vb:861-879 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 2) codes/Form_Main.vb:5510— codes/Form_Main.vb:5510-5528 | codes/Form_Main.vb:5675-5693 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) codes/Form_Main.vb:8451— codes/Form_Main.vb:8451-8468 | codes/Form_Main.vb:8784-8801 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) codes/Form_Main.vb:8673— codes/Form_Main.vb:8673-8690 | codes/Form_Main.vb:9122-9141 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 3) codes/Config_BGB.vb:1586— codes/Config_BGB.vb:1586-1597 | codes/Config_Lagrange.vb:1366-1377 | codes/Config_SDIVA.vb:354-365 — 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.
Duplicated block (12 lines × 3) codes/Form_Main.vb:1827— codes/Form_Main.vb:1827-1839 | codes/Form_Main.vb:1976-1987 | codes/Form_Main.vb:2187-2198 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 3) codes/Form_Main.vb:8546— codes/Form_Main.vb:8546-8556 | codes/Form_Main.vb:9111-9121 | codes/Form_Main.vb:9536-9546 — 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 — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 3) codes/Tool_Cluster.vb:204— codes/Tool_Cluster.vb:204-214 | codes/Tool_Cluster.vb:241-251 | codes/Tool_Cluster.vb:1059-1069 — 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 — 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 `codes/Tool_Cluster.vb:204` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 3) codes/Config_BGB.vb:126— codes/Config_BGB.vb:126-132 | codes/Config_Lagrange.vb:126-132 | codes/Config_SDIVA.vb:132-137 — 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.
Duplicated block (6 lines × 3) codes/Form_Main.vb:2129— codes/Form_Main.vb:2129-2134 | codes/Form_Main.vb:3990-3995 | codes/Form_Main.vb:6000-6005 — 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 — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 3) codes/Form_Main.vb:776— codes/Form_Main.vb:776-780 | codes/Form_Main.vb:982-986 | codes/Form_Main.vb:2629-2633 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) codes/View_Dis.vb:370— codes/View_Dis.vb:370-374 | codes/View_Dis.vb:403-407 | codes/View_Dis.vb:420-424 — 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 — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Form_Main.load_trees (cyclomatic 138) codes/Form_Main.vb:444— 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.
Form_Main.load_bayes_trees (cyclomatic 116) codes/Form_Main.vb:5323— 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.
Module_Brushes.str_to_color (cyclomatic 113) codes/Module_Brushes.vb:36— 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.
Form_Main.do_analysis (cyclomatic 101) codes/Form_Main.vb:1739— 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.
View_Tree.draw_tree (cyclomatic 94) codes/View_Tree.vb:1219— 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.
Batch_Tools.load_final_trees (cyclomatic 64) codes/Batch Tools.vb:42— 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.
View_Tree.read_results (cyclomatic 62) codes/View_Tree.vb:764— 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.
Form_Main.FDTimer_Tick (cyclomatic 61) codes/Form_Main.vb:4270— 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.
View_Tree.Global_Info (cyclomatic 57) codes/View_Tree.vb:1687— 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.
Config_BGB.Button13_Click (cyclomatic 55) codes/Config_BGB.vb:1198— 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.
Tool_Combine.combine_result (cyclomatic 54) codes/Tool_Combine.vb:182— 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.
Form_Main.Button1_Click (cyclomatic 48) codes/Form_Main.vb:7502— 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.
Ploy_Tree.New.ctor (cyclomatic 48) codes/Module_Tree.vb:42— 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.
Form_Main.make_final_trees (cyclomatic 45) codes/Form_Main.vb:2286— 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.
Form_Main.load_final_trees (cyclomatic 44) codes/Form_Main.vb:2502— 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.
View_Tree.Read_Poly_Tree (cyclomatic 43) codes/View_Tree.vb:233— 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.
Form_Main.remove_taxon (cyclomatic 41) codes/Form_Main.vb:7147— 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.
Tool_TvS.claculate_score (cyclomatic 40) codes/Tool_TvS.vb:93— 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.
Form_Main.check_mrbayes (cyclomatic 36) codes/Form_Main.vb:3019— 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.
View_Tree.Swap_tree (cyclomatic 36) codes/View_Tree.vb:65— 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.
View_Tree.Get_Info (cyclomatic 36) codes/View_Tree.vb:1986— 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.
Config_BGB.Read_Poly_Tree (cyclomatic 34) codes/Config_BGB.vb:469— 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.
Config_Lagrange.Read_Poly_Tree (cyclomatic 34) codes/Config_Lagrange.vb:611— 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.
Form_Main.read_new_bayes_log (cyclomatic 34) codes/Form_Main.vb:5965— 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.
Form_Main.comb_result_all (cyclomatic 33) codes/Form_Main.vb:4989— 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.
Config_BayArea.Read_Poly_Tree (cyclomatic 32) codes/Config_BayArea.vb:127— 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.
View_Tree.Swap_Whole (cyclomatic 30) codes/View_Tree.vb:3429— 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.
View_Dis.cal_column (cyclomatic 29) codes/View_Dis.vb:77— 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.
Form_Main.get_tree_length (cyclomatic 28) codes/Form_Main.vb:6668— 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.
Config_BGB.Read_LG_Tree (cyclomatic 27) codes/Config_BGB.vb:141— 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.
Config_Lagrange.Read_LG_Tree (cyclomatic 27) codes/Config_Lagrange.vb:142— 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.
Form_Main.load_names (cyclomatic 27) codes/Form_Main.vb:307— 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.
Form_Main.Build_Final_Tree (cyclomatic 27) codes/Form_Main.vb:3493— 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.
Form_Main.read_range_log (cyclomatic 27) codes/Form_Main.vb:3955— 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.
Form_Main.write_remove_og (cyclomatic 27) codes/Form_Main.vb:7351— 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.
Tool_Cluster.Timer_R_Tick (cyclomatic 27) codes/Tool_Cluster.vb:265— 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.
Tool_Combine.get_tree_length (cyclomatic 27) codes/Tool_Combine.vb:10— 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.
View_Tree.draw_diagram (cyclomatic 27) codes/View_Tree.vb:2980— 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.
Config_Lagrange.Button3_Click (cyclomatic 26) codes/Config_Lagrange.vb:288— 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.
Form_Main.LoadDistrutionToolStripMenuItem_Click (cyclomatic 26) codes/Form_Main.vb:2772— 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.
Form_Main.make_file_BGB (cyclomatic 26) codes/Form_Main.vb:6293— 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.
View_Tree.EventLine (cyclomatic 26) codes/View_Tree.vb:2823— 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.
Config_BBM.Button1_Click (cyclomatic 25) codes/Config_BBM.vb:10— 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.
Config_SDIVA.LoadSettingToolStripMenuItem_Click (cyclomatic 24) codes/Config_SDIVA.vb:418— 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.
Form_Main.runDIVA (cyclomatic 24) codes/Form_Main.vb:1109— 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.
Form_Main.make_file_dec (cyclomatic 24) codes/Form_Main.vb:6494— 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.
Module_Var.Read_Poly_Node (cyclomatic 24) codes/Module_Var.vb:239— 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.
Tool_Omitted.f_node (cyclomatic 24) codes/Tool_Omitted.vb:310— 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.
Form_Main.read_node (cyclomatic 23) codes/Form_Main.vb:1309— 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.
Config_Traits.read_traits_file (cyclomatic 22) codes/Config_Traits.vb:241— 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.
Tool_SvT.find_best_tree (cyclomatic 22) codes/Tool_SvT.vb:34— 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.
Config_BGB.LoadSettingToolStripMenuItem_Click (cyclomatic 20) codes/Config_BGB.vb:1624— 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.
Config_Lagrange.LoadSettingToolStripMenuItem_Click_1 (cyclomatic 20) codes/Config_Lagrange.vb:1403— 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.
View_Tree.Form1_Load (cyclomatic 20) codes/View_Tree.vb:534— 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.
Form_Main.make_final_tree (cyclomatic 19) codes/Form_Main.vb:3408— 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.
Form_Main.read_bayarea (cyclomatic 19) codes/Form_Main.vb:3835— 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.
Form_Main.BioGeoBEARSToolStripMenuItem2_Click (cyclomatic 19) codes/Form_Main.vb:8223— 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.
Form_Main.DIVALIKEInBiogenBEARSToolStripMenuItem_Click (cyclomatic 19) codes/Form_Main.vb:8326— 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.
Tool_Omitted.e_node (cyclomatic 19) codes/Tool_Omitted.vb:407— 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.
Form_Main.load_beast_trees (cyclomatic 18) codes/Form_Main.vb:5222— 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.
Form_Main.StatisticalDIVALIKEToolStripMenuItem_Click (cyclomatic 18) codes/Form_Main.vb:8427— 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.
Form_Main.StatisticalERSYMARDInAPEToolStripMenuItem_Click (cyclomatic 18) codes/Form_Main.vb:9313— 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.
View_Tree.draw_col (cyclomatic 18) codes/View_Tree.vb:2228— 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.
Config_BBM.Write_Bayes_nex (cyclomatic 17) codes/Config_BBM.vb:168— 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.
Config_Traits.Button1_Click (cyclomatic 17) codes/Config_Traits.vb:7— 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.
Form_Main.read_DEC (cyclomatic 17) codes/Form_Main.vb:4902— 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.
Form_Main.StatisticalDispersalVicarianceAnalysisSDIVAToolStripMenuItem_Click (cyclomatic 17) codes/Form_Main.vb:8529— 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.
Form_Main.ERSYMARDModelInAPEToolStripMenuItem_Click (cyclomatic 17) codes/Form_Main.vb:9156— 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.
View_Tree.AreaLine (cyclomatic 17) codes/View_Tree.vb:2709— 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.
Form_Main.add_tree_length (cyclomatic 16) codes/Form_Main.vb:8913— 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.
Tool_Cluster.make_final_tree (cyclomatic 16) codes/Tool_Cluster.vb:956— 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.
TodoComment codes/Form_AboutBox.vb:15— ' TODO: 在项目的“应用程序”窗格中自定义此应用程序的程序集信息 — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `' REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Form_Main.load_trees (cognitive 615) codes/Form_Main.vb:444— 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.
Form_Main.load_bayes_trees (cognitive 531) codes/Form_Main.vb:5323— 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.
View_Tree.draw_tree (cognitive 496) codes/View_Tree.vb:1219— 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.
Form_Main.do_analysis (cognitive 413) codes/Form_Main.vb:1739— 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.
Batch_Tools.load_final_trees (cognitive 286) codes/Batch Tools.vb:42— 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.
View_Tree.read_results (cognitive 283) codes/View_Tree.vb:764— 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.
Form_Main.make_final_trees (cognitive 208) codes/Form_Main.vb:2286— 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.
View_Tree.Global_Info (cognitive 173) codes/View_Tree.vb:1687— 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.
View_Tree.Get_Info (cognitive 167) codes/View_Tree.vb:1986— 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.
Form_Main.load_final_trees (cognitive 137) codes/Form_Main.vb:2502— 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.
Tool_Combine.combine_result (cognitive 129) codes/Tool_Combine.vb:182— 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.
Form_Main.FDTimer_Tick (cognitive 121) codes/Form_Main.vb:4270— 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.
Form_Main.Button1_Click (cognitive 121) codes/Form_Main.vb:7502— 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.
Form_Main.check_mrbayes (cognitive 120) codes/Form_Main.vb:3019— 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.
Ploy_Tree.New.ctor (cognitive 115) codes/Module_Tree.vb:42— 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.
View_Tree.draw_diagram (cognitive 114) codes/View_Tree.vb:2980— 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.
Module_Brushes.str_to_color (cognitive 112) codes/Module_Brushes.vb:36— 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.
Tool_TvS.claculate_score (cognitive 112) codes/Tool_TvS.vb:93— 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.
View_Dis.cal_column (cognitive 110) codes/View_Dis.vb:77— 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.
View_Tree.Read_Poly_Tree (cognitive 109) codes/View_Tree.vb:233— 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.
Form_Main.load_names (cognitive 107) codes/Form_Main.vb:307— 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.
Form_Main.comb_result_all (cognitive 101) codes/Form_Main.vb:4989— 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.
Config_SDIVA.LoadSettingToolStripMenuItem_Click (cognitive 94) codes/Config_SDIVA.vb:418— 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.
Form_Main.LoadDistrutionToolStripMenuItem_Click (cognitive 86) codes/Form_Main.vb:2772— 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.
View_Tree.EventLine (cognitive 80) codes/View_Tree.vb:2823— 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.
Config_BGB.Read_Poly_Tree (cognitive 78) codes/Config_BGB.vb:469— 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.
Config_Lagrange.Read_Poly_Tree (cognitive 78) codes/Config_Lagrange.vb:611— 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.
Config_BGB.Button13_Click (cognitive 77) codes/Config_BGB.vb:1198— 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.
Config_BGB.LoadSettingToolStripMenuItem_Click (cognitive 74) codes/Config_BGB.vb:1624— 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.
Config_Lagrange.LoadSettingToolStripMenuItem_Click_1 (cognitive 74) codes/Config_Lagrange.vb:1403— 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.
View_Tree.Swap_Whole (cognitive 73) codes/View_Tree.vb:3429— 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.
Config_Traits.TimerTraits_Tick (cognitive 71) codes/Config_Traits.vb:350— 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.
Config_BayArea.Read_Poly_Tree (cognitive 68) codes/Config_BayArea.vb:127— 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.
Tool_SvT.find_best_tree (cognitive 67) codes/Tool_SvT.vb:34— 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.
Form_Main.get_tree_length (cognitive 66) codes/Form_Main.vb:6668— 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.
Form_Main.write_remove_og (cognitive 66) codes/Form_Main.vb:7351— 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.
Config_BGB.Read_LG_Tree (cognitive 65) codes/Config_BGB.vb:141— 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.
Config_Lagrange.Read_LG_Tree (cognitive 65) codes/Config_Lagrange.vb:142— 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.
Tool_Combine.get_tree_length (cognitive 65) codes/Tool_Combine.vb:10— 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.
Form_Main.remove_taxon (cognitive 64) codes/Form_Main.vb:7147— 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.
View_Tree.Swap_tree (cognitive 64) codes/View_Tree.vb:65— 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.
View_Tree.Form1_Load (cognitive 62) codes/View_Tree.vb:534— 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.
Config_Lagrange.Button10_Click (cognitive 61) codes/Config_Lagrange.vb:1025— 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.
Tool_Omitted.f_node (cognitive 61) codes/Tool_Omitted.vb:310— 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.
Form_Main.read_new_bayes_log (cognitive 57) codes/Form_Main.vb:5965— 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.
Tool_DPP.Button4_Click (cognitive 57) codes/Tool_DPP.vb:92— 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.
Form_Main.StatisticalDispersalVicarianceAnalysisSDIVAToolStripMenuItem_Click (cognitive 56) codes/Form_Main.vb:8529— 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.
Module_Var.Read_Poly_Node (cognitive 56) codes/Module_Var.vb:239— 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.
View_Tree.draw_col (cognitive 56) codes/View_Tree.vb:2228— 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.
Form_Main.make_final_tree (cognitive 55) codes/Form_Main.vb:3408— 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.
Form_Main.load_beast_trees (cognitive 54) codes/Form_Main.vb:5222— 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.
Form_Main.read_DEC (cognitive 52) codes/Form_Main.vb:4902— 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.
Tool_Cluster.make_fdw_matrix (cognitive 52) codes/Tool_Cluster.vb:15— 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.
Form_Main.SaveDistributionToolStripMenuItem_Click (cognitive 51) codes/Form_Main.vb:5881— 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.
Form_Main.make_file_BGB (cognitive 51) codes/Form_Main.vb:6293— 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.
Form_Main.make_file_dec (cognitive 51) codes/Form_Main.vb:6494— 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.
Form_Main.BioGeoBEARSToolStripMenuItem2_Click (cognitive 50) codes/Form_Main.vb:8223— 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.
Form_Main.DIVALIKEInBiogenBEARSToolStripMenuItem_Click (cognitive 50) codes/Form_Main.vb:8326— 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.
Form_Main.StatisticalDIVALIKEToolStripMenuItem_Click (cognitive 48) codes/Form_Main.vb:8427— 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.
Config_Traits.read_traits_file (cognitive 47) codes/Config_Traits.vb:241— 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.
Tool_Omitted.e_node (cognitive 47) codes/Tool_Omitted.vb:407— 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.
Form_Main.add_tree_length (cognitive 46) codes/Form_Main.vb:8913— 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.
Form_Main.Build_Final_Tree (cognitive 45) codes/Form_Main.vb:3493— 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.
View_Tree.AreaLine (cognitive 45) codes/View_Tree.vb:2709— 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.
Form_Main.StatisticalERSYMARDInAPEToolStripMenuItem_Click (cognitive 44) codes/Form_Main.vb:9313— 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.
Config_BGB.Config_BGB_VisibleChanged (cognitive 43) codes/Config_BGB.vb:303— 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.
View_Tree.make_tree_xy (cognitive 43) codes/View_Tree.vb:449— 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.
Form_Main.Readnex (cognitive 42) codes/Form_Main.vb:6856— 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.
Tool_Cluster.Timer_R_Tick (cognitive 42) codes/Tool_Cluster.vb:265— 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.
Form_Main.runDIVA (cognitive 41) codes/Form_Main.vb:1109— 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.
Tool_Cluster.make_SC_matrix (cognitive 41) codes/Tool_Cluster.vb:84— 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.
Config_Lagrange.Button3_Click (cognitive 40) codes/Config_Lagrange.vb:288— 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.
Form_Main.read_range_log (cognitive 40) codes/Form_Main.vb:3955— 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.
Tool_TvS.Timer_R_Tick (cognitive 40) codes/Tool_TvS.vb:7— 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.
Form_Main.read_node (cognitive 39) codes/Form_Main.vb:1309— 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.
Form_Main.read_bayarea (cognitive 39) codes/Form_Main.vb:3835— 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.
View_Tree.PicBox2_High (cognitive 39) codes/View_Tree.vb:2176— 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.
Config_Chrom.TimerChromEvol_Tick (cognitive 38) codes/Config_Chrom.vb:411— 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.
Form_Main.StatesVsTreesToolStripMenuItem_Click (cognitive 38) codes/Form_Main.vb:9019— 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.
View_Tree.TreeWithTimeToolStripMenuItem_Click (cognitive 38) codes/View_Tree.vb:3308— 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.
View_Dis.drawfig1 (cognitive 37) codes/View_Dis.vb:217— 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.
Config_Lagrange.Lag_Config_VisibleChanged (cognitive 36) codes/Config_Lagrange.vb:451— 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.
Config_BBM.Write_Bayes_nex (cognitive 35) codes/Config_BBM.vb:168— 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.
Config_BGB.read_time_period (cognitive 34) codes/Config_BGB.vb:901— 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.
Form_Main.BayesianBinaryMCMCBBMToolStripMenuItem1_Click (cognitive 33) codes/Form_Main.vb:9104— 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.
Config_BBM.Button1_Click (cognitive 32) codes/Config_BBM.vb:10— 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.
Config_SDIVA.SaveSettingsToolStripMenuItem_Click (cognitive 32) codes/Config_SDIVA.vb:343— 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.
Form_Main.StatisticalDECSDECToolStripMenuItem_Click (cognitive 32) codes/Form_Main.vb:8759— 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.
Form_Main.make_range_P (cognitive 31) codes/Form_Main.vb:4114— 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.
Form_Main.MultiStateReconstructionInBayesTraitsToolStripMenuItem_Click (cognitive 31) codes/Form_Main.vb:9521— 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.
Tool_Omitted.Fill_clade (cognitive 31) codes/Tool_Omitted.vb:89— 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.
View_Tree.PictureBox1_MouseDoubleClick (cognitive 31) codes/View_Tree.vb:1580— 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.
Config_BGB.Button7_Click (cognitive 30) codes/Config_BGB.vb:821— 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.
Config_Lagrange.Button7_Click (cognitive 30) codes/Config_Lagrange.vb:947— 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.
Form_Main.BayesianInferenceForDiscreteAreasBayAreaToolStripMenuItem_Click (cognitive 30) codes/Form_Main.vb:8655— 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.
Tool_Cluster.make_final_tree (cognitive 30) codes/Tool_Cluster.vb:956— 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.
Tool_Cluster.ListView1_SelectedIndexChanged (cognitive 29) codes/Tool_Cluster.vb:451— 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.
View_Pie.pie_Load (cognitive 29) codes/View_Pie.vb:18— 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.
Form_Main.read_BGB (cognitive 28) codes/Form_Main.vb:7941— 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.
Config_Chrom.read_ChromEvol (cognitive 27) codes/Config_Chrom.vb:222— 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.
Form_Main.ERSYMARDModelInAPEToolStripMenuItem_Click (cognitive 27) codes/Form_Main.vb:9156— 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.
Module_BBM.read_result (cognitive 27) Codes/Module_BBM.vb:21— 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.
Tool_Omitted.exchange_clade (cognitive 27) codes/Tool_Omitted.vb:138— 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.
View_Tree.Load_result (cognitive 27) codes/View_Tree.vb:1129— 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.
Config_BGB.ComboBox2_SelectedIndexChanged (cognitive 25) codes/Config_BGB.vb:1479— 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.
Config_Chrom.Read_Poly_Tree (cognitive 25) codes/Config_Chrom.vb:11— 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.
Config_SDIVA.RangeForm_VisibleChanged (cognitive 25) codes/Config_SDIVA.vb:192— 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.
Form_Main.check_r_package (cognitive 25) codes/Form_Main.vb:8164— 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.
View_BBM.drawfig1 (cognitive 25) codes/View_BBM.vb:43— 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.
Config_Traits.Button1_Click (cognitive 24) codes/Config_Traits.vb:7— 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.
Form_Main.read_tree (cognitive 24) codes/Form_Main.vb:4842— 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.
Form_Welcome.Timer1_Tick (cognitive 24) codes/Form_Welcome.vb:34— 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.
View_Tree.SortNum (cognitive 24) codes/View_Tree.vb:691— 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.
Form_Main.BayesTimer_Tick (cognitive 23) codes/Form_Main.vb:4207— 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.
Form_Main.read_geiger (cognitive 23) codes/Form_Main.vb:7872— 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.
Form_Main.TreeTimeMultiplierToolStripMenuItem_Click (cognitive 23) codes/Form_Main.vb:8851— 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.
Config_BGB.pailie (cognitive 22) codes/Config_BGB.vb:83— 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.
Config_Lagrange.pailie (cognitive 22) codes/Config_Lagrange.vb:81— 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.
Config_SDIVA.pailie (cognitive 22) codes/Config_SDIVA.vb:80— 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.
Form_Main.pailie (cognitive 22) codes/Form_Main.vb:8045— 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.
View_Tree.read_max_reconstruction (cognitive 22) codes/View_Tree.vb:1040— 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.
View_Tree.cale_relation (cognitive 22) codes/View_Tree.vb:1089— 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.
Form_Main.make_new_range (cognitive 21) codes/Form_Main.vb:6163— 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.
Form_Main.make_file_ape (cognitive 21) codes/Form_Main.vb:9391— 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.
Tool_Cluster.write_matrix_limit (cognitive 21) codes/Tool_Cluster.vb:144— 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.
View_BBM.drawfig2 (cognitive 21) codes/View_BBM.vb:97— 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.
View_Pie.Mypaint (cognitive 21) codes/View_Pie.vb:91— 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.
Config_BayArea.make_chain (cognitive 20) codes/Config_BayArea.vb:283— 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.
Config_BGB.make_chain (cognitive 20) codes/Config_BGB.vb:655— 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.
Config_BGB.SaveSettingsToolStripMenuItem_Click (cognitive 20) codes/Config_BGB.vb:1575— 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.
Config_Lagrange.make_chain (cognitive 20) codes/Config_Lagrange.vb:797— 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.
Config_Lagrange.SaveSettingsToolStripMenuItem_Click_1 (cognitive 20) codes/Config_Lagrange.vb:1355— 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.
Form_Main.FormatedTreeToolStripMenuItem_Click (cognitive 20) codes/Form_Main.vb:3237— 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.
Tool_TvS.tree_vs_states (cognitive 20) codes/Tool_TvS.vb:308— 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.
Tool_TvS.state_vs_trees (cognitive 20) codes/Tool_TvS.vb:430— 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.
View_Tree.Button2_Click (cognitive 20) codes/View_Tree.vb:2610— 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.
Config_Chrom.Button3_Click (cognitive 19) codes/Config_Chrom.vb:322— 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.
Form_Main.Make_Optimize (cognitive 19) codes/Form_Main.vb:154— 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.
Tool_Convert.Button1_Click (cognitive 19) codes/Tool_Convert.vb:30— 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.
Tool_SvT.Tool_State_VisibleChanged (cognitive 19) codes/Tool_SvT.vb:162— 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.
Config_SDIVA.NumericUpDown2_ValueChanged (cognitive 18) codes/Config_SDIVA.vb:294— 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.
Config_Traits.LoadLogToolStripMenuItem_Click (cognitive 18) codes/Config_Traits.vb:422— 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.
Form_Main.DispersalExtinctionCladogenesisDECToolStripMenuItem_Click (cognitive 18) codes/Form_Main.vb:8604— 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.
View_BBM.drawfig3 (cognitive 18) codes/View_BBM.vb:152— 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.
View_Tracer.View_Tracer_VisibleChanged (cognitive 18) codes/View_Tracer.vb:17— 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.
Form_Main.LoadTreesDataToolStripMenuItem_Click (cognitive 16) codes/Form_Main.vb:3730— 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.
Tool_Omitted.export_omitted (cognitive 16) codes/Tool_Omitted.vb:534— 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.
View_Tree.load_color (cognitive 16) codes/View_Tree.vb:718— 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.
View_Tree.IncreaseTreeToolStripMenuItem_Click (cognitive 16) codes/View_Tree.vb:3688— 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.
Duplicated block (27 lines × 2) codes/Config_BGB.vb:1060— codes/Config_BGB.vb:1060-1086 | codes/Config_Lagrange.vb:1177-1203 — 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.
Duplicated block (21 lines × 8) codes/Config_BayArea.vb:156— 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 — there are 8 copies across 6 file(s) — 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.
Duplicated block (20 lines × 2) codes/Form_Main.vb:9199— codes/Form_Main.vb:9199-9218 | codes/Form_Main.vb:9357-9376 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) codes/Form_Main.vb:732— codes/Form_Main.vb:732-748 | codes/Form_Main.vb:937-954 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 8) codes/Form_Main.vb:5917— 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 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15 lines × 4) codes/Form_Main.vb:8088— codes/Form_Main.vb:8088-8102 | codes/Form_Main.vb:8281-8295 | codes/Form_Main.vb:8383-8397 | codes/Form_Main.vb:8485-8499 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (14 lines × 3) codes/Config_BGB.vb:93— codes/Config_BGB.vb:93-106 | codes/Config_Lagrange.vb:91-104 | codes/Config_SDIVA.vb:90-103 — 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.
Duplicated block (13 lines × 7) codes/Config_BayArea.vb:238— 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 — there are 7 copies across 5 file(s) — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 5) codes/Module_Stat.vb:133— 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 — 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 — 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 — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 6) codes/View_Tree.vb:1201— 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 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 4) codes/View_Tree.vb:3285— codes/View_Tree.vb:3285-3290 | codes/View_Tree.vb:3422-3427 | codes/View_Tree.vb:3680-3685 | codes/View_Tree.vb:3715-3720 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 23) codes/View_Tree.vb:639— 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 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 10) codes/Config_Traits.vb:423— 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 — there are 10 copies across 2 file(s) — 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.
Recommendation — 4 finding(s)
D11 · Test Reliability· Test reliability not included · ×1
Test reliability not included — No test suite was found, so reliability couldn't be assessed.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
Rotate the exposed credentials — git history can't be un-committed — Some of these secrets are in git HISTORY: deleting the file does not remove them (the commit persists on every clone, fork and backup). The remediation is to ROTATE each historically-exposed credential and treat it as compromised — not to delete the file. Rewriting history is disruptive and unreliable across existing forks. (Working-tree-only secrets — no commit — can instead be removed from the file and moved to a secret store.) Every location above sits inside a test/fixture/sample tree, so there may be no live credential to revoke — in that case the performable actions are different ones: confirm each value was never reused outside the tests (a fixture key shared with a staging or demo environment IS a live credential and must be rotated), generate this material at test time instead of committing it so the next one cannot be mistaken for a real leak, and record the deliberate exposure where a reader of the file will see it. Rotate anything that fails the first check.
early-stage repository — too little history to judge knowledge freshness — early-stage repository — too little history to judge knowledge freshness (45 commit(s) sampled).
No tests found — No test suite could be collected — 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.
Outdated: System.DirectoryServices — System.DirectoryServices 8.0.0 → 10.0.10 available (referenced by RASP).
D18 · Solution Shape· Build did not complete in the analyzer · ×1
Build did not complete in the analyzer — `dotnet build` reported 1 error(s) but no C# compiler diagnostic, so this is a build-environment gap rather than a code defect. The usual causes are a project that targets a platform this run cannot build (a Windows-only target framework on a Linux worker) or a build step that shells out to a tool the image does not carry. Solution Shape is scored on structure and is NOT capped. Semantic analysis is independent of this build and covers every project that loaded — but a project whose restore did not complete has no resolved references, so treat its results as absent rather than clean. Worth checking on your side too: a build that needs undeclared host tooling, or that cannot run off its own platform, is the same wall a new contributor hits.
D22 · Internal API Consistency· No exposed public API · ×1
No exposed public API — No intentionally-exposed types (IsPackable or .Contracts) to evaluate.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
dotnet: not applicable — the solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan for NuGet CVEs — excluded rather than scored; re-run on an SDK that can restore this solution
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Terraform, Kubernetes/Helm, CloudFormation); nothing to scan.
semgrep: not applicable — Data compliance (PII/GDPR) was not assessed in this scan — no ruleset is currently available for it. This says nothing about how this repository handles personal data, in either direction.
trivy: not applicable — No JS/npm manifest or lockfile found outside build output (package.json, package-lock.json, yarn.lock, pnpm-lock.yaml, bun.lockb); no JS dependencies to scan.
provenance: not applicable — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .gitlab-ci.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, Jenkinsfile, .circleci); there is no build to attest provenance for.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
0
—
Run 019fc776-e78e-7d7e-9fbd-76e7cb12e0e3 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 55 · Warnings: 391 · Recommendations: 4 · Info: 4 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 03-08-2026 @ 11:51 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.