Public report — circuit-drawing, published 1 Oct 2026.
Concrete security findings (which rule fired, in which file, on which line; CVE IDs, secret matches,
dependency versions) are REDACTED in this version; ask the repo owner for the full report.
Public
Codebase surveyMeasured under the Code Assurance Index · rubric rubric-2026.09.18 (frozen) · verify this surveyFiledcd_385a62f79993414b8994ec00f7b17dd4
Filed 1 October 2026, 14:42 UTC
Public
Medium · 46,226 LoC · 2 projects · rebuild ~0.3 person-years · weakest lens: Readiness (23%)
Findings by grade
3 critical593 serious9 minor43 could not be resolved — could be critical — see Limitations
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
1 October 2026, 14:40 UTC
A measurement, not a certificate. The Code Assurance Index does not certify,
approve or guarantee this codebase; it records a reproducible number and the evidence it was computed from. The
standard is authored by Canine Development, who also build Watchdog — its only implementation today. That is said
here so the number is checked rather than believed.
Build did not compile — scores are provisional
The analysed solution did not compile (1 build error(s)). Dimensions that depend on the compiler — complexity, duplication, cohesion, dead code, API surface — ran on incomplete models, so the scores below are provisional. Fix the build, then re-run for a reliable grade. First errors: BC2001: file 'CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_ToIntHex.vb' could not be found
Grounded in facts. Every number here is computed, not narrated — reproducible, tool-backed, and traceable to a line of code. How to trust this ▸
592findings with an exact file:lineof 605 — the remainder are repo-wide signals (a dimension-level measurement, not a single line); open any file:line and verify
34/117dimensions across the health lenses46226 LoC · 2 projects — wide & deep
The system is a workable asset carrying significant operational risk, reflected in a provisional health score of 44%. While the underlying code logic is relatively compact and inexpensive to rebuild, the current state prevents reliable delivery. The most critical barrier is that the solution does not compile, rendering many quality metrics provisional and untrustworthy. Until the build is fixed, the team cannot accurately assess complexity or maintainability, creating a blind spot in decision-making.
The biggest issue is operational fragility. With a readiness score of just 23%, the system lacks the safety nets required for stable production. There are no automated tests, meaning every change carries a high risk of regression. This absence of verification slows down development velocity and increases the likelihood of defects reaching users. The cost of this neglect is a recurring tax on every modification, estimated to add 5–11% effort to changes due to the need for manual verification and debugging.
A secondary concern is the hidden cost of technical debt. The code quality signals suggest a moderate level of complexity and duplication. While the system is small enough to rebuild for approximately €43,000, the ongoing drag on the team’s capacity is the more immediate financial impact. The effort to fix the build and introduce basic testing pays for itself within a year by reducing the annual time spent on unstable code. This is a high-leverage investment that stabilizes the foundation for future growth.
On the positive side, the security posture is strong, and the codebase is not bloated with boilerplate. The core logic is contained and manageable. However, the lack of automated testing and the broken build are critical blockers. The team should focus first on fixing the compilation error and establishing a continuous integration workflow. This single action will validate the health metrics and unlock the ability to safely iterate, turning a fragile asset into a reliable one.
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.
0.7× (at 44% 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.3 person-years of build effort (about ~€43,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.
Highest-leverage move: fix the build · Critical · Leverage
The solution doesn't compile, so every Roslyn-derived dimension (complexity, duplication, cohesion, dead code, API surface) ran on incomplete models and is PROVISIONAL. Fixing the build is the single change that makes the rest of the report trustworthy — do it first. The compiler reported: BC2001: file 'CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_ToIntHex.vb' could not be found.
Evidence: D18 build: The compiler reported: BC2001: file 'CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_ToIntHex.vb' could not be found.
→ Fix the build, then re-run for a reliable grade.
Value concentrated against a weak lens · High · Value at risk
This is a Medium asset (~0.3 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.
A velocity tax on every change · Medium · Economics
The code-quality signals (complexity, duplication, cohesion) average 6.0/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 5–11% 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 6.0/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.
The top fix pays for itself · Medium · Economics
The top-ranked fix costs roughly 1–3 engineer-days once. Not doing it costs about 0.3–1.8 engineer-days every year, paid as drag on the ~2,405 lines this team changes annually — a bill that arrives whether or not anyone books it. On those figures the fix breaks even in roughly 7–120 months and is free after that. Method, stated so this is not read as a quotation: debt from the ranked task's effort band; interest = annual changed lines (measured, annualised from the 90-day window) ÷ an ASSUMED 150–400 lines per engineer-day × the 5–11% drag implied by the code-quality signals; breaking point = debt ÷ annual interest. A modelled planning range built from measured inputs and one named assumption — not a quotation, a valuation, or a certified figure.
Evidence: D15 churn: 593 line(s) changed over a 90-day window ⇒ ~2,405/year · D1/D2/D4/D6 code quality: averaging 6.0/10 ⇒ a 5–11% drag on each change · top-ranked remediation: Low effort ⇒ about 1–3 engineer-day(s)
→ Do the top-ranked fix now if this code will still be yours in 120 months.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
Architecture — module dependency matrix
Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)
8 modules, 3 dependencies. 1 dependency cycle across 2 modules, marked above the diagonal.
Module dependency matrix. The row depends on the column; the number is how many type pairs create the dependency. A cell above the diagonal is part of a dependency cycle.
Establish a CI workflow to build and test on every push, immediately resolving the lack of automated testing and ensuring code coverage. Maintain a changelog to track release changes and document significant architectural decisions in a dedicated, discoverable location to preserve design context.
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 each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 3
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 593
Likely wrong, but not failing yet. It degrades
the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to
carry for two years either.
Minor — 9
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 43
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
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. 30 of 34 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 4 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.8 — 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 — 34 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, 592 of 605 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
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D14 License Compliance — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. License scan produced no result — the tool ran but wrote no JSON report (no package reference resolved); the offline NuGet fallback resolved nothing.
D15 Churn × Complexity Hotspots — measured, with a gap in what it reached — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Git history depth insufficient — this repository has 28 commit(s), too few for a reliable trend signal. The clone is complete, so there is no deeper history to fetch: the signal returns as the project accumulates history.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (2 contributor(s) across 28 commit(s) sampled, automation and bot accounts excluded). One of them holds 96% of the history; the other 1 hold 4% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
D22 Internal API Consistency — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. The loaded project set declares no packable project and no `.Contracts` project, so there is no intentionally-exposed surface for API consistency to be judged over.
D34 Knowledge Freshness — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Too few commits to judge knowledge freshness (28 commit(s) sampled).
D35 Change Coupling — measured, with a gap in what it reached — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Git history depth insufficient — this repository has 28 commit(s), too few for a reliable change-coupling signal. The clone is complete, so there is no deeper history to fetch: the signal returns as the project accumulates history.
D39 IL Efficiency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. IL NOT MEASURED: the analyzer's own build of this repository failed for an ENVIRONMENT reason (exit 1) — MSBuild's engine or the CLR gave up, or our image does not carry the SDK band/targeting pack this repository needs. This is OUR limitation, not a defect in the repo, and it is not a statement that this repository fails to build. D18 owns the question of whether this repository builds; it was not answered here.
D44 Platform End-of-Life — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P2 Observability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Observability was not assessed: this check recognises the logging, tracing/metrics and health-check idioms of .NET, the JVM, Go, Python, JavaScript/TypeScript, Rust, Ruby, PHP, Swift, Dart, Elixir and Erlang, and most of this repository's production source is in none of them. Absence of an idiom this check recognises is NOT evidence that this repo lacks structured logging. This is a gap in the analyzer, not a finding about this repository.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
PF2 Allocation hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Those languages have allocation-aware idioms of their own, but this check does not read them yet. That is a gap in this analyzer's language reach — not a finding that the code is careless with allocations.
PF3 Async & latency hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. No function of a language this check models was read, so there was no async code to examine. That is a limit of the analyzer on this repository, not a finding about it.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X1 Async correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X10 Duplicated predicate — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X12 Unreachable branch — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X13 Undrained process stream — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X14 Bypassable address classification — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X15 Unvalidated length from an untrusted reader — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X19 Unrestored process-global state — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X20 Mistyped argument guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X21 Side-effecting pattern guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X22 Contradicted release guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X23 Unguarded diagnostic materialisation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X25 Inert configuration knob — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X26 Unsynchronised callback handoff — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X27 Collection changed while being enumerated — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X28 Index access outside its own emptiness guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X30 Support guard that admits what it rejects — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X32 Type resolved by simple name across every loaded assembly — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X6 Hand-rolled structured-format parsing — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and Python, JavaScript/TypeScript, Go, Java/Kotlin/Scala, Ruby, PHP and Rust source only, and no C# was loaded and none of those languages was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X7 Silent fallback defaults — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C#, Python, TypeScript/JavaScript, Rust, Go, Java and Kotlin syntax only, and no C#, Python, TypeScript/JavaScript, Rust, Go, Java or Kotlin was loaded for this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
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 — an in-process token-stream comparison over sliding windows, with type-aware normalization — so 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. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
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.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
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 (4): D19, D21, D26, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They 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.
105 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was TemplateAusDatei.readIDLE at 185. A further 5 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being Precompiled_Grafik.ladeGrafik at 24 — they are counted neither in the figure above nor in this dimension's score. 2 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: CircuitDrawing/FRM_BauteilShortcutkeyAuswählen.vb (FRM_BauteilShortcutkeyAuswählen.TextBox1_KeyDown at 21), CircuitDrawing/Grafikelemente/ExportDrawArgs/LineStyleList.vb (DashStyle.New.ctor at 19). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 100 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 1 TemplateAusDatei.readIDLE (cyclomatic 185) finding(s) in Cyclomatic Complexity — start with TemplateAusDatei.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 TemplateAusDatei.leseGrafik (cyclomatic 137) finding(s) in Cyclomatic Complexity — start with TemplateAusDatei.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Vektor_Picturebox.mitVerschiebenWire (cyclomatic 87) finding(s) in Cyclomatic Complexity — start with Vektor_Picturebox.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.
+ 230 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 DrawString_HorizontalMode.calcBoundingBoxes (cognitive 25) finding(s) in Cognitive Complexity — start with AdvancedTextRenderer.vb (2). — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 TemplateAusDatei.readIDLE (cognitive 413) finding(s) in Cognitive Complexity — start with TemplateAusDatei.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 TemplateAusDatei.leseGrafik (cognitive 207) finding(s) in Cognitive Complexity — start with TemplateAusDatei.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.8 / 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 24 MethodTooLong finding(s) in God Classes — start with Vektor_Picturebox.vb (8), BauteilAusDatei.vb (2), SkillDetectSchematic.vb (2). — One of this dimension's main actionable groups (24 warning-level).
Resolve the 13 FileTooLong finding(s) in God Classes — start with Vektor_Picturebox.vb, SkillDetectSchematic.vb, Mathe.vb. — One of this dimension's main actionable groups (13 warning-level).
Resolve the 8 TooManyMethods finding(s) in God Classes — start with Vektor_Picturebox.vb, Form_Vektorgrafik.vb, SkillDetectSchematic.vb. — One of this dimension's main actionable groups (8 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.
172 duplicated block group(s) detected. A further 11 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 67 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 14 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with TemplateAusDatei.vb (4), DO_MultiLinie.vb (3), DO_Rechteck.vb (2). — One of this dimension's main actionable groups (14 warning-level).
Resolve the 14 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with Mathe.vb (2), ToolRechteckMarkierung.vb, Vektor_Picturebox.vb. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 13 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with ToolDrawWire.vb (2), Vektor_Picturebox.vb (2), ToolDeleteSnappoint.vb. — One of this dimension's main actionable groups (13 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 · Coupling6.0 / 10Adequate✓ 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.
Resolve the 1 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Stand up a CI pipeline, then gate Coupling 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: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Resolve the 11 Low cohesion finding(s) in Cohesion (LCOM4) — start with ToolDrawWire.vb, ToolDrawBezier.vb, ToolDrawLine.vb. — One of this dimension's main actionable groups (11 warning-level).
Stand up a CI pipeline, then gate Cohesion (LCOM4) 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: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D8 · Code Coverage0.0 / 10Critical✓ Tool-verified
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.
Resolve the 2 EmptyCatchBlock finding(s) in Explicit Debt — start with Einstellung_TemplateParameterString.vb, Form_Vektorgrafik.vb. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 HackComment finding(s) in Explicit Debt — start with XTextFormatterEx2.vb. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 TodoComment finding(s) in Explicit Debt — start with XTextFormatterEx2.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.
Do you agree with this assessment?
D18 · Solution Shape3.0 / 10Weak✓ Tool-verified
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.
2 projects, 257 source files, 46226 hand-written lines of code (46226 production / 0 test — the split is derived per file: test is what its project, its own path, or a compile-guarded region marks as test, and a file carrying no test signal counts as production), plus 4793 generated (machine-written code — designer, scaffolded and tool-emitted files — excluded from quality), 1 inter-project edges (build failed).
Build failed
What to do
Resolve the 1 Build failed finding(s) in Solution Shape. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d18_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
The repository's root README is a single cohesive document that describes Circuit Drawing (a .NET VB tool for creating vector circuit diagrams) with an overview, installation instructions, and first-steps guidance. It also includes a short Getting Started section plus the outline First steps; Add labels; Automatic labels of each component; Additional labels; Save, Open and Export; Export as EMF; Export for LaTeX; Custom Symbols. The body is clipped mid-Add Wire, so those later sections are not flagged as missing.
Documentation: no usage examplesREADME.md
What to do
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
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.
1 of 2 projects flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
32 % of calls cross a namespace and 2 % go through an interface, but 98 % 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: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
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. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
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.
~46.2k production LoC (489 types) across 2 project(s) / 8 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 · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. Deterministic, type-level.
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.
Add a README to the 2 of 2 project(s) that lack one — worth up to 2 pts.
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 numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
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 each file named `NNNN-title` in whatever markup those docs already use, 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 — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
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 a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets — CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
What to do
Run what this repository's stack ships: a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets — CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean — 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.
Not evidenced — 5 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
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.
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
Not included — 78 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
AX2 Stateful singletons — no singleton implementations detected
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
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.
D10 Test Quality — No tests were found in the analyzed repository to assess for quality.
D11 Test Reliability — No test suite was found to re-run, so reliability couldn't be assessed. Two searches produced that zero and both came back empty: the classifier that reads the loaded workspace recognised no suite it could run, and a walk of the source on disk — which covers the JS/TS `*.test.*` and `*.spec.*` conventions and probes for a Pester suite — found no test source in any other ecosystem either. Neither search reaches a suite that is missing from the loaded workspace and carries no name either walk recognises, so this is 'no suite found by those two searches', not a verdict that the repository has none.
D14 License Compliance — Licence collector did not produce a result
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
D23 Boundary Type-Coupling — At only 46k LoC across 2 projects this is a small multi-module codebase that clearly needs boundaries. No bounded-context organisation was detected either — neither a context-shaped layout nor 2+ sibling source directories each declaring an aggregate root. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D30 Dependency Vulnerabilities — nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D34 Knowledge Freshness — too few commits to judge knowledge freshness
D36 Supply-chain Provenance & Signing — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); 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.
D39 IL Efficiency — IL not measured — the analyzer's build of the target did not succeed
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.
D43 Malicious Dependencies — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens 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 lens 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 recognises the logging, tracing/metrics and health-check idioms of .NET, the JVM, Go, Python, JavaScript/TypeScript, Rust, Ruby, PHP, Swift, Dart, Elixir and Erlang, and most of this repository's production source is in none of them. Absence of an idiom this check recognises is NOT evidence that this repo lacks structured logging. This is a gap in the analyzer, not a finding about this repository.
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) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a BenchmarkDotNet reference in an .fsproj or .vbproj, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Allocation awareness was not assessed: this repository holds Visual Basic, whose allocation-aware idioms this check does not model yet. That is a gap in the analyzer's language reach, not a finding about your code.
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.
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
X10 Duplicated predicate — 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
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
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
X20 Mistyped argument guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X24 Document value interpolated into markup unescaped — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X25 Inert configuration knob — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X26 Unsynchronised callback handoff — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X27 Collection changed while being enumerated — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X28 Index access outside its own emptiness guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X29 Per-element action decided by a fixed element — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
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
X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
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
X6 Hand-rolled structured-format parsing — 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
X7 Silent fallback defaults — 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 CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameterString.vb:91— 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 CircuitDrawing/Form_Vektorgrafik.vb:830— 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.
No automated tests — No automated tests — no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (xUnit, NUnit or MSTest), and run it in CI so the gap cannot reopen.
MethodTooLong: WindowRenderer.LocationFensterChanged WindowRenderer/WindowRenderer.vb:532— MethodTooLong — LocationFensterChanged runs 222 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 122 over it, 2.22× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Vektor_Picturebox.RoutingVerbessern CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2074— MethodTooLong — RoutingVerbessern runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: BauteilAusDatei.Einlesen CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:296— MethodTooLong — Einlesen runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Routing_v2.solveShort CircuitDrawing/SkillDetect/Routing_v2.vb:160— MethodTooLong — solveShort runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Vektor_Picturebox.RoutingVerbessern_Wire CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2532— MethodTooLong — RoutingVerbessern_Wire runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Vektor_Picturebox.drawGrid CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4987— MethodTooLong — drawGrid runs 176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 76 over it, 1.76× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: DockStack.RerangeLayout WindowRenderer/DockStack.vb:299— MethodTooLong — RerangeLayout runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Vektor_Picturebox.simplifyWires CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5319— MethodTooLong — simplifyWires runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Ausdruck.auswertenFunktion CircuitDrawing/Ausdruck/Ausdruck.vb:481— MethodTooLong — auswertenFunktion runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Deko_Bauteil.Einlesen CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:87— MethodTooLong — Einlesen runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: AdvancedTextRenderer.leseStr CircuitDrawing/AdvancedTextRenderer.vb:143— MethodTooLong — leseStr runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Vektor_Picturebox.mitVerschiebenWire CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1111— MethodTooLong — mitVerschiebenWire runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Vektor_Picturebox.findRoutingSpeziell_Xplus CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1897— MethodTooLong — findRoutingSpeziell_Xplus runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Intelisense.ChangePopUpContent CircuitDrawing/Steuerelemente/Intelisense.vb:251— MethodTooLong — ChangePopUpContent runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SkillDetectSchematic.New(…) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:15— MethodTooLong — New(…) runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Vektor_Picturebox.moveWirePos CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1512— MethodTooLong — moveWirePos runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: BauteilAusDatei.setEinstellungen CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:579— MethodTooLong — setEinstellungen runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Ctr_BauelementeAuswahl_Skill.updateBauteil CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:208— MethodTooLong — updateBauteil runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SkillDetectSchematic.leseInst CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:238— MethodTooLong — leseInst runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ToolScale.MouseMoveOffgrid CircuitDrawing/Anzeige/Tools/ToolScale.vb:66— MethodTooLong — MouseMoveOffgrid runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Vektor_Picturebox.getNextScaleKante CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3555— MethodTooLong — getNextScaleKante runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ToolDrawBezierFreihand.berechneBezierBasisAlgo2 CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:225— MethodTooLong — berechneBezierBasisAlgo2 runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: DO_Text.drawTEX_Text CircuitDrawing/Grafikelemente/DO_Text.vb:333— MethodTooLong — drawTEX_Text runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: MatheAusrechnen.ausrechnen CircuitDrawing/MatheAusrechnen.vb:2— MethodTooLong — ausrechnen runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Duplicated block (8 lines × 2) CircuitDrawing/Anzeige/Tools/ToolHelper_PreviewMarkierung.vb:19— CircuitDrawing/Anzeige/Tools/ToolHelper_PreviewMarkierung.vb:19-26 | CircuitDrawing/Anzeige/Tools/ToolHelper_PreviewMarkierung.vb:28-36 — 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) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:766— CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:766-773 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1017-1025 — 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) CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:26— CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:26-33 | CircuitDrawing/Einstellungen/Einstellung_Linienstil.vb:44-51 — before extracting anything, compare `CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb` and `CircuitDrawing/Einstellungen/Einstellung_Linienstil.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1475— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1475-1482 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1483-1490 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1482` calls `add`, `Precompiled_Rect`, `koards` and `CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1474` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 2) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1491— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1491-1498 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1499-1506 — 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) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1633— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1633-1640 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1665-1672 — 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) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1649— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1649-1656 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1657-1664 — 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) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:36— CircuitDrawing/Elemente/CircuitElemente/Wire.vb:36-43 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:28-35 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/Wire.vb` and `CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) CircuitDrawing/Grafikelemente/DO_MultiLinie.vb:23— CircuitDrawing/Grafikelemente/DO_MultiLinie.vb:23-30 | CircuitDrawing/Grafikelemente/DO_MultiLinie_pointf.vb:15-22 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) CircuitDrawing/Grafikelemente/DO_MultiLinie.vb:34— CircuitDrawing/Grafikelemente/DO_MultiLinie.vb:34-41 | CircuitDrawing/Grafikelemente/DO_MultiLinie_pointf.vb:26-33 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) CircuitDrawing/Grafikelemente/DO_MultiLinie.vb:72— CircuitDrawing/Grafikelemente/DO_MultiLinie.vb:72-79 | CircuitDrawing/Grafikelemente/DO_MultiLinie_pointf.vb:69-76 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) CircuitDrawing/Grafikelemente/DO_Rechteck.vb:50— CircuitDrawing/Grafikelemente/DO_Rechteck.vb:50-57 | CircuitDrawing/Grafikelemente/DO_Textfeld.vb:25-32 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) CircuitDrawing/Grafikelemente/DO_Rechteck.vb:61— CircuitDrawing/Grafikelemente/DO_Rechteck.vb:61-68 | CircuitDrawing/Grafikelemente/DO_Textfeld.vb:55-62 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) WindowRenderer/DockStack.vb:108— WindowRenderer/DockStack.vb:108-115 | WindowRenderer/DockStack.vb:140-147 — 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) CircuitDrawing/Anzeige/Tools/ToolRechteckMarkierung.vb:108— CircuitDrawing/Anzeige/Tools/ToolRechteckMarkierung.vb:108-112 | CircuitDrawing/Anzeige/Tools/ToolRechteckMarkierung.vb:114-118 — 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) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:371— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:371-375 | CircuitDrawing/Elemente/ElementGruppe.vb:175-179 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:2195— CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:2195-2199 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:2205-2209 — 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 (5 lines × 2) CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Arrow.vb:25— CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Arrow.vb:25-29 | CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Int.vb:21-25 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:90— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:90-94 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:97-101 — 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) CircuitDrawing/Grafikelemente/DO_Ellipse.vb:44— CircuitDrawing/Grafikelemente/DO_Ellipse.vb:44-48 | CircuitDrawing/Grafikelemente/DO_Ellipse.vb:55-59 — 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) CircuitDrawing/Mathe.vb:511— CircuitDrawing/Mathe.vb:511-515 | CircuitDrawing/Mathe.vb:519-523 — 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) CircuitDrawing/Mathe.vb:537— CircuitDrawing/Mathe.vb:537-541 | CircuitDrawing/Mathe.vb:545-549 — 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) CircuitDrawing/Steuerelemente/DashStyleCombobox.vb:21— CircuitDrawing/Steuerelemente/DashStyleCombobox.vb:21-25 | CircuitDrawing/Steuerelemente/DashStyleCombobox.vb:47-51 — 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) WindowRenderer/DesignStyle.vb:667— WindowRenderer/DesignStyle.vb:667-671 | WindowRenderer/DesignStyle.vb:734-738 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `WindowRenderer/DesignStyle.vb:672` calls `FromArgb` and `WindowRenderer/DesignStyle.vb:738` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 2) WindowRenderer/DockStack.vb:203— WindowRenderer/DockStack.vb:203-207 | WindowRenderer/DockStack.vb:238-242 — 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 (5 lines × 2) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:56— CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:56-60 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:55-59 — before extracting anything, compare `CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb` and `CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:226— CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:226-230 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:183-187 — before extracting anything, compare `CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb` and `CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:28— CircuitDrawing/Elemente/CircuitElemente/Wire.vb:28-32 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:20-24 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/Wire.vb` and `CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
FileTooLong: Anzeige/Vektor_Picturebox.vb CircuitDrawing/Anzeige/Vektor_Picturebox.vb— FileTooLong — 5189 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4689 over it, 10.38× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: SkillDetect/SkillDetectSchematic.vb CircuitDrawing/SkillDetect/SkillDetectSchematic.vb— FileTooLong — 2230 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1730 over it, 4.46× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: CircuitDrawing/Mathe.vb CircuitDrawing/Mathe.vb— FileTooLong — 1067 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 567 over it, 2.13× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: CircuitElemente/BauteilAusDatei.vb CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb— FileTooLong — 1044 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 544 over it, 2.09× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: CircuitDrawing/Form_Vektorgrafik.vb CircuitDrawing/Form_Vektorgrafik.vb— FileTooLong — 928 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 428 over it, 1.86× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: CircuitDrawing/AdvancedTextRenderer.vb CircuitDrawing/AdvancedTextRenderer.vb— FileTooLong — 920 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 420 over it, 1.84× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: WindowRenderer/WindowRenderer.vb WindowRenderer/WindowRenderer.vb— FileTooLong — 871 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 371 over it, 1.74× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: WindowRenderer/TabElement.vb WindowRenderer/TabElement.vb— FileTooLong — 835 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 335 over it, 1.67× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: WindowRenderer/DesignStyle.vb WindowRenderer/DesignStyle.vb— FileTooLong — 790 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 290 over it, 1.58× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Ausdruck/Ausdruck.vb CircuitDrawing/Ausdruck/Ausdruck.vb— FileTooLong — 608 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 108 over it, 1.22× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: Steuerelemente/UserDrawListbox.vb CircuitDrawing/Steuerelemente/UserDrawListbox.vb— FileTooLong — 605 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 105 over it, 1.21× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: SkillDetect/Routing_v2.vb CircuitDrawing/SkillDetect/Routing_v2.vb— FileTooLong — 602 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 102 over it, 1.20× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: WindowRenderer/DockStack.vb WindowRenderer/DockStack.vb— FileTooLong — 580 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 80 over it, 1.16× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
Duplicated block (7 lines × 2) CircuitDrawing/Anzeige/Tools/ToolDeleteSnappoint.vb:78— CircuitDrawing/Anzeige/Tools/ToolDeleteSnappoint.vb:78-84 | CircuitDrawing/Anzeige/Tools/ToolEntfernen.vb:17-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:64— CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:64-70 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:63-69 — before extracting anything, compare `CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb` and `CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) CircuitDrawing/Anzeige/Tools/ToolMove.vb:305— CircuitDrawing/Anzeige/Tools/ToolMove.vb:305-311 | CircuitDrawing/Anzeige/Tools/ToolScale.vb:304-310 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `CircuitDrawing/Anzeige/Tools/ToolScale.vb:304` 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. 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `CircuitDrawing/Anzeige/Tools/ToolMove.vb:311` calls `DrawLine`, `PointF` and `CircuitDrawing/Anzeige/Tools/ToolScale.vb:310` does not — after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 2) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Gleich.vb:66— CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Gleich.vb:66-72 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Gleich.vb:77-83 — 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) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb:73— CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb:73-79 | CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Summe.vb:94-100 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:724— CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:724-730 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:743-749 — 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) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Graph.vb:156— CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Graph.vb:156-163 | CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:580-586 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:400— CircuitDrawing/Elemente/CircuitElemente/Wire.vb:400-406 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:243-249 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/Wire.vb` and `CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) CircuitDrawing/Mathe.vb:505— CircuitDrawing/Mathe.vb:505-511 | CircuitDrawing/Mathe.vb:531-537 — 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) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2455— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2455-2461 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2766-2772 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2453` calls `schneidet_Wire_ein_Bauteil`, `List`, `Clear` and `CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2764` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 2) WindowRenderer/DockStack.vb:196— WindowRenderer/DockStack.vb:196-202 | WindowRenderer/DockStack.vb:232-238 — 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 (7 lines × 2) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:238— CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:238-244 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:239-245 — before extracting anything, compare `CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb` and `CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2885— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2885-2891 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2908-2914 — 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 (6 lines × 2) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:408— CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:408-415 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:416-421 — 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) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:158— CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:158-163 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Spannungspfeil.vb:217-222 — before extracting anything, compare `CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb` and `CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Spannungspfeil.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb:135— CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb:135-140 | CircuitDrawing/Elemente/SnapableElemente/SnapableLabel.vb:109-114 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb:141` calls `get_ID`, `DirectCast`, `getNewLinienstil` and `CircuitDrawing/Elemente/SnapableElemente/SnapableLabel.vb:115` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (6 lines × 2) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1376— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1376-1382 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1391-1396 — 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) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1579— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1579-1584 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1590-1595 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1578` calls `add`, `Precompiled_Dot`, `params` and `CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1589` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (6 lines × 2) CircuitDrawing/MatheAusrechnen.vb:5— CircuitDrawing/MatheAusrechnen.vb:5-10 | CircuitDrawing/MatheAusrechnen.vb:29-34 — 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) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2464— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2464-2469 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2775-2780 — 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 (6 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2487— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2487-2492 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2794-2799 — 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 (6 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3169— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3169-3174 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3183-3188 — 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) CircuitDrawing/Steuerelemente/PfeilCombobox.vb:16— CircuitDrawing/Steuerelemente/PfeilCombobox.vb:16-21 | CircuitDrawing/Steuerelemente/PfeilCombobox.vb:29-34 — 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) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiGrafik.vb:90— CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiGrafik.vb:90-95 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Verzweigung/Precompiled_ELSE.vb:15-20 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) CircuitDrawing/Grafikelemente/DO_Rechteck.vb:97— CircuitDrawing/Grafikelemente/DO_Rechteck.vb:97-102 | CircuitDrawing/Grafikelemente/DO_RoundRect.vb:100-105 — before extracting anything, compare `CircuitDrawing/Grafikelemente/DO_Rechteck.vb` and `CircuitDrawing/Grafikelemente/DO_RoundRect.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2876— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2876-2881 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2901-2906 — 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.
Low cohesion: ToolDrawWire (LCOM4 5) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:1— ToolDrawWire's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ToolDrawBezier (LCOM4 5) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb:1— ToolDrawBezier's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ToolDrawLine (LCOM4 5) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:1— ToolDrawLine's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: SkillDetectSchematic (LCOM4 5) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:3— SkillDetectSchematic's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ToolAddSnappoint (LCOM4 4) CircuitDrawing/Anzeige/Tools/ToolAddSnappoint.vb:1— ToolAddSnappoint's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ToolDeleteSnappoint (LCOM4 4) CircuitDrawing/Anzeige/Tools/ToolDeleteSnappoint.vb:1— ToolDeleteSnappoint's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ToolCopy (LCOM4 4) CircuitDrawing/Anzeige/Tools/ToolCopy.vb:1— ToolCopy's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ToolRechteckMarkierung (LCOM4 4) CircuitDrawing/Anzeige/Tools/ToolRechteckMarkierung.vb:1— ToolRechteckMarkierung's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ToolDrawBezierFreihand (LCOM4 4) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:1— ToolDrawBezierFreihand's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Vektor_Picturebox (LCOM4 4) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2— Vektor_Picturebox's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: HeaderButton (LCOM4 4) WindowRenderer/HeaderButton.vb:2— HeaderButton's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
TooManyMethods: Vektor_Picturebox CircuitDrawing/Anzeige/Vektor_Picturebox.vb— TooManyMethods — 5153 significant lines (blank, comment-only and punctuation-only lines excluded), 192 methods. The bar is 30 methods; this is 162 over it, 6.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Form_Vektorgrafik CircuitDrawing/Form_Vektorgrafik.vb— TooManyMethods — 926 significant lines (blank, comment-only and punctuation-only lines excluded), 104 methods. The bar is 30 methods; this is 74 over it, 3.47× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: SkillDetectSchematic CircuitDrawing/SkillDetect/SkillDetectSchematic.vb— TooManyMethods — 1757 significant lines (blank, comment-only and punctuation-only lines excluded), 61 methods. The bar is 30 methods; this is 31 over it, 2.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: Mathe CircuitDrawing/Mathe.vb— TooManyMethods — 1002 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 30 methods; this is 15 over it, 1.50× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: TabElement WindowRenderer/TabElement.vb— TooManyMethods — 814 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 30 methods; this is 11 over it, 1.37× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: WindowRenderer WindowRenderer/WindowRenderer.vb— TooManyMethods — 846 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: BauteilAusDatei CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb— TooManyMethods — 681 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: UserDrawListbox CircuitDrawing/Steuerelemente/UserDrawListbox.vb— TooManyMethods — 409 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (10 lines × 2) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:378— CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:378-387 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:396-405 — 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) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:70— CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:70-79 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:112-121 — 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) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:805— CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:805-814 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1031-1040 — 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) CircuitDrawing/Form_Vektorgrafik.vb:1074— CircuitDrawing/Form_Vektorgrafik.vb:1074-1083 | CircuitDrawing/SkillDetect/SkillDetektionForm.vb:180-189 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:132— CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:132-141 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:107-116 — before extracting anything, compare `CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb` and `CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:60— CircuitDrawing/Elemente/CircuitElemente/Wire.vb:60-69 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:56-65 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/Wire.vb` and `CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:454— CircuitDrawing/Elemente/CircuitElemente/Wire.vb:454-463 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:293-302 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/Wire.vb` and `CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) WindowRenderer/VirtualWindowRenderer/MultiPerspektivenManager.vb:22— WindowRenderer/VirtualWindowRenderer/MultiPerspektivenManager.vb:22-31 | WindowRenderer/VirtualWindowRenderer/VirtualWindowRenderer.vb:30-39 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) CircuitDrawing/AdvancedTextRenderer.vb:945— CircuitDrawing/AdvancedTextRenderer.vb:945-953 | CircuitDrawing/AdvancedTextRenderer.vb:982-990 — 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 (9 lines × 2) CircuitDrawing/AdvancedTextRenderer.vb:1013— CircuitDrawing/AdvancedTextRenderer.vb:1013-1021 | CircuitDrawing/AdvancedTextRenderer.vb:1035-1043 — 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 (9 lines × 2) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:29— CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:29-37 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:28-36 — before extracting anything, compare `CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb` and `CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) CircuitDrawing/Ausdruck/Ausdruck.vb:235— CircuitDrawing/Ausdruck/Ausdruck.vb:235-243 | CircuitDrawing/Ausdruck/Ausdruck.vb:252-260 — 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) CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:91— CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:91-99 | CircuitDrawing/Einstellungen/Einstellung_Linienstil.vb:196-204 — before extracting anything, compare `CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb` and `CircuitDrawing/Einstellungen/Einstellung_Linienstil.vb` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:585— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:585-593 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:282-290 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1738— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1738-1746 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1747-1755 — 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) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5329— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5329-5337 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5494-5502 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5504` calls `If`, `OrElse` and `CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5339` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
ClassTooLong: AdvancedTextRenderer CircuitDrawing/AdvancedTextRenderer.vb— ClassTooLong — 918 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 518 over it, 2.30× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: DesignStyle WindowRenderer/DesignStyle.vb— ClassTooLong — 790 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 390 over it, 1.98× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Ausdruck CircuitDrawing/Ausdruck/Ausdruck.vb— ClassTooLong — 607 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 207 over it, 1.52× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: DockStack WindowRenderer/DockStack.vb— ClassTooLong — 579 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 179 over it, 1.45× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Routing_v2 CircuitDrawing/SkillDetect/Routing_v2.vb— ClassTooLong — 503 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 103 over it, 1.26× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: DO_Text CircuitDrawing/Grafikelemente/DO_Text.vb— ClassTooLong — 478 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 78 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Wire CircuitDrawing/Elemente/CircuitElemente/Wire.vb— ClassTooLong — 430 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 30 over it, 1.08× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (15 lines × 2) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:112— CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:112-126 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:121-135 — before extracting anything, compare `CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb` and `CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:178— CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:178-192 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:193-207 — before extracting anything, compare `CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb` and `CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) CircuitDrawing/Anzeige/Tools/ToolMove.vb:164— CircuitDrawing/Anzeige/Tools/ToolMove.vb:164-178 | CircuitDrawing/Anzeige/Tools/ToolMove.vb:216-230 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `CircuitDrawing/Anzeige/Tools/ToolMove.vb:214` calls `machRückgängigInklusiveKorrekterSelection`, `getRückArgs` and `CircuitDrawing/Anzeige/Tools/ToolMove.vb:162` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (15 lines × 2) CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:358— CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:358-372 | CircuitDrawing/WR_Fenster/WR_BauelementeAuswahl.vb:176-190 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:395— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:395-409 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:170-184 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:421— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:421-435 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:190-204 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) WindowRenderer/DockStack.vb:323— WindowRenderer/DockStack.vb:323-337 | WindowRenderer/DockStack.vb:355-369 — 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) CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddCurrentArrow.vb:12— CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddCurrentArrow.vb:12-23 | CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddSnapableImpedanceArrow.vb:12-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) CircuitDrawing/Anzeige/Tools/ToolAddVoltageArrow.vb:211— CircuitDrawing/Anzeige/Tools/ToolAddVoltageArrow.vb:211-222 | CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddSnapableElement.vb:54-65 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 2) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:167— CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:167-178 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Spannungspfeil.vb:226-237 — before extracting anything, compare `CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb` and `CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Spannungspfeil.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:381— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:381-392 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:158-169 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:619— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:619-630 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:313-324 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:634— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:634-645 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:327-338 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5114— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5114-5125 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5139-5150 — 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) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:380— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:380-393 | CircuitDrawing/Elemente/ElementGruppe.vb:184-197 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (14 lines × 2) CircuitDrawing/SkillDetect/Routing_v2.vb:515— CircuitDrawing/SkillDetect/Routing_v2.vb:515-528 | CircuitDrawing/SkillDetect/Routing_v2.vb:530-543 — 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) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:915— CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:915-928 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:992-1005 — 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) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Ellipse.vb:36— CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Ellipse.vb:36-49 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Rect.vb:32-45 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5341— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5341-5355 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5509-5522 — 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 (13 lines × 2) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:221— CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:221-233 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:223-235 — before extracting anything, compare `CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb` and `CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:21— CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:21-33 | CircuitDrawing/WR_Fenster/WR_BauelementeAuswahl.vb:18-30 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `CircuitDrawing/WR_Fenster/WR_BauelementeAuswahl.vb:18` calls `Bitmap` and `CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:21` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (13 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:543— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:543-555 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:265-277 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) CircuitDrawing/Mathe.vb:846— CircuitDrawing/Mathe.vb:846-858 | CircuitDrawing/Mathe.vb:898-910 — 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) WindowRenderer/WindowRenderer.vb:546— WindowRenderer/WindowRenderer.vb:546-558 | WindowRenderer/WindowRenderer.vb:730-742 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `WindowRenderer/WindowRenderer.vb:560` calls `Fenster`, `OnFensterLeave` and `WindowRenderer/WindowRenderer.vb:743` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (11 lines × 2) CircuitDrawing/AdvancedTextRenderer.vb:922— CircuitDrawing/AdvancedTextRenderer.vb:922-932 | CircuitDrawing/AdvancedTextRenderer.vb:959-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. 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) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb:164— CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb:164-174 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:134-144 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb:164` 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 (11 lines × 2) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_BasicRectBased.vb:93— CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_BasicRectBased.vb:93-103 | CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_BasicRectBased.vb:113-123 — 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) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:464— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:464-474 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:233-243 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) CircuitDrawing/Einstellungen/ElementEinstellung.vb:190— CircuitDrawing/Einstellungen/ElementEinstellung.vb:190-200 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:217-227 — 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) CircuitDrawing/SkillDetect/Routing_v2.vb:180— CircuitDrawing/SkillDetect/Routing_v2.vb:180-197 | CircuitDrawing/SkillDetect/Routing_v2.vb:198-215 — 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) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:886— CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:886-903 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:964-981 — 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) CircuitDrawing/Einstellungen/ElementEinstellung.vb:61— CircuitDrawing/Einstellungen/ElementEinstellung.vb:61-78 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:82-99 — 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) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1424— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1424-1441 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1457-1474 — 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.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
Members sharing a duplicated core (4 members, 50+ identical tokens) CircuitDrawing/Grafikelemente/DO_Ellipse.vb:67— CircuitDrawing/Grafikelemente/DO_Ellipse.vb:67-77 | CircuitDrawing/Grafikelemente/DO_Rechteck.vb:76-86 | CircuitDrawing/Grafikelemente/DO_RoundRect.vb:58-68 | CircuitDrawing/Grafikelemente/DO_Textfeld.vb:97-107 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) CircuitDrawing/Grafikelemente/DO_Rechteck.vb:50— CircuitDrawing/Grafikelemente/DO_Rechteck.vb:50-57 | CircuitDrawing/Grafikelemente/DO_Rechteck.vb:61-68 | CircuitDrawing/Grafikelemente/DO_Textfeld.vb:25-50 | CircuitDrawing/Grafikelemente/DO_Textfeld.vb:55-89 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4366— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4366-4410 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4414-4458 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4463-4504 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4508-4549 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (9 lines × 4) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:383— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:383-391 | CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:398-406 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:160-168 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:173-181 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 4) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2249— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2249-2257 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2274-2282 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2297-2305 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2322-2330 — 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 (9 lines × 4) CircuitDrawing/Mathe.vb:704— CircuitDrawing/Mathe.vb:704-712 | CircuitDrawing/Mathe.vb:801-809 | CircuitDrawing/Mathe.vb:853-861 | CircuitDrawing/Mathe.vb:905-913 — 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 (9 lines × 3) CircuitDrawing/Elemente/SnapableElement.vb:206— CircuitDrawing/Elemente/SnapableElement.vb:206-214 | CircuitDrawing/Elemente/SnapableElement.vb:220-228 | CircuitDrawing/Elemente/SnapableElement.vb:236-244 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `CircuitDrawing/Elemente/SnapableElement.vb:231` calls `setzeVerschobenenMittelpunktAufWireSoDassEsMöglichstGutPasst` and `CircuitDrawing/Elemente/SnapableElement.vb:216` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 3) CircuitDrawing/Einstellungen/ElementEinstellung.vb:157— CircuitDrawing/Einstellungen/ElementEinstellung.vb:157-165 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:196-204 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:223-231 — 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) CircuitDrawing/Grafikelemente/ExportDrawArgs/FillStyleList.vb:53— CircuitDrawing/Grafikelemente/ExportDrawArgs/FillStyleList.vb:53-61 | CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb:57-65 | CircuitDrawing/Grafikelemente/ExportDrawArgs/LineStyleList.vb:58-66 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (7 lines × 3) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:202— CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:202-208 | CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:220-226 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:222-228 — before extracting anything, compare `CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb` and `CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — 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) CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:278— CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:278-286 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:766-772 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1017-1023 — 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 (7 lines × 3) WindowRenderer/DesignStyle.vb:636— WindowRenderer/DesignStyle.vb:636-642 | WindowRenderer/DesignStyle.vb:708-714 | WindowRenderer/DesignStyle.vb:785-791 — 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.
DrawString_HorizontalMode.calcBoundingBoxes (cognitive 25) CircuitDrawing/AdvancedTextRenderer.vb:778— DrawString_HorizontalMode.calcBoundingBoxes has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (DrawString_HorizontalMode.calcBoundingBoxes) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
DrawString_HorizontalMode.calcBoundingBoxes (cognitive 25) CircuitDrawing/AdvancedTextRenderer.vb:836— DrawString_HorizontalMode.calcBoundingBoxes has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (DrawString_HorizontalMode.calcBoundingBoxes) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Duplicated block (35 lines × 2) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:130— CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:130-164 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:139-173 — before extracting anything, compare `CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb` and `CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (35 lines × 2) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:157— CircuitDrawing/Elemente/CircuitElemente/Wire.vb:157-191 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:160-194 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/Wire.vb` and `CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (27 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:302— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:302-328 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:90-116 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (27 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:333— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:333-359 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:121-147 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (26 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:438— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:438-463 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:207-232 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (26 lines × 2) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:115— CircuitDrawing/Elemente/CircuitElemente/Wire.vb:115-140 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:117-142 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/Wire.vb` and `CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (25 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:260— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:260-284 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:60-84 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (25 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5562— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5562-5586 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5590-5614 — 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 (22 lines × 2) CircuitDrawing/AdvancedTextRenderer.vb:691— CircuitDrawing/AdvancedTextRenderer.vb:691-712 | CircuitDrawing/AdvancedTextRenderer.vb:725-746 — 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 (22 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4789— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4789-4810 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4890-4911 — 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 (20 lines × 2) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1361— CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1361-1380 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1406-1425 — 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 (20 lines × 2) CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Int.vb:61— CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Int.vb:61-80 | CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParamter_Double.vb:57-76 — before extracting anything, compare `CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Int.vb` and `CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParamter_Double.vb` as WHOLE FILES: 82% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 3) CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:132— CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:132-145 | CircuitDrawing/Einstellungen/Einstellung_Fontstyle.vb:253-266 | CircuitDrawing/Einstellungen/Einstellung_Linienstil.vb:279-292 — before extracting anything, compare `CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb` and `CircuitDrawing/Einstellungen/Einstellung_Fontstyle.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 3) WindowRenderer/DockStack.vb:327— WindowRenderer/DockStack.vb:327-340 | WindowRenderer/DockStack.vb:359-372 | WindowRenderer/DockStack.vb:447-460 — 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 (12 lines × 3) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1697— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1697-1708 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1803-1814 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1975-1986 — 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 (12 lines × 3) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4394— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4394-4405 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4442-4453 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4535-4546 — 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 × 4) CircuitDrawing/Grafikelemente/DO_Ellipse.vb:67— CircuitDrawing/Grafikelemente/DO_Ellipse.vb:67-77 | CircuitDrawing/Grafikelemente/DO_Rechteck.vb:76-86 | CircuitDrawing/Grafikelemente/DO_RoundRect.vb:58-68 | CircuitDrawing/Grafikelemente/DO_Textfeld.vb:97-107 — before extracting anything, compare `CircuitDrawing/Grafikelemente/DO_Rechteck.vb` and `CircuitDrawing/Grafikelemente/DO_RoundRect.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 4) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4373— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4373-4383 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4421-4431 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4472-4482 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4517-4527 — 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. 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) CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:149— CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:149-159 | CircuitDrawing/Einstellungen/Einstellung_Fontstyle.vb:270-280 | CircuitDrawing/Einstellungen/Einstellung_Linienstil.vb:296-306 — before extracting anything, compare `CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb` and `CircuitDrawing/Einstellungen/Einstellung_Fontstyle.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 3) CircuitDrawing/Einstellungen/ElementEinstellung.vb:62— CircuitDrawing/Einstellungen/ElementEinstellung.vb:62-72 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:83-93 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:174-184 — 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 (10 lines × 3) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:92— CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:92-101 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:103-112 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:114-123 — 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 (10 lines × 3) CircuitDrawing/Einstellungen/ElementEinstellung.vb:68— CircuitDrawing/Einstellungen/ElementEinstellung.vb:68-77 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:89-98 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:119-128 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `CircuitDrawing/Einstellungen/ElementEinstellung.vb:129` calls `addEinstellungLiveChangedEvent` and `CircuitDrawing/Einstellungen/ElementEinstellung.vb:78` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5 lines × 4) CircuitDrawing/Grafikelemente/DO_Rechteck.vb:53— CircuitDrawing/Grafikelemente/DO_Rechteck.vb:53-57 | CircuitDrawing/Grafikelemente/DO_Rechteck.vb:64-68 | CircuitDrawing/Grafikelemente/DO_Textfeld.vb:28-32 | CircuitDrawing/Grafikelemente/DO_Textfeld.vb:58-62 — there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (5 lines × 4) CircuitDrawing/Mathe.vb:674— CircuitDrawing/Mathe.vb:674-680 | CircuitDrawing/Mathe.vb:772-778 | CircuitDrawing/Mathe.vb:840-844 | CircuitDrawing/Mathe.vb:892-896 — 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.
Appears unstructured (no recognised architecture) — ~46.2k production LoC (489 types) across 2 project(s) / 8 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.
TemplateAusDatei.readIDLE (cyclomatic 185) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:706— TemplateAusDatei.readIDLE has cyclomatic complexity 185 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
TemplateAusDatei.leseGrafik (cyclomatic 137) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1374— TemplateAusDatei.leseGrafik has cyclomatic complexity 137 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Vektor_Picturebox.mitVerschiebenWire (cyclomatic 87) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1111— Vektor_Picturebox.mitVerschiebenWire has cyclomatic complexity 87 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
AdvancedTextRenderer.leseStr (cyclomatic 72) CircuitDrawing/AdvancedTextRenderer.vb:143— AdvancedTextRenderer.leseStr has cyclomatic complexity 72 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Vektor_Picturebox.RoutingVerbessern_Wire (cyclomatic 68) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2532— Vektor_Picturebox.RoutingVerbessern_Wire has cyclomatic complexity 68 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Vektor_Picturebox.RoutingVerbessern (cyclomatic 65) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2074— Vektor_Picturebox.RoutingVerbessern has cyclomatic complexity 65 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Vektor_Picturebox.simplifyWires (cyclomatic 65) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5319— Vektor_Picturebox.simplifyWires has cyclomatic complexity 65 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Wire.AddIfPossible (cyclomatic 63) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:245— Wire.AddIfPossible has cyclomatic complexity 63 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Ausdruck.auswertenFunktion (cyclomatic 58) CircuitDrawing/Ausdruck/Ausdruck.vb:481— Ausdruck.auswertenFunktion has cyclomatic complexity 58 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
WindowRenderer.LocationFensterChanged (cyclomatic 57) WindowRenderer/WindowRenderer.vb:532— WindowRenderer.LocationFensterChanged 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.
BauteilAusDatei.Einlesen (cyclomatic 54) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:296— BauteilAusDatei.Einlesen 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.
TemplateAusDatei.kompilieren (cyclomatic 54) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:254— TemplateAusDatei.kompilieren 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.
Vektor_Picturebox.getNextScaleKante (cyclomatic 52) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3555— Vektor_Picturebox.getNextScaleKante has cyclomatic complexity 52 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
MatheAusrechnen.ausrechnen (cyclomatic 50) CircuitDrawing/MatheAusrechnen.vb:2— MatheAusrechnen.ausrechnen has cyclomatic complexity 50 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Intelisense.ChangePopUpContent (cyclomatic 49) CircuitDrawing/Steuerelemente/Intelisense.vb:251— Intelisense.ChangePopUpContent has cyclomatic complexity 49 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Element_Graph.setEinstellungen (cyclomatic 48) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Graph.vb:155— Element_Graph.setEinstellungen 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.
Vektor_Picturebox.hatWireAnPosition (cyclomatic 47) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3462— Vektor_Picturebox.hatWireAnPosition has cyclomatic complexity 47 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Deko_Bauteil.Einlesen (cyclomatic 46) CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:87— Deko_Bauteil.Einlesen has cyclomatic complexity 46 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Vektor_Picturebox.moveWirePos (cyclomatic 45) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1512— Vektor_Picturebox.moveWirePos 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.
Vektor_Picturebox.darfHierRouten (cyclomatic 44) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2749— Vektor_Picturebox.darfHierRouten 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.
Vektor_Picturebox.moveSelectedElements_Intern (cyclomatic 42) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:939— Vektor_Picturebox.moveSelectedElements_Intern has cyclomatic complexity 42 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Vektor_Picturebox.findRoutingSpeziell_Xplus (cyclomatic 42) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1897— Vektor_Picturebox.findRoutingSpeziell_Xplus has cyclomatic complexity 42 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Vektor_Picturebox.schneidet_Wire_ein_Bauteil (cyclomatic 42) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2453— Vektor_Picturebox.schneidet_Wire_ein_Bauteil has cyclomatic complexity 42 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Routing_v2.solveShort (cyclomatic 40) CircuitDrawing/SkillDetect/Routing_v2.vb:160— Routing_v2.solveShort 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.
SkillDetectSchematic.leseInst (cyclomatic 40) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:238— SkillDetectSchematic.leseInst 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.
BauteilAusDatei.setEinstellungen (cyclomatic 40) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:579— BauteilAusDatei.setEinstellungen 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.
DockStack.RerangeLayout (cyclomatic 40) WindowRenderer/DockStack.vb:299— DockStack.RerangeLayout 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.
TemplateAusDatei.__lade_defaultParameterValues (cyclomatic 38) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2241— TemplateAusDatei.__lade_defaultParameterValues has cyclomatic complexity 38 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Vektor_Picturebox.drawGrid (cyclomatic 37) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4987— Vektor_Picturebox.drawGrid has cyclomatic complexity 37 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Vektor_Picturebox.RoutingVerbessern_BauteilUmgehen (cyclomatic 36) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2342— Vektor_Picturebox.RoutingVerbessern_BauteilUmgehen 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.
Ausdruck.getAusdruck_Bool (cyclomatic 35) CircuitDrawing/Ausdruck/Ausdruck.vb:151— Ausdruck.getAusdruck_Bool has cyclomatic complexity 35 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
SkillDetectSchematic.New.ctor (cyclomatic 34) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:15— SkillDetectSchematic.New.ctor 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.
TemplateAusDatei.definiereVariable (cyclomatic 34) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:600— TemplateAusDatei.definiereVariable 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.
TemplateAusDatei.definiereKonstanteGesamt (cyclomatic 33) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:501— TemplateAusDatei.definiereKonstanteGesamt 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.
Ausdruck.auswertenOperatorVergleiche (cyclomatic 32) CircuitDrawing/Ausdruck/Ausdruck.vb:268— Ausdruck.auswertenOperatorVergleiche 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.
ToolScale.MouseMoveOffgrid (cyclomatic 29) CircuitDrawing/Anzeige/Tools/ToolScale.vb:66— ToolScale.MouseMoveOffgrid 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_Vektorgrafik.OnKeyDown (cyclomatic 29) CircuitDrawing/Form_Vektorgrafik.vb:1069— Form_Vektorgrafik.OnKeyDown 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.
DO_Text.drawGraphics (cyclomatic 29) CircuitDrawing/Grafikelemente/DO_Text.vb:77— DO_Text.drawGraphics 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.
DO_Text.drawPDFSharp (cyclomatic 29) CircuitDrawing/Grafikelemente/DO_Text.vb:225— DO_Text.drawPDFSharp 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.
Vektor_Picturebox.select_Element_At (cyclomatic 29) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:607— Vektor_Picturebox.select_Element_At 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.
Vektor_Picturebox.mitVerschiebenBauteilSnappoint (cyclomatic 29) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1058— Vektor_Picturebox.mitVerschiebenBauteilSnappoint 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.
Precompiled_LineArrow.callback_AfterOrigin (cyclomatic 28) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:74— Precompiled_LineArrow.callback_AfterOrigin 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.
Vektor_Picturebox.OnPaint (cyclomatic 28) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4861— Vektor_Picturebox.OnPaint 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.
Netz_WireElement.propagateConstraints (cyclomatic 27) CircuitDrawing/SkillDetect/Netz_Wires.vb:132— Netz_WireElement.propagateConstraints 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.
Deko_Bauteil.setEinstellungen (cyclomatic 27) CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:280— Deko_Bauteil.setEinstellungen 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.
DO_Text.drawTEX_Text (cyclomatic 27) CircuitDrawing/Grafikelemente/DO_Text.vb:333— DO_Text.drawTEX_Text 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.
Vektor_Picturebox.defaultOnKeyDown (cyclomatic 27) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5784— Vektor_Picturebox.defaultOnKeyDown 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.
Settings.ladeSettings (cyclomatic 26) CircuitDrawing/Allgemeine_Settings/Settings.vb:129— Settings.ladeSettings 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.
MasterElemente.getBitmap (cyclomatic 26) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:2155— MasterElemente.getBitmap 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.
Routing_v2.AlignRestToFixpoints (cyclomatic 25) CircuitDrawing/SkillDetect/Routing_v2.vb:29— Routing_v2.AlignRestToFixpoints 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.
Precompiled_Grafik.speicherGrafik (cyclomatic 24) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Grafik.vb:11— Precompiled_Grafik.speicherGrafik has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (Precompiled_Grafik.exportiereGrafik) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Precompiled_Grafik.exportiereGrafik (cyclomatic 24) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Grafik.vb:140— Precompiled_Grafik.exportiereGrafik has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This shape REPEATS in the file: one other method here (Precompiled_Grafik.speicherGrafik) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Intelisense.txtKeyPress (cyclomatic 24) CircuitDrawing/Steuerelemente/Intelisense.vb:73— Intelisense.txtKeyPress 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.
SnapableImpedanceArrow.setEinstellungen (cyclomatic 23) CircuitDrawing/Elemente/SnapableElemente/SnapableImpedanceArrow.vb:172— SnapableImpedanceArrow.setEinstellungen 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.
Mathe.schneidetRechteck (cyclomatic 23) CircuitDrawing/Mathe.vb:927— Mathe.schneidetRechteck 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.
Vektor_Picturebox.findRouting (cyclomatic 23) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1714— Vektor_Picturebox.findRouting 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.
TabElement.PicHeaderMouseMove (cyclomatic 23) WindowRenderer/TabElement.vb:350— TabElement.PicHeaderMouseMove 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.
Element_Graph.CalcFunktion (cyclomatic 22) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Graph.vb:34— Element_Graph.CalcFunktion 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.
Bibliothek.speicherVerwendeteTemplates (cyclomatic 22) CircuitDrawing/BauelementeBibliothek/Bibliothek.vb:225— Bibliothek.speicherVerwendeteTemplates 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.
TemplateAusDatei.addSnappointVonSkill (cyclomatic 22) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:159— TemplateAusDatei.addSnappointVonSkill 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.
Mathe.getSchnittpunkt_alpha (cyclomatic 22) CircuitDrawing/Mathe.vb:1051— Mathe.getSchnittpunkt_alpha 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.
TabElement.UntersucheContentAvailableChanges (cyclomatic 22) WindowRenderer/TabElement.vb:779— TabElement.UntersucheContentAvailableChanges 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.
ToolCopy.KeyDown (cyclomatic 21) CircuitDrawing/Anzeige/Tools/ToolCopy.vb:342— ToolCopy.KeyDown has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
SkillDetectSchematic.leseMaster (cyclomatic 21) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:141— SkillDetectSchematic.leseMaster has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
SkillDetectSchematic.leseNet (cyclomatic 21) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:193— SkillDetectSchematic.leseNet has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
SkillDetectSchematic.getNetName (cyclomatic 21) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:498— SkillDetectSchematic.getNetName has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Precompiled_IF.simplifyBlock (cyclomatic 21) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Verzweigung/Precompiled_IF.vb:12— Precompiled_IF.simplifyBlock has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Vektor_Picturebox.schalteBeschriftungsPosDurch (cyclomatic 21) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3709— Vektor_Picturebox.schalteBeschriftungsPosDurch has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Vektor_Picturebox.ladeGrafikIntern (cyclomatic 21) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4233— Vektor_Picturebox.ladeGrafikIntern has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Ausdruck.auswerten (cyclomatic 20) CircuitDrawing/Ausdruck/Ausdruck.vb:76— Ausdruck.auswerten 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.
SkillDetectSchematic.getBauteilZuordnungen (cyclomatic 20) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:654— SkillDetectSchematic.getBauteilZuordnungen 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.
SkillDetectSchematic.solveDirectConnections_Pins (cyclomatic 20) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1072— SkillDetectSchematic.solveDirectConnections_Pins 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.
Precompiled_Snappoint.compile (cyclomatic 20) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Snappoint.vb:59— Precompiled_Snappoint.compile 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.
Mathe.getSchnittpunkt_alpha (cyclomatic 20) CircuitDrawing/Mathe.vb:986— Mathe.getSchnittpunkt_alpha 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.
Vektor_Picturebox.getElementAt_forSelect (cyclomatic 20) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:689— Vektor_Picturebox.getElementAt_forSelect 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.
Vektor_Picturebox.adjustWhenNotOnWire (cyclomatic 20) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5531— Vektor_Picturebox.adjustWhenNotOnWire 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.
ToolDrawBezierFreihand.berechneBezierBasisAlgo2 (cyclomatic 19) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:225— ToolDrawBezierFreihand.berechneBezierBasisAlgo2 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.
ElementGruppe.getEinstellungen (cyclomatic 19) CircuitDrawing/Elemente/ElementGruppe.vb:154— ElementGruppe.getEinstellungen 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.
SkillDetectSchematic.verschiebeElementMitGenau1Wire (cyclomatic 19) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1845— SkillDetectSchematic.verschiebeElementMitGenau1Wire 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.
Mathe.getBezierBoundingBox (cyclomatic 19) CircuitDrawing/Mathe.vb:486— Mathe.getBezierBoundingBox 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.
Vektor_Picturebox.darfSelektieren (cyclomatic 19) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:865— Vektor_Picturebox.darfSelektieren 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.
Vektor_Picturebox.detectConnectedNets (cyclomatic 19) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2960— Vektor_Picturebox.detectConnectedNets 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.
Vektor_Picturebox.performGravity (cyclomatic 19) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3250— Vektor_Picturebox.performGravity 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.
ToolCopy.MouseUp (cyclomatic 18) CircuitDrawing/Anzeige/Tools/ToolCopy.vb:79— ToolCopy.MouseUp 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.
ToolDrawBezier.OnDraw (cyclomatic 18) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb:108— ToolDrawBezier.OnDraw 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.
Ausdruck_MaxMin.AusrechnenSoweitMöglich (cyclomatic 18) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_MaxMin.vb:13— Ausdruck_MaxMin.AusrechnenSoweitMöglich 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.
Ctr_BauelementeAuswahl_Skill.updateBauteil (cyclomatic 18) CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:208— Ctr_BauelementeAuswahl_Skill.updateBauteil 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.
Routing_v2.zeichne (cyclomatic 18) CircuitDrawing/SkillDetect/Routing_v2.vb:499— Routing_v2.zeichne 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.
Skill_BauteilZuordnung.leseInfo (cyclomatic 18) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:2400— Skill_BauteilZuordnung.leseInfo 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.
BauteilAusDatei.isEqualExceptSelection (cyclomatic 18) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:498— BauteilAusDatei.isEqualExceptSelection 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.
DO_Text.addTEXText (cyclomatic 18) CircuitDrawing/Grafikelemente/DO_Text.vb:440— DO_Text.addTEXText 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.
Mathe.auswerten (cyclomatic 18) CircuitDrawing/Mathe.vb:287— Mathe.auswerten 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.
Vektor_Picturebox._text_Nicht_Kursiv (cyclomatic 18) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3815— Vektor_Picturebox._text_Nicht_Kursiv 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.
TabElement.ContentvisibleChanged (cyclomatic 18) WindowRenderer/TabElement.vb:104— TabElement.ContentvisibleChanged 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.
SkillDetectSchematic.connectToNextLineOLD (cyclomatic 17) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:939— SkillDetectSchematic.connectToNextLineOLD 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.
Element_Rect.setEinstellungen (cyclomatic 17) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Rect.vb:159— Element_Rect.setEinstellungen 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.
TemplateAusDatei.defVar (cyclomatic 17) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1314— TemplateAusDatei.defVar 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.
Vektor_Picturebox.getEinstellungenOfSelectedElements (cyclomatic 17) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:352— Vektor_Picturebox.getEinstellungenOfSelectedElements 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.
Vektor_Picturebox.bewerteRouting (cyclomatic 17) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2029— Vektor_Picturebox.bewerteRouting 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.
DockStack.UpdateContentAvailableChanges (cyclomatic 17) WindowRenderer/DockStack.vb:567— DockStack.UpdateContentAvailableChanges 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.
ToolMove.MouseUp (cyclomatic 16) CircuitDrawing/Anzeige/Tools/ToolMove.vb:52— ToolMove.MouseUp 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.
Precompiled_Snappoint.export (cyclomatic 16) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Snappoint.vb:197— Precompiled_Snappoint.export 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.
Mathe.string_vorm_auswertenAufbereiten (cyclomatic 16) CircuitDrawing/Mathe.vb:226— Mathe.string_vorm_auswertenAufbereiten 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.
Vektor_Picturebox.Selected_Elemente_one_level_fore_back (cyclomatic 16) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3065— Vektor_Picturebox.Selected_Elemente_one_level_fore_back 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.
JoSiCombobox.abdunkeln (cyclomatic 16) CircuitDrawing/Steuerelemente/JoSiCombobox.vb:171— JoSiCombobox.abdunkeln 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.
HackComment CircuitDrawing/Grafikelemente/XTextFormatterEx2.vb:120— 'HACK in XTextFormatter — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
TodoComment CircuitDrawing/Grafikelemente/XTextFormatterEx2.vb:255— ' TODO Do we need "XStringFormat format" at PrepareDrawString Or at DrawString? Not yet used anyway, but probably already needed at PrepareDrawString. — 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.
Build failed — The target solution did not build cleanly (errors: 1), which caps Solution Shape at 3/10 — the most basic shape signal is that it compiles. First errors: BC2001: file 'CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_ToIntHex.vb' could not be found.
TemplateAusDatei.readIDLE (cognitive 413) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:706— TemplateAusDatei.readIDLE 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.
TemplateAusDatei.leseGrafik (cognitive 207) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1374— TemplateAusDatei.leseGrafik has cognitive complexity 207 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.simplifyWires (cognitive 207) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5319— Vektor_Picturebox.simplifyWires has cognitive complexity 207 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
BauteilAusDatei.setEinstellungen (cognitive 201) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:579— BauteilAusDatei.setEinstellungen has cognitive complexity 201 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.RoutingVerbessern (cognitive 201) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2074— Vektor_Picturebox.RoutingVerbessern has cognitive complexity 201 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
DockStack.RerangeLayout (cognitive 193) WindowRenderer/DockStack.vb:299— DockStack.RerangeLayout has cognitive complexity 193 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
WindowRenderer.LocationFensterChanged (cognitive 190) WindowRenderer/WindowRenderer.vb:532— WindowRenderer.LocationFensterChanged has cognitive complexity 190 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
TemplateAusDatei.kompilieren (cognitive 181) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:254— TemplateAusDatei.kompilieren has cognitive complexity 181 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.RoutingVerbessern_Wire (cognitive 168) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2532— Vektor_Picturebox.RoutingVerbessern_Wire has cognitive complexity 168 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.mitVerschiebenWire (cognitive 163) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1111— Vektor_Picturebox.mitVerschiebenWire has cognitive complexity 163 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.getNextScaleKante (cognitive 155) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3555— Vektor_Picturebox.getNextScaleKante has cognitive complexity 155 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
BauteilAusDatei.Einlesen (cognitive 144) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:296— BauteilAusDatei.Einlesen has cognitive complexity 144 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.darfHierRouten (cognitive 135) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2749— Vektor_Picturebox.darfHierRouten has cognitive complexity 135 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Deko_Bauteil.Einlesen (cognitive 130) CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:87— Deko_Bauteil.Einlesen has cognitive complexity 130 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
ToolScale.MouseMoveOffgrid (cognitive 129) CircuitDrawing/Anzeige/Tools/ToolScale.vb:66— ToolScale.MouseMoveOffgrid 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.
Ausdruck.auswertenFunktion (cognitive 128) CircuitDrawing/Ausdruck/Ausdruck.vb:481— Ausdruck.auswertenFunktion has cognitive complexity 128 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.schneidet_Wire_ein_Bauteil (cognitive 124) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2453— Vektor_Picturebox.schneidet_Wire_ein_Bauteil has cognitive complexity 124 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.findRoutingSpeziell_Xplus (cognitive 120) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1897— Vektor_Picturebox.findRoutingSpeziell_Xplus 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.
Element_Graph.setEinstellungen (cognitive 116) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Graph.vb:155— Element_Graph.setEinstellungen has cognitive complexity 116 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
TemplateAusDatei.__lade_defaultParameterValues (cognitive 114) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2241— TemplateAusDatei.__lade_defaultParameterValues 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.
Vektor_Picturebox.moveSelectedElements_Intern (cognitive 96) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:939— Vektor_Picturebox.moveSelectedElements_Intern has cognitive complexity 96 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Deko_Bauteil.setEinstellungen (cognitive 95) CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:280— Deko_Bauteil.setEinstellungen has cognitive complexity 95 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Routing_v2.solveShort (cognitive 93) CircuitDrawing/SkillDetect/Routing_v2.vb:160— Routing_v2.solveShort has cognitive complexity 93 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Intelisense.ChangePopUpContent (cognitive 92) CircuitDrawing/Steuerelemente/Intelisense.vb:251— Intelisense.ChangePopUpContent has cognitive complexity 92 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.select_Element_At (cognitive 90) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:607— Vektor_Picturebox.select_Element_At has cognitive complexity 90 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Ctr_BauelementeAuswahl_Skill.updateBauteil (cognitive 87) CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:208— Ctr_BauelementeAuswahl_Skill.updateBauteil has cognitive complexity 87 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Wire.AddIfPossible (cognitive 86) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:245— Wire.AddIfPossible 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.
Vektor_Picturebox.moveWirePos (cognitive 81) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1512— Vektor_Picturebox.moveWirePos has cognitive complexity 81 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.RoutingVerbessern_BauteilUmgehen (cognitive 80) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2342— Vektor_Picturebox.RoutingVerbessern_BauteilUmgehen 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.
Vektor_Picturebox.drawGrid (cognitive 80) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4987— Vektor_Picturebox.drawGrid 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.
TabElement.UntersucheContentAvailableChanges (cognitive 77) WindowRenderer/TabElement.vb:779— TabElement.UntersucheContentAvailableChanges 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.
Element_Rect.setEinstellungen (cognitive 76) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Rect.vb:159— Element_Rect.setEinstellungen has cognitive complexity 76 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.OnPaint (cognitive 75) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4861— Vektor_Picturebox.OnPaint has cognitive complexity 75 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SkillDetectSchematic.verschiebeElementMitGenau1Wire (cognitive 74) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1845— SkillDetectSchematic.verschiebeElementMitGenau1Wire 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.
Netz_WireElement.propagateConstraints (cognitive 69) CircuitDrawing/SkillDetect/Netz_Wires.vb:132— Netz_WireElement.propagateConstraints has cognitive complexity 69 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
MatheAusrechnen.ausrechnen (cognitive 69) CircuitDrawing/MatheAusrechnen.vb:2— MatheAusrechnen.ausrechnen has cognitive complexity 69 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Routing_v2.AlignRestToFixpoints (cognitive 67) CircuitDrawing/SkillDetect/Routing_v2.vb:29— Routing_v2.AlignRestToFixpoints 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.
Routing_v2.zeichne (cognitive 65) CircuitDrawing/SkillDetect/Routing_v2.vb:499— Routing_v2.zeichne 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.
Precompiled_LineArrow.callback_AfterOrigin (cognitive 64) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:74— Precompiled_LineArrow.callback_AfterOrigin 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.
Vektor_Picturebox.hatWireAnPosition (cognitive 64) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3462— Vektor_Picturebox.hatWireAnPosition 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.
Vektor_Picturebox.adjustWhenNotOnWire (cognitive 62) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5531— Vektor_Picturebox.adjustWhenNotOnWire 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.
SkillDetectSchematic.New.ctor (cognitive 60) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:15— SkillDetectSchematic.New.ctor has cognitive complexity 60 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SkillDetectSchematic.solveDirectConnections_Pins (cognitive 59) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1072— SkillDetectSchematic.solveDirectConnections_Pins has cognitive complexity 59 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.select_All_in_Rect (cognitive 59) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:551— Vektor_Picturebox.select_All_in_Rect has cognitive complexity 59 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.LöseSchnittpunkt (cognitive 58) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5637— Vektor_Picturebox.LöseSchnittpunkt has cognitive complexity 58 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SkillDetectSchematic.leseInst (cognitive 57) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:238— SkillDetectSchematic.leseInst 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.
Vektor_Picturebox.getEinstellungenOfSelectedElements (cognitive 57) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:352— Vektor_Picturebox.getEinstellungenOfSelectedElements 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.
TemplateAusDatei.definiereVariable (cognitive 55) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:600— TemplateAusDatei.definiereVariable 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.
Vektor_Picturebox.getElementAt_forSelect (cognitive 55) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:689— Vektor_Picturebox.getElementAt_forSelect 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.
TabElement.ContentvisibleChanged (cognitive 55) WindowRenderer/TabElement.vb:104— TabElement.ContentvisibleChanged 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.
Precompiled_IF.simplifyBlock (cognitive 54) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Verzweigung/Precompiled_IF.vb:12— Precompiled_IF.simplifyBlock 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.
TemplateAusDatei.definiereKonstanteGesamt (cognitive 54) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:501— TemplateAusDatei.definiereKonstanteGesamt 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.
AdvancedTextRenderer.leseStr (cognitive 53) CircuitDrawing/AdvancedTextRenderer.vb:143— AdvancedTextRenderer.leseStr has cognitive complexity 53 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Element_Graph.CalcFunktion (cognitive 53) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Graph.vb:34— Element_Graph.CalcFunktion has cognitive complexity 53 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
TemplateAusDatei.addSnappointVonSkill (cognitive 53) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:159— TemplateAusDatei.addSnappointVonSkill has cognitive complexity 53 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
ElementGruppe.getEinstellungen (cognitive 52) CircuitDrawing/Elemente/ElementGruppe.vb:154— ElementGruppe.getEinstellungen 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.
SkillDetectSchematic.connectToNextLine (cognitive 52) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:881— SkillDetectSchematic.connectToNextLine 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.
Mathe.getSchnittpunkt_alpha (cognitive 52) CircuitDrawing/Mathe.vb:1051— Mathe.getSchnittpunkt_alpha 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.
ToolCopy.MouseUp (cognitive 51) CircuitDrawing/Anzeige/Tools/ToolCopy.vb:79— ToolCopy.MouseUp 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.
Vektor_Picturebox.Selected_Elemente_one_level_fore_back (cognitive 51) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3065— Vektor_Picturebox.Selected_Elemente_one_level_fore_back 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.
Vektor_Picturebox.findRouting (cognitive 50) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1714— Vektor_Picturebox.findRouting 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.
TabElement.PicHeaderMouseMove (cognitive 50) WindowRenderer/TabElement.vb:350— TabElement.PicHeaderMouseMove 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.
MasterElemente.getBitmap (cognitive 48) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:2155— MasterElemente.getBitmap 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.
SnapableImpedanceArrow.setEinstellungen (cognitive 48) CircuitDrawing/Elemente/SnapableElemente/SnapableImpedanceArrow.vb:172— SnapableImpedanceArrow.setEinstellungen 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.
Vektor_Picturebox.mitVerschiebenBauteilSnappoint (cognitive 48) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1058— Vektor_Picturebox.mitVerschiebenBauteilSnappoint 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.
SkillDetectSchematic.getBauteilZuordnungen (cognitive 47) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:654— SkillDetectSchematic.getBauteilZuordnungen 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.
TemplateAusDatei.try_translate_param_value (cognitive 47) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2351— TemplateAusDatei.try_translate_param_value 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.
ToolPlace.MouseUp (cognitive 46) CircuitDrawing/Anzeige/Tools/ToolPlace.vb:92— ToolPlace.MouseUp 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.
ToolMove.MouseUp (cognitive 45) CircuitDrawing/Anzeige/Tools/ToolMove.vb:52— ToolMove.MouseUp 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.
SkillDetectSchematic.connectToNextLineOLD (cognitive 45) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:939— SkillDetectSchematic.connectToNextLineOLD 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.
ToolScale.OnDraw (cognitive 44) CircuitDrawing/Anzeige/Tools/ToolScale.vb:243— ToolScale.OnDraw 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.
Ausdruck.auswertenOperatorVergleiche (cognitive 44) CircuitDrawing/Ausdruck/Ausdruck.vb:268— Ausdruck.auswertenOperatorVergleiche 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.
SkillDetectSchematic.leseNet (cognitive 44) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:193— SkillDetectSchematic.leseNet 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.
Precompiled_Snappoint.compile (cognitive 44) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Snappoint.vb:59— Precompiled_Snappoint.compile 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.
Intelisense.txtKeyPress (cognitive 44) CircuitDrawing/Steuerelemente/Intelisense.vb:73— Intelisense.txtKeyPress 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.
SkillDetectSchematic.leseMaster (cognitive 43) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:141— SkillDetectSchematic.leseMaster 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.
DO_Text.drawTEX_Text (cognitive 43) CircuitDrawing/Grafikelemente/DO_Text.vb:333— DO_Text.drawTEX_Text 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.
ToolCopy.KeyDown (cognitive 42) CircuitDrawing/Anzeige/Tools/ToolCopy.vb:342— ToolCopy.KeyDown 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.
TemplateAusDatei.defVar (cognitive 42) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1314— TemplateAusDatei.defVar 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_Vektorgrafik.OnKeyDown (cognitive 42) CircuitDrawing/Form_Vektorgrafik.vb:1069— Form_Vektorgrafik.OnKeyDown 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.
DO_Text.addTEXText (cognitive 42) CircuitDrawing/Grafikelemente/DO_Text.vb:440— DO_Text.addTEXText 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.
Ausdruck.getAusdruck_Bool (cognitive 41) CircuitDrawing/Ausdruck/Ausdruck.vb:151— Ausdruck.getAusdruck_Bool 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.
Bibliothek.speicherVerwendeteTemplates (cognitive 41) CircuitDrawing/BauelementeBibliothek/Bibliothek.vb:225— Bibliothek.speicherVerwendeteTemplates 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.
Vektor_Picturebox.detectConnectedNets (cognitive 41) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2960— Vektor_Picturebox.detectConnectedNets 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.
Vektor_Picturebox._text_Nicht_Kursiv (cognitive 41) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3815— Vektor_Picturebox._text_Nicht_Kursiv 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.
SkillDetectSchematic.getNetName (cognitive 40) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:498— SkillDetectSchematic.getNetName 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.
SkillDetectSchematic.routeUngefähr (cognitive 40) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1619— SkillDetectSchematic.routeUngefähr 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.
Mathe.string_vorm_auswertenAufbereiten (cognitive 39) CircuitDrawing/Mathe.vb:226— Mathe.string_vorm_auswertenAufbereiten 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.
Vektor_Picturebox.ladeGrafikIntern (cognitive 39) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4233— Vektor_Picturebox.ladeGrafikIntern 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.
Ctr_BauelementeAuswahl_Skill.init (cognitive 37) CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:95— Ctr_BauelementeAuswahl_Skill.init 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.
DO_Text.drawPDFSharp (cognitive 37) CircuitDrawing/Grafikelemente/DO_Text.vb:225— DO_Text.drawPDFSharp 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.
Vektor_Picturebox.darfHierRouten_wirdWireOderPinBerührt (cognitive 36) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2830— Vektor_Picturebox.darfHierRouten_wirdWireOderPinBerührt 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.
Vektor_Picturebox.drawDots_recursive (cognitive 35) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5212— Vektor_Picturebox.drawDots_recursive 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.
RückgängigGrafik.ladeZustand (cognitive 35) CircuitDrawing/Rückgängig/RückgängigGrafik.vb:45— RückgängigGrafik.ladeZustand 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.
ToolDrawBezierFreihand.berechneBezierBasisAlgo2 (cognitive 34) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:225— ToolDrawBezierFreihand.berechneBezierBasisAlgo2 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.
SkillDetectSchematic.leseKeyValuePairs (cognitive 34) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:444— SkillDetectSchematic.leseKeyValuePairs 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.
Vektor_Picturebox.getDrehpunkt (cognitive 34) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1414— Vektor_Picturebox.getDrehpunkt 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.
SkillDetectSchematic.ordneBauteileZu (cognitive 33) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:718— SkillDetectSchematic.ordneBauteileZu 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.
Vektor_Picturebox.schalteBeschriftungsPosDurch (cognitive 33) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3709— Vektor_Picturebox.schalteBeschriftungsPosDurch 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.
ToolDrawLine.KeyDown (cognitive 32) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:94— ToolDrawLine.KeyDown 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.
Ausdruck_MaxMin.AusrechnenSoweitMöglich (cognitive 32) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_MaxMin.vb:13— Ausdruck_MaxMin.AusrechnenSoweitMöglich 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.
Ausdruck_Summe.AusrechnenSoweitMöglich (cognitive 32) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Summe.vb:22— Ausdruck_Summe.AusrechnenSoweitMöglich 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.
SkillDetectSchematic.getVector (cognitive 32) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:399— SkillDetectSchematic.getVector 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.
SkillDetectSchematic.BauelementeAusrichten_NachPins (cognitive 32) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1446— SkillDetectSchematic.BauelementeAusrichten_NachPins 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.
ToolPlace.OnDraw (cognitive 31) CircuitDrawing/Anzeige/Tools/ToolPlace.vb:150— ToolPlace.OnDraw 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.
Ausdruck.auswertenFunktionen (cognitive 31) CircuitDrawing/Ausdruck/Ausdruck.vb:432— Ausdruck.auswertenFunktionen 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.
SkillDetectSchematic.TerminalsVerschieben (cognitive 31) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1806— SkillDetectSchematic.TerminalsVerschieben 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.
GrafikEPS_DrawArgs.switchToDashstyle (cognitive 31) CircuitDrawing/Grafikelemente/ExportDrawArgs/GrafikEPS_DrawArgs.vb:81— GrafikEPS_DrawArgs.switchToDashstyle 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.
Mathe.getBezierBoundingBox (cognitive 30) CircuitDrawing/Mathe.vb:486— Mathe.getBezierBoundingBox 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.
Vektor_Picturebox.defaultOnKeyDown (cognitive 30) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5784— Vektor_Picturebox.defaultOnKeyDown 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.
Window.UpdateContentAvailableChanges (cognitive 30) WindowRenderer/Window.vb:313— Window.UpdateContentAvailableChanges 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.
Mathe.schneidetRechteck (cognitive 29) CircuitDrawing/Mathe.vb:927— Mathe.schneidetRechteck 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.
Vektor_Picturebox.selectAll (cognitive 29) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:524— Vektor_Picturebox.selectAll 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.
ToolDrawWire.OnDraw (cognitive 28) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:177— ToolDrawWire.OnDraw 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.
SkillDetectSchematic.getPinZuordnung (cognitive 28) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:781— SkillDetectSchematic.getPinZuordnung 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.
SkillDetectSchematic.setWireConnections (cognitive 28) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:857— SkillDetectSchematic.setWireConnections 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.
Wire.getSnappoint (cognitive 28) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:156— Wire.getSnappoint 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.
WireLuftlinie.getSnappoint (cognitive 28) CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:159— WireLuftlinie.getSnappoint 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.
Intelisense.openPopup (cognitive 28) CircuitDrawing/Steuerelemente/Intelisense.vb:197— Intelisense.openPopup 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.
ToolAddVoltageArrow.KeyDown (cognitive 27) CircuitDrawing/Anzeige/Tools/ToolAddVoltageArrow.vb:114— ToolAddVoltageArrow.KeyDown 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.
ToolDrawBezier.OnDraw (cognitive 27) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb:108— ToolDrawBezier.OnDraw 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.
SkillDetectSchematic.hatMehrAls1WireOderElementeAnPosition (cognitive 27) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1251— SkillDetectSchematic.hatMehrAls1WireOderElementeAnPosition 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.
Basic_Linie.getSnappoint (cognitive 27) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:273— Basic_Linie.getSnappoint 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.
Basic_Spannungspfeil.setEinstellungen (cognitive 27) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Spannungspfeil.vb:261— Basic_Spannungspfeil.setEinstellungen 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.
Multi_Lang_String.New.ctor (cognitive 27) CircuitDrawing/TemplateAusDatei/Multi_Lang_String.vb:9— Multi_Lang_String.New.ctor 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.
Mathe.getSchnittpunkt_alpha (cognitive 27) CircuitDrawing/Mathe.vb:1135— Mathe.getSchnittpunkt_alpha 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.
MultiPerspektivenManager.ladeAnordnung (cognitive 27) WindowRenderer/VirtualWindowRenderer/MultiPerspektivenManager.vb:66— MultiPerspektivenManager.ladeAnordnung 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.
Settings.ladeSettings (cognitive 26) CircuitDrawing/Allgemeine_Settings/Settings.vb:129— Settings.ladeSettings has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SkillDetectSchematic.addConstraints (cognitive 26) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1533— SkillDetectSchematic.addConstraints has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
SkillDetectSchematic.routeDetail (cognitive 26) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1675— SkillDetectSchematic.routeDetail has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
TemplateAusDatei.New.ctor (cognitive 26) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:62— TemplateAusDatei.New.ctor has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Wire.getGrafikMitZeilensprüngen (cognitive 26) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:46— Wire.getGrafikMitZeilensprüngen has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
DO_Text.drawGraphics (cognitive 26) CircuitDrawing/Grafikelemente/DO_Text.vb:77— DO_Text.drawGraphics has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Mathe.auswerten (cognitive 26) CircuitDrawing/Mathe.vb:287— Mathe.auswerten has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Vektor_Picturebox.performGravity (cognitive 26) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3250— Vektor_Picturebox.performGravity has cognitive complexity 26 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Ausdruck.auswerten (cognitive 25) CircuitDrawing/Ausdruck/Ausdruck.vb:76— Ausdruck.auswerten 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.
SkillDetectSchematic.direkterPfad (cognitive 25) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1573— SkillDetectSchematic.direkterPfad 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.
WireLuftlinie.getGrafikMitZeilensprüngen (cognitive 25) CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:38— WireLuftlinie.getGrafikMitZeilensprüngen 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.
Matrix.Auflösen (cognitive 25) CircuitDrawing/Matrix.vb:12— Matrix.Auflösen 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.
Vektor_Picturebox.FindGravity (cognitive 25) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3196— Vektor_Picturebox.FindGravity 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.
UserDrawListbox.OnDrawItems (cognitive 25) CircuitDrawing/Steuerelemente/UserDrawListbox.vb:88— UserDrawListbox.OnDrawItems 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.
Window.TabsLostElement (cognitive 25) WindowRenderer/Window.vb:155— Window.TabsLostElement 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.
ToolMove.MouseMove (cognitive 24) CircuitDrawing/Anzeige/Tools/ToolMove.vb:192— ToolMove.MouseMove 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.
Skill_BauteilZuordnung.New.ctor (cognitive 24) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:2348— Skill_BauteilZuordnung.New.ctor 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.
Einstellung_Fontstyle.getNewFontstyle (cognitive 24) CircuitDrawing/Einstellungen/Einstellung_Fontstyle.vb:113— Einstellung_Fontstyle.getNewFontstyle 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.
CopyClipboard.Einlesen (cognitive 24) CircuitDrawing/Anzeige/CopyClipboard.vb:82— CopyClipboard.Einlesen 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.
Precompiled_Grafik.speicherGrafik (cognitive 24) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Grafik.vb:11— Precompiled_Grafik.speicherGrafik has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (Precompiled_Grafik.exportiereGrafik) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Precompiled_Grafik.exportiereGrafik (cognitive 24) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Grafik.vb:140— Precompiled_Grafik.exportiereGrafik has cognitive complexity 24 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (Precompiled_Grafik.speicherGrafik) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Vektor_Picturebox.gruppeAuflösen (cognitive 24) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3387— Vektor_Picturebox.gruppeAuflösen 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.
DockStack.UpdateContentAvailableChanges (cognitive 24) WindowRenderer/DockStack.vb:567— DockStack.UpdateContentAvailableChanges 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.
ToolCopy.set_copy_elemente (cognitive 23) CircuitDrawing/Anzeige/Tools/ToolCopy.vb:175— ToolCopy.set_copy_elemente 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.
ToolDrawLine.OnDraw (cognitive 23) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:192— ToolDrawLine.OnDraw 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.
Netz_WireElement.zeichnen (cognitive 23) CircuitDrawing/SkillDetect/Netz_Wires.vb:209— Netz_WireElement.zeichnen 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.
TemplateAusDatei.Skill_liegtImWeg (cognitive 23) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:203— TemplateAusDatei.Skill_liegtImWeg 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.
TemplateAusDatei.leseScaling (cognitive 23) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1802— TemplateAusDatei.leseScaling 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.
Mathe.splitString (cognitive 23) CircuitDrawing/Mathe.vb:345— Mathe.splitString 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.
Vektor_Picturebox.getExportElemente (cognitive 23) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4786— Vektor_Picturebox.getExportElemente 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.
Pfeil_Verwaltung.getBezierWithPfeil (cognitive 23) CircuitDrawing/Pfeile/Pfeil_Verwaltung.vb:68— Pfeil_Verwaltung.getBezierWithPfeil 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.
JoSiCombobox.abdunkeln (cognitive 23) CircuitDrawing/Steuerelemente/JoSiCombobox.vb:171— JoSiCombobox.abdunkeln 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.
WR_Einstellungsform.setEinstellungen (cognitive 23) CircuitDrawing/WR_Fenster/WR_Einstellungsform.vb:32— WR_Einstellungsform.setEinstellungen 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.
getNextTokenString.getNextToken (cognitive 22) CircuitDrawing/AdvancedTextRenderer.vb:334— getNextTokenString.getNextToken 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.
ToolDrawWire.KeyDown (cognitive 22) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:94— ToolDrawWire.KeyDown 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.
BauteilAusDatei.isEqualExceptSelection (cognitive 22) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:498— BauteilAusDatei.isEqualExceptSelection 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.
CompileParentArgs.add_parent_grafik (cognitive 22) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:3104— CompileParentArgs.add_parent_grafik 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_Vektorgrafik.DeleteLokalSymbol (cognitive 22) CircuitDrawing/Form_Vektorgrafik.vb:268— Form_Vektorgrafik.DeleteLokalSymbol 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.
XTextFormatterEx2.CreateLayout (cognitive 22) CircuitDrawing/Grafikelemente/XTextFormatterEx2.vb:355— XTextFormatterEx2.CreateLayout 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.
Vektor_Picturebox.exportierenAlsTEX (cognitive 22) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4616— Vektor_Picturebox.exportierenAlsTEX 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.
Vektor_Picturebox.changeSnapingElementsWhenWiresAreCombined (cognitive 22) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5704— Vektor_Picturebox.changeSnapingElementsWhenWiresAreCombined 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.
Intelisense.txtKeyDown (cognitive 22) CircuitDrawing/Steuerelemente/Intelisense.vb:48— Intelisense.txtKeyDown 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.
TabElement.UntersucheContentAvailableChanges (cognitive 22) WindowRenderer/TabElement.vb:752— TabElement.UntersucheContentAvailableChanges 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.
Settings.read_SelectBauteil (cognitive 21) CircuitDrawing/Allgemeine_Settings/Settings.vb:277— Settings.read_SelectBauteil 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.
ElementGruppe.getSelection (cognitive 21) CircuitDrawing/Elemente/ElementGruppe.vb:46— ElementGruppe.getSelection 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.
WireSnappoint.Move_WennliegtAufWire (cognitive 21) CircuitDrawing/Elemente/SnapableElement.vb:203— WireSnappoint.Move_WennliegtAufWire 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.
Mathe.splitString (cognitive 21) CircuitDrawing/Mathe.vb:383— Mathe.splitString 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.
Vektor_Picturebox.findRoutingSpeziell_onGrid (cognitive 21) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1839— Vektor_Picturebox.findRoutingSpeziell_onGrid 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.
Vektor_Picturebox.gruppeErstellen (cognitive 21) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3333— Vektor_Picturebox.gruppeErstellen 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.
ToolDrawWire.suche_snapPoint (cognitive 20) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:129— ToolDrawWire.suche_snapPoint 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.
ToolDrawLine.suche_snapPoint (cognitive 20) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:138— ToolDrawLine.suche_snapPoint 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.
Ausdruck_Gleich.exportiere (cognitive 20) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Gleich.vb:58— Ausdruck_Gleich.exportiere 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.
SkillDetectSchematic.deleteDummys (cognitive 20) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1276— SkillDetectSchematic.deleteDummys 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.
SkillDetectSchematic.routeDetail2 (cognitive 20) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1725— SkillDetectSchematic.routeDetail2 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.
Einstellung_Linienstil.aktualisiere (cognitive 20) CircuitDrawing/Einstellungen/Einstellung_Linienstil.vb:60— Einstellung_Linienstil.aktualisiere 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.
Einstellung_Linienstil.getNewLinienstil (cognitive 20) CircuitDrawing/Einstellungen/Einstellung_Linienstil.vb:130— Einstellung_Linienstil.getNewLinienstil 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.
Einstellung_Multi.CombineValues (cognitive 20) CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_Multi.vb:26— Einstellung_Multi.CombineValues 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.
TemplateAusDatei.leseTextPos (cognitive 20) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1881— TemplateAusDatei.leseTextPos 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.
LineStyle.getXPen (cognitive 20) CircuitDrawing/Grafikelemente/ExportDrawArgs/LineStyleList.vb:189— LineStyle.getXPen 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.
WR_Einstellungsform.sindEinstellungenGleich (cognitive 20) CircuitDrawing/WR_Fenster/WR_Einstellungsform.vb:90— WR_Einstellungsform.sindEinstellungenGleich 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.
TabElement.headerRendern (cognitive 20) WindowRenderer/TabElement.vb:216— TabElement.headerRendern 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.
TabElement.headerLöschen (cognitive 20) WindowRenderer/TabElement.vb:458— TabElement.headerLöschen 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.
VirtualWindowRenderer.vorlagePrüfenUndKorrigieren (cognitive 20) WindowRenderer/VirtualWindowRenderer/VirtualWindowRenderer.vb:82— VirtualWindowRenderer.vorlagePrüfenUndKorrigieren 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.
EinstellungBeschriftung.aktualisiere (cognitive 19) CircuitDrawing/Einstellungen/EinstellungBeschriftung.vb:76— EinstellungBeschriftung.aktualisiere 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.
Precompiled_IF.compile (cognitive 19) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Verzweigung/Precompiled_IF.vb:61— Precompiled_IF.compile 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_Vektorgrafik.AusZwischenablageToolStripMenuItem1_Click (cognitive 19) CircuitDrawing/Form_Vektorgrafik.vb:616— Form_Vektorgrafik.AusZwischenablageToolStripMenuItem1_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.
XTextFormatterEx2.CreateBlocks (cognitive 19) CircuitDrawing/Grafikelemente/XTextFormatterEx2.vb:312— XTextFormatterEx2.CreateBlocks 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.
WindowRenderer.rechtsVisibleChanged (cognitive 19) WindowRenderer/WindowRenderer.vb:110— WindowRenderer.rechtsVisibleChanged has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (WindowRenderer.linksVisibleChanged) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
WindowRenderer.linksVisibleChanged (cognitive 19) WindowRenderer/WindowRenderer.vb:142— WindowRenderer.linksVisibleChanged has cognitive complexity 19 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function. This shape REPEATS in the file: one other method here (WindowRenderer.rechtsVisibleChanged) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
ToolDrawBezierFreihand.MouseUp (cognitive 18) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:75— ToolDrawBezierFreihand.MouseUp 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.
SkillDetectSchematic.is_unconnected (cognitive 18) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1161— SkillDetectSchematic.is_unconnected 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.
SnapableCurrentArrow.setEinstellungen (cognitive 18) CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb:236— SnapableCurrentArrow.setEinstellungen 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.
Mathe.approxNextPointToZeroBezierKurveRekursiv (cognitive 18) CircuitDrawing/Mathe.vb:573— Mathe.approxNextPointToZeroBezierKurveRekursiv 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.
Vektor_Picturebox.darfSelektieren (cognitive 18) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:865— Vektor_Picturebox.darfSelektieren 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.
Vektor_Picturebox.bewerteRouting (cognitive 18) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2029— Vektor_Picturebox.bewerteRouting 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.
Vektor_Picturebox.schneidenSichWires (cognitive 18) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2875— Vektor_Picturebox.schneidenSichWires 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.
Vektor_Picturebox.delete_selected (cognitive 18) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3991— Vektor_Picturebox.delete_selected 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.
UserDrawListbox.OnMouseUp (cognitive 18) CircuitDrawing/Steuerelemente/UserDrawListbox.vb:346— UserDrawListbox.OnMouseUp 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.
DockStack.OnFensterOver (cognitive 18) WindowRenderer/DockStack.vb:106— DockStack.OnFensterOver 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.
DockStack.TabMovingComplete (cognitive 18) WindowRenderer/DockStack.vb:186— DockStack.TabMovingComplete 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.
ToolDrawLine.MouseUp (cognitive 17) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:62— ToolDrawLine.MouseUp has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Ausdruck_KleinerGrößer.AusrechnenSoweitMöglich (cognitive 17) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößer.vb:15— Ausdruck_KleinerGrößer.AusrechnenSoweitMöglich has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Ausdruck_KleinerGrößerGleich.AusrechnenSoweitMöglich (cognitive 17) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößerGleich.vb:15— Ausdruck_KleinerGrößerGleich.AusrechnenSoweitMöglich has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Routing_v2.MarkAllShorts (cognitive 17) CircuitDrawing/SkillDetect/Routing_v2.vb:115— Routing_v2.MarkAllShorts has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Element_Textfeld.setEinstellungen (cognitive 17) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Textfeld.vb:96— Element_Textfeld.setEinstellungen has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Multi_Lang_String.lese_option (cognitive 17) CircuitDrawing/TemplateAusDatei/Multi_Lang_String.vb:46— Multi_Lang_String.lese_option has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
BauteilAusDatei.getEinstellungen (cognitive 17) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:539— BauteilAusDatei.getEinstellungen has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
TemplateAusDatei.leseScalingStart (cognitive 17) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1755— TemplateAusDatei.leseScalingStart has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
TemplateAusDatei.leseInfo (cognitive 17) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1925— TemplateAusDatei.leseInfo has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
TemplateAusDatei.leseCompatibilit (cognitive 17) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1966— TemplateAusDatei.leseCompatibilit has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
TemplateAusDatei.readForDefinition (cognitive 17) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2036— TemplateAusDatei.readForDefinition has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Intelisense.changeLine (cognitive 17) CircuitDrawing/Steuerelemente/Intelisense.vb:117— Intelisense.changeLine has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
TabElement.Insert (cognitive 17) WindowRenderer/TabElement.vb:609— TabElement.Insert has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Window.Show (cognitive 17) WindowRenderer/Window.vb:103— Window.Show has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
ToolPlace.KeyDown (cognitive 16) CircuitDrawing/Anzeige/Tools/ToolPlace.vb:268— ToolPlace.KeyDown 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.
Einstellung_Fontstyle.aktualisiere (cognitive 16) CircuitDrawing/Einstellungen/Einstellung_Fontstyle.vb:55— Einstellung_Fontstyle.aktualisiere 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.
Element_RoundRect.setEinstellungen (cognitive 16) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_RoundRect.vb:80— Element_RoundRect.setEinstellungen 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.
Basic_Bezier.setEinstellungen (cognitive 16) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:233— Basic_Bezier.setEinstellungen 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.
Basic_Linie.setEinstellungen (cognitive 16) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:190— Basic_Linie.setEinstellungen 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.
Einstellung_Pfeilspitze.aktualisiere (cognitive 16) CircuitDrawing/Einstellungen/Einstellung_Pfeilspitze.vb:45— Einstellung_Pfeilspitze.aktualisiere 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.
TemplateAusDatei.leseSnap_intern (cognitive 16) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1850— TemplateAusDatei.leseSnap_intern 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.
Wire.setEinstellungen (cognitive 16) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:472— Wire.setEinstellungen 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.
WireLuftlinie.setEinstellungen (cognitive 16) CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:311— WireLuftlinie.setEinstellungen 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.
Vektor_Picturebox.setEinstellungenSelected (cognitive 16) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:402— Vektor_Picturebox.setEinstellungenSelected 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.
Vektor_Picturebox.sucheNextSnapPoint (cognitive 16) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1691— Vektor_Picturebox.sucheNextSnapPoint 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.
Vektor_Picturebox.Selected_Elemente_to_fore_back (cognitive 16) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3033— Vektor_Picturebox.Selected_Elemente_to_fore_back 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.
VirtualWindowRenderer.ladeAnordnung (cognitive 16) WindowRenderer/VirtualWindowRenderer/VirtualWindowRenderer.vb:250— VirtualWindowRenderer.ladeAnordnung 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.
D4 · Code Duplication· Near-duplicate member family (4 members, 36 shared lines) · ×1
Near-duplicate member family (4 members, 36 shared lines) CircuitDrawing/Mathe.vb:625— CircuitDrawing/Mathe.vb:625-719 | CircuitDrawing/Mathe.vb:723-816 | CircuitDrawing/Mathe.vb:820-868 | CircuitDrawing/Mathe.vb:872-920 — These 4 members are variants of one another: a block of 36 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Near-duplicate member pair (133 shared lines) CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:88— CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:88-245 | CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:297-495 — These two members are variants of one another: 133 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (48 shared lines) CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:281— CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:281-350 | CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:580-688 — These two members are variants of one another: 48 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (19 shared lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2454— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2454-2529 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2750-2827 — These two members are variants of one another: 19 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (21 corresponding lines) · ×1
Edited copy of a member (21 corresponding lines) CircuitDrawing/Steuerelemente/PfeilCombobox.vb:39— CircuitDrawing/Steuerelemente/PfeilCombobox.vb:39-63 | CircuitDrawing/Steuerelemente/PfeilCombobox.vb:68-101 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (13 corresponding lines) · ×1
Edited copy of a member (13 corresponding lines) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb:164— CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb:164-176 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:134-146 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (7 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (7 members, 50+ identical tokens) CircuitDrawing/Einstellungen/ElementEinstellung.vb:61— CircuitDrawing/Einstellungen/ElementEinstellung.vb:61-78 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:82-99 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:103-130 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:150-170 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:174-186 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:190-213 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:217-240 — These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) CircuitDrawing/Grafikelemente/DO_Arc.vb:235— CircuitDrawing/Grafikelemente/DO_Arc.vb:235-294 | CircuitDrawing/Grafikelemente/DO_Ellipse.vb:86-106 | CircuitDrawing/Grafikelemente/DO_Polygon.vb:154-186 | CircuitDrawing/Grafikelemente/DO_Rechteck.vb:95-117 | CircuitDrawing/Grafikelemente/DO_RoundRect.vb:77-136 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Duplicated block (85 lines × 2) CircuitDrawing/Grafikelemente/DO_Text.vb:83— CircuitDrawing/Grafikelemente/DO_Text.vb:83-167 | CircuitDrawing/Grafikelemente/DO_Text.vb:234-318 — 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 (55 lines × 2) CircuitDrawing/AdvancedTextRenderer.vb:779— CircuitDrawing/AdvancedTextRenderer.vb:779-833 | CircuitDrawing/AdvancedTextRenderer.vb:837-891 — 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 (42 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4366— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4366-4407 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4414-4455 — 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 (37 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4463— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4463-4499 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4508-4544 — 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 (35–36 lines × 2) CircuitDrawing/Mathe.vb:674— CircuitDrawing/Mathe.vb:674-709 | CircuitDrawing/Mathe.vb:772-806 — 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 (33–34 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5360— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5360-5393 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5398-5430 — 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 (27 lines × 3) CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:100— CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:100-126 | CircuitDrawing/Einstellungen/Einstellung_Fontstyle.vb:198-224 | CircuitDrawing/Einstellungen/Einstellung_Linienstil.vb:205-231 — before extracting anything, compare `CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb` and `CircuitDrawing/Einstellungen/Einstellung_Fontstyle.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (20–27 lines × 2) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1334— CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1334-1360 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1386-1405 — 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 (23–24 lines × 2) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1878— CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1878-1900 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1907-1930 — 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 (24 lines × 2) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:473— CircuitDrawing/Elemente/CircuitElemente/Wire.vb:473-496 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:312-335 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/Wire.vb` and `CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (23 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:126— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:126-148 | CircuitDrawing/Elemente/CircuitElemente/Blackbox.vb:114-136 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (21 lines × 3) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:234— CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:234-254 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:191-211 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Spannungspfeil.vb:262-282 — before extracting anything, compare `CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb` and `CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (18–21 lines × 2) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:75— CircuitDrawing/Elemente/CircuitElemente/Wire.vb:75-95 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:73-90 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/Wire.vb` and `CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 146 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (21 lines × 2) CircuitDrawing/Steuerelemente/PfeilCombobox.vb:43— CircuitDrawing/Steuerelemente/PfeilCombobox.vb:43-63 | CircuitDrawing/Steuerelemente/PfeilCombobox.vb:80-100 — 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–18 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5074— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5074-5091 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5129-5142 — 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 (17 lines × 2) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:95— CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:95-111 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:95-111 — before extracting anything, compare `CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb` and `CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 3) CircuitDrawing/Grafikelemente/ExportDrawArgs/LineStyleList.vb:403— CircuitDrawing/Grafikelemente/ExportDrawArgs/LineStyleList.vb:403-418 | CircuitDrawing/Grafikelemente/ExportDrawArgs/LineStyleList.vb:421-436 | CircuitDrawing/Grafikelemente/ExportDrawArgs/LineStyleList.vb:439-454 — 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 (16 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:594— CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:594-609 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:290-305 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 229 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15–16 lines × 2) CircuitDrawing/Elemente/SnapableElement.vb:216— CircuitDrawing/Elemente/SnapableElement.vb:216-231 | CircuitDrawing/Elemente/SnapableElement.vb:232-246 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `CircuitDrawing/Elemente/SnapableElement.vb:231` calls `setzeVerschobenenMittelpunktAufWireSoDassEsMöglichstGutPasst` and `CircuitDrawing/Elemente/SnapableElement.vb:214` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (15 lines × 4) CircuitDrawing/Mathe.vb:629— CircuitDrawing/Mathe.vb:629-643 | CircuitDrawing/Mathe.vb:727-741 | CircuitDrawing/Mathe.vb:824-838 | CircuitDrawing/Mathe.vb:876-890 — 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 (15 lines × 3) CircuitDrawing/Rückgängig/RückgängigFillStyles.vb:38— CircuitDrawing/Rückgängig/RückgängigFillStyles.vb:38-52 | CircuitDrawing/Rückgängig/RückgängigFontStyle.vb:38-52 | CircuitDrawing/Rückgängig/RückgängigLineStyle.vb:38-52 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (14 lines × 5) CircuitDrawing/Grafikelemente/DO_Arc.vb:281— CircuitDrawing/Grafikelemente/DO_Arc.vb:281-294 | CircuitDrawing/Grafikelemente/DO_Ellipse.vb:93-106 | CircuitDrawing/Grafikelemente/DO_Polygon.vb:173-186 | CircuitDrawing/Grafikelemente/DO_Rechteck.vb:103-116 | CircuitDrawing/Grafikelemente/DO_RoundRect.vb:122-135 — before extracting anything, compare `CircuitDrawing/Grafikelemente/DO_Rechteck.vb` and `CircuitDrawing/Grafikelemente/DO_RoundRect.vb` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (13–14 lines × 2) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_BasicRectBased.vb:64— CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_BasicRectBased.vb:64-77 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:32-44 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12 lines × 4) WindowRenderer/DockStack.vb:334— WindowRenderer/DockStack.vb:334-345 | WindowRenderer/DockStack.vb:366-377 | WindowRenderer/DockStack.vb:419-430 | WindowRenderer/DockStack.vb:454-465 — 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 (11–12 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2131— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2131-2141 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2186-2197 — 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–11 lines × 2) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2276— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2276-2285 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2299-2309 — 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 (9–10 lines × 2) WindowRenderer/DesignStyle.vb:634— WindowRenderer/DesignStyle.vb:634-643 | WindowRenderer/DesignStyle.vb:784-792 — 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 × 7) CircuitDrawing/Einstellungen/ElementEinstellung.vb:67— CircuitDrawing/Einstellungen/ElementEinstellung.vb:67-74 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:88-95 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:118-125 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:156-163 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:179-186 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:195-202 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:222-229 — all 7 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `CircuitDrawing/Einstellungen/ElementEinstellung.vb:129` calls `addEinstellungLiveChangedEvent` and `CircuitDrawing/Einstellungen/ElementEinstellung.vb:78` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 4) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1641— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1641-1648 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1673-1680 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1681-1688 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1689-1696 — 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 (7–8 lines × 2) CircuitDrawing/SkillDetect/Routing_v2.vb:486— CircuitDrawing/SkillDetect/Routing_v2.vb:486-492 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1624-1631 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 4) CircuitDrawing/Mathe.vb:713— CircuitDrawing/Mathe.vb:713-719 | CircuitDrawing/Mathe.vb:810-816 | CircuitDrawing/Mathe.vb:862-868 | CircuitDrawing/Mathe.vb:914-920 — 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 (6 lines × 3) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5099— CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5099-5104 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5117-5122 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5142-5147 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5104` calls `_GRID_BYTES_LARGE` and `CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5122` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (5–6 lines × 3) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1544— CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1544-1549 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1553-1558 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1562-1566 — 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) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Bezier.vb:12— CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Bezier.vb:12-16 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiLinie.vb:12-16 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Poly.vb:16-20 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (3–5 lines × 3) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:343— CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:343-347 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:348-352 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb:357-359 — 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 (4–5 lines × 3) CircuitDrawing/Elemente/CircuitElemente/ElementLinestyle.vb:26— CircuitDrawing/Elemente/CircuitElemente/ElementLinestyle.vb:26-29 | CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb:237-241 | CircuitDrawing/Elemente/SnapableElemente/SnapableImpedanceArrow.vb:173-177 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. 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.
Off the main sequence: WindowRenderer — WindowRenderer: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Documentation: no usage examples README.md— The First steps guide describes component placement, shortcuts, and settings but does not show any runnable code or an example of running the tool. Add a short Usage section with a minimal runnable snippet showing how to place a resistor and run CircuitDrawing.exe.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `CircuitDrawing` (41376 LoC, 371 public types across 2 namespaces). Review these for cohesion — split a project that spans unrelated responsibilities.
No tests found — No test suite could be collected — no discoverable tests to count. If this repository does test, wiring the suite to a framework a runner can collect (xUnit, NUnit or MSTest) is what makes it countable here; a pipeline step that invokes a runner is not evidence on its own, because a runner over an empty suite passes. Tests written as plain executables or shell/PowerShell harnesses are not collectible this way and are not scored here.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M2 · Architecture documentation· No architecture diagram/doc · ×1
No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
No SAST — No static application security testing detected. For this repository's stack, add a Roslyn security analyzer package referenced from the project (the analyzer packages do analyse VB.NET), plus gitleaks for committed secrets — CodeQL has no VB.NET extractor, so its csharp pack would extract nothing from this tree and then report it clean — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
No changelog — 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.)
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.
nuget: not applicable — nuget: `dotnet list package --vulnerable` could not read this solution's dependency graph — it reported an error for at least one project and returned no package data at all (typically a packages.config / non-PackageReference project, which the command cannot read). An unreadable dependency graph is not a clean one; migrate the project(s) to PackageReference to enable this scan
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
provenance: not applicable — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); 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.
none (no readable dependency manifest): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
0
—
Run 01a0f7e9-2fdd-7795-bc2e-a7f5dc655918 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 3 · Warnings: 593 · Recommendations: 9 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 01-10-2026 @ 14:40 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.