Public report of SimonGit0/circuit-drawing, published 15 November 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey → Signed and filed in the standard's public register, 15 November 2026, 03:05 UTC · Survey ID cd_7cbadaa5f2654f16a38e0da6567f64ad

SimonGit0/circuit-drawing

Measured 15 November 2026, 03:04 UTC, at code version f9fd550

Boundary Type-Coupling is not measured: Bounded contexts not declared.

CAI score 42out of 100 Provisional Up 1 since the last survey

The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.

A medium codebase: 46,226 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 0.3 person-years · Weakest lens: Production Readiness, 20

Findings by how serious they are

3 critical 716 serious 6 minor

44 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
15 November 2026, 03:04 UTC

A measurement, not a certificate. The Code Assurance Index records a number together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that implements it, and today the Canine Code Analyzer is the only one that does.

The code didn't build, so the score is provisional
We couldn't build the code: the build stopped with 1 error. The dimensions that need a working build, such as complexity, duplication and dead code, were measured on an incomplete picture of the code, so their grades and the score are provisional. Fix the build errors and run the survey again for a final score. The first errors: BC2001: file 'CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_ToIntHex.vb' could not be found

The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

29of 29 dimensions measured by tools.
717of 725 findings point to an exact file and line, so you can open each one in the code. The other 8 concern the repository as a whole, such as missing documentation.
29dimensions across 5 lenses, read from 46,226 lines of product code in 2 projects.
Chapters

Executive summary

SimonGit0/circuit-drawing has a provisional result, because the code didn't build. Its score is held back because the project has no automated tests and we found no working pipeline that builds or tests changes to the code. It scores 42 out of 100, and the ratings may change once the code builds. None of its three critical findings concern security.

Production Readiness, at 20, is the weakest lens and counts most in the score. The best first step for the work it takes is recording design decisions, worth about 7 points. Adding automated tests would lift Production Readiness itself, worth about 21 points. Raising Production Readiness to 70 would lift the score to about 61.

The project has no automated tests, so a change can break it without warning. Two errors are caught and ignored, so failures can go unnoticed. Adding automated tests and handling or logging the ignored errors would close both risks.

The product code is 46,226 lines, about €42,000 to rebuild.

A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.

How the score is built: what each lens counts for The lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Production Readiness 20 · counts for 47%Maturity 50 · counts for 26%Code Health 66 · counts for 14%Architecture 68 · counts for 8%Security and Compliance 100 · counts for 4%

If Production Readiness rose from 20 to 70, the lowest score rated Strong, the score would rise from 42 to about 61.

Code composition: what the lines of code are
Product code 100%
New since the last survey: 132 findings

These 132 critical or serious findings weren't in the previous survey, on 29 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.

  • Code Duplication · Near-duplicate member family (4 members, 34 shared lines) CircuitDrawing/Mathe.vb
  • Code Duplication · Near-duplicate member pair (131 shared lines) CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb
  • Code Duplication · Edited copy of a member (78 corresponding lines) WindowRenderer/DesignStyle.vb
  • Code Duplication · Edited copy of a member (105 corresponding lines) CircuitDrawing/Grafikelemente/DO_Text.vb
  • Code Duplication · Edited copy of a member (96 corresponding lines) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb
  • Code Duplication · Edited copy of a member (49 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Wire.vb
  • Code Duplication · Edited copy of a member (42 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Wire.vb
  • Code Duplication · Edited copy of a member (34 corresponding lines) CircuitDrawing/AdvancedTextRenderer.vb
  • Code Duplication · Edited copy of a member (28 corresponding lines) CircuitDrawing/Grafikelemente/DO_Arc.vb
  • Code Duplication · Edited copy of a member (27 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb
  • Code Duplication · Edited copy of a member (55 corresponding lines) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb
  • Code Duplication · Edited copy of a member (18 corresponding lines) CircuitDrawing/Mathe.vb
  • Code Duplication · Edited copy of a member (40 corresponding lines) CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb
  • Code Duplication · Edited copy of a member (47 corresponding lines) CircuitDrawing/Elemente/ElementGruppe.vb
  • Code Duplication · Edited copy of a member (19 corresponding lines) CircuitDrawing/AdvancedTextRenderer.vb
  • Code Duplication · Edited copy of a member (29 corresponding lines) WindowRenderer/WindowRenderer.vb
  • Code Duplication · Edited copy of a member (31 corresponding lines) CircuitDrawing/AdvancedTextRenderer.vb
  • Code Duplication · Edited copies of one member (3 members, 31+ corresponding lines) CircuitDrawing/AdvancedTextRenderer.vb
  • Code Duplication · Edited copies of one member (3 members, 18+ corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb
  • Code Duplication · Edited copy of a member (30 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Blackbox.vb
  • Code Duplication · Edited copy of a member (32 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb
  • Code Duplication · Edited copy of a member (27 corresponding lines) WindowRenderer/WindowRenderer.vb
  • Code Duplication · Edited copy of a member (14 corresponding lines) CircuitDrawing/Steuerelemente/DashStyleCombobox.vb
  • Code Duplication · Edited copies of one member (3 members, 24+ corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Spannungspfeil.vb
  • Code Duplication · Edited copy of a member (11 corresponding lines) CircuitDrawing/Mathe.vb
  • Code Duplication · Edited copy of a member (35 corresponding lines) CircuitDrawing/Mathe.vb
  • Code Duplication · Edited copy of a member (21 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb
  • Code Duplication · Edited copies of one member (3 members, 4+ corresponding lines) CircuitDrawing/Elemente/Element.vb
  • Code Duplication · Edited copy of a member (17 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Graph.vb
  • Code Duplication · Edited copy of a member (29 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb
  • Code Duplication · Edited copy of a member (18 corresponding lines) CircuitDrawing/Steuerelemente/UserDrawListbox.vb
  • Code Duplication · Edited copy of a member (16 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Arc.vb
  • Code Duplication · Edited copy of a member (11 corresponding lines) CircuitDrawing/Elemente/SnapableElement.vb
  • Code Duplication · Edited copy of a member (22 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößer.vb
  • Code Duplication · Edited copy of a member (24 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb
  • Code Duplication · Edited copy of a member (12 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb
  • Code Duplication · Edited copy of a member (17 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Ellipse.vb
  • Code Duplication · Edited copy of a member (7 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Wire.vb
  • Code Duplication · Edited copy of a member (10 corresponding lines) CircuitDrawing/Mathe.vb
  • Code Duplication · Edited copy of a member (14 corresponding lines) CircuitDrawing/Grafikelemente/DO_MultiLinie.vb
  • Code Duplication · Edited copy of a member (25 corresponding lines) WindowRenderer/VirtualWindowRenderer/MultiPerspektivenManager.vb
  • Code Duplication · Edited copies of one member (4 members, 11+ corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb
  • Code Duplication · Edited copy of a member (14 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck.vb
  • Code Duplication · Edited copy of a member (14 corresponding lines) CircuitDrawing/Grafikelemente/DO_Polygon.vb
  • Code Duplication · Edited copy of a member (8 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb
  • Code Duplication · Edited copy of a member (14 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Wire.vb
  • Code Duplication · Edited copy of a member (16 corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb
  • Code Duplication · Edited copy of a member (12 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb
  • Code Duplication · Edited copy of a member (19 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolAddSnappoint.vb
  • Code Duplication · Edited copy of a member (13 corresponding lines) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb
  • Code Duplication · Edited copy of a member (13 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Ellipse.vb
  • Code Duplication · Edited copy of a member (14 corresponding lines) CircuitDrawing/Grafikelemente/DO_Bezier.vb
  • Code Duplication · Edited copy of a member (14 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb
  • Code Duplication · Edited copy of a member (12 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb
  • Code Duplication · Edited copy of a member (6 corresponding lines) CircuitDrawing/SkillDetect/Routing_v2.vb
  • Code Duplication · Edited copy of a member (11 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb
  • Code Duplication · Edited copy of a member (18 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_ODER.vb
  • Code Duplication · Edited copy of a member (5 corresponding lines) CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddCurrentArrow.vb
  • Code Duplication · Edited copy of a member (7 corresponding lines) CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Arrow.vb
  • Code Duplication · Edited copy of a member (16 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_ToInt.vb
  • Code Duplication · Edited copy of a member (16 corresponding lines) CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb
  • Code Duplication · Edited copy of a member (15 corresponding lines) CircuitDrawing/FRM_ImgSizeSelection.vb
  • Code Duplication · Edited copy of a member (4 corresponding lines) CircuitDrawing/Grafikelemente/DO_Dot.vb
  • Code Duplication · Edited copy of a member (13 corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb
  • Code Duplication · Edited copies of one member (3 members, 15+ corresponding lines) CircuitDrawing/Grafikelemente/ExportDrawArgs/FillStyleList.vb
  • Code Duplication · Edited copy of a member (17 corresponding lines) WindowRenderer/Maus.vb
  • Code Duplication · Edited copy of a member (7 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolPlace.vb
  • Code Duplication · Edited copy of a member (8 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb
  • Code Duplication · Edited copy of a member (8 corresponding lines) CircuitDrawing/Grafikelemente/DO_Ellipse.vb
  • Code Duplication · Edited copy of a member (12 corresponding lines) CircuitDrawing/WR_Fenster/WR_BauelementeAuswahl.vb
  • Code Duplication · Edited copy of a member (9 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb
  • Code Duplication · Edited copies of one member (4 members, 16+ corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb
  • Code Duplication · Edited copy of a member (9 corresponding lines) CircuitDrawing/Steuerelemente/PfeilCombobox.vb
  • Code Duplication · Edited copy of a member (17 corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb
  • Code Duplication · Edited copy of a member (11 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb
  • Code Duplication · Edited copy of a member (4 corresponding lines) CircuitDrawing/Steuerelemente/UserDrawListbox.vb
  • Code Duplication · Edited copies of one member (3 members, 5+ corresponding lines) CircuitDrawing/Anzeige/Tools/ToolCopy.vb
  • Code Duplication · Edited copies of one member (3 members, 16+ corresponding lines) CircuitDrawing/Grafikelemente/ExportDrawArgs/FillStyleList.vb
  • Code Duplication · Edited copy of a member (11 corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb
  • Code Duplication · Edited copies of one member (4 members, 12+ corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiGrafik.vb
  • Code Duplication · Edited copy of a member (12 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolAddSnappoint.vb
  • Code Duplication · Edited copy of a member (12 corresponding lines) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb
  • Code Duplication · Edited copy of a member (3 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolRechteckMarkierung.vb
  • Code Duplication · Edited copies of one member (4 members, 14+ corresponding lines) CircuitDrawing/Einstellungen/EinstellungStrompfeilArt.vb
  • Code Duplication · Edited copies of one member (4 members, 10+ corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Rect.vb
  • Code Duplication · Edited copy of a member (8 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb
  • Code Duplication · Edited copy of a member (11 corresponding lines) CircuitDrawing/AdvancedTextRenderer.vb
  • Code Duplication · Edited copy of a member (5 corresponding lines) CircuitDrawing/Anzeige/CopyClipboard.vb
  • Code Duplication · Edited copy of a member (16 corresponding lines) CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Int.vb
  • Code Duplication · Edited copy of a member (8 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb
  • Code Duplication · Edited copy of a member (6 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Rect.vb
  • Code Duplication · Edited copy of a member (19 corresponding lines) CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb
  • Code Duplication · Edited copy of a member (5 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb
  • Code Duplication · Edited copy of a member (5 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Linie.vb
  • Code Duplication · Edited copy of a member (8 corresponding lines) CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddSnapableElement.vb
  • Code Duplication · Edited copy of a member (8 corresponding lines) CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb
  • Code Duplication · Edited copies of one member (3 members, 6+ corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Bezier.vb
  • Code Duplication · Edited copy of a member (10 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_GleichString.vb
  • Code Duplication · Edited copies of one member (3 members, 11+ corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_GleichString.vb
  • Code Duplication · Edited copy of a member (5 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiGrafik.vb

We compare every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.

Fixed since the last survey: 6 findings

These 6 critical or serious findings were in the previous survey, on 29 October 2026, and are gone from this one.

  • Code Duplication · Near-duplicate member family (4 members, 34 shared lines) CircuitDrawing/Mathe.vb
  • Code Duplication · Near-duplicate member pair (129 shared lines) CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb
  • Code Duplication · Duplicated block (20 lines × 2) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb
  • Code Duplication · Duplicated block (15 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb
  • Code Duplication · Duplicated block (11 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb
  • Code Duplication · Duplicated block (7 lines × 4) CircuitDrawing/Mathe.vb
Rebuild cost: about €42,000 · Estimate
Cost to rebuild€14,000 to €69,000, for 230 to 731 hours of work, about 0.3 person-years for one engineer
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 42. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 46,226 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with CircuitDrawing.vbproj.
Raises the score by about 7 points · Low effort · ADR Quality
2
Resolve the 1 No automated tests finding(s) in Code Coverage.
Raises the score by about 21 points · High effort · Code Coverage
3
Add a CI workflow that builds and runs the test suite on every push/PR.
Raises the score by about 7 points · Medium effort · CI/CD gates

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

If you do one thing first · First action
Fix the build. The code didn't build, so the dimensions that need a working build were measured on an incomplete picture of the code, and every grade in this report is provisional. Once the build works, the next survey gives a final score. The compiler's first errors: BC2001: file 'CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_ToIntHex.vb' could not be found
Based on: Solution Shape
Where the investment is most exposed · Value at risk
This code would cost about €42,000 to build again, about 0.3 person-years of work. Its weakest lens is Production Readiness, at 20 (Critical). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 4.9 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 8% to 18% on every change. The history of the code shows how much it changes: about 593 lines over the last 90 days, which is about 2,405 lines a year. At that pace, the extra work comes to an estimated 0.5 to 2.8 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.

arch CircuitDrawing CircuitDrawing WindowRenderer WindowRenderer CircuitDrawing->WindowRenderer

Architecture: which parts of the code depend on which

The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.

6 modules, with 3 dependencies between them. One loop runs through 2 of the modules, marked above the diagonal.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 CircuitDrawing.My2 Microsoft.VisualBasic3 WindowRenderer4 WindowRenderer.My5 CircuitDrawing.Detektion6 CircuitDrawing
1 CircuitDrawing.My
2 Microsoft.VisualBasic
3 WindowRenderer
4 WindowRenderer.My
5 CircuitDrawing.Detektion17
6 CircuitDrawing36
Uses a module listed above itPart of a loopThe module itself
1 CircuitDrawing.My2 Microsoft.VisualBasic3 WindowRenderer4 WindowRenderer.My5 CircuitDrawing.Detektion6 CircuitDrawingCircuitDrawing.My1Microsoft.VisualBasic2WindowRenderer3WindowRenderer.My4CircuitDrawing.Detektion5CircuitDrawing61736

At a glance — Code Health · 66% · Adequate · gated by D2, D4, D18 ·

At a glance — Architecture · 68% · Adequate · gated by D26, AX5 ·

At a glance — Maturity · 50% · Adequate · gated by M2 ·

At a glance — Readiness · 20% · Critical · gated by D8, P1, P3 ·

At a glance — Security · 100% · Checked 2 of 9 ·

Roadmap

Top priorities: Resolve the 1 No automated tests finding(s) in Code Coverage; Resolve the 1 No ADRs found finding(s) in ADR Quality — start with CircuitDrawing.vbproj; Add a CI workflow that builds and runs the test suite on every push/PR.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do thisHelpsEffortDimension
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with CircuitDrawing.vbproj.+6.9 ptsLowADR Quality
Resolve the 1 No automated tests finding(s) in Code Coverage.+21.1 ptsHighCode Coverage
Add a CI workflow that builds and runs the test suite on every push/PR.+6.6 ptsMediumCI/CD gates
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+5.6 ptsMediumArchitecture documentation
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with CircuitDrawing.vbproj.+1.8 ptsLowProject Cohesion
Resolve the 2 EmptyCatchBlock finding(s) in Explicit Debt — start with Einstellung_TemplateParameterString.vb, Form_Vektorgrafik.vb.+1.6 ptsLowExplicit Debt
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.+2.6 ptsMediumRelease Hygiene
Resolve the 1 Build failed finding(s) in Solution Shape.+1.2 ptsLowSolution Shape

File quality

Per-file score 0–10 — a quality signature. Of 124 files carrying findings, judged against the Production bar: 0% slop · 72% mixed · 28% near-clean.

FileScoreBandWorst signal
CircuitDrawing/Form_Vektorgrafik.vb4.6MixedExplicit Debt: EmptyCatchBlock
CircuitDrawing/Anzeige/Vektor_Picturebox.vb5.5MixedCyclomatic Complexity: Vektor_Picturebox.mitVerschiebenWire (cyclomatic 87)
CircuitDrawing/SkillDetect/SkillDetectSchematic.vb5.5MixedCyclomatic Complexity: SkillDetectSchematic.leseInst (cyclomatic 40)
CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb5.5MixedCognitive Complexity: ToolDrawWire.OnDraw (cognitive 28)
CircuitDrawing/Anzeige/Tools/ToolCopy.vb5.5MixedCyclomatic Complexity: ToolCopy.KeyDown (cyclomatic 21)
CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezierFreihand.vb5.6MixedCyclomatic Complexity: ToolDrawBezierFreihand.berechneBezierBasisAlgo2 (cyclomatic 19)
CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb5.6MixedCyclomatic Complexity: ToolDrawBezier.OnDraw (cyclomatic 18)
CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb5.6MixedCognitive Complexity: ToolDrawLine.KeyDown (cognitive 32)
CircuitDrawing/Grafikelemente/XTextFormatterEx2.vb6.0MixedExplicit Debt: HackComment
CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameterString.vb6.1MixedExplicit Debt: EmptyCatchBlock
CircuitDrawing/Anzeige/Tools/ToolAddSnappoint.vb6.3MixedCode Duplication: Edited copy of a member (19 corresponding lines)
CircuitDrawing/Anzeige/Tools/ToolRechteckMarkierung.vb6.3MixedCode Duplication: Edited copy of a member (3 corresponding lines)
CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb7.0MixedCyclomatic Complexity: TemplateAusDatei.readIDLE (cyclomatic 185)
CircuitDrawing/AdvancedTextRenderer.vb7.0MixedCyclomatic Complexity: AdvancedTextRenderer.leseStr (cyclomatic 72)
CircuitDrawing/Elemente/CircuitElemente/Wire.vb7.0MixedCyclomatic Complexity: Wire.AddIfPossible (cyclomatic 63)
CircuitDrawing/Ausdruck/Ausdruck.vb7.0MixedCyclomatic Complexity: Ausdruck.auswertenFunktion (cyclomatic 58)
WindowRenderer/WindowRenderer.vb7.0MixedCyclomatic Complexity: WindowRenderer.LocationFensterChanged (cyclomatic 57)
CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb7.0MixedCyclomatic Complexity: BauteilAusDatei.Einlesen (cyclomatic 54)
CircuitDrawing/SkillDetect/Routing_v2.vb7.0MixedCyclomatic Complexity: Routing_v2.solveShort (cyclomatic 40)
WindowRenderer/DockStack.vb7.0MixedCyclomatic Complexity: DockStack.RerangeLayout (cyclomatic 40)

How the grades work

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 — 716

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 — 6

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 44

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

This survey 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. All 29 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.

Every figure here is one of two 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. 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.

What we checked — 29 dimensions across the health lenses
D1D2D3D4D5D6D8D13D15D17D18D20D26D27D28D29D35AX10AX3AX4AX5GD1M1M2M3P1P2P3P6

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
  1. 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, 717 of 725 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.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. 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.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Canine Code Analyzer duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic

Every finding is locatable in findings.md. Run 01a1dd2a-49ba-7402-8df8-6df67dca3ed4.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

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.

  • D12 Dependency Hygiene — not measured this run — We 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. `dotnet list package` did not return usable output (restore or query failed); no outdated/vulnerable/deprecated data to assess. The tool said: `dotnet list package` exited 1 with no output.
  • D14 License Compliance — not measured this run — We 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.
  • D21 Naming Consistency — not measured this run — We 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. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
  • 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.
  • D23 Boundary Type-Coupling — not measured this run — We 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. Large codebase (46,226 production LoC in the .NET projects) with no declared bounded contexts — cross-boundary type coupling is unassessed Bounded contexts cannot be inferred from a codebase that is not physically organised by them (D-321), so with none declared there are no boundaries for the coupling pass to measure across. You can widen what we reach: name this codebase's bounded contexts (≥2 module groups, e.g. per subsystem) so cross-boundary type coupling can 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 — not measured this run — We 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. D24 compares a comment's words with the identifiers, literals and constructs of the code it annotates, using English function-word and rationale lexicons. Comments in another script or language were left unread rather than counted as clean.
  • 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.
  • D44 Platform End-of-Life — not measured this run — We 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.
  • AX6 Interface segregation — not measured this run — We 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's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • C1 Data Protection — not measured this run — We 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 — We 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 — We 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 — We 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 — We 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 — We 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.
  • 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.
  • PF3 Async & latency hygiene — not measured this run — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X29 Per-element action decided by a fixed element — not measured this run — We 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 — We 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 — We 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 — We 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 — We 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 — We 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 — We 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, Rust, Swift, Erlang, Elixir and Dart 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 — We 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, Kotlin, Scala, PHP, Ruby, Swift and Dart syntax only, and no C#, Python, TypeScript/JavaScript, Rust, Go, Java, Kotlin, Scala, PHP, Ruby, Swift or Dart 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

We assess the repository exactly as committed, and only the repository. By design we do 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 our 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.
  • 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.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • 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.
  • 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.

Dimensions

D1 · Cyclomatic Complexity4.4 / 10Weak✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 4.4 / 10 · rule-coverage 100% · ceiling Prevented

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.

TemplateAusDatei.readIDLE (cyclomatic 185)CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:706
TemplateAusDatei.leseGrafik (cyclomatic 137)CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1374
Vektor_Picturebox.mitVerschiebenWire (cyclomatic 87)CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1111
AdvancedTextRenderer.leseStr (cyclomatic 72)CircuitDrawing/AdvancedTextRenderer.vb:143
Vektor_Picturebox.RoutingVerbessern_Wire (cyclomatic 68)CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2532

+ 100 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 2 bodies over 120 down to 120 or less in Cyclomatic Complexity — start with TemplateAusDatei.readIDLE (cyclomatic 185), TemplateAusDatei.leseGrafik (cyclomatic 137). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 2 together lifts Cyclomatic Complexity from 4.4 to about 5.1/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

D2 · Cognitive Complexity2.0 / 10Critical✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 2.0 / 10 · rule-coverage 100% · ceiling Prevented

236 method(s) exceeded the cognitive complexity threshold of 15; the worst was TemplateAusDatei.readIDLE at 413.

DrawString_HorizontalMode.calcBoundingBoxes (cognitive 25) · ×2CircuitDrawing/AdvancedTextRenderer.vb:778
TemplateAusDatei.readIDLE (cognitive 413)CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:706
TemplateAusDatei.leseGrafik (cognitive 207)CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1374
Vektor_Picturebox.simplifyWires (cognitive 207)CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5319
BauteilAusDatei.setEinstellungen (cognitive 201)CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:579

+ 230 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 41 bodies over 60 down to 60 or less in Cognitive Complexity — start with TemplateAusDatei.readIDLE (cognitive 413), TemplateAusDatei.leseGrafik (cognitive 207), Vektor_Picturebox.simplifyWires (cognitive 207). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 41 together lifts Cognitive Complexity from 2.0 to about 3.6/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

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.

Maturity: Documented → Verified → Prevented · effective 7.8 / 10 · rule-coverage 100% · ceiling Prevented

52 god class(es) detected.

MethodTooLong: WindowRenderer.LocationFensterChanged · ×24WindowRenderer/WindowRenderer.vb:532
FileTooLong: Anzeige/Vektor_Picturebox.vb · ×13CircuitDrawing/Anzeige/Vektor_Picturebox.vb
TooManyMethods: Vektor_Picturebox · ×8CircuitDrawing/Anzeige/Vektor_Picturebox.vb
ClassTooLong: AdvancedTextRenderer · ×7CircuitDrawing/AdvancedTextRenderer.vb

What to do

  1. 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).
  2. 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).
  3. 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).

Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.

D4 · Code Duplication3.7 / 10Weak✓ Tool-verified

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

Maturity: Documented → Verified → Prevented · effective 3.7 / 10 · rule-coverage 100% · ceiling Verified

166 duplicated block group(s) detected. 15.7 % of the production lines (7,235 of 46,226) are in a reported copy. A further 141 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.

Duplicated block (5 lines × 2) · ×23CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1477
Duplicated block (8 lines × 2) · ×17CircuitDrawing/Elemente/CircuitElemente/Wire.vb:60
Duplicated block (6 lines × 2) · ×13CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_BasicRectBased.vb:95
Edited copy of a member (7 corresponding lines) · ×11CircuitDrawing/Elemente/CircuitElemente/Wire.vb:226
Edited copy of a member (8 corresponding lines) · ×10CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:223

+ 123 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 23 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with TemplateAusDatei.vb (5), Vektor_Picturebox.vb (4), Mathe.vb (2). — One of this dimension's main actionable groups (23 warning-level).
  2. Resolve the 17 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with DO_MultiLinie.vb (3), Wire.vb (2), AdvancedTextRenderer.vb (2). — One of this dimension's main actionable groups (17 warning-level).
  3. Resolve the 13 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with Vektor_Picturebox.vb (3), TemplateAusDatei.vb (2), Element_BasicRectBased.vb. — One of this dimension's main actionable groups (13 warning-level).

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

D5 · Coupling10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

2 projects, 0 dependency cycle(s), 0 unstable depended-on project(s).

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)9.4 / 10Stronggated by 11 serious findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.4 / 10 · rule-coverage 100% · ceiling Verified

11 of 211 classes have LCOM4 above 3.

Low cohesion: ToolDrawWire (LCOM4 5) · ×11CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:1

What to do

  1. 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).

Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.

D8 · Code Coverage0.0 / 10Critical✓ Tool-verified

What it measures: How much of the code is actually exercised by tests.

Method: Coverage from the analyzer's own run of the suite, computed per-file with structured exclusions for generated, trivial, and glue code. A coverage report found in the repository is never read. When the suite can't be built/run in-image, 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.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Verified

No automated tests — no test code was found in this repository.

No automated tests

What to do

  1. Resolve the 1 No automated tests finding(s) in Code Coverage. — One of this dimension's main actionable groups (1 issue-level).

Detailed fixes: d8_recommendation.md · top locations in Appendix A, every location in findings.md.

D13 · Secret Scanning10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D15 · Churn × Complexity Hotspots10.0 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No churn × complexity hotspots in the window.

✓ On the Gold path — maintain.

Detailed fixes: d15_recommendation.md.

D17 · Explicit Debt9.9 / 10Adequategated by 2 critical findings✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Prevented

4 deducted debt markers + 0 dead symbols across 46226 LoC in the .NET projects (0.0/KLoC) → score 9.9.

EmptyCatchBlock · ×2CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameterString.vb:91
HackCommentCircuitDrawing/Grafikelemente/XTextFormatterEx2.vb:120
TodoCommentCircuitDrawing/Grafikelemente/XTextFormatterEx2.vb:255

What to do

  1. 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).
  2. Resolve the 1 HackComment finding(s) in Explicit Debt — start with XTextFormatterEx2.vb. — One of this dimension's main actionable groups (1 warning-level).
  3. Resolve the 1 TodoComment finding(s) in Explicit Debt — start with XTextFormatterEx2.vb. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.

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.

Maturity: Documented → Verified → Prevented · effective 3.0 / 10 · rule-coverage 100% · ceiling Documented

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

  1. 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.

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

No architecture decision records were found.

No ADRs foundCircuitDrawing/CircuitDrawing.vbproj:8

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with CircuitDrawing.vbproj. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.

D26 · Project Cohesion0.0 / 10Critical✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 2 projects flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesionCircuitDrawing/CircuitDrawing.vbproj:1

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with CircuitDrawing.vbproj. — 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.

D27 · Navigability9.8 / 10Exemplary✓ Tool-verified

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. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.

Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Documented

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.

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

D28 · Secrets (history)10.0 / 10Exemplary○ Nothing flagged

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

gitleaks scanned the full history AND the current working tree and found no secrets.

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)10.0 / 10Exemplary○ Nothing flagged

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).

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

semgrep found no security issues.

✓ On the Gold path — maintain.

Detailed fixes: d29_recommendation.md.

D35 · Change Coupling10.0 / 10Exemplary✓ Tool-verified

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.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

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.

AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

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.

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

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.

AX5 · Architecture & structure3.0 / 10Weak✓ Tool-verified

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.
GD1 · Unfinished & placeholder code10.0 / 10Exemplary○ Nothing flagged

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.

M1 · Documentation (README)6.7 / 10Adequate✓ Tool-verified

Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.

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

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation0.0 / 10Critical✓ Tool-verified

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 your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
  • Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
M3 · Folder & project structure8.0 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

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.
P2 · Observability7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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.
P6 · Release Hygiene5.0 / 10Adequate✓ Tool-verified

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.

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.

LensScoreRatingImpact
Code Health66%Adequate — gated by D2, D4, D18Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture68%Adequate — gated by D26, AX5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity50%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness20%Critical — gated by D8, P1, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security100%Checked 2 of 9Strongest area.
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 — 80 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.
  • AX1 Captive dependencies — no DI registrations detected
  • AX2 Stateful singletons — no singleton implementations detected
  • AX6 Interface segregation — AX6 reached only 0% of this repository's production lines — vbnet (46,261 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • 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.
  • D12 Dependency Hygiene — Dependency hygiene not measured
  • D14 License Compliance — Licence collector did not produce a result
  • D16 Bus Factor — single-maintainer repository — bus factor is not applicable
  • D19 Documentation Quality — No runnable or published unit to look for an example in, and no multi-project root README to look for a map in; the other documentation kinds are withheld (see the gaps), so documentation quality is not applicable here.
  • D21 Naming Consistency — Naming consistency does not read Visual Basic yet; not measured.
  • D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
  • D23 Boundary Type-Coupling — Cross-context type coupling could not be assessed — this codebase's bounded contexts are neither declared nor inferable.
  • D24 Comment Value — 920 of 944 comment blocks were not judged (920 in a language other than English): redundancy is judged by word overlap with the code's identifiers, which cannot be measured across languages.
  • 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.
  • 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
  • M4 Documentation accuracy — Not applicable: the 1 current-state document(s) make no claim of a kind M4 checks.
  • P12 CI test-gate honesty — no CI workflow found
  • 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 — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • 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 — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is 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 — X28 reached only 0% of this repository's production lines — vbnet (46,261 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • 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.

Critical — 3 finding(s)
D17 · Explicit Debt · EmptyCatchBlock · ×2
  • 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. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
  • EmptyCatchBlock CircuitDrawing/Form_Vektorgrafik.vb:830 — empty catch block — the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct — as it often is on a teardown/dispose path where throwing would mask the original failure — catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow ("ignored", "do nothing") is read as no explanation at all.
D8 · Code Coverage · No automated tests · ×1
  • 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.
Serious — 716 finding(s)
D3 · God Classes · MethodTooLong · ×24
  • 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.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×23
  • Duplicated block (5 lines × 2) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1477 — CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1477-1481 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1485-1489 — 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 (5 lines × 2) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1493 — CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1493-1497 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1501-1505 — 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/TemplateAusDatei/TemplateAusDatei.vb:1635 — CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1635-1639 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1667-1671 — 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/TemplateAusDatei/TemplateAusDatei.vb:1651 — CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1651-1655 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1659-1663 — 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/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb:73 — CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb:73-77 | CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Summe.vb:94-98 — 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/MatheAusrechnen.vb:6 — CircuitDrawing/MatheAusrechnen.vb:6-10 | CircuitDrawing/MatheAusrechnen.vb:30-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 (5 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2487 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2487-2491 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2794-2798 — 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:3169 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3169-3173 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3183-3187 — 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) 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 127 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 35 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.
  • Duplicated block (5 lines × 2) CircuitDrawing/Grafikelemente/DO_Rechteck.vb:98 — CircuitDrawing/Grafikelemente/DO_Rechteck.vb:98-102 | CircuitDrawing/Grafikelemente/DO_RoundRect.vb:101-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 30 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/Anzeige/Vektor_Picturebox.vb:2876 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2876-2880 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2901-2905 — 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 · Duplicated block (8 lines × 2) · ×17
  • Duplicated block (8 lines × 2) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:60 — CircuitDrawing/Elemente/CircuitElemente/Wire.vb:60-67 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:56-63 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:54` calls `Atan2`, `Abs` and `CircuitDrawing/Elemente/CircuitElemente/Wire.vb:59` 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/AdvancedTextRenderer.vb:945 — CircuitDrawing/AdvancedTextRenderer.vb:945-952 | CircuitDrawing/AdvancedTextRenderer.vb:982-989 — 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/AdvancedTextRenderer.vb:1013 — CircuitDrawing/AdvancedTextRenderer.vb:1013-1020 | CircuitDrawing/AdvancedTextRenderer.vb:1035-1042 — 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/BauteilAusDatei.vb:586 — CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:586-593 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:283-290 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 222 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/Anzeige/Vektor_Picturebox.vb:1739 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1739-1746 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1748-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 (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 64 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/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 (8 lines × 2) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Gleich.vb:65 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Gleich.vb:65-72 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Gleich.vb:76-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 (8 lines × 2) CircuitDrawing/Steuerelemente/DashStyleCombobox.vb:21 — CircuitDrawing/Steuerelemente/DashStyleCombobox.vb:21-28 | CircuitDrawing/Steuerelemente/DashStyleCombobox.vb:47-54 — 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.
D3 · God Classes · FileTooLong · ×13
  • 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.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×13
  • Duplicated block (6 lines × 2) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_BasicRectBased.vb:95 — CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_BasicRectBased.vb:95-100 | CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_BasicRectBased.vb:115-120 — 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/Tools/ToolMove.vb:305 — CircuitDrawing/Anzeige/Tools/ToolMove.vb:305-310 | CircuitDrawing/Anzeige/Tools/ToolScale.vb:304-309 — 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/Anzeige/Tools/ToolMove.vb:311` calls `DrawLine`, `PointF` and `CircuitDrawing/Anzeige/Tools/ToolScale.vb:310` 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 (6 lines × 2) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:725 — CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:725-730 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:744-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 (6 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2455 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2455-2460 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2766-2771 — 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/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 (6 lines × 2) WindowRenderer/DockStack.vb:196 — WindowRenderer/DockStack.vb:196-201 | WindowRenderer/DockStack.vb:232-237 — 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/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/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/Anzeige/Vektor_Picturebox.vb:2885 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2885-2890 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2908-2913 — 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 · Edited copy of a member (7 corresponding lines) · ×11
  • Edited copy of a member (7 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:226 — CircuitDrawing/Elemente/CircuitElemente/Wire.vb:226-232 | CircuitDrawing/Elemente/CircuitElemente/Wire.vb:236-242 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Arrow.vb:24 — CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Arrow.vb:24-30 | CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Int.vb:20-27 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolPlace.vb:222 — CircuitDrawing/Anzeige/Tools/ToolPlace.vb:222-228 | CircuitDrawing/Anzeige/Tools/ToolPlace.vb:231-237 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableImpedanceArrow.vb:129 — CircuitDrawing/Elemente/SnapableElemente/SnapableImpedanceArrow.vb:129-137 | CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb:197-203 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Ellipse.vb:33 — CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Ellipse.vb:33-39 | CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_RoundRect.vb:38-45 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/PrecompiledTextpos.vb:63 — CircuitDrawing/TemplateAusDatei/Precompiled/PrecompiledTextpos.vb:63-70 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Text.vb:44-50 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_ODER.vb:50 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_ODER.vb:50-56 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_UND.vb:50-56 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Bezier.vb:27 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Bezier.vb:27-33 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiLinie.vb:27-35 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößer.vb:41 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößer.vb:41-47 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößerGleich.vb:41-47 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb:26 — CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb:26-32 | CircuitDrawing/Elemente/SnapableElemente/SnapableImpedanceArrow.vb:27-36 — These two members are one piece of code written twice and then edited apart: 7 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.
  • Edited copy of a member (7 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolCopy.vb:249 — CircuitDrawing/Anzeige/Tools/ToolCopy.vb:249-255 | CircuitDrawing/Anzeige/Tools/ToolMove.vb:242-248 — These two members are one piece of code written twice and then edited apart: 7 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.
D6 · Cohesion (LCOM4) · Low cohesion · ×11
  • 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.
D4 · Code Duplication · Edited copy of a member (8 corresponding lines) · ×10
  • Edited copy of a member (8 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:223 — CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:223-230 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:234-243 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb:8 — CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb:8-15 | CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Summe.vb:8-15 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) CircuitDrawing/Grafikelemente/DO_Ellipse.vb:41 — CircuitDrawing/Grafikelemente/DO_Ellipse.vb:41-48 | CircuitDrawing/Grafikelemente/DO_Ellipse.vb:52-59 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb:112 — CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb:112-123 | CircuitDrawing/Elemente/SnapableElemente/SnapableLabel.vb:91-98 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb:85 — CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb:85-93 | CircuitDrawing/Elemente/SnapableElemente/SnapableLabel.vb:66-73 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddSnapableElement.vb:11 — CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddSnapableElement.vb:11-18 | CircuitDrawing/Anzeige/Tools/ToolAddVoltageArrow.vb:22-34 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb:160 — CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb:160-167 | CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb:171-178 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Verzweigung/Precompiled_ELSE_IF.vb:45 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Verzweigung/Precompiled_ELSE_IF.vb:45-52 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Verzweigung/Precompiled_IF.vb:86-93 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) CircuitDrawing/WR_Fenster/BauelementeAuswahl.vb:6 — CircuitDrawing/WR_Fenster/BauelementeAuswahl.vb:6-13 | CircuitDrawing/WR_Fenster/WR_BauelementeAuswahl.vb:34-43 — These two members are one piece of code written twice and then edited apart: 8 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.
  • Edited copy of a member (8 corresponding lines) CircuitDrawing/Einstellungen/EinstellungBeschriftung.vb:203 — CircuitDrawing/Einstellungen/EinstellungBeschriftung.vb:203-210 | CircuitDrawing/Einstellungen/Einstellung_Int.vb:58-65 — These two members are one piece of code written twice and then edited apart: 8 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.
D3 · God Classes · TooManyMethods · ×8
  • 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.
D3 · God Classes · ClassTooLong · ×7
  • 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.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×7
  • Edited copy of a member (14 corresponding lines) CircuitDrawing/Steuerelemente/DashStyleCombobox.vb:15 — CircuitDrawing/Steuerelemente/DashStyleCombobox.vb:15-28 | CircuitDrawing/Steuerelemente/DashStyleCombobox.vb:33-55 — These two members are one piece of code written twice and then edited apart: 14 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.
  • Edited copy of a member (14 corresponding lines) CircuitDrawing/Grafikelemente/DO_MultiLinie.vb:45 — CircuitDrawing/Grafikelemente/DO_MultiLinie.vb:45-58 | CircuitDrawing/Grafikelemente/DO_Polygon.vb:117-134 — These two members are one piece of code written twice and then edited apart: 14 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.
  • Edited copy of a member (14 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck.vb:235 — CircuitDrawing/Ausdruck/Ausdruck.vb:235-248 | CircuitDrawing/Ausdruck/Ausdruck.vb:252-265 — These two members are one piece of code written twice and then edited apart: 14 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.
  • Edited copy of a member (14 corresponding lines) CircuitDrawing/Grafikelemente/DO_Polygon.vb:83 — CircuitDrawing/Grafikelemente/DO_Polygon.vb:83-96 | CircuitDrawing/Grafikelemente/DO_Polygon.vb:100-113 — These two members are one piece of code written twice and then edited apart: 14 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.
  • Edited copy of a member (14 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:366 — CircuitDrawing/Elemente/CircuitElemente/Wire.vb:366-379 | CircuitDrawing/Elemente/CircuitElemente/Wire.vb:383-396 — These two members are one piece of code written twice and then edited apart: 14 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.
  • Edited copy of a member (14 corresponding lines) CircuitDrawing/Grafikelemente/DO_Bezier.vb:47 — CircuitDrawing/Grafikelemente/DO_Bezier.vb:47-60 | CircuitDrawing/Grafikelemente/DO_Bezier.vb:64-77 — These two members are one piece of code written twice and then edited apart: 14 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.
  • Edited copy of a member (14 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:106 — CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:106-121 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Spannungspfeil.vb:164-177 — These two members are one piece of code written twice and then edited apart: 14 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 (5 corresponding lines) · ×7
  • Edited copy of a member (5 corresponding lines) CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddCurrentArrow.vb:37 — CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddCurrentArrow.vb:37-41 | CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddSnapableImpedanceArrow.vb:31-35 — These two members are one piece of code written twice and then edited apart: 5 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.
  • Edited copy of a member (5 corresponding lines) CircuitDrawing/Anzeige/CopyClipboard.vb:30 — CircuitDrawing/Anzeige/CopyClipboard.vb:30-34 | CircuitDrawing/Rückgängig/Rückgängig.vb:36-40 — These two members are one piece of code written twice and then edited apart: 5 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.
  • Edited copy of a member (5 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb:127 — CircuitDrawing/Elemente/SnapableElemente/SnapableBusTap.vb:127-131 | CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb:228-233 — These two members are one piece of code written twice and then edited apart: 5 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.
  • Edited copy of a member (5 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Linie.vb:26 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Linie.vb:26-30 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Selection.vb:26-30 — These two members are one piece of code written twice and then edited apart: 5 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.
  • Edited copy of a member (5 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiGrafik.vb:19 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiGrafik.vb:19-23 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiGrafik.vb:34-41 — These two members are one piece of code written twice and then edited apart: 5 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.
  • Edited copy of a member (5 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_RoundRect.vb:16 — CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_RoundRect.vb:16-20 | CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Textfeld.vb:21-25 — These two members are one piece of code written twice and then edited apart: 5 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.
  • Edited copy of a member (5 corresponding lines) CircuitDrawing/BauelementeBibliothek/BauteileNamespace.vb:63 — CircuitDrawing/BauelementeBibliothek/BauteileNamespace.vb:63-67 | CircuitDrawing/BauelementeBibliothek/Bibliothek.vb:127-131 — These two members are one piece of code written twice and then edited apart: 5 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 · Duplicated block (12 lines × 2) · ×7
  • Duplicated block (12 lines × 2) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Ellipse.vb:36 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Ellipse.vb:36-47 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Rect.vb:32-43 — 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/Mathe.vb:847 — CircuitDrawing/Mathe.vb:847-858 | CircuitDrawing/Mathe.vb:899-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 (12 lines × 2) WindowRenderer/WindowRenderer.vb:547 — WindowRenderer/WindowRenderer.vb:547-558 | WindowRenderer/WindowRenderer.vb:731-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 (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/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: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 12 separate duplicated blocks between them, totalling at least 222 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 12 separate duplicated blocks between them, totalling at least 222 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.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×7
  • Duplicated block (9 lines × 2) CircuitDrawing/AdvancedTextRenderer.vb:922 — CircuitDrawing/AdvancedTextRenderer.vb:922-930 | CircuitDrawing/AdvancedTextRenderer.vb:959-967 — 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/Elemente/BasicGrafikElemente/Basic_Bezier.vb:133 — CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:133-141 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:108-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 35 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) WindowRenderer/VirtualWindowRenderer/MultiPerspektivenManager.vb:22 — WindowRenderer/VirtualWindowRenderer/MultiPerspektivenManager.vb:22-30 | WindowRenderer/VirtualWindowRenderer/VirtualWindowRenderer.vb:30-38 — 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/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 127 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 64 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: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.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×7
  • Duplicated block (7 lines × 2) CircuitDrawing/Form_Vektorgrafik.vb:1076 — CircuitDrawing/Form_Vektorgrafik.vb:1076-1082 | CircuitDrawing/SkillDetect/SkillDetektionForm.vb:182-188 — 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/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 127 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/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/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 127 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.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×6
  • Edited copy of a member (11 corresponding lines) CircuitDrawing/Mathe.vb:38 — CircuitDrawing/Mathe.vb:38-48 | CircuitDrawing/Mathe.vb:52-62 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) CircuitDrawing/Elemente/SnapableElement.vb:115 — CircuitDrawing/Elemente/SnapableElement.vb:115-125 | CircuitDrawing/Elemente/SnapableElement.vb:129-142 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb:175 — CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb:175-185 | CircuitDrawing/Elemente/SnapableElemente/SnapableImpedanceArrow.vb:105-117 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:75 — CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:75-86 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:51-61 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:451 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:451-465 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:486-496 — These two members are one piece of code written twice and then edited apart: 11 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.
  • Edited copy of a member (11 corresponding lines) CircuitDrawing/AdvancedTextRenderer.vb:1064 — CircuitDrawing/AdvancedTextRenderer.vb:1064-1074 | CircuitDrawing/AdvancedTextRenderer.vb:1085-1095 — These two members are one piece of code written twice and then edited apart: 11 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 (12 corresponding lines) · ×6
  • Edited copy of a member (12 corresponding lines) CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb:207 — CircuitDrawing/Elemente/SnapableElemente/SnapableCurrentArrow.vb:207-224 | CircuitDrawing/Elemente/SnapableElemente/SnapableImpedanceArrow.vb:141-152 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
  • Edited copy of a member (12 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:206 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:206-220 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Text.vb:66-77 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
  • Edited copy of a member (12 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:112 — CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:112-123 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Spannungspfeil.vb:139-152 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
  • Edited copy of a member (12 corresponding lines) CircuitDrawing/WR_Fenster/WR_BauelementeAuswahl.vb:196 — CircuitDrawing/WR_Fenster/WR_BauelementeAuswahl.vb:196-209 | CircuitDrawing/WR_Fenster/WR_BauelementeAuswahl.vb:215-226 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
  • Edited copy of a member (12 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolAddSnappoint.vb:53 — CircuitDrawing/Anzeige/Tools/ToolAddSnappoint.vb:53-64 | CircuitDrawing/Anzeige/Tools/ToolDeleteSnappoint.vb:54-67 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
  • Edited copy of a member (12 corresponding lines) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:622 — CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:622-633 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:637-648 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 · Duplicated block (10 lines × 2) · ×6
  • Duplicated block (10 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:384 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:384-393 | CircuitDrawing/Elemente/ElementGruppe.vb:188-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 (10 lines × 2) CircuitDrawing/Anzeige/Tools/ToolAddVoltageArrow.vb:213 — CircuitDrawing/Anzeige/Tools/ToolAddVoltageArrow.vb:213-222 | CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddSnapableElement.vb:56-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 (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/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.
D4 · Code Duplication · Edited copy of a member (16 corresponding lines) · ×5
  • Edited copy of a member (16 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Arc.vb:63 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Arc.vb:63-79 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_ArrowHead.vb:73-88 — These two members are one piece of code written twice and then edited apart: 16 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.
  • Edited copy of a member (16 corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:762 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:762-777 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:796-811 — These two members are one piece of code written twice and then edited apart: 16 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.
  • Edited copy of a member (16 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_ToInt.vb:19 — CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_ToInt.vb:19-41 | CircuitDrawing/Ausdruck/Ausdruck_String/Ausdruck_ToString.vb:31-46 — These two members are one piece of code written twice and then edited apart: 16 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.
  • Edited copy of a member (16 corresponding lines) CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb:182 — CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb:182-197 | CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb:201-216 — These two members are one piece of code written twice and then edited apart: 16 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.
  • Edited copy of a member (16 corresponding lines) CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Int.vb:38 — CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Int.vb:38-53 | CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParamter_Double.vb:34-49 — These two members are one piece of code written twice and then edited apart: 16 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 (6 corresponding lines) · ×5
  • Edited copy of a member (6 corresponding lines) CircuitDrawing/SkillDetect/Routing_v2.vb:472 — CircuitDrawing/SkillDetect/Routing_v2.vb:472-477 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2922-2933 — These two members are one piece of code written twice and then edited apart: 6 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.
  • Edited copy of a member (6 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Rect.vb:52 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Rect.vb:52-62 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Selection.vb:34-39 — These two members are one piece of code written twice and then edited apart: 6 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.
  • Edited copy of a member (6 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:203 — CircuitDrawing/Elemente/CircuitElemente/Wire.vb:203-208 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:206-211 — These two members are one piece of code written twice and then edited apart: 6 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.
  • Edited copy of a member (6 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolCopy.vb:29 — CircuitDrawing/Anzeige/Tools/ToolCopy.vb:29-35 | CircuitDrawing/Anzeige/Tools/ToolMove.vb:25-30 — These two members are one piece of code written twice and then edited apart: 6 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.
  • Edited copy of a member (6 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolCopy.vb:39 — CircuitDrawing/Anzeige/Tools/ToolCopy.vb:39-45 | CircuitDrawing/Anzeige/Tools/ToolMove.vb:44-49 — These two members are one piece of code written twice and then edited apart: 6 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 · Duplicated block (13 lines × 2) · ×5
  • Duplicated block (13 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:397 — CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:397-409 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:172-184 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 222 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/SkillDetect/Routing_v2.vb:516 — CircuitDrawing/SkillDetect/Routing_v2.vb:516-528 | CircuitDrawing/SkillDetect/Routing_v2.vb:531-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 (13 lines × 2) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:916 — CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:916-928 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:993-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 (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 127 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/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 12 separate duplicated blocks between them, totalling at least 222 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.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×5
  • Duplicated block (11 lines × 2) CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:23 — CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:23-33 | CircuitDrawing/WR_Fenster/WR_BauelementeAuswahl.vb:20-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 (11 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:382 — CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:382-392 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:159-169 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 222 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/Anzeige/Vektor_Picturebox.vb:5115 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5115-5125 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5140-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 (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/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.
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×4
  • 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.
  • Edited copy of a member (13 corresponding lines) CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb:93 — CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawBezier.vb:93-105 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:177-189 — 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.
  • Edited copy of a member (13 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Ellipse.vb:43 — CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Ellipse.vb:43-55 | CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_RoundRect.vb:49-62 — 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.
  • Edited copy of a member (13 corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:780 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:780-792 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:814-826 — 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 · Edited copies of one member (3 members, 4+ corresponding lines) · ×4
  • Edited copies of one member (3 members, 4+ corresponding lines) CircuitDrawing/Elemente/Element.vb:117 — CircuitDrawing/Elemente/Element.vb:117-123 | CircuitDrawing/Elemente/Element.vb:127-130 | CircuitDrawing/Grafikelemente/DO_Rechteck.vb:11-16 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Gleich.vb:52 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Gleich.vb:52-55 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößer.vb:57-60 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößerGleich.vb:57-60 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) CircuitDrawing/Grafikelemente/ExportDrawArgs/FillStyleList.vb:42 — CircuitDrawing/Grafikelemente/ExportDrawArgs/FillStyleList.vb:42-45 | CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb:46-49 | CircuitDrawing/Grafikelemente/ExportDrawArgs/LineStyleList.vb:47-50 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 4+ corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Boolean.vb:82 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Boolean.vb:82-85 | CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Int.vb:92-95 | CircuitDrawing/Ausdruck/Ausdruck_Pfeil/Ausdruck_Pfeil.vb:43-46 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (17 corresponding lines) · ×4
  • Edited copy of a member (17 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Graph.vb:245 — CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Graph.vb:245-270 | CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Textfeld.vb:57-73 — These two members are one piece of code written twice and then edited apart: 17 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.
  • Edited copy of a member (17 corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Ellipse.vb:36 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Ellipse.vb:36-52 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Rect.vb:32-48 — These two members are one piece of code written twice and then edited apart: 17 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.
  • Edited copy of a member (17 corresponding lines) WindowRenderer/Maus.vb:12 — WindowRenderer/Maus.vb:12-28 | WindowRenderer/Maus.vb:32-48 — These two members are one piece of code written twice and then edited apart: 17 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.
  • Edited copy of a member (17 corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4158 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4158-4176 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4202-4218 — These two members are one piece of code written twice and then edited apart: 17 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 (4 corresponding lines) · ×4
  • Edited copy of a member (4 corresponding lines) CircuitDrawing/Grafikelemente/DO_Dot.vb:20 — CircuitDrawing/Grafikelemente/DO_Dot.vb:20-23 | CircuitDrawing/Grafikelemente/DO_Dot.vb:27-30 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) CircuitDrawing/Steuerelemente/UserDrawListbox.vb:561 — CircuitDrawing/Steuerelemente/UserDrawListbox.vb:561-564 | CircuitDrawing/Steuerelemente/UserDrawListbox.vb:572-575 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameterString.vb:20 — CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameterString.vb:20-23 | CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParamter_Double.vb:20-23 — These two members are one piece of code written twice and then edited apart: 4 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.
  • Edited copy of a member (4 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_ODER.vb:43 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_ODER.vb:43-46 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_UND.vb:43-46 — These two members are one piece of code written twice and then edited apart: 4 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 (9 corresponding lines) · ×4
  • Edited copy of a member (9 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb:73 — CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb:73-81 | CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Summe.vb:94-102 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) CircuitDrawing/Steuerelemente/PfeilCombobox.vb:8 — CircuitDrawing/Steuerelemente/PfeilCombobox.vb:8-21 | CircuitDrawing/Steuerelemente/PfeilCombobox.vb:26-34 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) CircuitDrawing/Einstellungen/EinstellungStrompfeilArt.vb:150 — CircuitDrawing/Einstellungen/EinstellungStrompfeilArt.vb:150-158 | CircuitDrawing/Einstellungen/Einstellung_Pfeilspitze.vb:155-163 — These two members are one piece of code written twice and then edited apart: 9 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.
  • Edited copy of a member (9 corresponding lines) CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Arrow.vb:103 — CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Arrow.vb:103-111 | CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter.vb:80-88 — These two members are one piece of code written twice and then edited apart: 9 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 · Duplicated block (14 lines × 2) · ×4
  • Duplicated block (14 lines × 2) CircuitDrawing/SkillDetect/Routing_v2.vb:184 — CircuitDrawing/SkillDetect/Routing_v2.vb:184-197 | CircuitDrawing/SkillDetect/Routing_v2.vb:202-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 (14 lines × 2) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:113 — CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:113-126 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:122-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 127 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 (14 lines × 2) WindowRenderer/DockStack.vb:324 — WindowRenderer/DockStack.vb:324-337 | WindowRenderer/DockStack.vb:356-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 (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.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×4
  • Duplicated block (15 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:595 — CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:595-609 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:291-305 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 222 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/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 127 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.
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.
D4 · Code Duplication · Edited copy of a member (18 corresponding lines) · ×3
  • Edited copy of a member (18 corresponding lines) CircuitDrawing/Mathe.vb:118 — CircuitDrawing/Mathe.vb:118-135 | CircuitDrawing/Mathe.vb:139-156 — These two members are one piece of code written twice and then edited apart: 18 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.
  • Edited copy of a member (18 corresponding lines) CircuitDrawing/Steuerelemente/UserDrawListbox.vb:232 — CircuitDrawing/Steuerelemente/UserDrawListbox.vb:232-251 | CircuitDrawing/Steuerelemente/UserDrawListbox.vb:255-272 — These two members are one piece of code written twice and then edited apart: 18 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.
  • Edited copy of a member (18 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_ODER.vb:13 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_ODER.vb:13-30 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_UND.vb:13-30 — These two members are one piece of code written twice and then edited apart: 18 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 (19 corresponding lines) · ×3
  • Edited copy of a member (19 corresponding lines) CircuitDrawing/AdvancedTextRenderer.vb:1013 — CircuitDrawing/AdvancedTextRenderer.vb:1013-1031 | CircuitDrawing/AdvancedTextRenderer.vb:1035-1053 — These two members are one piece of code written twice and then edited apart: 19 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.
  • Edited copy of a member (19 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolAddSnappoint.vb:31 — CircuitDrawing/Anzeige/Tools/ToolAddSnappoint.vb:31-49 | CircuitDrawing/Anzeige/Tools/ToolDeleteSnappoint.vb:31-50 — These two members are one piece of code written twice and then edited apart: 19 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.
  • Edited copy of a member (19 corresponding lines) CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:46 — CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:46-64 | CircuitDrawing/SkillDetect/Skill_BauelementeAuswählen.vb:70-88 — These two members are one piece of code written twice and then edited apart: 19 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 · Duplicated block (23 lines × 2) · ×3
  • Duplicated block (23 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:262 — CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:262-284 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:62-84 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 222 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/Anzeige/Vektor_Picturebox.vb:5564 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5564-5586 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:5592-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 (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.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×3
  • Duplicated block (17 lines × 2) CircuitDrawing/Einstellungen/ElementEinstellung.vb:62 — CircuitDrawing/Einstellungen/ElementEinstellung.vb:62-78 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:83-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 (17 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1425 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1425-1441 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1458-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.
  • 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 127 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.
D4 · Code Duplication · Duplicated block (9 lines × 3) · ×3
  • Duplicated block (9 lines × 3) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1699 — CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1699-1707 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1805-1813 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1977-1985 — 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/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/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.
D4 · Code Duplication · Duplicated block (5 lines × 3) · ×3
  • Duplicated block (5 lines × 3) CircuitDrawing/Einstellungen/ElementEinstellung.vb:67 — CircuitDrawing/Einstellungen/ElementEinstellung.vb:67-71 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:88-92 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:179-183 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (5 lines × 3) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:203 — CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:203-207 | CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:221-225 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:223-227 — 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 127 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 × 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.
D4 · Code Duplication · Duplicated block (7 lines × 3) · ×3
  • Duplicated block (7 lines × 3) CircuitDrawing/Einstellungen/ElementEinstellung.vb:157 — CircuitDrawing/Einstellungen/ElementEinstellung.vb:157-163 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:196-202 | CircuitDrawing/Einstellungen/ElementEinstellung.vb:223-229 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (7 lines × 3) 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.
D4 · Code Duplication · Duplicated block (5 lines × 4) · ×3
  • Duplicated block (5 lines × 4) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1643 — CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1643-1647 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1675-1679 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1683-1687 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:1691-1695 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (5 lines × 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.
D2 · Cognitive Complexity · DrawString_HorizontalMode.calcBoundingBoxes (cognitive 25) · ×2
  • 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.
D4 · Code Duplication · Edited copy of a member (21 corresponding lines) · ×2
  • 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.
  • Edited copy of a member (21 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:145 — CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:145-165 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:125-149 — 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 (27 corresponding lines) · ×2
  • Edited copy of a member (27 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:58 — CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:58-84 | CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:250-293 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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.
  • Edited copy of a member (27 corresponding lines) WindowRenderer/WindowRenderer.vb:389 — WindowRenderer/WindowRenderer.vb:389-415 | WindowRenderer/WindowRenderer.vb:436-462 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 (29 corresponding lines) · ×2
  • Edited copy of a member (29 corresponding lines) WindowRenderer/WindowRenderer.vb:111 — WindowRenderer/WindowRenderer.vb:111-140 | WindowRenderer/WindowRenderer.vb:143-171 — These two members are one piece of code written twice and then edited apart: 29 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.
  • Edited copy of a member (29 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb:85 — CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Produkt.vb:85-115 | CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Summe.vb:106-134 — These two members are one piece of code written twice and then edited apart: 29 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 (10 corresponding lines) · ×2
  • Edited copy of a member (10 corresponding lines) CircuitDrawing/Mathe.vb:4 — CircuitDrawing/Mathe.vb:4-13 | CircuitDrawing/Mathe.vb:17-26 — These two members are one piece of code written twice and then edited apart: 10 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.
  • Edited copy of a member (10 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_GleichString.vb:16 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_GleichString.vb:16-25 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_GleichBool.vb:16-25 — These two members are one piece of code written twice and then edited apart: 10 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 (3 corresponding lines) · ×2
  • Edited copy of a member (3 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolRechteckMarkierung.vb:77 — CircuitDrawing/Anzeige/Tools/ToolRechteckMarkierung.vb:77-79 | CircuitDrawing/Anzeige/Tools/ToolRechteckMarkierung.vb:83-85 — These two members are one piece of code written twice and then edited apart: 3 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.
  • Edited copy of a member (3 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:467 — CircuitDrawing/Elemente/CircuitElemente/Wire.vb:467-469 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:306-308 — These two members are one piece of code written twice and then edited apart: 3 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 copies of one member (3 members, 7+ corresponding lines) · ×2
  • Edited copies of one member (3 members, 7+ corresponding lines) CircuitDrawing/BauelementeBibliothek/BauteilCell.vb:59 — CircuitDrawing/BauelementeBibliothek/BauteilCell.vb:59-65 | CircuitDrawing/BauelementeBibliothek/BauteileNamespace.vb:43-49 | CircuitDrawing/BauelementeBibliothek/Bibliothek.vb:91-97 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
  • Edited copies of one member (3 members, 7+ corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Gleich.vb:36 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_Gleich.vb:36-42 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_GleichBool.vb:29-35 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_GleichString.vb:29-35 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (35 lines × 2) · ×2
  • 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 127 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.
D4 · Code Duplication · Duplicated block (22 lines × 2) · ×2
  • 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.
D4 · Code Duplication · Duplicated block (10 lines × 3) · ×2
  • Duplicated block (10 lines × 3) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4394 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4394-4403 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4442-4451 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4535-4544 — 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.
D4 · Code Duplication · Duplicated block (8 lines × 4) · ×2
  • Duplicated block (8 lines × 4) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:384 — CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:384-391 | CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:399-406 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:161-168 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:174-181 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 222 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 × 4) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2250 — CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2250-2257 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2275-2282 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2298-2305 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:2323-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.
AX5 · Architecture & structure · Appears unstructured (no recognised architecture) · ×1
  • 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.
D1 · Cyclomatic Complexity · TemplateAusDatei.readIDLE (cyclomatic 185) · ×1
  • 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.
D1 · Cyclomatic Complexity · TemplateAusDatei.leseGrafik (cyclomatic 137) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.mitVerschiebenWire (cyclomatic 87) · ×1
  • 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.
D1 · Cyclomatic Complexity · AdvancedTextRenderer.leseStr (cyclomatic 72) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.RoutingVerbessern_Wire (cyclomatic 68) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.RoutingVerbessern (cyclomatic 65) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.simplifyWires (cyclomatic 65) · ×1
  • 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.
D1 · Cyclomatic Complexity · Wire.AddIfPossible (cyclomatic 63) · ×1
  • 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.
D1 · Cyclomatic Complexity · Ausdruck.auswertenFunktion (cyclomatic 58) · ×1
  • 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.
D1 · Cyclomatic Complexity · WindowRenderer.LocationFensterChanged (cyclomatic 57) · ×1
  • 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.
D1 · Cyclomatic Complexity · BauteilAusDatei.Einlesen (cyclomatic 54) · ×1
  • 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.
D1 · Cyclomatic Complexity · TemplateAusDatei.kompilieren (cyclomatic 54) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.getNextScaleKante (cyclomatic 52) · ×1
  • 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.
D1 · Cyclomatic Complexity · MatheAusrechnen.ausrechnen (cyclomatic 50) · ×1
  • 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.
D1 · Cyclomatic Complexity · Intelisense.ChangePopUpContent (cyclomatic 49) · ×1
  • 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.
D1 · Cyclomatic Complexity · Element_Graph.setEinstellungen (cyclomatic 48) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.hatWireAnPosition (cyclomatic 47) · ×1
  • 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.
D1 · Cyclomatic Complexity · Deko_Bauteil.Einlesen (cyclomatic 46) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.moveWirePos (cyclomatic 45) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.darfHierRouten (cyclomatic 44) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.moveSelectedElements_Intern (cyclomatic 42) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.findRoutingSpeziell_Xplus (cyclomatic 42) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.schneidet_Wire_ein_Bauteil (cyclomatic 42) · ×1
  • 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.
D1 · Cyclomatic Complexity · Routing_v2.solveShort (cyclomatic 40) · ×1
  • 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.
D1 · Cyclomatic Complexity · SkillDetectSchematic.leseInst (cyclomatic 40) · ×1
  • 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.
D1 · Cyclomatic Complexity · BauteilAusDatei.setEinstellungen (cyclomatic 40) · ×1
  • 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.
D1 · Cyclomatic Complexity · DockStack.RerangeLayout (cyclomatic 40) · ×1
  • 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.
D1 · Cyclomatic Complexity · TemplateAusDatei.__lade_defaultParameterValues (cyclomatic 38) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.drawGrid (cyclomatic 37) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.RoutingVerbessern_BauteilUmgehen (cyclomatic 36) · ×1
  • 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.
D1 · Cyclomatic Complexity · Ausdruck.getAusdruck_Bool (cyclomatic 35) · ×1
  • 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.
D1 · Cyclomatic Complexity · SkillDetectSchematic.New.ctor (cyclomatic 34) · ×1
  • 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.
D1 · Cyclomatic Complexity · TemplateAusDatei.definiereVariable (cyclomatic 34) · ×1
  • 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.
D1 · Cyclomatic Complexity · TemplateAusDatei.definiereKonstanteGesamt (cyclomatic 33) · ×1
  • 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.
D1 · Cyclomatic Complexity · Ausdruck.auswertenOperatorVergleiche (cyclomatic 32) · ×1
  • 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.
D1 · Cyclomatic Complexity · ToolScale.MouseMoveOffgrid (cyclomatic 29) · ×1
  • 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.
D1 · Cyclomatic Complexity · Form_Vektorgrafik.OnKeyDown (cyclomatic 29) · ×1
  • 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.
D1 · Cyclomatic Complexity · DO_Text.drawGraphics (cyclomatic 29) · ×1
  • 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.
D1 · Cyclomatic Complexity · DO_Text.drawPDFSharp (cyclomatic 29) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.select_Element_At (cyclomatic 29) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.mitVerschiebenBauteilSnappoint (cyclomatic 29) · ×1
  • 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.
D1 · Cyclomatic Complexity · Precompiled_LineArrow.callback_AfterOrigin (cyclomatic 28) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.OnPaint (cyclomatic 28) · ×1
  • 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.
D1 · Cyclomatic Complexity · Netz_WireElement.propagateConstraints (cyclomatic 27) · ×1
  • 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.
D1 · Cyclomatic Complexity · Deko_Bauteil.setEinstellungen (cyclomatic 27) · ×1
  • 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.
D1 · Cyclomatic Complexity · DO_Text.drawTEX_Text (cyclomatic 27) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.defaultOnKeyDown (cyclomatic 27) · ×1
  • 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.
D1 · Cyclomatic Complexity · Settings.ladeSettings (cyclomatic 26) · ×1
  • 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.
D1 · Cyclomatic Complexity · MasterElemente.getBitmap (cyclomatic 26) · ×1
  • 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.
D1 · Cyclomatic Complexity · Routing_v2.AlignRestToFixpoints (cyclomatic 25) · ×1
  • 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.
D1 · Cyclomatic Complexity · Precompiled_Grafik.speicherGrafik (cyclomatic 24) · ×1
  • 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.
D1 · Cyclomatic Complexity · Precompiled_Grafik.exportiereGrafik (cyclomatic 24) · ×1
  • 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.
D1 · Cyclomatic Complexity · Intelisense.txtKeyPress (cyclomatic 24) · ×1
  • 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.
D1 · Cyclomatic Complexity · SnapableImpedanceArrow.setEinstellungen (cyclomatic 23) · ×1
  • 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.
D1 · Cyclomatic Complexity · Mathe.schneidetRechteck (cyclomatic 23) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.findRouting (cyclomatic 23) · ×1
  • 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.
D1 · Cyclomatic Complexity · TabElement.PicHeaderMouseMove (cyclomatic 23) · ×1
  • 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.
D1 · Cyclomatic Complexity · Element_Graph.CalcFunktion (cyclomatic 22) · ×1
  • 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.
D1 · Cyclomatic Complexity · Bibliothek.speicherVerwendeteTemplates (cyclomatic 22) · ×1
  • 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.
D1 · Cyclomatic Complexity · TemplateAusDatei.addSnappointVonSkill (cyclomatic 22) · ×1
  • 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.
D1 · Cyclomatic Complexity · Mathe.getSchnittpunkt_alpha (cyclomatic 22) · ×1
  • 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.
D1 · Cyclomatic Complexity · TabElement.UntersucheContentAvailableChanges (cyclomatic 22) · ×1
  • 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.
D1 · Cyclomatic Complexity · ToolCopy.KeyDown (cyclomatic 21) · ×1
  • 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.
D1 · Cyclomatic Complexity · SkillDetectSchematic.leseMaster (cyclomatic 21) · ×1
  • 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.
D1 · Cyclomatic Complexity · SkillDetectSchematic.leseNet (cyclomatic 21) · ×1
  • 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.
D1 · Cyclomatic Complexity · SkillDetectSchematic.getNetName (cyclomatic 21) · ×1
  • 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.
D1 · Cyclomatic Complexity · Precompiled_IF.simplifyBlock (cyclomatic 21) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.schalteBeschriftungsPosDurch (cyclomatic 21) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.ladeGrafikIntern (cyclomatic 21) · ×1
  • 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.
D1 · Cyclomatic Complexity · Ausdruck.auswerten (cyclomatic 20) · ×1
  • 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.
D1 · Cyclomatic Complexity · SkillDetectSchematic.getBauteilZuordnungen (cyclomatic 20) · ×1
  • 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.
D1 · Cyclomatic Complexity · SkillDetectSchematic.solveDirectConnections_Pins (cyclomatic 20) · ×1
  • 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.
D1 · Cyclomatic Complexity · Precompiled_Snappoint.compile (cyclomatic 20) · ×1
  • 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.
D1 · Cyclomatic Complexity · Mathe.getSchnittpunkt_alpha (cyclomatic 20) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.getElementAt_forSelect (cyclomatic 20) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.adjustWhenNotOnWire (cyclomatic 20) · ×1
  • 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.
D1 · Cyclomatic Complexity · ToolDrawBezierFreihand.berechneBezierBasisAlgo2 (cyclomatic 19) · ×1
  • 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.
D1 · Cyclomatic Complexity · ElementGruppe.getEinstellungen (cyclomatic 19) · ×1
  • 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.
D1 · Cyclomatic Complexity · SkillDetectSchematic.verschiebeElementMitGenau1Wire (cyclomatic 19) · ×1
  • 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.
D1 · Cyclomatic Complexity · Mathe.getBezierBoundingBox (cyclomatic 19) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.darfSelektieren (cyclomatic 19) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.detectConnectedNets (cyclomatic 19) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.performGravity (cyclomatic 19) · ×1
  • 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.
D1 · Cyclomatic Complexity · ToolCopy.MouseUp (cyclomatic 18) · ×1
  • 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.
D1 · Cyclomatic Complexity · ToolDrawBezier.OnDraw (cyclomatic 18) · ×1
  • 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.
D1 · Cyclomatic Complexity · Ausdruck_MaxMin.AusrechnenSoweitMöglich (cyclomatic 18) · ×1
  • 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.
D1 · Cyclomatic Complexity · Ctr_BauelementeAuswahl_Skill.updateBauteil (cyclomatic 18) · ×1
  • 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.
D1 · Cyclomatic Complexity · Routing_v2.zeichne (cyclomatic 18) · ×1
  • 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.
D1 · Cyclomatic Complexity · Skill_BauteilZuordnung.leseInfo (cyclomatic 18) · ×1
  • 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.
D1 · Cyclomatic Complexity · BauteilAusDatei.isEqualExceptSelection (cyclomatic 18) · ×1
  • 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.
D1 · Cyclomatic Complexity · DO_Text.addTEXText (cyclomatic 18) · ×1
  • 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.
D1 · Cyclomatic Complexity · Mathe.auswerten (cyclomatic 18) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox._text_Nicht_Kursiv (cyclomatic 18) · ×1
  • 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.
D1 · Cyclomatic Complexity · TabElement.ContentvisibleChanged (cyclomatic 18) · ×1
  • 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.
D1 · Cyclomatic Complexity · SkillDetectSchematic.connectToNextLineOLD (cyclomatic 17) · ×1
  • 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.
D1 · Cyclomatic Complexity · Element_Rect.setEinstellungen (cyclomatic 17) · ×1
  • 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.
D1 · Cyclomatic Complexity · TemplateAusDatei.defVar (cyclomatic 17) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.getEinstellungenOfSelectedElements (cyclomatic 17) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.bewerteRouting (cyclomatic 17) · ×1
  • 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.
D1 · Cyclomatic Complexity · DockStack.UpdateContentAvailableChanges (cyclomatic 17) · ×1
  • 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.
D1 · Cyclomatic Complexity · ToolMove.MouseUp (cyclomatic 16) · ×1
  • 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.
D1 · Cyclomatic Complexity · Precompiled_Snappoint.export (cyclomatic 16) · ×1
  • 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.
D1 · Cyclomatic Complexity · Mathe.string_vorm_auswertenAufbereiten (cyclomatic 16) · ×1
  • 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.
D1 · Cyclomatic Complexity · Vektor_Picturebox.Selected_Elemente_one_level_fore_back (cyclomatic 16) · ×1
  • 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.
D1 · Cyclomatic Complexity · JoSiCombobox.abdunkeln (cyclomatic 16) · ×1
  • 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.
D17 · Explicit Debt · HackComment · ×1
  • 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.
D17 · Explicit Debt · TodoComment · ×1
  • 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.
D18 · Solution Shape · Build failed · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.readIDLE (cognitive 413) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.leseGrafik (cognitive 207) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.simplifyWires (cognitive 207) · ×1
  • 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.
D2 · Cognitive Complexity · BauteilAusDatei.setEinstellungen (cognitive 201) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.RoutingVerbessern (cognitive 201) · ×1
  • 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.
D2 · Cognitive Complexity · DockStack.RerangeLayout (cognitive 193) · ×1
  • 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.
D2 · Cognitive Complexity · WindowRenderer.LocationFensterChanged (cognitive 190) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.kompilieren (cognitive 181) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.RoutingVerbessern_Wire (cognitive 168) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.mitVerschiebenWire (cognitive 163) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.getNextScaleKante (cognitive 155) · ×1
  • 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.
D2 · Cognitive Complexity · BauteilAusDatei.Einlesen (cognitive 144) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.darfHierRouten (cognitive 135) · ×1
  • 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.
D2 · Cognitive Complexity · Deko_Bauteil.Einlesen (cognitive 130) · ×1
  • 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.
D2 · Cognitive Complexity · ToolScale.MouseMoveOffgrid (cognitive 129) · ×1
  • 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.
D2 · Cognitive Complexity · Ausdruck.auswertenFunktion (cognitive 128) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.schneidet_Wire_ein_Bauteil (cognitive 124) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.findRoutingSpeziell_Xplus (cognitive 120) · ×1
  • 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.
D2 · Cognitive Complexity · Element_Graph.setEinstellungen (cognitive 116) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.__lade_defaultParameterValues (cognitive 114) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.moveSelectedElements_Intern (cognitive 96) · ×1
  • 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.
D2 · Cognitive Complexity · Deko_Bauteil.setEinstellungen (cognitive 95) · ×1
  • 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.
D2 · Cognitive Complexity · Routing_v2.solveShort (cognitive 93) · ×1
  • 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.
D2 · Cognitive Complexity · Intelisense.ChangePopUpContent (cognitive 92) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.select_Element_At (cognitive 90) · ×1
  • 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.
D2 · Cognitive Complexity · Ctr_BauelementeAuswahl_Skill.updateBauteil (cognitive 87) · ×1
  • 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.
D2 · Cognitive Complexity · Wire.AddIfPossible (cognitive 86) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.moveWirePos (cognitive 81) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.RoutingVerbessern_BauteilUmgehen (cognitive 80) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.drawGrid (cognitive 80) · ×1
  • 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.
D2 · Cognitive Complexity · TabElement.UntersucheContentAvailableChanges (cognitive 77) · ×1
  • 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.
D2 · Cognitive Complexity · Element_Rect.setEinstellungen (cognitive 76) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.OnPaint (cognitive 75) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.verschiebeElementMitGenau1Wire (cognitive 74) · ×1
  • 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.
D2 · Cognitive Complexity · Netz_WireElement.propagateConstraints (cognitive 69) · ×1
  • 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.
D2 · Cognitive Complexity · MatheAusrechnen.ausrechnen (cognitive 69) · ×1
  • 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.
D2 · Cognitive Complexity · Routing_v2.AlignRestToFixpoints (cognitive 67) · ×1
  • 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.
D2 · Cognitive Complexity · Routing_v2.zeichne (cognitive 65) · ×1
  • 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.
D2 · Cognitive Complexity · Precompiled_LineArrow.callback_AfterOrigin (cognitive 64) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.hatWireAnPosition (cognitive 64) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.adjustWhenNotOnWire (cognitive 62) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.New.ctor (cognitive 60) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.solveDirectConnections_Pins (cognitive 59) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.select_All_in_Rect (cognitive 59) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.LöseSchnittpunkt (cognitive 58) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.leseInst (cognitive 57) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.getEinstellungenOfSelectedElements (cognitive 57) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.definiereVariable (cognitive 55) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.getElementAt_forSelect (cognitive 55) · ×1
  • 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.
D2 · Cognitive Complexity · TabElement.ContentvisibleChanged (cognitive 55) · ×1
  • 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.
D2 · Cognitive Complexity · Precompiled_IF.simplifyBlock (cognitive 54) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.definiereKonstanteGesamt (cognitive 54) · ×1
  • 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.
D2 · Cognitive Complexity · AdvancedTextRenderer.leseStr (cognitive 53) · ×1
  • 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.
D2 · Cognitive Complexity · Element_Graph.CalcFunktion (cognitive 53) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.addSnappointVonSkill (cognitive 53) · ×1
  • 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.
D2 · Cognitive Complexity · ElementGruppe.getEinstellungen (cognitive 52) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.connectToNextLine (cognitive 52) · ×1
  • 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.
D2 · Cognitive Complexity · Mathe.getSchnittpunkt_alpha (cognitive 52) · ×1
  • 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.
D2 · Cognitive Complexity · ToolCopy.MouseUp (cognitive 51) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.Selected_Elemente_one_level_fore_back (cognitive 51) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.findRouting (cognitive 50) · ×1
  • 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.
D2 · Cognitive Complexity · TabElement.PicHeaderMouseMove (cognitive 50) · ×1
  • 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.
D2 · Cognitive Complexity · MasterElemente.getBitmap (cognitive 48) · ×1
  • 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.
D2 · Cognitive Complexity · SnapableImpedanceArrow.setEinstellungen (cognitive 48) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.mitVerschiebenBauteilSnappoint (cognitive 48) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.getBauteilZuordnungen (cognitive 47) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.try_translate_param_value (cognitive 47) · ×1
  • 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.
D2 · Cognitive Complexity · ToolPlace.MouseUp (cognitive 46) · ×1
  • 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.
D2 · Cognitive Complexity · ToolMove.MouseUp (cognitive 45) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.connectToNextLineOLD (cognitive 45) · ×1
  • 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.
D2 · Cognitive Complexity · ToolScale.OnDraw (cognitive 44) · ×1
  • 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.
D2 · Cognitive Complexity · Ausdruck.auswertenOperatorVergleiche (cognitive 44) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.leseNet (cognitive 44) · ×1
  • 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.
D2 · Cognitive Complexity · Precompiled_Snappoint.compile (cognitive 44) · ×1
  • 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.
D2 · Cognitive Complexity · Intelisense.txtKeyPress (cognitive 44) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.leseMaster (cognitive 43) · ×1
  • 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.
D2 · Cognitive Complexity · DO_Text.drawTEX_Text (cognitive 43) · ×1
  • 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.
D2 · Cognitive Complexity · ToolCopy.KeyDown (cognitive 42) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.defVar (cognitive 42) · ×1
  • 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.
D2 · Cognitive Complexity · Form_Vektorgrafik.OnKeyDown (cognitive 42) · ×1
  • 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.
D2 · Cognitive Complexity · DO_Text.addTEXText (cognitive 42) · ×1
  • 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.
D2 · Cognitive Complexity · Ausdruck.getAusdruck_Bool (cognitive 41) · ×1
  • 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.
D2 · Cognitive Complexity · Bibliothek.speicherVerwendeteTemplates (cognitive 41) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.detectConnectedNets (cognitive 41) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox._text_Nicht_Kursiv (cognitive 41) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.getNetName (cognitive 40) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.routeUngefähr (cognitive 40) · ×1
  • 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.
D2 · Cognitive Complexity · Mathe.string_vorm_auswertenAufbereiten (cognitive 39) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.ladeGrafikIntern (cognitive 39) · ×1
  • 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.
D2 · Cognitive Complexity · Ctr_BauelementeAuswahl_Skill.init (cognitive 37) · ×1
  • 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.
D2 · Cognitive Complexity · DO_Text.drawPDFSharp (cognitive 37) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.darfHierRouten_wirdWireOderPinBerührt (cognitive 36) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.drawDots_recursive (cognitive 35) · ×1
  • 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.
D2 · Cognitive Complexity · RückgängigGrafik.ladeZustand (cognitive 35) · ×1
  • 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.
D2 · Cognitive Complexity · ToolDrawBezierFreihand.berechneBezierBasisAlgo2 (cognitive 34) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.leseKeyValuePairs (cognitive 34) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.getDrehpunkt (cognitive 34) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.ordneBauteileZu (cognitive 33) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.schalteBeschriftungsPosDurch (cognitive 33) · ×1
  • 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.
D2 · Cognitive Complexity · ToolDrawLine.KeyDown (cognitive 32) · ×1
  • 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.
D2 · Cognitive Complexity · Ausdruck_MaxMin.AusrechnenSoweitMöglich (cognitive 32) · ×1
  • 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.
D2 · Cognitive Complexity · Ausdruck_Summe.AusrechnenSoweitMöglich (cognitive 32) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.getVector (cognitive 32) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.BauelementeAusrichten_NachPins (cognitive 32) · ×1
  • 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.
D2 · Cognitive Complexity · ToolPlace.OnDraw (cognitive 31) · ×1
  • 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.
D2 · Cognitive Complexity · Ausdruck.auswertenFunktionen (cognitive 31) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.TerminalsVerschieben (cognitive 31) · ×1
  • 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.
D2 · Cognitive Complexity · GrafikEPS_DrawArgs.switchToDashstyle (cognitive 31) · ×1
  • 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.
D2 · Cognitive Complexity · Mathe.getBezierBoundingBox (cognitive 30) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.defaultOnKeyDown (cognitive 30) · ×1
  • 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.
D2 · Cognitive Complexity · Window.UpdateContentAvailableChanges (cognitive 30) · ×1
  • 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.
D2 · Cognitive Complexity · Mathe.schneidetRechteck (cognitive 29) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.selectAll (cognitive 29) · ×1
  • 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.
D2 · Cognitive Complexity · ToolDrawWire.OnDraw (cognitive 28) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.getPinZuordnung (cognitive 28) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.setWireConnections (cognitive 28) · ×1
  • 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.
D2 · Cognitive Complexity · Wire.getSnappoint (cognitive 28) · ×1
  • 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.
D2 · Cognitive Complexity · WireLuftlinie.getSnappoint (cognitive 28) · ×1
  • 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.
D2 · Cognitive Complexity · Intelisense.openPopup (cognitive 28) · ×1
  • 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.
D2 · Cognitive Complexity · ToolAddVoltageArrow.KeyDown (cognitive 27) · ×1
  • 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.
D2 · Cognitive Complexity · ToolDrawBezier.OnDraw (cognitive 27) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.hatMehrAls1WireOderElementeAnPosition (cognitive 27) · ×1
  • 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.
D2 · Cognitive Complexity · Basic_Linie.getSnappoint (cognitive 27) · ×1
  • 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.
D2 · Cognitive Complexity · Basic_Spannungspfeil.setEinstellungen (cognitive 27) · ×1
  • 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.
D2 · Cognitive Complexity · Multi_Lang_String.New.ctor (cognitive 27) · ×1
  • 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.
D2 · Cognitive Complexity · Mathe.getSchnittpunkt_alpha (cognitive 27) · ×1
  • 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.
D2 · Cognitive Complexity · MultiPerspektivenManager.ladeAnordnung (cognitive 27) · ×1
  • 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.
D2 · Cognitive Complexity · Settings.ladeSettings (cognitive 26) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.addConstraints (cognitive 26) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.routeDetail (cognitive 26) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.New.ctor (cognitive 26) · ×1
  • 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.
D2 · Cognitive Complexity · Wire.getGrafikMitZeilensprüngen (cognitive 26) · ×1
  • 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.
D2 · Cognitive Complexity · DO_Text.drawGraphics (cognitive 26) · ×1
  • 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.
D2 · Cognitive Complexity · Mathe.auswerten (cognitive 26) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.performGravity (cognitive 26) · ×1
  • 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.
D2 · Cognitive Complexity · Ausdruck.auswerten (cognitive 25) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.direkterPfad (cognitive 25) · ×1
  • 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.
D2 · Cognitive Complexity · WireLuftlinie.getGrafikMitZeilensprüngen (cognitive 25) · ×1
  • 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.
D2 · Cognitive Complexity · Matrix.Auflösen (cognitive 25) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.FindGravity (cognitive 25) · ×1
  • 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.
D2 · Cognitive Complexity · UserDrawListbox.OnDrawItems (cognitive 25) · ×1
  • 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.
D2 · Cognitive Complexity · Window.TabsLostElement (cognitive 25) · ×1
  • 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.
D2 · Cognitive Complexity · ToolMove.MouseMove (cognitive 24) · ×1
  • 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.
D2 · Cognitive Complexity · Skill_BauteilZuordnung.New.ctor (cognitive 24) · ×1
  • 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.
D2 · Cognitive Complexity · Einstellung_Fontstyle.getNewFontstyle (cognitive 24) · ×1
  • 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.
D2 · Cognitive Complexity · CopyClipboard.Einlesen (cognitive 24) · ×1
  • 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.
D2 · Cognitive Complexity · Precompiled_Grafik.speicherGrafik (cognitive 24) · ×1
  • 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.
D2 · Cognitive Complexity · Precompiled_Grafik.exportiereGrafik (cognitive 24) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.gruppeAuflösen (cognitive 24) · ×1
  • 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.
D2 · Cognitive Complexity · DockStack.UpdateContentAvailableChanges (cognitive 24) · ×1
  • 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.
D2 · Cognitive Complexity · ToolCopy.set_copy_elemente (cognitive 23) · ×1
  • 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.
D2 · Cognitive Complexity · ToolDrawLine.OnDraw (cognitive 23) · ×1
  • 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.
D2 · Cognitive Complexity · Netz_WireElement.zeichnen (cognitive 23) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.Skill_liegtImWeg (cognitive 23) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.leseScaling (cognitive 23) · ×1
  • 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.
D2 · Cognitive Complexity · Mathe.splitString (cognitive 23) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.getExportElemente (cognitive 23) · ×1
  • 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.
D2 · Cognitive Complexity · Pfeil_Verwaltung.getBezierWithPfeil (cognitive 23) · ×1
  • 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.
D2 · Cognitive Complexity · JoSiCombobox.abdunkeln (cognitive 23) · ×1
  • 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.
D2 · Cognitive Complexity · WR_Einstellungsform.setEinstellungen (cognitive 23) · ×1
  • 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.
D2 · Cognitive Complexity · getNextTokenString.getNextToken (cognitive 22) · ×1
  • 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.
D2 · Cognitive Complexity · ToolDrawWire.KeyDown (cognitive 22) · ×1
  • 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.
D2 · Cognitive Complexity · BauteilAusDatei.isEqualExceptSelection (cognitive 22) · ×1
  • 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.
D2 · Cognitive Complexity · CompileParentArgs.add_parent_grafik (cognitive 22) · ×1
  • 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.
D2 · Cognitive Complexity · Form_Vektorgrafik.DeleteLokalSymbol (cognitive 22) · ×1
  • 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.
D2 · Cognitive Complexity · XTextFormatterEx2.CreateLayout (cognitive 22) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.exportierenAlsTEX (cognitive 22) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.changeSnapingElementsWhenWiresAreCombined (cognitive 22) · ×1
  • 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.
D2 · Cognitive Complexity · Intelisense.txtKeyDown (cognitive 22) · ×1
  • 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.
D2 · Cognitive Complexity · TabElement.UntersucheContentAvailableChanges (cognitive 22) · ×1
  • 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.
D2 · Cognitive Complexity · Settings.read_SelectBauteil (cognitive 21) · ×1
  • 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.
D2 · Cognitive Complexity · ElementGruppe.getSelection (cognitive 21) · ×1
  • 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.
D2 · Cognitive Complexity · WireSnappoint.Move_WennliegtAufWire (cognitive 21) · ×1
  • 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.
D2 · Cognitive Complexity · Mathe.splitString (cognitive 21) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.findRoutingSpeziell_onGrid (cognitive 21) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.gruppeErstellen (cognitive 21) · ×1
  • 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.
D2 · Cognitive Complexity · ToolDrawWire.suche_snapPoint (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · ToolDrawLine.suche_snapPoint (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · Ausdruck_Gleich.exportiere (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.deleteDummys (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.routeDetail2 (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · Einstellung_Linienstil.aktualisiere (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · Einstellung_Linienstil.getNewLinienstil (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · Einstellung_Multi.CombineValues (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.leseTextPos (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · LineStyle.getXPen (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · WR_Einstellungsform.sindEinstellungenGleich (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · TabElement.headerRendern (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · TabElement.headerLöschen (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · VirtualWindowRenderer.vorlagePrüfenUndKorrigieren (cognitive 20) · ×1
  • 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.
D2 · Cognitive Complexity · EinstellungBeschriftung.aktualisiere (cognitive 19) · ×1
  • 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.
D2 · Cognitive Complexity · Precompiled_IF.compile (cognitive 19) · ×1
  • 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.
D2 · Cognitive Complexity · Form_Vektorgrafik.AusZwischenablageToolStripMenuItem1_Click (cognitive 19) · ×1
  • 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.
D2 · Cognitive Complexity · XTextFormatterEx2.CreateBlocks (cognitive 19) · ×1
  • 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.
D2 · Cognitive Complexity · WindowRenderer.rechtsVisibleChanged (cognitive 19) · ×1
  • 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.
D2 · Cognitive Complexity · WindowRenderer.linksVisibleChanged (cognitive 19) · ×1
  • 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.
D2 · Cognitive Complexity · ToolDrawBezierFreihand.MouseUp (cognitive 18) · ×1
  • 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.
D2 · Cognitive Complexity · SkillDetectSchematic.is_unconnected (cognitive 18) · ×1
  • 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.
D2 · Cognitive Complexity · SnapableCurrentArrow.setEinstellungen (cognitive 18) · ×1
  • 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.
D2 · Cognitive Complexity · Mathe.approxNextPointToZeroBezierKurveRekursiv (cognitive 18) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.darfSelektieren (cognitive 18) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.bewerteRouting (cognitive 18) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.schneidenSichWires (cognitive 18) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.delete_selected (cognitive 18) · ×1
  • 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.
D2 · Cognitive Complexity · UserDrawListbox.OnMouseUp (cognitive 18) · ×1
  • 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.
D2 · Cognitive Complexity · DockStack.OnFensterOver (cognitive 18) · ×1
  • 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.
D2 · Cognitive Complexity · DockStack.TabMovingComplete (cognitive 18) · ×1
  • 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.
D2 · Cognitive Complexity · ToolDrawLine.MouseUp (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · Ausdruck_KleinerGrößer.AusrechnenSoweitMöglich (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · Ausdruck_KleinerGrößerGleich.AusrechnenSoweitMöglich (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · Routing_v2.MarkAllShorts (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · Element_Textfeld.setEinstellungen (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · Multi_Lang_String.lese_option (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · BauteilAusDatei.getEinstellungen (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.leseScalingStart (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.leseInfo (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.leseCompatibilit (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.readForDefinition (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · Intelisense.changeLine (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · TabElement.Insert (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · Window.Show (cognitive 17) · ×1
  • 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.
D2 · Cognitive Complexity · ToolPlace.KeyDown (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · Einstellung_Fontstyle.aktualisiere (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · Element_RoundRect.setEinstellungen (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · Basic_Bezier.setEinstellungen (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · Basic_Linie.setEinstellungen (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · Einstellung_Pfeilspitze.aktualisiere (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · TemplateAusDatei.leseSnap_intern (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · Wire.setEinstellungen (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · WireLuftlinie.setEinstellungen (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.setEinstellungenSelected (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.sucheNextSnapPoint (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · Vektor_Picturebox.Selected_Elemente_to_fore_back (cognitive 16) · ×1
  • 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.
D2 · Cognitive Complexity · VirtualWindowRenderer.ladeAnordnung (cognitive 16) · ×1
  • 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, 34 shared lines) · ×1
  • Near-duplicate member family (4 members, 34 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 34 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.
D4 · Code Duplication · Near-duplicate member pair (131 shared lines) · ×1
  • Near-duplicate member pair (131 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: 131 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 · Near-duplicate member pair (47 shared lines) · ×1
  • Near-duplicate member pair (47 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: 47 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 · Near-duplicate member pair (17 shared lines) · ×1
  • Near-duplicate member pair (17 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: 17 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 · 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.
D4 · Code Duplication · Edited copy of a member (78 corresponding lines) · ×1
  • Edited copy of a member (78 corresponding lines) WindowRenderer/DesignStyle.vb:570 — WindowRenderer/DesignStyle.vb:570-649 | WindowRenderer/DesignStyle.vb:719-796 — These two members are one piece of code written twice and then edited apart: 78 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 (105 corresponding lines) · ×1
  • Edited copy of a member (105 corresponding lines) CircuitDrawing/Grafikelemente/DO_Text.vb:78 — CircuitDrawing/Grafikelemente/DO_Text.vb:78-198 | CircuitDrawing/Grafikelemente/DO_Text.vb:226-330 — These two members are one piece of code written twice and then edited apart: 105 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 (96 corresponding lines) · ×1
  • Edited copy of a member (96 corresponding lines) CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:502 — CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:502-597 | CircuitDrawing/TemplateAusDatei/TemplateAusDatei.vb:601-703 — These two members are one piece of code written twice and then edited apart: 96 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 (49 corresponding lines) · ×1
  • Edited copy of a member (49 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:47 — CircuitDrawing/Elemente/CircuitElemente/Wire.vb:47-95 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:39-90 — These two members are one piece of code written twice and then edited apart: 49 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 (42 corresponding lines) · ×1
  • Edited copy of a member (42 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:99 — CircuitDrawing/Elemente/CircuitElemente/Wire.vb:99-140 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:94-142 — These two members are one piece of code written twice and then edited apart: 42 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 (34 corresponding lines) · ×1
  • Edited copy of a member (34 corresponding lines) CircuitDrawing/AdvancedTextRenderer.vb:922 — CircuitDrawing/AdvancedTextRenderer.vb:922-955 | CircuitDrawing/AdvancedTextRenderer.vb:959-992 — These two members are one piece of code written twice and then edited apart: 34 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 (28 corresponding lines) · ×1
  • Edited copy of a member (28 corresponding lines) CircuitDrawing/Grafikelemente/DO_Arc.vb:58 — CircuitDrawing/Grafikelemente/DO_Arc.vb:58-88 | CircuitDrawing/Grafikelemente/DO_Arc.vb:96-123 — These two members are one piece of code written twice and then edited apart: 28 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 (55 corresponding lines) · ×1
  • Edited copy of a member (55 corresponding lines) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:882 — CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:882-936 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:940-1012 — These two members are one piece of code written twice and then edited apart: 55 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 (40 corresponding lines) · ×1
  • Edited copy of a member (40 corresponding lines) CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:334 — CircuitDrawing/SkillDetect/Ctr_BauelementeAuswahl_Skill.vb:334-373 | CircuitDrawing/WR_Fenster/WR_BauelementeAuswahl.vb:144-192 — These two members are one piece of code written twice and then edited apart: 40 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 (47 corresponding lines) · ×1
  • Edited copy of a member (47 corresponding lines) CircuitDrawing/Elemente/ElementGruppe.vb:155 — CircuitDrawing/Elemente/ElementGruppe.vb:155-204 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:353-399 — These two members are one piece of code written twice and then edited apart: 47 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 (31 corresponding lines) · ×1
  • Edited copy of a member (31 corresponding lines) CircuitDrawing/AdvancedTextRenderer.vb:691 — CircuitDrawing/AdvancedTextRenderer.vb:691-721 | CircuitDrawing/AdvancedTextRenderer.vb:725-755 — These two members are one piece of code written twice and then edited apart: 31 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 copies of one member (3 members, 31+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 31+ corresponding lines) CircuitDrawing/AdvancedTextRenderer.vb:7 — CircuitDrawing/AdvancedTextRenderer.vb:7-40 | CircuitDrawing/AdvancedTextRenderer.vb:44-89 | CircuitDrawing/AdvancedTextRenderer.vb:93-123 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 18+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 18+ corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2876 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2876-2897 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:2901-2918 | CircuitDrawing/SkillDetect/Routing_v2.vb:438-455 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (30 corresponding lines) · ×1
  • Edited copy of a member (30 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Blackbox.vb:107 — CircuitDrawing/Elemente/CircuitElemente/Blackbox.vb:107-136 | CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:117-149 — These two members are one piece of code written twice and then edited apart: 30 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 (32 corresponding lines) · ×1
  • Edited copy of a member (32 corresponding lines) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:95 — CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:95-126 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:95-135 — These two members are one piece of code written twice and then edited apart: 32 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 copies of one member (3 members, 24+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 24+ corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Spannungspfeil.vb:181 — CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Spannungspfeil.vb:181-208 | CircuitDrawing/Elemente/CircuitElemente/Wire.vb:423-450 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:266-289 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (35 corresponding lines) · ×1
  • Edited copy of a member (35 corresponding lines) CircuitDrawing/Mathe.vb:346 — CircuitDrawing/Mathe.vb:346-380 | CircuitDrawing/Mathe.vb:384-423 — These two members are one piece of code written twice and then edited apart: 35 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 (22 corresponding lines) · ×1
  • Edited copy of a member (22 corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößer.vb:16 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößer.vb:16-37 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößerGleich.vb:16-37 — These two members are one piece of code written twice and then edited apart: 22 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 (24 corresponding lines) · ×1
  • Edited copy of a member (24 corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:234 — CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Bezier.vb:234-257 | CircuitDrawing/Elemente/BasicGrafikElemente/Basic_Linie.vb:191-214 — These two members are one piece of code written twice and then edited apart: 24 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 (25 corresponding lines) · ×1
  • Edited copy of a member (25 corresponding lines) WindowRenderer/VirtualWindowRenderer/MultiPerspektivenManager.vb:22 — WindowRenderer/VirtualWindowRenderer/MultiPerspektivenManager.vb:22-46 | WindowRenderer/VirtualWindowRenderer/VirtualWindowRenderer.vb:28-56 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — 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 copies of one member (4 members, 11+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 11+ corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3137 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3137-3149 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3153-3165 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3169-3179 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:3183-3193 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (15 corresponding lines) · ×1
  • Edited copy of a member (15 corresponding lines) CircuitDrawing/FRM_ImgSizeSelection.vb:36 — CircuitDrawing/FRM_ImgSizeSelection.vb:36-50 | CircuitDrawing/FRM_ImgSizeSelection.vb:54-68 — These two members are one piece of code written twice and then edited apart: 15 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 copies of one member (3 members, 15+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 15+ corresponding lines) CircuitDrawing/Grafikelemente/ExportDrawArgs/FillStyleList.vb:20 — CircuitDrawing/Grafikelemente/ExportDrawArgs/FillStyleList.vb:20-34 | CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb:20-34 | CircuitDrawing/Grafikelemente/ExportDrawArgs/LineStyleList.vb:21-35 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 16+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 16+ corresponding lines) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1339 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1339-1354 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1358-1373 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1377-1392 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:1396-1411 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 5+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 5+ corresponding lines) CircuitDrawing/Anzeige/Tools/ToolCopy.vb:399 — CircuitDrawing/Anzeige/Tools/ToolCopy.vb:399-404 | CircuitDrawing/Anzeige/Tools/ToolMove.vb:329-333 | CircuitDrawing/Anzeige/Tools/ToolPlace.vb:324-329 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 16+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 16+ corresponding lines) CircuitDrawing/Grafikelemente/ExportDrawArgs/FillStyleList.vb:65 — CircuitDrawing/Grafikelemente/ExportDrawArgs/FillStyleList.vb:65-80 | CircuitDrawing/Grafikelemente/ExportDrawArgs/FontList.vb:69-84 | CircuitDrawing/Grafikelemente/ExportDrawArgs/LineStyleList.vb:70-85 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 12+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 12+ corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiGrafik.vb:99 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiGrafik.vb:99-110 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Verzweigung/Precompiled_ELSE.vb:24-35 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Verzweigung/Precompiled_ELSE_IF.vb:56-69 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Verzweigung/Precompiled_IF.vb:97-110 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 14+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 14+ corresponding lines) CircuitDrawing/Einstellungen/EinstellungStrompfeilArt.vb:162 — CircuitDrawing/Einstellungen/EinstellungStrompfeilArt.vb:162-175 | CircuitDrawing/Einstellungen/Einstellung_Pfeilspitze.vb:179-192 | CircuitDrawing/Einstellungen/Einstellung_Pfeilspitze.vb:196-209 | CircuitDrawing/Einstellungen/TemplateParameter/Einstellung_TemplateParameter_Arrow.vb:115-128 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 10+ corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Rect.vb:90 — CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Rect.vb:90-100 | CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Textfeld.vb:43-53 | CircuitDrawing/Elemente/CircuitElemente/Wire.vb:410-419 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:253-262 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 6+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 6+ corresponding lines) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Bezier.vb:37 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Bezier.vb:37-42 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_MultiLinie.vb:39-44 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_Poly.vb:49-59 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 11+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 11+ corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_GleichString.vb:52 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_GleichString.vb:52-62 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößer.vb:64-74 | CircuitDrawing/Ausdruck/Ausdruck_Boolean/Ausdruck_KleinerGrößerGleich.vb:64-74 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 12+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 12+ corresponding lines) CircuitDrawing/Pfeile/Pfeil3.vb:18 — CircuitDrawing/Pfeile/Pfeil3.vb:18-31 | CircuitDrawing/Pfeile/Pfeil_Basic.vb:14-25 | CircuitDrawing/Pfeile/Pfeil_Line.vb:25-36 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (2 corresponding lines) · ×1
  • Edited copy of a member (2 corresponding lines) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:144 — CircuitDrawing/Elemente/CircuitElemente/Wire.vb:144-145 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:146-147 — These two members are one piece of code written twice and then edited apart: 2 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 copies of one member (3 members, 8+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 8+ corresponding lines) CircuitDrawing/Rückgängig/RückgängigFillStyles.vb:20 — CircuitDrawing/Rückgängig/RückgängigFillStyles.vb:20-27 | CircuitDrawing/Rückgängig/RückgängigFontStyle.vb:20-27 | CircuitDrawing/Rückgängig/RückgängigLineStyle.vb:20-27 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 5+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 5+ corresponding lines) CircuitDrawing/Ausdruck/Ausdruck_Boolean/AusdruckBoolean_Variable.vb:43 — CircuitDrawing/Ausdruck/Ausdruck_Boolean/AusdruckBoolean_Variable.vb:43-47 | CircuitDrawing/Ausdruck/Ausdruck_Int/Ausdruck_Variable.vb:48-52 | CircuitDrawing/Ausdruck/Ausdruck_Pfeil/Ausdruck_Pfeil_Variable.vb:37-41 | CircuitDrawing/Ausdruck/Ausdruck_String/AusdruckString_Variable.vb:44-48 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 3+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 3+ corresponding lines) CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:248 — CircuitDrawing/Anzeige/Tools/ToolDrawWire.vb:248-251 | CircuitDrawing/Anzeige/Tools/Tool_AddSnapableElement/ToolAddCurrentArrow.vb:27-29 | CircuitDrawing/Anzeige/Tools/Zeichentools/ToolDrawLine.vb:249-252 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, 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 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. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 3+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 3+ corresponding lines) CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Ellipse.vb:27 — CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Ellipse.vb:27-29 | CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Rect.vb:84-86 | CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_RoundRect.vb:32-34 | CircuitDrawing/Elemente/BasicGrafikElemente/BasicRectBased/Element_Textfeld.vb:37-39 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, 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 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. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Duplicated block (82 lines × 2) · ×1
  • Duplicated block (82 lines × 2) CircuitDrawing/Grafikelemente/DO_Text.vb:85 — CircuitDrawing/Grafikelemente/DO_Text.vb:85-166 | CircuitDrawing/Grafikelemente/DO_Text.vb:236-317 — 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 · Duplicated block (55 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (41 lines × 2) · ×1
  • Duplicated block (41 lines × 2) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4366 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4366-4406 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4414-4454 — 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 · Duplicated block (37 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (35–36 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (33–34 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (22 lines × 3) · ×1
  • Duplicated block (22 lines × 3) CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:105 — CircuitDrawing/Einstellungen/Einstellung_Fillstil.vb:105-126 | CircuitDrawing/Einstellungen/Einstellung_Fontstyle.vb:203-224 | CircuitDrawing/Einstellungen/Einstellung_Linienstil.vb:210-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 47 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.
D4 · Code Duplication · Duplicated block (42–49 lines × 2) · ×1
  • Duplicated block (42–49 lines × 2) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1334 — CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1334-1382 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:1386-1427 — 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 · Duplicated block (26 lines × 2) · ×1
  • Duplicated block (26 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:302 — CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:302-327 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:90-115 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 222 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.
D4 · Code Duplication · Duplicated block (27 lines × 2) · ×1
  • 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 12 separate duplicated blocks between them, totalling at least 222 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.
D4 · Code Duplication · Duplicated block (54 lines × 2) · ×1
  • Duplicated block (54 lines × 2) CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:421 — CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb:421-474 | CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb:190-243 — before extracting anything, compare `CircuitDrawing/Elemente/CircuitElemente/BauteilAusDatei.vb` and `CircuitDrawing/Elemente/CircuitElemente/Deko_Bauteil.vb` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 222 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.
D4 · Code Duplication · Duplicated block (28 lines × 2) · ×1
  • Duplicated block (28 lines × 2) CircuitDrawing/Elemente/CircuitElemente/Wire.vb:113 — CircuitDrawing/Elemente/CircuitElemente/Wire.vb:113-140 | CircuitDrawing/Elemente/CircuitElemente/WireLuftlinie.vb:115-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.
D4 · Code Duplication · Duplicated block (23–24 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (24 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (21 lines × 3) · ×1
  • 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 35 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.
D4 · Code Duplication · Duplicated block (18–21 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×1
  • Duplicated block (16 lines × 2) CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:888 — CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:888-903 | CircuitDrawing/SkillDetect/SkillDetectSchematic.vb:966-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.
D4 · Code Duplication · Duplicated block (14–18 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (15–16 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (13 lines × 4) · ×1
  • Duplicated block (13 lines × 4) CircuitDrawing/Mathe.vb:631 — CircuitDrawing/Mathe.vb:631-643 | CircuitDrawing/Mathe.vb:729-741 | CircuitDrawing/Mathe.vb:826-838 | CircuitDrawing/Mathe.vb:878-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.
D4 · Code Duplication · Duplicated block (15 lines × 3) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (14 lines × 5) · ×1
  • 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 30 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.
D4 · Code Duplication · Duplicated block (14 lines × 3) · ×1
  • 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 47 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.
D4 · Code Duplication · Duplicated block (13 lines × 3) · ×1
  • Duplicated block (13 lines × 3) WindowRenderer/DockStack.vb:328 — WindowRenderer/DockStack.vb:328-340 | WindowRenderer/DockStack.vb:360-372 | WindowRenderer/DockStack.vb:448-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.
D4 · Code Duplication · Duplicated block (13–14 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (12 lines × 4) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (11–12 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (11 lines × 4) · ×1
  • 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 30 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.
D4 · Code Duplication · Duplicated block (10 lines × 4) · ×1
  • Duplicated block (10 lines × 4) CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4373 — CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4373-4382 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4421-4430 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4472-4481 | CircuitDrawing/Anzeige/Vektor_Picturebox.vb:4517-4526 — 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.
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×1
  • 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 47 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.
D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (8 lines × 3) · ×1
  • Duplicated block (8 lines × 3) CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:94 — CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:94-101 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:105-112 | CircuitDrawing/TemplateAusDatei/Precompiled/Precompiled_Grafik/Precompiled_LineArrow.vb:116-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.
D4 · Code Duplication · Duplicated block (9–10 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (16 lines × 4) · ×1
  • Duplicated block (16 lines × 4) CircuitDrawing/Mathe.vb:704 — CircuitDrawing/Mathe.vb:704-719 | CircuitDrawing/Mathe.vb:801-816 | CircuitDrawing/Mathe.vb:853-868 | CircuitDrawing/Mathe.vb:905-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.
D4 · Code Duplication · Duplicated block (8 lines × 7) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (7–8 lines × 2) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (6 lines × 3) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (5–6 lines × 3) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (3–5 lines × 3) · ×1
  • 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.
D4 · Code Duplication · Duplicated block (4–5 lines × 3) · ×1
  • 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.
P1 · CI/CD gates · No CI pipeline · ×1
  • No CI pipeline — No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.
Minor — 6 finding(s)
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found CircuitDrawing/CircuitDrawing.vbproj:8 — 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/`. ADRs are expected here because `CircuitDrawing/CircuitDrawing.vbproj` makes this repository a deployable product (line 8).
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion CircuitDrawing/CircuitDrawing.vbproj:1 — `CircuitDrawing` overshoots its size bounds (41376 LoC, 371 public types across 2 namespaces). 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Size alone is no reason to split a project: where its type references show a separable part, a Split row names it.
M2 · Architecture documentation · No ADRs · ×1
  • 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.
P3 · Security & performance tooling · No SAST · ×1
  • 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.
P6 · Release Hygiene · No changelog · ×1
  • 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.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-e5bf973ad02e414a9813826089e00760/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-e5bf973ad02e414a9813826089e00760/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .0artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesnuget—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 scan0—
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—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.0—
D36 · Supply-chain Provenance & Signingprovenance—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.0—
D37 · Vulnerability-disclosure Policydisclosure—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.0—
D40 · Network Egress Confinementruntime-hardening—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.0—
D41 · Kernel & Syscall Confinementruntime-hardening—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.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesnone (no readable dependency manifest)—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 01a1dd2a-49ba-7402-8df8-6df67dca3ed4 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

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.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md